---
_id: '16720'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: N.
full_name: Bruls, N.
last_name: Bruls
- first_name: U.
full_name: Kastens, U.
last_name: Kastens
- first_name: D. K.
full_name: Le, D. K.
last_name: Le
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: J.-C.
full_name: Niemann, J.-C.
last_name: Niemann
- first_name: M.
full_name: Porrmann, M.
last_name: Porrmann
- first_name: U.
full_name: Rückert, U.
last_name: Rückert
- first_name: A.
full_name: Slowik, A.
last_name: Slowik
- first_name: M.
full_name: Thies, M.
last_name: Thies
citation:
ama: 'Bonorden O, Bruls N, Kastens U, et al. A holistic methodology for network
processor design. In: 28th Annual IEEE International Conference on Local Computer
Networks. ; 2003. doi:10.1109/LCN.2003.1243185'
apa: Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann,
J.-C., … Thies, M. (2003). A holistic methodology for network processor design.
In 28th Annual IEEE International Conference on Local Computer Networks.
https://doi.org/10.1109/LCN.2003.1243185
bibtex: '@inproceedings{Bonorden_Bruls_Kastens_Le_Meyer auf der Heide_Niemann_Porrmann_Rückert_Slowik_Thies_2003,
title={A holistic methodology for network processor design}, DOI={10.1109/LCN.2003.1243185},
booktitle={28th Annual IEEE International Conference on Local Computer Networks},
author={Bonorden, Olaf and Bruls, N. and Kastens, U. and Le, D. K. and Meyer auf
der Heide, Friedhelm and Niemann, J.-C. and Porrmann, M. and Rückert, U. and Slowik,
A. and Thies, M.}, year={2003} }'
chicago: Bonorden, Olaf, N. Bruls, U. Kastens, D. K. Le, Friedhelm Meyer auf der
Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, and M. Thies. “A Holistic
Methodology for Network Processor Design.” In 28th Annual IEEE International
Conference on Local Computer Networks, 2003. https://doi.org/10.1109/LCN.2003.1243185.
ieee: O. Bonorden et al., “A holistic methodology for network processor design,”
in 28th Annual IEEE International Conference on Local Computer Networks,
2003.
mla: Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.”
28th Annual IEEE International Conference on Local Computer Networks, 2003,
doi:10.1109/LCN.2003.1243185.
short: 'O. Bonorden, N. Bruls, U. Kastens, D.K. Le, F. Meyer auf der Heide, J.-C.
Niemann, M. Porrmann, U. Rückert, A. Slowik, M. Thies, in: 28th Annual IEEE International
Conference on Local Computer Networks, 2003.'
date_created: 2020-04-17T08:31:57Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1109/LCN.2003.1243185
language:
- iso: eng
publication: 28th Annual IEEE International Conference on Local Computer Networks
status: public
title: A holistic methodology for network processor design
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19727'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- 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: 'Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested
BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In:
Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA). ; 2002:2202-2208.'
apa: 'Bonorden, O., Meyer auf der Heide, F., & Wanka, R. (2002). Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example. In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA) (pp. 2202–2208).'
bibtex: '@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques
and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={2002}, pages={2202–2208} }'
chicago: 'Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example.” In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA), 2202–8, 2002.'
ieee: 'O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient
Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,”
in Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA), 2002, pp. 2202–2208.'
mla: 'Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum
Spanning Tree Computation as an Instructive Example.” Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp.
2202–08.'
short: 'O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.'
date_created: 2020-09-28T10:49:50Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
page: 2202-2208
publication: Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA)
status: public
title: 'Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation
as an Instructive Example'
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '16489'
author:
- first_name: Christof
full_name: Krick, Christof
last_name: Krick
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Bernhard
full_name: Vöcking, Bernhard
last_name: Vöcking
- first_name: 'Matthias'' '
full_name: 'Westermann, Matthias'' '
last_name: Westermann
citation:
ama: 'Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data Management
in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of
Computing Systems. Published online 2002:217-245. doi:10.1007/s00224-001-1045-z'
apa: 'Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann,
M. (2002). Data Management in Networks: Experimental Evaluation of a Provably
Good Strategy. Theory of Computing Systems, 217–245. https://doi.org/10.1007/s00224-001-1045-z'
bibtex: '@article{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_2002, title={Data
Management in Networks: Experimental Evaluation of a Provably Good Strategy},
DOI={10.1007/s00224-001-1045-z},
journal={Theory of Computing Systems}, author={Krick, Christof and Meyer auf der
Heide, Friedhelm and Räcke, Harald and Vöcking, Bernhard and Westermann, Matthias’
}, year={2002}, pages={217–245} }'
chicago: 'Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Bernhard
Vöcking, and Matthias’ Westermann. “Data Management in Networks: Experimental
Evaluation of a Provably Good Strategy.” Theory of Computing Systems, 2002,
217–45. https://doi.org/10.1007/s00224-001-1045-z.'
ieee: 'C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann,
“Data Management in Networks: Experimental Evaluation of a Provably Good Strategy,”
Theory of Computing Systems, pp. 217–245, 2002, doi: 10.1007/s00224-001-1045-z.'
mla: 'Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation
of a Provably Good Strategy.” Theory of Computing Systems, 2002, pp. 217–45,
doi:10.1007/s00224-001-1045-z.'
short: C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory
of Computing Systems (2002) 217–245.
date_created: 2020-04-09T10:03:55Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/s00224-001-1045-z
language:
- iso: eng
page: 217-245
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: 'Data Management in Networks: Experimental Evaluation of a Provably Good Strategy'
type: journal_article
user_id: '15415'
year: '2002'
...
---
_id: '16490'
abstract:
- lang: eng
text: "We present a new data structure for rendering highly complex virtual environments
of arbitrary topology. The special feature of our approach is that it allows an
interactive navigation in very large scenes (30 GB/400 million polygons in our
benchmark scenes) that cannot be stored in main memory, but only on a local or
remote hard disk. Furthermore, it allows interactive rendering of substantially
more complex scenes by instantiating objects.\r\n\r\nFor the computation of an
approximate image of the scene, a sampling technique is used. In the preprocessing,
a so-called sample tree is built whose nodes contain randomly selected polygons
from the scene. This tree only uses space that is linear in the number of polygons.
In order to produce an image of the scene, the tree is traversed and polygons
stored in the visited nodes are rendered. During the interactive walkthrough,
parts of the sample tree are loaded from local or remote hard disk.\r\n\r\nWe
implemented our algorithm in a prototypical walkthrough system. Analysis and experiments
show that the quality of our images is comparable to images computed by the conventional
z-buffer algorithm regardless of the scene topology."
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The
randomized sample tree: a data structure for interactive walkthroughs in externally
stored virtual environments. In: Proceedings of the ACM Symposium on Virtual
Reality Software and Technology - VRST ’02. ; 2002. doi:10.1145/585740.585764'
apa: 'Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf
der Heide, F. (2002). The randomized sample tree: a data structure for interactive
walkthroughs in externally stored virtual environments. In Proceedings of the
ACM symposium on Virtual reality software and technology - VRST ’02. https://doi.org/10.1145/585740.585764'
bibtex: '@inproceedings{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2002,
title={The randomized sample tree: a data structure for interactive walkthroughs
in externally stored virtual environments}, DOI={10.1145/585740.585764},
booktitle={Proceedings of the ACM symposium on Virtual reality software and technology
- VRST ’02}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and
Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2002}
}'
chicago: 'Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka,
and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure
for Interactive Walkthroughs in Externally Stored Virtual Environments.” In Proceedings
of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02,
2002. https://doi.org/10.1145/585740.585764.'
ieee: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der
Heide, “The randomized sample tree: a data structure for interactive walkthroughs
in externally stored virtual environments,” in Proceedings of the ACM symposium
on Virtual reality software and technology - VRST ’02, 2002.'
mla: 'Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive
Walkthroughs in Externally Stored Virtual Environments.” Proceedings of the
ACM Symposium on Virtual Reality Software and Technology - VRST ’02, 2002,
doi:10.1145/585740.585764.'
short: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der
Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology
- VRST ’02, 2002.'
date_created: 2020-04-09T10:10:36Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/585740.585764
language:
- iso: eng
publication: Proceedings of the ACM symposium on Virtual reality software and technology -
VRST '02
publication_identifier:
isbn:
- '1581135300'
publication_status: published
status: public
title: 'The randomized sample tree: a data structure for interactive walkthroughs
in externally stored virtual environments'
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '16491'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
citation:
ama: 'Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Energy, congestion
and dilation in radio networks. In: Proceedings of the Fourteenth Annual ACM
Symposium on Parallel Algorithms and Architectures - SPAA ’02. ; 2002. doi:10.1145/564870.564910'
apa: Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M.
(2002). Energy, congestion and dilation in radio networks. In Proceedings of
the fourteenth annual ACM symposium on Parallel algorithms and architectures
- SPAA ’02. https://doi.org/10.1145/564870.564910
bibtex: '@inproceedings{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2002,
title={Energy, congestion and dilation in radio networks}, DOI={10.1145/564870.564910},
booktitle={Proceedings of the fourteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’02}, author={Meyer auf der Heide, Friedhelm and Schindelhauer,
Christian and Volbert, Klaus and Grünewald, Matthias}, year={2002} }'
chicago: Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert,
and Matthias Grünewald. “Energy, Congestion and Dilation in Radio Networks.” In
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and
Architectures - SPAA ’02, 2002. https://doi.org/10.1145/564870.564910.
ieee: F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy,
congestion and dilation in radio networks,” in Proceedings of the fourteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’02,
2002.
mla: Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in
Radio Networks.” Proceedings of the Fourteenth Annual ACM Symposium on Parallel
Algorithms and Architectures - SPAA ’02, 2002, doi:10.1145/564870.564910.
short: 'F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, in:
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and
Architectures - SPAA ’02, 2002.'
date_created: 2020-04-09T10:30:23Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/564870.564910
language:
- iso: eng
publication: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA '02
publication_identifier:
isbn:
- '1581135297'
publication_status: published
status: public
title: Energy, congestion and dilation in radio networks
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '16723'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Mohan
full_name: Kumar, Mohan
last_name: Kumar
- first_name: Sotiris
full_name: Nikoletseas, Sotiris
last_name: Nikoletseas
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
citation:
ama: 'Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing,
Mobile Networks. In: Euro-Par 2002 Parallel Processing. Lecture Notes in
Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133'
apa: Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002).
Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing
(Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_133
bibtex: '@inbook{Meyer auf der Heide_Kumar_Nikoletseas_Spirakis_2002, place={Berlin,
Heidelberg}, edition={Lecture Notes in Computer Science, vol 2400}, title={Mobile
Computing, Mobile Networks}, DOI={10.1007/3-540-45706-2_133},
booktitle={Euro-Par 2002 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, year={2002} }'
chicago: Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul
Spirakis. “Mobile Computing, Mobile Networks.” In Euro-Par 2002 Parallel Processing,
Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45706-2_133.
ieee: F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile
Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture
Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.
mla: Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”
Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol
2400, 2002, doi:10.1007/3-540-45706-2_133.
short: 'F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par
2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin,
Heidelberg, 2002.'
date_created: 2020-04-17T11:40:33Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-45706-2_133
edition: Lecture Notes in Computer Science, vol 2400
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par 2002 Parallel Processing
publication_identifier:
isbn:
- '9783540440499'
- '9783540457060'
issn:
- 0302-9743
publication_status: published
status: public
title: Mobile Computing, Mobile Networks
type: book_chapter
user_id: '15415'
year: '2002'
...
---
_id: '2139'
author:
- 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: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers:
Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138.
doi:10.1007/s004930170007'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica,
21(1), 95--138. https://doi.org/10.1007/s004930170007'
bibtex: '@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1},
journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={2001}, pages={95--138} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica
21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded
Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21,
no. 1, pp. 95--138, 2001.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica,
vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.'
short: F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
date_created: 2018-04-03T05:47:20Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s004930170007
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 95--138
publication: Combinatorica
status: public
title: 'Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols'
type: journal_article
user_id: '14955'
volume: 21
year: '2001'
...
---
_id: '16492'
abstract:
- lang: eng
text: We present a new output-sensitive rendering algorithm, the randomized z-buffer
algorithm. It renders an image of an arbitrary three-dimensional scene consisting
of triangular primitives by reconstruction from a dynamically chosen set of random
surface sample points. This approach is independent of mesh connectivity and topology.
The resulting rendering time grows only logarithmically with the numbers of triangles
in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles
at interactive frame rates. Automatic identification of low detail scene components
ensures that the rendering speed of the randomized z-buffer cannot drop below
that of conventional z-buffer rendering. Experimental and analytical evidence
is given that the image quality is comparable to that of common approaches like
z-buffer rendering. The precomputed data structures employed by the randomized
z-buffer allow for interactive dynamic updates of the scene. Their memory requirements
grow only linearly with the number of triangles and allow for a scene graph based
instantiation scheme to further reduce memory consumption.
author:
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Ingmar
full_name: Peter, Ingmar
last_name: Peter
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Wolfgang
full_name: Straßer, Wolfgang
last_name: Straßer
citation:
ama: 'Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized
z-buffer algorithm. In: Proceedings of the 28th Annual Conference on Computer
Graphics and Interactive Techniques - SIGGRAPH ’01. ; 2001. doi:10.1145/383259.383299'
apa: Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W.
(2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual
conference on Computer graphics and interactive techniques - SIGGRAPH ’01.
https://doi.org/10.1145/383259.383299
bibtex: '@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The
randomized z-buffer algorithm}, DOI={10.1145/383259.383299},
booktitle={Proceedings of the 28th annual conference on Computer graphics and
interactive techniques - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias
and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001}
}'
chicago: Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der
Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In Proceedings
of the 28th Annual Conference on Computer Graphics and Interactive Techniques
- SIGGRAPH ’01, 2001. https://doi.org/10.1145/383259.383299.
ieee: M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The
randomized z-buffer algorithm,” in Proceedings of the 28th annual conference
on Computer graphics and interactive techniques - SIGGRAPH ’01, 2001.
mla: Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” Proceedings of
the 28th Annual Conference on Computer Graphics and Interactive Techniques -
SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.
short: 'M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings
of the 28th Annual Conference on Computer Graphics and Interactive Techniques
- SIGGRAPH ’01, 2001.'
date_created: 2020-04-09T10:36:54Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/383259.383299
language:
- iso: eng
publication: Proceedings of the 28th annual conference on Computer graphics and interactive
techniques - SIGGRAPH '01
publication_identifier:
isbn:
- 158113374X
publication_status: published
status: public
title: The randomized z-buffer algorithm
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '16493'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic
Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2'
apa: Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic
Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
bibtex: '@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={
Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204},
DOI={10.1007/3-540-45477-2_2},
booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science}
}'
chicago: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In Graph-Theoretic
Concepts in Computer Science, Vol. 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45477-2_2.
ieee: F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic
Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
mla: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic
Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.
short: 'F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science,
Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:40:48Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45477-2_2
intvolume: ' 2204'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
isbn:
- '9783540427070'
- '9783540454779'
issn:
- 0302-9743
publication_status: published
series_title: ' Lecture Notes in Computer Science'
status: public
title: Data Management in Networks
type: book_chapter
user_id: '15415'
volume: 2204
year: '2001'
...
---
_id: '16494'
author:
- 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: 'Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact
on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg;
2001. doi:10.1007/3-540-45718-6_68'
apa: Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and
Their Impact on Algorithm Design. In Computational Science - ICCS 2001.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
bibtex: '@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel
Bridging Models and Their Impact on Algorithm Design}, DOI={10.1007/3-540-45718-6_68},
booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={2001} }'
chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models
and Their Impact on Algorithm Design.” In Computational Science - ICCS 2001.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45718-6_68.
ieee: F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact
on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg,
2001.
mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and
Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001,
doi:10.1007/3-540-45718-6_68.
short: 'F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001,
Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:51:36Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45718-6_68
language:
- iso: eng
place: Berlin, Heidelberg
publication: Computational Science - ICCS 2001
publication_identifier:
isbn:
- '9783540422334'
- '9783540457183'
issn:
- 0302-9743
publication_status: published
status: public
title: Parallel Bridging Models and Their Impact on Algorithm Design
type: book_chapter
user_id: '15415'
year: '2001'
...
---
_id: '16722'
citation:
ama: 'Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium
Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin,
Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1'
apa: 'Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS,
volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1'
bibtex: '@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture
Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001,
9th Annual European Symposium Århus, Denmark}, DOI={10.1007/3-540-44676-1},
publisher={Springer }, year={2001} }'
chicago: 'Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161). Berlin, Heidelberg: Springer , 2001. https://doi.org/10.1007/3-540-44676-1.'
ieee: 'F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European
Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume
2161). Berlin, Heidelberg: Springer , 2001.'
mla: Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.
short: F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium
Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer
, Berlin, Heidelberg, 2001.
date_created: 2020-04-17T10:59:08Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-44676-1
edition: Lecture Notes in Computer Science (LNCS, volume 2161)
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783540424932'
- '9783540446767'
issn:
- 0302-9743
publication_status: published
publisher: 'Springer '
status: public
title: Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark
type: book_editor
user_id: '15415'
year: '2001'
...
---
_id: '17865'
abstract:
- lang: eng
text: We present a new output-sensitive rendering algorithm, the randomized z-buffer
algorithm. It renders an image of a three dimensional scene of triangular primitives
by reconstruction from a random sample of surface points which are chosen with
a probability proportional to the projected area of the objects. The approach
is independent of mesh connectivity and topology. It leads to a rendering time
that grows only logarithmically with the numbers of triangles in the scene and
to linear memory consumption, thus allowing walkthroughs of scenes of extreme
complexity. We consider different methods for image reconstruction which aim at
correctness, rendering speed and image quality and we develop an efficient data
structure for sample extraction in output-sensitive time which allows for efficient
dynamic updates of the scene. Experiments confirm that scenes consisting of some
hundred billion triangles can be rendered within seconds with an image quality
comparable to a conventional z-buffer rendering; in special cases, realtime performance
can be achieved.
author:
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- 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
citation:
ama: Wand M, Fischer M, Meyer auf der Heide F. Randomized Point Sampling for
Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn;
2000.
apa: Wand, M., Fischer, M., & Meyer auf der Heide, F. (2000). Randomized
Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität
Paderborn.
bibtex: '@book{Wand_Fischer_Meyer auf der Heide_2000, place={Universität Paderborn},
title={Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic
Scenes}, author={Wand, Michael and Fischer, Matthias and Meyer auf der Heide,
Friedhelm}, year={2000} }'
chicago: Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. Randomized
Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität
Paderborn, 2000.
ieee: M. Wand, M. Fischer, and F. Meyer auf der Heide, Randomized Point Sampling
for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn,
2000.
mla: Wand, Michael, et al. Randomized Point Sampling for Output-Sensitive Rendering
of Complex Dynamic Scenes. 2000.
short: M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for
Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.
date_created: 2020-08-12T13:27:52Z
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-12T13:27:33Z
date_updated: 2020-08-12T13:27:33Z
file_id: '17866'
file_name: tr-ri-00-217.pdf
file_size: 921817
relation: main_file
success: 1
file_date_updated: 2020-08-12T13:27:33Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
title: Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic
Scenes
type: report
user_id: '15415'
year: '2000'
...
---
_id: '16495'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Meyer auf der Heide F, Räcke H, Westermann M. Data management in hierarchical
bus networks. In: Proceedings of the Twelfth Annual ACM Symposium on Parallel
Algorithms and Architectures - SPAA ’00. ; 2000. doi:10.1145/341800.341814'
apa: Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management
in hierarchical bus networks. Proceedings of the Twelfth Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’00. https://doi.org/10.1145/341800.341814
bibtex: '@inproceedings{Meyer auf der Heide_Räcke_Westermann_2000, title={Data management
in hierarchical bus networks}, DOI={10.1145/341800.341814},
booktitle={Proceedings of the twelfth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’00}, author={Meyer auf der Heide, Friedhelm and Räcke,
Harald and Westermann, Matthias}, year={2000} }'
chicago: Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann.
“Data Management in Hierarchical Bus Networks.” In Proceedings of the Twelfth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00,
2000. https://doi.org/10.1145/341800.341814.
ieee: 'F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in
hierarchical bus networks,” 2000, doi: 10.1145/341800.341814.'
mla: Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus
Networks.” Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms
and Architectures - SPAA ’00, 2000, doi:10.1145/341800.341814.
short: 'F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the
Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA
’00, 2000.'
date_created: 2020-04-09T13:06:23Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/341800.341814
language:
- iso: eng
publication: Proceedings of the twelfth annual ACM symposium on Parallel algorithms
and architectures - SPAA '00
publication_identifier:
isbn:
- '1581131852'
publication_status: published
status: public
title: Data management in hierarchical bus networks
type: conference
user_id: '15415'
year: '2000'
...
---
_id: '16496'
abstract:
- lang: eng
text: We present a general framework for the development of on-line algorithms for
data management in networks with limited memory capacities. These algorithms dynamically
create and delete copies of shared data objects that can be read and written by
the nodes in the network. Our algorithms aim to minimize the congestion, i.e.,
the maximum communication load over all network resources, so that that none of
these resources become a communication bottleneck. We give several examples of
networks for which our framework yields efficient algorithms, including meshes,
fat-trees, hypercubic networks, and complete networks. For example, our framework
yields an $O(d cdot log n)$-competitive caching algorithm for $d$-dimensional
meshes of size $n$ with respect to the congestion on the communication links,
and an $O(1)$-competitive algorithms for complete networks with respect to the
congestion at the memory modules due to remote accesses. Previous work on data
management in networks either neglects memory capacity constraints or minimizes
only the total communication load, i.e., the sum of the communication load over
all resources, which may produce congestion as some of the links become bottlenecks.
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. Caching in networks. In: SODA
’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms.
; 2000:430–439.'
apa: 'Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (2000). Caching
in networks. In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium
on Discrete algorithms (pp. 430–439).'
bibtex: '@inproceedings{Meyer auf der Heide_Vöcking_Westermann_2000, title={Caching
in networks}, booktitle={SODA ’00: Proceedings of the eleventh annual ACM-SIAM
symposium on Discrete algorithms}, author={Meyer auf der Heide, Friedhelm and
Vöcking, Berthold and Westermann, Matthias}, year={2000}, pages={430–439} }'
chicago: 'Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann.
“Caching in Networks.” In SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM
Symposium on Discrete Algorithms, 430–439, 2000.'
ieee: 'F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,”
in SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete
algorithms, 2000, pp. 430–439.'
mla: 'Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” SODA ’00:
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms,
2000, pp. 430–439.'
short: 'F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings
of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.'
date_created: 2020-04-09T13:16:15Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
language:
- iso: eng
page: 430–439
publication: 'SODA ''00: Proceedings of the eleventh annual ACM-SIAM symposium on
Discrete algorithms'
publication_identifier:
isbn:
- '0898714532'
status: public
title: Caching in networks
type: conference
user_id: '15415'
year: '2000'
...
---
_id: '16497'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Mirosław
full_name: Kutyłowski, Mirosław
last_name: Kutyłowski
- first_name: Prabhakar
full_name: Ragde, Prabhakar
last_name: Ragde
citation:
ama: 'Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms.
In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59'
apa: Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity
Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg.
https://doi.org/10.1007/3-540-44520-x_59
bibtex: '@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg},
title={Complexity Theory and Algorithms}, DOI={10.1007/3-540-44520-x_59},
booktitle={Euro-Par 2000 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
and Kutyłowski, Mirosław and Ragde, Prabhakar}, year={2000} }'
chicago: Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde.
“Complexity Theory and Algorithms.” In Euro-Par 2000 Parallel Processing.
Berlin, Heidelberg, 2000. https://doi.org/10.1007/3-540-44520-x_59.
ieee: F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and
Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg,
2000.
mla: Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.”
Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.
short: 'F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel
Processing, Berlin, Heidelberg, 2000.'
date_created: 2020-04-09T13:30:45Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-44520-x_59
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par 2000 Parallel Processing
publication_identifier:
isbn:
- '9783540679561'
- '9783540445203'
issn:
- 0302-9743
publication_status: published
status: public
title: Complexity Theory and Algorithms
type: book_chapter
user_id: '15415'
year: '2000'
...
---
_id: '17010'
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. SIAM Journal on Computing. 2000:1703-1739.
doi:10.1137/s009753979529564x
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (2000). Contention Resolution
in Hashing Based Shared Memory Simulations. SIAM Journal on Computing,
1703–1739. https://doi.org/10.1137/s009753979529564x
bibtex: '@article{Czumaj_Meyer auf der Heide_Stemann_2000, title={Contention Resolution
in Hashing Based Shared Memory Simulations}, DOI={10.1137/s009753979529564x},
journal={SIAM Journal on Computing}, author={Czumaj, Artur and Meyer auf der Heide,
Friedhelm and Stemann, Volker}, year={2000}, pages={1703–1739} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention
Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing,
2000, 1703–39. https://doi.org/10.1137/s009753979529564x.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution
in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing,
pp. 1703–1739, 2000.
mla: Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory
Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing
(2000) 1703–1739.
date_created: 2020-05-18T13:47:36Z
date_updated: 2022-01-06T06:53:01Z
department:
- _id: '63'
doi: 10.1137/s009753979529564x
language:
- iso: eng
page: 1703-1739
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: journal_article
user_id: '15415'
year: '2000'
...
---
_id: '16345'
article_type: original
author:
- 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: Meyer auf der Heide F, Wanka R. Von der Hollerith-Maschine zum Parallelrechner
- Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik.
ForschungsForum Paderborn. 2000:112-116.
apa: Meyer auf der Heide, F., & Wanka, R. (2000). Von der Hollerith-Maschine
zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor
für die Informatik. ForschungsForum Paderborn, 112–116.
bibtex: '@article{Meyer auf der Heide_Wanka_2000, title={Von der Hollerith-Maschine
zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor
für die Informatik}, journal={ForschungsForum Paderborn}, author={Meyer auf der
Heide, Friedhelm and Wanka, Rolf}, year={2000}, pages={112–116} }'
chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine
Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor
Für Die Informatik.” ForschungsForum Paderborn, 2000, 112–16.
ieee: F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner
- Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,”
ForschungsForum Paderborn, pp. 112–116, 2000.
mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine
Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor
Für Die Informatik.” ForschungsForum Paderborn, 2000, pp. 112–16.
short: F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116.
date_created: 2020-03-24T10:59:27Z
date_updated: 2022-01-06T06:52:49Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-04T13:17:46Z
date_updated: 2020-08-04T13:17:46Z
file_id: '17588'
file_name: FFP-06-2000.pdf
file_size: 477845
relation: main_file
success: 1
file_date_updated: 2020-08-04T13:17:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 112-116
publication: ForschungsForum Paderborn
publication_identifier:
unknown:
- ISBN 978-3-942647-99-1
status: public
title: Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des
Sortierens als Fortschrittsmotor für die Informatik
type: journal_article
user_id: '15415'
year: '2000'
...
---
_id: '18965'
author:
- first_name: Christof
full_name: Krick, Christof
last_name: Krick
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data management
in networks: experimental evaluation of a provably good strategy. In: Proceedings
of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’99. ; 1999:165-174. doi:10.1145/305619.305637'
apa: 'Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann,
M. (1999). Data management in networks: experimental evaluation of a provably
good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel
algorithms and architectures - SPAA ’99 (pp. 165–174). https://doi.org/10.1145/305619.305637'
bibtex: '@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999,
title={Data management in networks: experimental evaluation of a provably good
strategy}, DOI={10.1145/305619.305637},
booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms
and architectures - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide,
Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999},
pages={165–174} }'
chicago: 'Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold
Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation
of a Provably Good Strategy.” In Proceedings of the Eleventh Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’99, 165–74, 1999. https://doi.org/10.1145/305619.305637.'
ieee: 'C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann,
“Data management in networks: experimental evaluation of a provably good strategy,”
in Proceedings of the eleventh annual ACM symposium on Parallel algorithms
and architectures - SPAA ’99, 1999, pp. 165–174.'
mla: 'Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation
of a Provably Good Strategy.” Proceedings of the Eleventh Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.'
short: 'C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in:
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’99, 1999, pp. 165–174.'
date_created: 2020-09-03T14:27:14Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
doi: 10.1145/305619.305637
language:
- iso: eng
page: 165-174
publication: Proceedings of the eleventh annual ACM symposium on Parallel algorithms
and architectures - SPAA '99
publication_identifier:
isbn:
- '1581131240'
publication_status: published
status: public
title: 'Data management in networks: experimental evaluation of a provably good strategy'
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '16501'
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. Shortest-Path Routing in Arbitrary Networks.
Journal of Algorithms. 1999:105-131. doi:10.1006/jagm.1998.0980
apa: Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in
Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980
bibtex: '@article{Meyer auf der Heide_Vöcking_1999, title={Shortest-Path Routing
in Arbitrary Networks}, DOI={10.1006/jagm.1998.0980},
journal={Journal of Algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking,
Berthold}, year={1999}, pages={105–131} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing
in Arbitrary Networks.” Journal of Algorithms, 1999, 105–31. https://doi.org/10.1006/jagm.1998.0980.
ieee: F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary
Networks,” Journal of Algorithms, pp. 105–131, 1999.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing
in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.
short: F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
date_created: 2020-04-14T11:50:52Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1006/jagm.1998.0980
language:
- iso: eng
page: 105-131
publication: Journal of Algorithms
publication_identifier:
issn:
- 0196-6774
publication_status: published
status: public
title: Shortest-Path Routing in Arbitrary Networks
type: journal_article
user_id: '15415'
year: '1999'
...
---
_id: '16502'
author:
- first_name: P.
full_name: Berenbrink, P.
last_name: Berenbrink
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: K.
full_name: Schröder, K.
last_name: Schröder
citation:
ama: Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating Weighted Jobs in
Parallel. Theory of Computing Systems. 1999:281-300. doi:10.1007/s002240000119
apa: Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1999). Allocating
Weighted Jobs in Parallel. Theory of Computing Systems, 281–300. https://doi.org/10.1007/s002240000119
bibtex: '@article{Berenbrink_Meyer auf der Heide_Schröder_1999, title={Allocating
Weighted Jobs in Parallel}, DOI={10.1007/s002240000119},
journal={Theory of Computing Systems}, author={Berenbrink, P. and Meyer auf der
Heide, Friedhelm and Schröder, K.}, year={1999}, pages={281–300} }'
chicago: Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating
Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, 281–300.
https://doi.org/10.1007/s002240000119.
ieee: P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted
Jobs in Parallel,” Theory of Computing Systems, pp. 281–300, 1999.
mla: Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of
Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.
short: P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems
(1999) 281–300.
date_created: 2020-04-14T12:00:32Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/s002240000119
language:
- iso: eng
page: 281-300
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Allocating Weighted Jobs in Parallel
type: journal_article
user_id: '15415'
year: '1999'
...