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
O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.
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
M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.
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
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.
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
V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.
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
J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.
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
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.
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
F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.
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
F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
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
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.
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
I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
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
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
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
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000.
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
M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.
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
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
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
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
2000 | Conference Paper | LibreCat-ID: 2146 | 
Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
LibreCat
| Files available
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.
2000 | Conference Paper | LibreCat-ID: 2147 |
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.
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
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
2000 | Conference Paper | LibreCat-ID: 2149 |
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
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.
2000 | Conference Paper | LibreCat-ID: 2150 |
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.
LibreCat
| Files available
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.