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.
792 Publications
1997 | Conference Paper | LibreCat-ID: 2179 | 
Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).
LibreCat
| Files available
1997 | Journal Article | LibreCat-ID: 16564
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
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16565
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
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16567
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
LibreCat
| 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 | Conference Paper | LibreCat-ID: 16604
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
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
1997 | Conference Paper | LibreCat-ID: 16689
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
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16693
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
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 19958
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.
LibreCat
1996 | Report | LibreCat-ID: 17418
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention Resolution in Hashing Based Shared Memory Simulations.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17419
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.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17483
Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27). Amsterdam: IOS Press.
LibreCat
| Files available
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 | Report | LibreCat-ID: 18352
Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn.
LibreCat
| Files available
1996 | Dissertation | LibreCat-ID: 2181
Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany.
LibreCat
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
LibreCat
| DOI
1996 | Conference Paper | LibreCat-ID: 2183 |
Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).
LibreCat
| Files available