---
_id: '19735'
abstract:
- lang: eng
text: The Paderborn University BSP (PUB) library is a parallel C library based on
the BSP model. The basic library supports buffered and unbuffered asynchronous
communication between any pair of processors, and a mechanism for synchronizing
the processors in a barrier style. In addition, it provides routines for collective
communication on arbitrary subsets of processors, partition operations, and a
zero-cost synchronization mechanism. Furthermore, some techniques used in the
implementation of the PUB library deviate significantly from the techniques used
in other BSP libraries.
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
- first_name: Ingo
full_name: von Otte, Ingo
last_name: von Otte
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
citation:
ama: Bonorden O, Rieping I, von Otte I, Juurlink B. The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance.; 1998.
apa: Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (1998). The
Paderborn University BSP (PUB) Library - Design, Implementation and Performance.
bibtex: '@book{Bonorden_Rieping_von Otte_Juurlink_1998, title={The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance}, author={Bonorden,
Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={1998}
}'
chicago: Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The
Paderborn University BSP (PUB) Library - Design, Implementation and Performance,
1998.
ieee: O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance. 1998.
mla: Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design,
Implementation and Performance. 1998.
short: O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance, 1998.
date_created: 2020-09-28T12:41:20Z
date_updated: 2022-01-06T06:54:11Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-28T12:41:08Z
date_updated: 2020-09-28T12:41:08Z
file_id: '19736'
file_name: pub-hni-1350.pdf
file_size: 255806
relation: main_file
success: 1
file_date_updated: 2020-09-28T12:41:08Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
type: report
user_id: '15415'
year: '1998'
...
---
_id: '17412'
abstract:
- lang: eng
text: "We study algorithmic aspects in the management of geometric scenes in interactive
walkthrough animations. We consider arbitrarily large scenes consisting of unit
size balls. For a smooth navigation in the scene we have to fulfill hard real
time requirements. Therefore, we need algorithms whose running time is independent
of the total number of objects in the scene and that use as small space as possible.
In this work we focus on one of the basic operations in our walkthrough system:
reporting the objects around the visitor within a certain distance. Previously
a randomized data structure was presented that supports reporting the balls around
the visitor in an output sensitive time and allows insertion and deletion of objects
nearly as fast as searching. These results were achieved by exploiting the fact
that the visitor moves ''slowly'' through the scene. A serious disadvantage of
the aforementioned data structure is a big space overhead and the use of randomization.
Our first result is a construction of weak spanners that leads to an improvement
of the space requirement of the previously known data structures. Then we develop
a deterministic data structure for the searching problem in which insertion of
objects are allowed. Our incremental data structure supports O(1+k) reporting
time, where k is a certain quantity close to the number of reported objects. The
insertion time is similar to the reporting time and the space is linear to the
total number of objects.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations
with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg;
1998. doi:10.1007/3-540-68530-8_14'
apa: Fischer, M., Lukovszki, T., & Ziegler, M. (1998). Geometric Searching in
Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’
98. Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_14
bibtex: '@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric
Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={10.1007/3-540-68530-8_14},
booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás
and Ziegler, Martin}, year={1998} }'
chicago: Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching
in Walkthrough Animations with Weak Spanners in Real Time.” In Algorithms —
ESA’ 98. Berlin, Heidelberg, 1998. https://doi.org/10.1007/3-540-68530-8_14.
ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough
Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin,
Heidelberg, 1998.
mla: Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with
Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.
short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin,
Heidelberg, 1998.'
date_created: 2020-07-27T11:42:54Z
date_updated: 2022-01-06T06:53:11Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/3-540-68530-8_14
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-27T11:20:38Z
date_updated: 2020-08-27T11:20:38Z
file_id: '18442'
file_name: hni-id-854.pdf
file_size: 266070
relation: main_file
success: 1
file_date_updated: 2020-08-27T11:20:38Z
has_accepted_license: '1'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms — ESA’ 98
publication_identifier:
isbn:
- '9783540648482'
- '9783540685302'
issn:
- 0302-9743
publication_status: published
status: public
title: Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
type: book_chapter
user_id: '15415'
year: '1998'
...
---
_id: '17863'
abstract:
- lang: eng
text: "New dynamic search data structures developed recently guarantee constant
execution time per search and update, i.e., they fulfil the real-time requirements
necessary for interactive walkthrough in large geometric scenes. Yet, superiority
or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir
prototypical implementation presented in this work uses common libraries on standard
stations and thus represents a first strut to bridge this gap. Indeed our experimental
results give an indication on the actual performance of these theoretical ideas
on real machines and possible bottlenecks in future developments. By special algorithmic
enhancements, we can even avoid the otherwise essential preprocessing step.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Tamas
full_name: Lukovszki, Tamas
last_name: Lukovszki
- first_name: 'Martin '
full_name: 'Ziegler, Martin '
last_name: Ziegler
citation:
ama: 'Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough
of Massive Models. In: Algorithm Engineering, 2nd International Workshop, {WAE
’98}. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.'
apa: 'Fischer, M., Lukovszki, T., & Ziegler, M. (1998). A Network Based Approach
for Realtime Walkthrough of Massive Models. In Algorithm Engineering, 2nd International
Workshop, {WAE ’98} (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.'
bibtex: '@inproceedings{Fischer_Lukovszki_Ziegler_1998, place={Saarbrücken}, title={A
Network Based Approach for Realtime Walkthrough of Massive Models}, booktitle={Algorithm
Engineering, 2nd International Workshop, {WAE ’98}}, publisher={Max-Planck-Institut
für Informatik}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin
}, year={1998}, pages={133--142} }'
chicago: 'Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “A Network Based
Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering,
2nd International Workshop, {WAE ’98}, 133--142. Saarbrücken: Max-Planck-Institut
für Informatik, 1998.'
ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime
Walkthrough of Massive Models,” in Algorithm Engineering, 2nd International
Workshop, {WAE ’98}, 1998, pp. 133--142.
mla: Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough
of Massive Models.” Algorithm Engineering, 2nd International Workshop, {WAE
’98}, Max-Planck-Institut für Informatik, 1998, pp. 133--142.
short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International
Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp.
133--142.'
date_created: 2020-08-12T12:50:56Z
date_updated: 2022-01-06T06:53:21Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-27T11:18:26Z
date_updated: 2020-08-27T11:18:26Z
file_id: '18440'
file_name: hni-id-853.pdf
file_size: 272549
relation: main_file
success: 1
file_date_updated: 2020-08-27T11:18:26Z
has_accepted_license: '1'
language:
- iso: eng
page: 133--142
place: Saarbrücken
publication: Algorithm Engineering, 2nd International Workshop, {WAE '98}
publisher: Max-Planck-Institut für Informatik
status: public
title: A Network Based Approach for Realtime Walkthrough of Massive Models
type: conference
user_id: '15415'
year: '1998'
...
---
_id: '18145'
abstract:
- lang: ger
text: Preis für den Beitrag "Multimediale Entdeckungsreisen unserer Welt mit dem
Internet"
- lang: eng
text: Award for the Article "Multimedia-based Expedition of our World with the Internet"
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer
Welt Mit Dem Internet.; 1998.
apa: Ziegler, M., Fischer, M., & Lukovszki, T. (1998). Multimediale Entdeckungsreisen
unserer Welt mit dem Internet.
bibtex: '@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen
unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias
and Lukovszki, Tamás}, year={1998} }'
chicago: Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale
Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
ieee: M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen
unserer Welt mit dem Internet. 1998.
mla: Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit
Dem Internet. 1998.
short: M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer
Welt Mit Dem Internet, 1998.
date_created: 2020-08-24T09:55:41Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Multimediale Entdeckungsreisen unserer Welt mit dem Internet
type: report
user_id: '15415'
year: '1998'
...
---
_id: '18445'
author:
- first_name: Brigitte
full_name: Oesterdiekhoff, Brigitte
last_name: Oesterdiekhoff
citation:
ama: Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn;
1998.
apa: Oesterdiekhoff, B. (1998). On Periodic Comparator Networks. Universität
Paderborn.
bibtex: '@book{Oesterdiekhoff_1998, place={Universität Paderborn}, title={On Periodic
Comparator Networks}, author={Oesterdiekhoff, Brigitte}, year={1998} }'
chicago: Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität
Paderborn, 1998.
ieee: B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn,
1998.
mla: Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.
short: B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn,
1998.
date_created: 2020-08-27T11:42:12Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On Periodic Comparator Networks
type: dissertation
user_id: '15415'
year: '1998'
...
---
_id: '2168'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory
Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096
apa: Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies.
Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096
bibtex: '@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies},
volume={31}, DOI={10.1007/s002240000096},
number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and
Vöcking, Berthold}, year={1998}, pages={425--449} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.'
ieee: C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory
Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
mla: Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449,
doi:10.1007/s002240000096.
short: C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
date_created: 2018-04-03T08:59:06Z
date_updated: 2022-01-06T06:55:10Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000096
intvolume: ' 31'
issue: '4'
language:
- iso: eng
page: 425--449
publication: Theory Comput. Syst.
status: public
title: Universal Continuous Routing Strategies
type: journal_article
user_id: '14955'
volume: 31
year: '1998'
...
---
_id: '2169'
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless
Networks (Extended Abstract). In: SPAA. ; 1998:259--268.'
apa: Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).
bibtex: '@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler,
Micah and Scheideler, Christian}, year={1998}, pages={259--268} }'
chicago: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc
Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.
short: 'M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.'
date_created: 2018-04-03T08:59:55Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:08:12Z
date_updated: 2018-04-12T07:08:12Z
file_id: '2285'
file_name: SPAA98.pdf
file_size: 492778
relation: main_file
file_date_updated: 2018-04-12T07:08:12Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 259--268
publication: SPAA
status: public
title: Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
type: conference
urn: '21699'
user_id: '14955'
year: '1998'
...
---
_id: '2170'
author:
- first_name: Uriel
full_name: Feige, Uriel
last_name: Feige
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended
Abstract). In: STOC. ; 1998:624--633.'
apa: Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract). In STOC (pp. 624--633).
bibtex: '@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic
Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel
and Scheideler, Christian}, year={1998}, pages={624--633} }'
chicago: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling
(Extended Abstract),” in STOC, 1998, pp. 624--633.
mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.
short: 'U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.'
date_created: 2018-04-03T09:00:31Z
date_updated: 2022-01-06T06:55:11Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:15:50Z
date_updated: 2018-04-12T07:15:50Z
file_id: '2286'
file_name: STOC98.pdf
file_size: 228487
relation: main_file
file_date_updated: 2018-04-12T07:15:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 624--633
publication: STOC
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
type: conference
urn: '21705'
user_id: '14955'
year: '1998'
...
---
_id: '2185'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Universal Routing Strategies for Interconnection Networks.
Vol 1390.; 1998. doi:10.1007/BFb0052928
apa: Scheideler, C. (1998). Universal Routing Strategies for Interconnection
Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928
bibtex: '@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal
Routing Strategies for Interconnection Networks}, volume={1390}, DOI={10.1007/BFb0052928},
author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer
Science} }'
chicago: Scheideler, Christian. Universal Routing Strategies for Interconnection
Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.
ieee: C. Scheideler, Universal Routing Strategies for Interconnection Networks,
vol. 1390. 1998.
mla: Scheideler, Christian. Universal Routing Strategies for Interconnection
Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.
short: C. Scheideler, Universal Routing Strategies for Interconnection Networks,
1998.
date_created: 2018-04-03T09:38:18Z
date_updated: 2022-01-06T06:55:17Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/BFb0052928
intvolume: ' 1390'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-540-69792-3
series_title: Lecture Notes in Computer Science
status: public
title: Universal Routing Strategies for Interconnection Networks
type: book
user_id: '14955'
volume: 1390
year: '1998'
...
---
_id: '16503'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
- first_name: Frank
full_name: Schwarze, Frank
last_name: Schwarze
citation:
ama: Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical
crossbars. Theoretical Computer Science. 1998;196:181-200. doi:10.1016/s0304-3975(97)86791-6
apa: Meyer auf der Heide, F., Schröder, K., & Schwarze, F. (1998). Routing on
networks of optical crossbars. Theoretical Computer Science, 196,
181–200. https://doi.org/10.1016/s0304-3975(97)86791-6
bibtex: '@article{Meyer auf der Heide_Schröder_Schwarze_1998, title={Routing on
networks of optical crossbars}, volume={196}, DOI={10.1016/s0304-3975(97)86791-6},
journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm
and Schröder, Klaus and Schwarze, Frank}, year={1998}, pages={181–200} }'
chicago: 'Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing
on Networks of Optical Crossbars.” Theoretical Computer Science 196 (1998):
181–200. https://doi.org/10.1016/s0304-3975(97)86791-6.'
ieee: F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks
of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200,
1998.
mla: Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.”
Theoretical Computer Science, vol. 196, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.
short: F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science
196 (1998) 181–200.
date_created: 2020-04-14T12:20:57Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(97)86791-6
intvolume: ' 196'
language:
- iso: eng
page: 181-200
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Routing on networks of optical crossbars
type: journal_article
user_id: '15415'
volume: 196
year: '1998'
...
---
_id: '16504'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms:
1-optimal multisearch for an extension of the BSP model. Theoretical Computer
Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6'
apa: 'Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient
parallel algorithms: 1-optimal multisearch for an extension of the BSP model.
Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6'
bibtex: '@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient
parallel algorithms: 1-optimal multisearch for an extension of the BSP model},
DOI={10.1016/s0304-3975(98)00020-6},
journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang
and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide.
“Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of
the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.'
ieee: 'A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel
algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical
Computer Science, pp. 175–203, 1998.'
mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch
for an Extension of the BSP Model.” Theoretical Computer Science, 1998,
pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.'
short: A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science
(1998) 175–203.
date_created: 2020-04-14T12:36:47Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(98)00020-6
language:
- iso: eng
page: 175-203
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: 'Truly efficient parallel algorithms: 1-optimal multisearch for an extension
of the BSP model'
type: journal_article
user_id: '15415'
year: '1998'
...
---
_id: '16562'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Gabriel Terán
full_name: Martinez, Gabriel Terán
last_name: Martinez
citation:
ama: 'Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway
and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics.
Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332'
apa: 'Meyer auf der Heide, F., & Martinez, G. T. (1998). Communication-efficient
parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical
Informatics. Berlin, Heidelberg. https://doi.org/10.1007/bfb0054332'
bibtex: '@inbook{Meyer auf der Heide_Martinez_1998, place={Berlin, Heidelberg},
title={Communication-efficient parallel multiway and approximate minimum cut computation},
DOI={10.1007/bfb0054332}, booktitle={LATIN’98:
Theoretical Informatics}, author={Meyer auf der Heide, Friedhelm and Martinez,
Gabriel Terán}, year={1998} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient
Parallel Multiway and Approximate Minimum Cut Computation.” In LATIN’98: Theoretical
Informatics. Berlin, Heidelberg, 1998. https://doi.org/10.1007/bfb0054332.'
ieee: 'F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel
multiway and approximate minimum cut computation,” in LATIN’98: Theoretical
Informatics, Berlin, Heidelberg, 1998.'
mla: 'Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient
Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical
Informatics, 1998, doi:10.1007/bfb0054332.'
short: 'F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics,
Berlin, Heidelberg, 1998.'
date_created: 2020-04-15T10:34:15Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bfb0054332
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'LATIN''98: Theoretical Informatics'
publication_identifier:
isbn:
- '9783540642756'
- '9783540697152'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Communication-efficient parallel multiway and approximate minimum cut computation
type: book_chapter
user_id: '15415'
year: '1998'
...
---
_id: '16563'
author:
- first_name: Richard
full_name: Cole, Richard
last_name: Cole
- first_name: Bruce M.
full_name: Maggs, Bruce M.
last_name: Maggs
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Mitzenmacher, Michael
last_name: Mitzenmacher
- first_name: Andréa W.
full_name: Richa, Andréa W.
last_name: Richa
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
- first_name: Ramesh K.
full_name: Sitaraman, Ramesh K.
last_name: Sitaraman
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion
circuit routing in multistage interconnection networks. In: Proceedings of
the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98. ; 1998.
doi:10.1145/276698.276790'
apa: Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A.
W., Schröder, K., … Vöcking, B. (1998). Randomized protocols for low-congestion
circuit routing in multistage interconnection networks. In Proceedings of the
thirtieth annual ACM symposium on Theory of computing - STOC ’98. https://doi.org/10.1145/276698.276790
bibtex: '@inproceedings{Cole_Maggs_Meyer auf der Heide_Mitzenmacher_Richa_Schröder_Sitaraman_Vöcking_1998,
title={Randomized protocols for low-congestion circuit routing in multistage interconnection
networks}, DOI={10.1145/276698.276790},
booktitle={Proceedings of the thirtieth annual ACM symposium on Theory of computing
- STOC ’98}, author={Cole, Richard and Maggs, Bruce M. and Meyer auf der Heide,
Friedhelm and Mitzenmacher, Michael and Richa, Andréa W. and Schröder, Klaus and
Sitaraman, Ramesh K. and Vöcking, Berthold}, year={1998} }'
chicago: Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher,
Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “Randomized
Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.”
In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing
- STOC ’98, 1998. https://doi.org/10.1145/276698.276790.
ieee: R. Cole et al., “Randomized protocols for low-congestion circuit routing
in multistage interconnection networks,” in Proceedings of the thirtieth annual
ACM symposium on Theory of computing - STOC ’98, 1998.
mla: Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing
in Multistage Interconnection Networks.” Proceedings of the Thirtieth Annual
ACM Symposium on Theory of Computing - STOC ’98, 1998, doi:10.1145/276698.276790.
short: 'R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa,
K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual
ACM Symposium on Theory of Computing - STOC ’98, 1998.'
date_created: 2020-04-15T10:38:12Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1145/276698.276790
language:
- iso: eng
publication: Proceedings of the thirtieth annual ACM symposium on Theory of computing -
STOC '98
publication_identifier:
isbn:
- '0897919629'
publication_status: published
status: public
title: Randomized protocols for low-congestion circuit routing in multistage interconnection
networks
type: conference
user_id: '15415'
year: '1998'
...
---
_id: '19631'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
citation:
ama: Bäumker A. Communication Efficient Parallel Searching. Vol 28. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1997.
apa: Bäumker, A. (1997). Communication Efficient Parallel Searching (Vol.
28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Bäumker_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Communication Efficient Parallel Searching}, volume={28}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Bäumker, Armin}, year={1997},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Bäumker, Armin. Communication Efficient Parallel Searching. Vol.
28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
ieee: A. Bäumker, Communication Efficient Parallel Searching, vol. 28. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
mla: Bäumker, Armin. Communication Efficient Parallel Searching. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
short: A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:46:17Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 28'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-27-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Communication Efficient Parallel Searching
type: dissertation
user_id: '5786'
volume: 28
year: '1997'
...
---
_id: '19636'
author:
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
citation:
ama: Dittrich W. Communication and I/O Efficient Parallel Data Structures.
Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
apa: Dittrich, W. (1997). Communication and I/O Efficient Parallel Data Structures
(Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Dittrich_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Communication and I/O Efficient Parallel Data Structures},
volume={27}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Dittrich, Wolfgang}, year={1997}, collection={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn} }'
chicago: Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures.
Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
ieee: W. Dittrich, Communication and I/O Efficient Parallel Data Structures,
vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
mla: Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
short: W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:53:00Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 27'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-26-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Communication and I/O Efficient Parallel Data Structures
type: dissertation
user_id: '5786'
volume: 27
year: '1997'
...
---
_id: '19637'
author:
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
citation:
ama: Strothmann W-B. Bounded Degree Spanning Trees. Vol 35. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1997.
apa: Strothmann, W.-B. (1997). Bounded Degree Spanning Trees (Vol. 35). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Strothmann_1997, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Bounded Degree Spanning Trees}, volume={35}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Strothmann, Willy-Bernhard},
year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}
}'
chicago: Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol.
35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
ieee: W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
mla: Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
short: W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:57:53Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T12:57:43Z
date_updated: 2020-09-22T12:57:43Z
file_id: '19638'
file_name: pub-hni-468.pdf
file_size: 1172216
relation: main_file
success: 1
file_date_updated: 2020-09-22T12:57:43Z
has_accepted_license: '1'
intvolume: ' 35'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-34-5
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Bounded Degree Spanning Trees
type: dissertation
user_id: '5786'
volume: 35
year: '1997'
...
---
_id: '19869'
abstract:
- lang: eng
text: Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning
tree of $G$ of maximum degree bounded by $dT$. It is well known that for each
$dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning
tree is NP-complete. In this paper we investigate this problem when additionally
connectivity and maximum degree of the graph are given. A complete characterization
of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$
is provided. Our first result is that given a biconnected graph of maximum degree
$2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of
higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning
tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand,
we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$
has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge
3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$
has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian
path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$.
This extends the well known result for $k=3$ and fully characterizes the case
$dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected
planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG
> dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$.
On the other hand, we show how to find in polynomial (linear or almost linear)
time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
citation:
ama: 'Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: Proceedings
of the Fifth Annual European Symposium on Algorithms (ESA’97). ; 1997. doi:10.1007/3-540-63397-9_9'
apa: Czumaj, A., & Strothmann, W.-B. (1997). Bounded degree spanning trees.
Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97).
https://doi.org/10.1007/3-540-63397-9_9
bibtex: '@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees},
DOI={10.1007/3-540-63397-9_9},
booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)},
author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }'
chicago: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning
Trees.” In Proceedings of the Fifth Annual European Symposium on Algorithms
(ESA’97), 1997. https://doi.org/10.1007/3-540-63397-9_9.
ieee: 'A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi:
10.1007/3-540-63397-9_9.'
mla: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”
Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97),
1997, doi:10.1007/3-540-63397-9_9.
short: 'A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European
Symposium on Algorithms (ESA’97), 1997.'
date_created: 2020-10-05T07:13:42Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_9
language:
- iso: eng
publication: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)
publication_identifier:
isbn:
- '9783540633976'
- '9783540695363'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Bounded degree spanning trees
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '18955'
abstract:
- lang: eng
text: In this paper we present a (randomized) algorithm for maintaining the biconnected
components of a dynamic planar graph of $n$ vertices under deletions of edges.
The biconnected components can be maintained under any sequence of edge deletions
in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$
amortized time per edge deletion, which improves previous (deterministic) results
due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed.
Our work describes a simplification of the data structures from [GiIt96] and uses
dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi
and Italiano, we only need $O(n)$ space. Finally we describe some simply additional
operations on the decremental data structure. By aid of them this the data structure
is applicable for finding efficiently a $Delta$-spanning tree in a biconnected
planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann.
author:
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Strothmann W-B, Lukovszki T. Decremental Biconnectivity on Planar Graphs.
Paderborn; 1997.
apa: Strothmann, W.-B., & Lukovszki, T. (1997). Decremental Biconnectivity
on Planar Graphs. Paderborn.
bibtex: '@book{Strothmann_Lukovszki_1997, place={Paderborn}, title={Decremental
Biconnectivity on Planar Graphs}, author={Strothmann, Willy-Bernhard and Lukovszki,
Tamás}, year={1997} }'
chicago: Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity
on Planar Graphs. Paderborn, 1997.
ieee: W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar
Graphs. Paderborn, 1997.
mla: Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity
on Planar Graphs. 1997.
short: W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs,
Paderborn, 1997.
date_created: 2020-09-03T12:59:56Z
date_updated: 2022-01-06T06:53:55Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-03T12:59:44Z
date_updated: 2020-09-03T12:59:44Z
file_id: '18957'
file_name: pub-hni-901.pdf
file_size: 222106
relation: main_file
success: 1
file_date_updated: 2020-09-03T12:59:44Z
has_accepted_license: '1'
language:
- iso: eng
place: Paderborn
status: public
title: Decremental Biconnectivity on Planar Graphs
type: report
user_id: '15415'
year: '1997'
...
---
_id: '18575'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Markus
full_name: Denny, Markus
last_name: Denny
citation:
ama: 'Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point
Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry.
; 1997:39-43.'
apa: Sohler, C., & Denny, M. (1997). Encoding a Triangulation as a Permutation
of its Point Set. In Proceedings of the 9th Canadian Conference on Computational
Geometry (pp. 39–43).
bibtex: '@inproceedings{Sohler_Denny_1997, title={Encoding a Triangulation as a
Permutation of its Point Set}, booktitle={Proceedings of the 9th Canadian Conference
on Computational Geometry}, author={Sohler, Christian and Denny, Markus}, year={1997},
pages={39–43} }'
chicago: Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation
of Its Point Set.” In Proceedings of the 9th Canadian Conference on Computational
Geometry, 39–43, 1997.
ieee: C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its
Point Set,” in Proceedings of the 9th Canadian Conference on Computational
Geometry, 1997, pp. 39–43.
mla: Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation
of Its Point Set.” Proceedings of the 9th Canadian Conference on Computational
Geometry, 1997, pp. 39–43.
short: 'C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational
Geometry, 1997, pp. 39–43.'
date_created: 2020-08-28T14:14:57Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
language:
- iso: eng
page: 39-43
publication: Proceedings of the 9th Canadian Conference on Computational Geometry
status: public
title: Encoding a Triangulation as a Permutation of its Point Set
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '2175'
author:
- first_name: Stefan
full_name: Bock, Stefan
last_name: Bock
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the
(n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.'
apa: Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole
Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.
bibtex: '@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal
Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer
Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={1997}, pages={326--332} }'
chicago: Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler.
“Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE
Computer Society, 1997.
ieee: S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing
in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.
mla: Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS,
IEEE Computer Society, 1997, pp. 326--332.
short: 'S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer
Society, 1997, pp. 326--332.'
date_created: 2018-04-03T09:11:47Z
date_updated: 2022-01-06T06:55:13Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:07:20Z
date_updated: 2018-04-12T07:11:50Z
file_id: '2284'
file_name: IPPS97.pdf
file_size: 88749
relation: main_file
file_date_updated: 2018-04-12T07:11:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 326--332
publication: IPPS
publisher: IEEE Computer Society
status: public
title: Optimal Wormhole Routing in the (n, d)-Torus
type: conference
urn: '21759'
user_id: '14955'
year: '1997'
...