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. (2001). Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18. https://doi.org/10.1145/504331.504333
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18152
Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18166
Ziegler, M., & Emamy-Khansari, M. R. (2001). 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, pp. 155–164).
LibreCat
 

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

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

2001 | Conference Paper | LibreCat-ID: 16492
Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W. (2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01. https://doi.org/10.1145/383259.383299
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
LibreCat | DOI
 

2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1
LibreCat | DOI
 

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

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

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

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

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

2000 | Journal Article | LibreCat-ID: 2143
Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006
LibreCat | DOI
 

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

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

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

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

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

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed