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.
235 Publications
1999 | Conference Paper | LibreCat-ID: 13608
Eisenring, M., Platzner, M., & Thiele, L. (1999). Communication Synthesis for Reconfigurable Embedded Systems. In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL) (Vol. 1673, pp. 205–214). Springer. https://doi.org/10.1007/978-3-540-48302-1_21
LibreCat
| DOI
1998 | Book Chapter | LibreCat-ID: 16562
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
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 13606
Platzner, M., & De Micheli, G. (1998). Acceleration of satisfiability algorithms by reconfigurable hardware. In Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) (pp. 69–78). Berlin, Heidelberg: Springer . https://doi.org/10.1007/bfb0055234
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 19869
Czumaj, A., & Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97). https://doi.org/10.1007/3-540-63397-9_9
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5
LibreCat
| Files available
| DOI
1997 | Conference Paper | LibreCat-ID: 16568
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, 1157–1170. https://doi.org/10.1007/3-540-63397-9_13
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16569
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
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16605
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
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16687
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
LibreCat
| DOI
1996 | Book Chapter | LibreCat-ID: 19816
Kleine Büning, H., & Lettmann, T. (1996). Learning a representation for optimizable formulas. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-61863-5_33
LibreCat
| DOI
1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg. https://doi.org/10.1007/bfb0024725
LibreCat
| DOI
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide, F., & Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0
LibreCat
| DOI
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131
LibreCat
| DOI
1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide, F., Monien, B., & Rosenberg, A. L. (Eds.). (1993). Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-56731-3
LibreCat
| DOI
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
LibreCat
| DOI
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46
LibreCat
| DOI