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 | Report | LibreCat-ID: 17865
Wand M, Fischer M, Meyer auf der Heide F. 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 S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS. ; 2000:585-614. doi:10.1007/s00453-005-1197-3
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 17990
Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18150
Ziegler M, Sohler C. Computing Cut Numbers. In: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00). ; 2000:73-79.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
Lorys K, Wanka R, Oesterdiekhoff B, Kutylowski M. Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM. 2000;45:944-967. doi:10.1145/355483.355490
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 | 
Czumaj A, Scheideler C. 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. ; 2000:38-47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide F, Räcke H, Westermann M. Data management in hierarchical bus networks. In: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00. ; 2000. doi:10.1145/341800.341814
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide F, Vöcking B, Westermann M. Caching in networks. In: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. ; 2000:430–439.
LibreCat
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 17010
Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing. 2000:1703-1739. doi:10.1137/s009753979529564x
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 16345
Meyer auf der Heide F, Wanka R. Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn. 2000:112-116.
LibreCat
| Files available
2000 | Habilitation | LibreCat-ID: 19784
Scheideler C. Probabilistic Methods for Coordination Problems.; 2000.
LibreCat
1999 | Conference Paper | LibreCat-ID: 19732
Bonorden O, Juurlink B, Von Otte I, Rieping I. 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. ; 1999:99-104. doi:10.1109/ipps.1999.760442
LibreCat
| DOI
1999 | Journal Article | LibreCat-ID: 2151
Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 2164 |
Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: SODA. ; 1999:112--121.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 2165 |
Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 17864
Fischer M, Lukovszki T, Ziegler M. 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 C. Fast Reconstruction of Delaunay Triangulations. In: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99). ; 1999:136-141.
LibreCat
1999 | Dissertation | LibreCat-ID: 18942
Lukovszki T. New Results on Geometric Spanners and Their Applications. Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999.
LibreCat
| Files available