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
2000 | Conference Paper | LibreCat-ID: 2150 | 
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 18962
Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000. https://doi.org/10.1007/s00453-005-1197-3.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-45253-2_15.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-44411-4_34.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18150
Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 73–79, 2000.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM 45 (2000): 944–67. https://doi.org/10.1145/355483.355490.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 |
Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.” In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00, 2000. https://doi.org/10.1145/341800.341814.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 430–439, 2000.
LibreCat
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000. https://doi.org/10.1007/3-540-44520-x_59.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 17010
Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, 1703–39. https://doi.org/10.1137/s009753979529564x.
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 16345
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” ForschungsForum Paderborn, 2000, 112–16.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 19732
Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” In Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104, 1999. https://doi.org/10.1109/ipps.1999.760442.
LibreCat
| DOI
1999 | Journal Article | LibreCat-ID: 2151
Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999): 387--420. https://doi.org/10.1007/s002240000123.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 2164 |
Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2165 |
Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 17864
Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver, 1999.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 18747
Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 136–41, 1999.
LibreCat
1999 | Dissertation | LibreCat-ID: 18942
Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat
| Files available
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