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
M. Wand, M. Fischer, and F. 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
S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 2000, vol. 4698, pp. 155–166.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in SOFSEM 2000: Theory and Practice of Informatics, 2000, vol. 1963, pp. 450–458.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18150
M. Ziegler and C. Sohler, “Computing Cut Numbers,” in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
 

2000 | Journal Article | LibreCat-ID: 18446
K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” Journal of the ACM, vol. 45, pp. 944–967, 2000, doi: 10.1145/355483.355490.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2211 | OA
A. Czumaj and C. 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, 2000, pp. 38–47.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 16495
F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: 10.1145/341800.341814.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 16496
F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 2000, pp. 430–439.
LibreCat
 

2000 | Book Chapter | LibreCat-ID: 16497
F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing, pp. 1703–1739, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 16345
F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,” ForschungsForum Paderborn, pp. 112–116, 2000.
LibreCat | Files available
 

2000 | Habilitation | LibreCat-ID: 19784
C. Scheideler, Probabilistic Methods for Coordination Problems. 2000.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 19732
O. Bonorden, B. Juurlink, I. Von Otte, and I. 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, 1999, pp. 99–104, doi: 10.1109/ipps.1999.760442.
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 2151
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 2164 | OA
P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2165 | OA
P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 17864
M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 18747
C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.
LibreCat
 

1999 | Dissertation | LibreCat-ID: 18942
T. Lukovszki, New Results on Geometric Spanners and Their Applications, vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat | Files available
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed