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


2001 | Journal Article | LibreCat-ID: 23731
O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18152
M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2001, vol. 2064, pp. 378–388.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18166
M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,” in Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, vol. AA, pp. 155–164.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18168
V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18370
J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–278.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 16492
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01, 2001.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Book (Editor) | LibreCat-ID: 16722
F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.
LibreCat | DOI
 

2000 | Dissertation | LibreCat-ID: 19620
I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat
 

2000 | Dissertation | LibreCat-ID: 19621
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat | Files available
 

2000 | Report | LibreCat-ID: 19733
O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference. 2000.
LibreCat | Files available
 

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

2000 | Conference Paper | LibreCat-ID: 19849
M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture design of a hybrid hardware/software sorter,” in Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi: 10.1109/asap.2000.862400.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2143
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2145
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2146 | OA
P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2147 | OA
A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.
LibreCat | Files available
 

2000 | Journal Article | LibreCat-ID: 2148
A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 2149 | OA
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2150 | OA
A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.
LibreCat | Files available
 

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
 

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
 

1999 | Conference Paper | LibreCat-ID: 18959
T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18965
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. 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, 1999, pp. 165–174.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 18576
C. Sohler, “Generating Random Star-Shaped Polygons,” in Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 2210 | OA
P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2166 | OA
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.
LibreCat | Files available
 

1999 | Journal Article | LibreCat-ID: 16501
F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” Journal of Algorithms, pp. 105–131, 1999.
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 16502
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted Jobs in Parallel,” Theory of Computing Systems, pp. 281–300, 1999.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17052
E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop on Communication and Data Management in Large Networks,” in Informatik aktuell, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17053
F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1998 | Dissertation | LibreCat-ID: 19639
B. Vöcking, Static and Dynamic Data Management in Networks, vol. 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat | Files available
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed