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.

184 Publications


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
 

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 | Conference Paper | LibreCat-ID: 18964
Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS. https://doi.org/10.1007/3-540-45294-x_21
LibreCat | DOI
 

2001 | Journal Article | LibreCat-ID: 18749
Czumaj, A., & Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 493–505. https://doi.org/10.1007/3-540-48224-5_41
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, A., Sohler, C., & Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-45253-2_15
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, M., & Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-44411-4_34
LibreCat | DOI
 

1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9
LibreCat | DOI
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed