Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”https://doi.org/10.1007/3-540-45294-x_21__In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.https://doi.org/10.1007/3-540-45294-x_21 .

Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.”https://doi.org/10.1007/3-540-45335-0_23__In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45335-0_23 .

Meyer auf der Heide, Friedhelm. “Data Management in Networks.”https://doi.org/10.1007/3-540-45477-2_2__In Graph-Theoretic Concepts in Computer Science, Vol. 2204.https://doi.org/10.1007/3-540-45477-2_2__Lecture Notes in Computer Science. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45477-2_2 .

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.”https://doi.org/10.1007/3-540-45718-6_68__In Computational Science - ICCS 2001. Berlin, Heidelberg, 2001.https://doi.org/10.1007/3-540-45718-6_68 .

Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.https://doi.org/10.1007/3-540-44676-1 .

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”https://doi.org/10.1007/3-540-45022-x_22__In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000.https://doi.org/10.1007/3-540-45022-x_22 .

Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.”https://doi.org/10.1007/3-540-45253-2_15__In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-45253-2_15 .

Fromme, J., S. Ganguin, S. Iske, Dorothee M. Meister, and U. Sander, eds. Medienbildung und Gesellschaft. VS Verlag, 2000.

Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.”https://doi.org/10.1007/3-540-44411-4_34__In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-44411-4_34 .

Meyer auf der Heide, Friedhelm, Mirosaw Kutyowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.”https://doi.org/10.1007/3-540-44520-x_59__In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000.https://doi.org/10.1007/3-540-44520-x_59 .

Simon, Jens, Alexander Reinefeld, and Oliver Heinz. “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI.”https://doi.org/10.1007/10704208__In SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, edited by Hermann Hellwagner and Alexander Reinefeld, 1734:367–81. Lecture Notes in Computer Science (LNCS). Berlin / Heidelberg: Springer, 1999.https://doi.org/10.1007/10704208 .

Koyro, M., and Gerson Meschut. “Eine Quasistationäre Meßmethode Zur Ermittlung Der Wärmeleitfähigkeit Polymerer Zwischenschichten in Abhängigkeit von Der Temperatur.” In Tagungsband Zur Veranstaltung Werkstoffprüfung 1999, 173–84, 1999.

Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.”https://doi.org/10.1007/3-540-48447-7_20__In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999.https://doi.org/10.1007/3-540-48447-7_20 .

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”https://doi.org/10.1007/3-540-48481-7_9__In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999.https://doi.org/10.1007/3-540-48481-7_9 .

Eisenring, Michael, Marco Platzner, and Lothar Thiele. “Communication Synthesis for Reconfigurable Embedded Systems.”https://doi.org/10.1007/978-3-540-48302-1_21__In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), 1673:205–14. LCS. Springer, 1999.https://doi.org/10.1007/978-3-540-48302-1_21 .

Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”https://doi.org/10.1007/3-540-68530-8_14__In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998.https://doi.org/10.1007/3-540-68530-8_14 .

Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.”https://doi.org/10.1007/bfb0054332__In LATIN’98: Theoretical Informatics. Berlin, Heidelberg, 1998.https://doi.org/10.1007/bfb0054332 .

Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability Algorithms by Reconfigurable Hardware.”https://doi.org/10.1007/bfb0055234__In Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , 69–78. LNCS. Berlin, Heidelberg: Springer , 1998.https://doi.org/10.1007/bfb0055234 .

Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”https://doi.org/10.1007/3-540-63397-9_9__In Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.https://doi.org/10.1007/3-540-63397-9_9 .

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/3-540-63397-9_5__In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997.https://doi.org/10.1007/3-540-63397-9_5 .