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
1998 | Report | LibreCat-ID: 19735
Bonorden O, Rieping I, von Otte I, Juurlink B. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance.; 1998.
LibreCat
| Files available
1998 | Book Chapter | LibreCat-ID: 17412
Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg; 1998. doi:10.1007/3-540-68530-8_14
LibreCat
| Files available
| DOI
1998 | Conference Paper | LibreCat-ID: 17863
Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough of Massive Models. In: Algorithm Engineering, 2nd International Workshop, {WAE ’98}. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.
LibreCat
| Files available
1998 | Report | LibreCat-ID: 18145
Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet.; 1998.
LibreCat
1998 | Dissertation | LibreCat-ID: 18445
Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn; 1998.
LibreCat
1998 | Journal Article | LibreCat-ID: 2168
Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 2169 | 
Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.
LibreCat
| Files available
1998 | Conference Paper | LibreCat-ID: 2170 |
Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.
LibreCat
| Files available
1998 | Book | LibreCat-ID: 2185
Scheideler C. Universal Routing Strategies for Interconnection Networks. Vol 1390.; 1998. doi:10.1007/BFb0052928
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. Theoretical Computer Science. 1998;196:181-200. doi:10.1016/s0304-3975(97)86791-6
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16504
Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6
LibreCat
| DOI
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics. Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 16563
Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98. ; 1998. doi:10.1145/276698.276790
LibreCat
| DOI
1997 | Dissertation | LibreCat-ID: 19631
Bäumker A. Communication Efficient Parallel Searching. Vol 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19636
Dittrich W. Communication and I/O Efficient Parallel Data Structures. Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19637
Strothmann W-B. Bounded Degree Spanning Trees. Vol 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 19869
Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97). ; 1997. doi:10.1007/3-540-63397-9_9
LibreCat
| DOI
1997 | Report | LibreCat-ID: 18955
Strothmann W-B, Lukovszki T. Decremental Biconnectivity on Planar Graphs. Paderborn; 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 18575
Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry. ; 1997:39-43.
LibreCat
1997 | Conference Paper | LibreCat-ID: 2175 |
Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 2179 |
Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: SPAA. ; 1997:170--179.
LibreCat
| Files available
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16565
Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation. 1997:103-120. doi:10.1006/inco.1997.2642
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems. Published online 1997:627-644. doi:10.1007/s002240000071
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16568
Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97. ; 1997. doi:10.1145/258492.258522
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg; 1997. doi:10.1007/3-540-63138-0_21
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16689
Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: Proceedings 38th Annual Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117
LibreCat
| DOI
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