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 | 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
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed