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
1999 | Conference Paper | LibreCat-ID: 18959
Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999. https://doi.org/10.1007/3-540-48447-7_20.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 18965
Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “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, 165–74, 1999. https://doi.org/10.1145/305619.305637.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 18576
Sohler, Christian. “Generating Random Star-Shaped Polygons.” In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 174–77, 1999.
LibreCat
1999 | Conference Paper | LibreCat-ID: 2210 | 
Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2166 |
Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.
LibreCat
| Files available
1999 | Journal Article | LibreCat-ID: 16501
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, 105–31. https://doi.org/10.1006/jagm.1998.0980.
LibreCat
| DOI
1999 | Journal Article | LibreCat-ID: 16502
Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, 281–300. https://doi.org/10.1007/s002240000119.
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 17052
Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International Workshop on Communication and Data Management in Large Networks.” In Informatik Aktuell. Berlin, Heidelberg, 1999. https://doi.org/10.1007/978-3-662-01069-3_47.
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999. https://doi.org/10.1007/3-540-48481-7_9.
LibreCat
| DOI
1998 | Dissertation | LibreCat-ID: 19639
Vöcking, Berthold. Static and Dynamic Data Management in Networks. Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat
| Files available
1998 | Report | LibreCat-ID: 19735
Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.
LibreCat
| Files available
1998 | Book Chapter | LibreCat-ID: 17412
Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998. https://doi.org/10.1007/3-540-68530-8_14.
LibreCat
| Files available
| DOI
1998 | Conference Paper | LibreCat-ID: 17863
Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.
LibreCat
| Files available
1998 | Report | LibreCat-ID: 18145
Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
LibreCat
1998 | Dissertation | LibreCat-ID: 18445
Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität Paderborn, 1998.
LibreCat
1998 | Journal Article | LibreCat-ID: 2168
Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 2169 |
Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
LibreCat
| Files available
1998 | Conference Paper | LibreCat-ID: 2170 |
Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
LibreCat
| Files available
1998 | Book | LibreCat-ID: 2185
Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science 196 (1998): 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6.
LibreCat
| DOI
1998 | Journal Article | LibreCat-ID: 16504
Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.
LibreCat
| DOI
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” In LATIN’98: Theoretical Informatics. Berlin, Heidelberg, 1998. https://doi.org/10.1007/bfb0054332.
LibreCat
| DOI
1998 | Conference Paper | LibreCat-ID: 16563
Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “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. https://doi.org/10.1145/276698.276790.
LibreCat
| DOI
1997 | Dissertation | LibreCat-ID: 19631
Bäumker, Armin. Communication Efficient Parallel Searching. Vol. 28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19636
Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
1997 | Dissertation | LibreCat-ID: 19637
Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol. 35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 19869
Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” In Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997. https://doi.org/10.1007/3-540-63397-9_9.
LibreCat
| DOI
1997 | Report | LibreCat-ID: 18955
Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 18575
Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” In Proceedings of the 9th Canadian Conference on Computational Geometry, 39–43, 1997.
LibreCat
1997 | Conference Paper | LibreCat-ID: 2175 |
Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.
LibreCat
| Files available
1997 | Conference Paper | LibreCat-ID: 2179 |
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.
LibreCat
| Files available
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387.
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16565
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.
LibreCat
| DOI
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, 627–44. https://doi.org/10.1007/s002240000071.
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16568
Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002716.
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522.
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21.
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741.
LibreCat
| DOI
1997 | Conference Paper | LibreCat-ID: 16689
Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” In Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997. https://doi.org/10.1109/sfcs.1997.646117.
LibreCat
| DOI
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” In Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg, 1997. https://doi.org/10.1007/978-3-642-60831-5_22.
LibreCat
| DOI
1996 | Journal Article | LibreCat-ID: 19958
Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I (1996): 299–306.
LibreCat
1996 | Report | LibreCat-ID: 17418
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB, University of Paderborn, 1996.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc. of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996.
LibreCat
1996 | Conference Paper | LibreCat-ID: 17483
Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “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), 13–27. Amsterdam: IOS Press, 1996.
LibreCat
| Files available
1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.
LibreCat
| DOI
1996 | Report | LibreCat-ID: 18352
Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. 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, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.
LibreCat
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2 (1996): 245--281. https://doi.org/10.1016/0304-3975(96)00032-1.
LibreCat
| DOI
1996 | Conference Paper | LibreCat-ID: 2183 |
Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.
LibreCat
| Files available