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
Factoring a binary polynomial of degree over one million
O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.
LibreCat | DOI
 

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

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

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

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

2001 | Conference Paper | LibreCat-ID: 16492
The randomized z-buffer algorithm
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001.
LibreCat | DOI
 

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

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

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

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

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

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

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

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

2000 | Journal Article | LibreCat-ID: 2143
Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
LibreCat | DOI
 

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

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

2000 | Conference Paper | LibreCat-ID: 2147 | OA LibreCat | Files available
 

2000 | Journal Article | LibreCat-ID: 2148
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
LibreCat
 

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

2000 | Conference Paper | LibreCat-ID: 2150 | OA LibreCat | Files available
 

2000 | Report | LibreCat-ID: 17865
Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes
M. Wand, M. Fischer, 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
I/O-Efficient Well-Separated Pair Decomposition and Applications
S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, 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
Property Testing in Computational Geometry
A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.
LibreCat | DOI
 

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

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

2000 | Journal Article | LibreCat-ID: 18446
Periodification Scheme: Constructing Sorting Networks with Constant Period
K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2211 | OA
A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 16495
Data management in hierarchical bus networks
F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 16496
Caching in networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, 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
Complexity Theory and Algorithms
F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat | DOI
 

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

2000 | Journal Article | LibreCat-ID: 16345 LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 19732
The Paderborn university BSP (PUB) library-design, implementation and performance
O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104.
LibreCat | DOI
 

1999 | Journal Article | LibreCat-ID: 2151
Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
LibreCat | DOI
 

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

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

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

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

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

1999 | Conference Paper | LibreCat-ID: 18959
New Results on Fault Tolerant Geometric Spanners
T. Lukovszki, 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
Data management in networks: experimental evaluation of a provably good strategy
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, 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
Generating Random Star-Shaped Polygons
C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 2210 | OA
Design of the PRESTO Multimedia Storage Network (Extended Abstract)
P. Berenbrink, M. Riedel, C. Scheideler, 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
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.
LibreCat | Files available
 

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

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

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

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

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

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Export / Embed