Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
298 Publications
2003 | Conference Paper | LibreCat-ID: 16720
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
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 19727
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).
LibreCat
2002 | Journal Article | LibreCat-ID: 16489
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
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 16490
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
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 16491
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
LibreCat
| DOI
2002 | Book Chapter | LibreCat-ID: 16723
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
LibreCat
| DOI
2001 | Journal Article | LibreCat-ID: 2139
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
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 16492
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
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16493
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
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16494
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
LibreCat
| DOI
2001 | Book (Editor) | LibreCat-ID: 16722
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
LibreCat
| DOI
2000 | Report | LibreCat-ID: 17865
Wand, M., Fischer, M., & Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 16495
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
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 16496
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).
LibreCat
2000 | Book Chapter | LibreCat-ID: 16497
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
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 17010
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
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 16345
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.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 18965
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
LibreCat
| DOI
1999 | Journal Article | LibreCat-ID: 16501
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
LibreCat
| DOI
1999 | Journal Article | LibreCat-ID: 16502
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
LibreCat
| DOI