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 | Book Chapter | LibreCat-ID: 16693
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
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 19958
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.
LibreCat
1996 | Report | LibreCat-ID: 17418
Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.; 1996.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17419
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.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17483
Fischer M, Rethmann J, Wachsmann A. 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). Amsterdam: IOS Press; 1996:13–27.
LibreCat
| Files available
1996 | Book Chapter | LibreCat-ID: 17564
Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725
LibreCat
| DOI
1996 | Report | LibreCat-ID: 18352
Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn; 1996.
LibreCat
| Files available
1996 | Dissertation | LibreCat-ID: 2181
Scheideler C. Universal Routing Strategies. University of Paderborn, Germany; 1996.
LibreCat
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281. doi:10.1016/0304-3975(96)00032-1
LibreCat
| DOI
1996 | Conference Paper | LibreCat-ID: 2183 | 
Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.
LibreCat
| Files available
1996 | Conference Paper | LibreCat-ID: 2184 |
Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.
LibreCat
| Files available
1996 | Conference Paper | LibreCat-ID: 2186 |
Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.
LibreCat
| Files available
1996 | Journal Article | LibreCat-ID: 16698
Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A new approach to space-bounded learning. Acta Informatica. 1996:621-630. doi:10.1007/bf03036467
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. Algorithmica. Published online 1996:413-427. doi:10.1007/bf01955042
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16700
Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. Algorithmica. 1996:517-542. doi:10.1007/bf01940878
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 16701
Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722
LibreCat
| DOI
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide F, Monien B, eds. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61440-0
LibreCat
| DOI
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16
LibreCat
| DOI
1995 | Dissertation | LibreCat-ID: 19623
Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. Vol 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
LibreCat
1995 | Dissertation | LibreCat-ID: 19627
Czumaj A. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Vol 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
LibreCat
| Files available