---
_id: '17052'
author:
- first_name: E. W.
full_name: Mayr, E. W.
last_name: Mayr
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication
and Data Management in Large Networks. In: Informatik Aktuell. ; 1999.
doi:10.1007/978-3-662-01069-3_47'
apa: Mayr, E. W., Meyer auf der Heide, F., & Wanka, R. (1999). International
Workshop on Communication and Data Management in Large Networks. In Informatik
aktuell. https://doi.org/10.1007/978-3-662-01069-3_47
bibtex: '@inbook{Mayr_Meyer auf der Heide_Wanka_1999, place={Berlin, Heidelberg},
title={International Workshop on Communication and Data Management in Large Networks},
DOI={10.1007/978-3-662-01069-3_47},
booktitle={Informatik aktuell}, author={Mayr, E. W. and Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={1999} }'
chicago: Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International
Workshop on Communication and Data Management in Large Networks.” In Informatik
Aktuell. Berlin, Heidelberg, 1999. https://doi.org/10.1007/978-3-662-01069-3_47.
ieee: E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop
on Communication and Data Management in Large Networks,” in Informatik aktuell,
Berlin, Heidelberg, 1999.
mla: Mayr, E. W., et al. “International Workshop on Communication and Data Management
in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.
short: 'E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin,
Heidelberg, 1999.'
date_created: 2020-05-20T13:16:56Z
date_updated: 2022-01-06T06:53:03Z
department:
- _id: '63'
doi: 10.1007/978-3-662-01069-3_47
language:
- iso: eng
place: Berlin, Heidelberg
publication: Informatik aktuell
publication_identifier:
isbn:
- '9783540664505'
- '9783662010693'
issn:
- 1431-472X
publication_status: published
status: public
title: International Workshop on Communication and Data Management in Large Networks
type: book_chapter
user_id: '15415'
year: '1999'
...
---
_id: '17053'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical
Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’
99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9'
apa: Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably
Good and Practical Strategies for Non-uniform Data Management in Networks. In
Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9
bibtex: '@inbook{Meyer auf der Heide_Vöcking_Westermann_1999, place={Berlin, Heidelberg},
title={Provably Good and Practical Strategies for Non-uniform Data Management
in Networks}, DOI={10.1007/3-540-48481-7_9},
booktitle={Algorithms - ESA’ 99}, author={Meyer auf der Heide, Friedhelm and Vöcking,
Berthold and Westermann, Matthias}, year={1999} }'
chicago: Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann.
“Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”
In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999. https://doi.org/10.1007/3-540-48481-7_9.
ieee: F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and
Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms
- ESA’ 99, Berlin, Heidelberg, 1999.
mla: Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies
for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999,
doi:10.1007/3-540-48481-7_9.
short: 'F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’
99, Berlin, Heidelberg, 1999.'
date_created: 2020-05-20T13:35:49Z
date_updated: 2022-01-06T06:53:03Z
department:
- _id: '63'
doi: 10.1007/3-540-48481-7_9
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms - ESA’ 99
publication_identifier:
isbn:
- '9783540662518'
- '9783540484813'
issn:
- 0302-9743
publication_status: published
status: public
title: Provably Good and Practical Strategies for Non-uniform Data Management in Networks
type: book_chapter
user_id: '15415'
year: '1999'
...
---
_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: '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'
...
---
_id: '16564'
author:
- first_name: Dima
full_name: Grigoriev, Dima
last_name: Grigoriev
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Roman
full_name: Smolensky, Roman
last_name: Smolensky
citation:
ama: Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
for randomized algebraic decision trees. computational complexity. 1997:357-375.
doi:10.1007/bf01270387
apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R.
(1997). A lower bound for randomized algebraic decision trees. Computational
Complexity, 357–375. https://doi.org/10.1007/bf01270387
bibtex: '@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A
lower bound for randomized algebraic decision trees}, DOI={10.1007/bf01270387},
journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek
and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375}
}'
chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational
Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387.
ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
bound for randomized algebraic decision trees,” computational complexity,
pp. 357–375, 1997.
mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
short: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational
Complexity (1997) 357–375.
date_created: 2020-04-15T10:42:43Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bf01270387
language:
- iso: eng
page: 357-375
publication: computational complexity
publication_identifier:
issn:
- 1016-3328
- 1420-8954
publication_status: published
status: public
title: A lower bound for randomized algebraic decision trees
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16565'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real
Time: On the Computation Power of Reconfigurable Architectures. Information
and Computation. 1997:103-120. doi:10.1006/inco.1997.2642'
apa: 'Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.
Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642'
bibtex: '@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared
Memory in Real Time: On the Computation Power of Reconfigurable Architectures},
DOI={10.1006/inco.1997.2642},
journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der
Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }'
chicago: 'Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.”
Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.'
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory
in Real Time: On the Computation Power of Reconfigurable Architectures,” Information
and Computation, pp. 103–120, 1997.'
mla: 'Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation
Power of Reconfigurable Architectures.” Information and Computation, 1997,
pp. 103–20, doi:10.1006/inco.1997.2642.'
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation
(1997) 103–120.
date_created: 2020-04-15T11:20:09Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1006/inco.1997.2642
language:
- iso: eng
page: 103-120
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: 'Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable
Architectures'
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16567'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: M.
full_name: Storch, M.
last_name: Storch
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and
Slowdown for Universal Parallel Networks. Theory of Computing Systems.
Published online 1997:627-644. doi:10.1007/s002240000071
apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks. Theory of Computing
Systems, 627–644. https://doi.org/10.1007/s002240000071
bibtex: '@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks}, DOI={10.1007/s002240000071},
journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm
and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }'
chicago: Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing
Systems, 1997, 627–44. https://doi.org/10.1007/s002240000071.
ieee: 'F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between
Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems,
pp. 627–644, 1997, doi: 10.1007/s002240000071.'
mla: Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and
Slowdown for Universal Parallel Networks.” Theory of Computing Systems,
1997, pp. 627–44, doi:10.1007/s002240000071.
short: F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems
(1997) 627–644.
date_created: 2020-04-15T11:31:05Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/s002240000071
language:
- iso: eng
page: 627-644
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16569'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks.
In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716'
apa: Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data
management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.
https://doi.org/10.1007/bfb0002716
bibtex: '@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static
and dynamic data management in networks}, DOI={10.1007/bfb0002716},
booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
and Vöcking, Berthold}, year={1997} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic
Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin,
Heidelberg, 1997. https://doi.org/10.1007/bfb0002716.
ieee: F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management
in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data
Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
short: 'F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-15T11:47:28Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bfb0002716
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
isbn:
- '9783540634409'
- '9783540695493'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Static and dynamic data management in networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16604'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- 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
citation:
ama: 'Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs
in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel
Algorithms and Architectures - SPAA ’97. ; 1997. doi:10.1145/258492.258522'
apa: Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating
weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium
on Parallel algorithms and architectures - SPAA ’97. https://doi.org/10.1145/258492.258522
bibtex: '@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating
weighted jobs in parallel}, DOI={10.1145/258492.258522},
booktitle={Proceedings of the ninth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’97}, author={Berenbrink, Petra and Meyer auf der Heide,
Friedhelm and Schröder, Klaus}, year={1997} }'
chicago: Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating
Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522.
ieee: P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted
jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel
algorithms and architectures - SPAA ’97, 1997.
mla: Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings
of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures -
SPAA ’97, 1997, doi:10.1145/258492.258522.
short: 'P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the
Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97,
1997.'
date_created: 2020-04-16T06:18:07Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '63'
doi: 10.1145/258492.258522
language:
- iso: eng
publication: Proceedings of the ninth annual ACM symposium on Parallel algorithms
and architectures - SPAA '97
publication_identifier:
isbn:
- '0897918908'
publication_status: published
status: public
title: Allocating weighted jobs in parallel
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '16605'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching.
In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg;
1997. doi:10.1007/3-540-63138-0_21'
apa: Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient
parallel searching. In Solving Irregularly Structured Problems in Parallel.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21
bibtex: '@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication
efficient parallel searching}, DOI={10.1007/3-540-63138-0_21},
booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker,
Armin and Meyer auf der Heide, Friedhelm}, year={1997} }'
chicago: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
Parallel Searching.” In Solving Irregularly Structured Problems in Parallel.
Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21.
ieee: A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,”
in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg,
1997.
mla: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
Parallel Searching.” Solving Irregularly Structured Problems in Parallel,
1997, doi:10.1007/3-540-63138-0_21.
short: 'A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems
in Parallel, Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T06:22:32Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '63'
doi: 10.1007/3-540-63138-0_21
language:
- iso: eng
place: Berlin, Heidelberg
publication: Solving Irregularly Structured Problems in Parallel
publication_identifier:
isbn:
- '9783540631385'
- '9783540691570'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Communication efficient parallel searching
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16687'
author:
- first_name: Efstratios
full_name: Karaivazoglou, Efstratios
last_name: Karaivazoglou
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks.
In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741'
apa: Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous
processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.
https://doi.org/10.1007/bfb0002741
bibtex: '@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg},
title={Routing on asyncronous processor networks}, DOI={10.1007/bfb0002741},
booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios
and Meyer auf der Heide, Friedhelm}, year={1997} }'
chicago: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing
on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing.
Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741.
ieee: E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor
networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
mla: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous
Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
short: 'E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:41:06Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bfb0002741
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
isbn:
- '9783540634409'
- '9783540695493'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Routing on asyncronous processor networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16689'
author:
- first_name: B.M.
full_name: Maggs, B.M.
last_name: Maggs
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality
for data management in systems of limited bandwidth. In: Proceedings 38th Annual
Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117'
apa: Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997).
Exploiting locality for data management in systems of limited bandwidth. Proceedings
38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117
bibtex: '@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting
locality for data management in systems of limited bandwidth}, DOI={10.1109/sfcs.1997.646117},
booktitle={Proceedings 38th Annual Symposium on Foundations of Computer Science},
author={Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and
Westermann, Matthias}, year={1997} }'
chicago: Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias
Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.”
In Proceedings 38th Annual Symposium on Foundations of Computer Science,
1997. https://doi.org/10.1109/sfcs.1997.646117.
ieee: 'B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting
locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.'
mla: Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of
Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer
Science, 1997, doi:10.1109/sfcs.1997.646117.
short: 'B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings
38th Annual Symposium on Foundations of Computer Science, 1997.'
date_created: 2020-04-16T10:44:29Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1109/sfcs.1997.646117
language:
- iso: eng
publication: Proceedings 38th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '0818681977'
publication_status: published
status: public
title: Exploiting locality for data management in systems of limited bandwidth
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '16693'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Thomas
full_name: Decker, Thomas
last_name: Decker
citation:
ama: 'Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB
376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik
’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22'
apa: 'Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn:
The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.”
In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-60831-5_22'
bibtex: '@inbook{Meyer auf der Heide_Decker_1997, place={Berlin, Heidelberg}, title={Parallel
Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design
Methods, Applications”}, DOI={10.1007/978-3-642-60831-5_22},
booktitle={Informatik ’97 Informatik als Innovationsmotor}, author={Meyer auf
der Heide, Friedhelm and Decker, Thomas}, year={1997} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing
in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
In Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg,
1997. https://doi.org/10.1007/978-3-642-60831-5_22.'
ieee: 'F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The
SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in
Informatik ’97 Informatik als Innovationsmotor, Berlin, Heidelberg, 1997.'
mla: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in
Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.'
short: 'F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:48:16Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/978-3-642-60831-5_22
language:
- iso: eng
place: Berlin, Heidelberg
publication: Informatik ’97 Informatik als Innovationsmotor
publication_identifier:
isbn:
- '9783540630661'
- '9783642608315'
issn:
- 1431-472X
publication_status: published
status: public
title: 'Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms,
Design Methods, Applications”'
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16568'
abstract:
- lang: eng
text: "We present a data structure problem which describes the requirements of a
simple variant of fully dynamic walk-through animation: We assume the scene to
consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily
large and has to be stored in secondary memory (discs) with relatively slow access.
We allow a visitor to walk in the scene, and a modeler to update the scene by
insertions and deletions of balls. We focus on the realtime requirement of animation
systems: For some t (specified by the computation power of (the rendering hardware
of) the graphic workstation) the data structure has to guarantee that the balls
within distance t of the current visitor's position are presented to the rendering
hardware, 20 times per second. Insertions and deletions should also be available
to the visitor with small delay, independent of the size of the scene. We present
a data structure that fulfills the above task in realtime. Its runtime is output-sensitive,
i.e. linear in a quantity close to the output size of the query. We further present
(preliminary) experimental results indicating that our structure is efficient
in practice.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
citation:
ama: 'Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures
for realtime management of large geometric scenes. In: 5th Annual European
Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science.
Springer; 1997:157-170. doi:10.1007/3-540-63397-9_13'
apa: Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic
data structures for realtime management of large geometric scenes. 5th Annual
European Symposium on Algorithms (ESA ’97), 1284, 157–170. https://doi.org/10.1007/3-540-63397-9_13
bibtex: '@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin,
Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures
for realtime management of large geometric scenes}, volume={1284}, DOI={10.1007/3-540-63397-9_13},
booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer},
author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard},
year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }'
chicago: 'Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann.
“Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In
5th Annual European Symposium on Algorithms (ESA ’97), 1284:157–70. Lecture
Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.'
ieee: 'M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures
for realtime management of large geometric scenes,” in 5th Annual European
Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 157–170, doi: 10.1007/3-540-63397-9_13.'
mla: Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management
of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA
’97), vol. 1284, Springer, 1997, pp. 157–70, doi:10.1007/3-540-63397-9_13.
short: 'M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European
Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.'
date_created: 2020-04-15T11:44:36Z
date_updated: 2026-02-23T16:05:33Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_13
intvolume: ' 1284'
language:
- iso: eng
page: 157-170
place: Berlin, Heidelberg
publication: 5th Annual European Symposium on Algorithms (ESA '97)
publication_identifier:
isbn:
- '9783540633976'
- '9783540695363'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Dynamic data structures for realtime management of large geometric scenes
type: conference
user_id: '14972'
volume: 1284
year: '1997'
...
---
_id: '19958'
author:
- first_name: Frank
full_name: Schwarze, Frank
last_name: Schwarze
- 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
citation:
ama: Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical
Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.
apa: Schwarze, F., Meyer auf der Heide, F., & Schröder, K. (1996). Routing on
Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996, I,
299–306.
bibtex: '@article{Schwarze_Meyer auf der Heide_Schröder_1996, title={Routing on
Networks of Optical Crossbars (Extended Abstract).}, volume={I}, journal={Euro-Par
1996}, author={Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder,
Klaus}, year={1996}, pages={299–306} }'
chicago: 'Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing
on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I
(1996): 299–306.'
ieee: F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks
of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp.
299–306, 1996.
mla: Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended
Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
short: F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996)
299–306.
date_created: 2020-10-08T12:04:41Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
language:
- iso: eng
page: 299-306
publication: Euro-Par 1996
status: public
title: Routing on Networks of Optical Crossbars (Extended Abstract).
type: journal_article
user_id: '15415'
volume: I
year: '1996'
...
---
_id: '17418'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing
Based Shared Memory Simulations.; 1996.
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention
Resolution in Hashing Based Shared Memory Simulations.
bibtex: '@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report
SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared
Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm
and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University
of Paderborn} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention
Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB,
University of Paderborn, 1996.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution
in Hashing Based Shared Memory Simulations. 1996.
mla: Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory
Simulations. 1996.
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing
Based Shared Memory Simulations, 1996.
date_created: 2020-07-27T13:03:41Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
language:
- iso: eng
report_number: tr-rsfb-96-005
series_title: Technical Report SFB, University of Paderborn
status: public
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: report
user_id: '15415'
year: '1996'
...
---
_id: '17419'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
author:
- first_name: Dima
full_name: Grigoriev, Dima
last_name: Grigoriev
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Roman
full_name: Smolensky, Roman
last_name: Smolensky
citation:
ama: 'Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol
65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics
and Visualization; 1996:612-621.'
apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R.
(1996). A lower bound for randomized algebraic decision trees. In Proc. of
28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel
Graphics and Visualization.
bibtex: '@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996,
series={Lecture Notes in Computer Science}, title={A lower bound for randomized
algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC},
publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev,
Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman},
year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }'
chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc.
of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics
Symposium on Parallel Graphics and Visualization, 1996.
ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC,
1996, vol. 65453, pp. 612–621.
mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel
Graphics and Visualization, 1996, pp. 612–21.
short: 'D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc.
of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization,
1996, pp. 612–621.'
date_created: 2020-07-27T13:09:09Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
intvolume: ' 65453'
language:
- iso: eng
page: 612-621
publication: Proc. of 28th ACM-STOC
publisher: Eurographics Symposium on Parallel Graphics and Visualization
series_title: Lecture Notes in Computer Science
status: public
title: A lower bound for randomized algebraic decision trees
type: conference
user_id: '15415'
volume: 65453
year: '1996'
...