Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”https://doi.org/10.1007/3-540-45706-2_134__In Proceedings of the 8th International Euro-Par Conference. Paderborn, Germany, 2002.https://doi.org/10.1007/3-540-45706-2_134 .
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

Hahn, O., M. Koyro, and Gerson Meschut. “Lipirea În Combinatie Cu Îmbinarile Obtinute Prin Deformare.” Sudura 2 (2002): 10–13.
LibreCat: /record/21050

Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.”https://doi.org/10.1007/3-540-45465-9_77__In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-45465-9_77 .
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.”https://doi.org/10.1007/3-540-45706-2_133__In Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-45706-2_133 .
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

Meschut, Gerson. “Hybridfügen – Grundlagen, Technologie, Anwendungen.” In DVM-Bericht 668, 668:119–34. Berlin, 2001.
LibreCat: /record/21009

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.”https://doi.org/10.1007/3-540-48224-5_41__Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, 493–505.https://doi.org/10.1007/3-540-48224-5_41 .
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

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 .
LibreCat: /record/18964
DOI: 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 .
LibreCat: /record/18152
DOI: 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 .
LibreCat: /record/16493
DOI: 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 .
LibreCat: /record/16494
DOI: 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 .
LibreCat: /record/16722
DOI: 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 .
LibreCat: /record/3023
DOI: 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 .
LibreCat: /record/17990
DOI: 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.
LibreCat: /record/18121

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 .
LibreCat: /record/18146
DOI: 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 .
LibreCat: /record/16497
DOI: 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 .
LibreCat: /record/2435
DOI: 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.
LibreCat: /record/20992

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 .
LibreCat: /record/18959
DOI: 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 .
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9