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
Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18152
Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18166
Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001). Vol AA. ; 2001:155-164.
LibreCat
2001 | Conference Paper | LibreCat-ID: 18168
Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01). ; 2001:181-184.
LibreCat
2001 | Conference Paper | LibreCat-ID: 18370
Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: Proc. of 3. GI-Informatiktage 2001. Bad Schussenried; 2001:275-278.
LibreCat
| Files available
2001 | Conference Paper | LibreCat-ID: 16492
Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01. ; 2001. doi:10.1145/383259.383299
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45718-6_68
LibreCat
| DOI
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1
LibreCat
| DOI
2000 | Dissertation | LibreCat-ID: 19620
Rieping I. Communication in Parallel Systems-Models, Algorithms and Implementations. Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.
LibreCat
2000 | Dissertation | LibreCat-ID: 19621
Westermann M. 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
Bonorden O, Rieping I, von Otte I, Juurlink B. PUB-Library, Release 7.0, User Guide and Function Reference.; 2000.
LibreCat
| Files available
2000 | Habilitation | LibreCat-ID: 19784
Scheideler C. Probabilistic Methods for Coordination Problems.; 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 19849
Bednara M, Beyer O, Teich J, Wanka R. Tradeoff analysis and architecture design of a hybrid hardware/software sorter. In: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP). ; 2000:299-308. doi:10.1109/asap.2000.862400
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2143
Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2145
Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 | 
Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.
LibreCat
| Files available