Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.”https://doi.org/10.1007/978-3-540-39429-7_6__In Database and XML Technologies, First International XML Database Symposium, XSym 2003, 85–99. Berlin, Heidelberg, 2003.https://doi.org/10.1007/978-3-540-39429-7_6 .
LibreCat: /record/15078
DOI: 10.1007/978-3-540-39429-7_6

Steiger, Christoph, Herbert Walder, and Marco Platzner. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.”https://doi.org/10.1007/978-3-540-45234-8_56__In Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), 575–84. Berlin, Heidelberg: Springer, 2003.https://doi.org/10.1007/978-3-540-45234-8_56 .
LibreCat: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.”https://doi.org/10.1007/3-540-36379-3_36__In Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002.https://doi.org/10.1007/3-540-36379-3_36 .
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

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

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

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

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

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

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 .
LibreCat: /record/13608
DOI: 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 .
LibreCat: /record/17412
DOI: 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 .
LibreCat: /record/16562
DOI: 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 .
LibreCat: /record/13606
DOI: 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 .
LibreCat: /record/19869
DOI: 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 .
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”https://doi.org/10.1007/3-540-63397-9_13__In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997.https://doi.org/10.1007/3-540-63397-9_13 .
LibreCat: /record/16568
DOI: 10.1007/3-540-63397-9_13

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.”https://doi.org/10.1007/bfb0002716__In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997.https://doi.org/10.1007/bfb0002716 .
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.”https://doi.org/10.1007/3-540-63138-0_21__In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997.https://doi.org/10.1007/3-540-63138-0_21 .
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.”https://doi.org/10.1007/bfb0002741__In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997.https://doi.org/10.1007/bfb0002741 .
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.”https://doi.org/10.1007/3-540-61863-5_33__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1996.https://doi.org/10.1007/3-540-61863-5_33 .
LibreCat: /record/19816
DOI: 10.1007/3-540-61863-5_33

Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”https://doi.org/10.1007/bfb0024725__In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996.https://doi.org/10.1007/bfb0024725 .
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. Automata, Languages and Programming, 23rd International Colloquium, ICAL. Berlin, Heidelberg, 1996.https://doi.org/10.1007/3-540-61440-0 .
LibreCat: /record/16702
DOI: 10.1007/3-540-61440-0

Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.”https://doi.org/10.1007/3-540-60922-9_16__In STACS 96. Berlin, Heidelberg, 1996.https://doi.org/10.1007/3-540-60922-9_16 .
LibreCat: /record/16703
DOI: 10.1007/3-540-60922-9_16

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.”https://doi.org/10.1007/3-540-59042-0_81__In STACS 95. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-59042-0_81 .
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.”https://doi.org/10.1007/3-540-60313-1_133__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_133 .
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.”https://doi.org/10.1007/3-540-60618-1_77__In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60618-1_77 .
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1007/3-540-60313-1_131__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_131 .
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.https://doi.org/10.1007/3-540-56731-3 .
LibreCat: /record/17477
DOI: 10.1007/3-540-56731-3

Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.”https://doi.org/10.1007/3-540-56939-1_89__In Automata, Languages and Programming. Berlin, Heidelberg, 1993.https://doi.org/10.1007/3-540-56939-1_89 .
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.”https://doi.org/10.1007/3-540-56503-5_46__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993.https://doi.org/10.1007/3-540-56503-5_46 .
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.”https://doi.org/10.1007/3-540-55488-2_19__In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992.https://doi.org/10.1007/3-540-55488-2_19 .
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.”https://doi.org/10.1007/3-540-55488-2_31__In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-55488-2_31 .
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.”https://doi.org/10.1007/3-540-56731-3_3__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-56731-3_3 .
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.”https://doi.org/10.1007/3-540-55210-3_176__In STACS 92. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-55210-3_176 .
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.”https://doi.org/10.1007/bfb0028983__In STACS 89. Berlin, Heidelberg, 1989.https://doi.org/10.1007/bfb0028983 .
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.”https://doi.org/10.1007/bfb0035829__In STACS 88. Berlin, Heidelberg, 1988.https://doi.org/10.1007/bfb0035829 .
LibreCat: /record/16767
DOI: 10.1007/bfb0035829

Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.”https://doi.org/10.1007/3-540-19487-8_24__In SWAT 88. Berlin, Heidelberg, 1988.https://doi.org/10.1007/3-540-19487-8_24 .
LibreCat: /record/16768
DOI: 10.1007/3-540-19487-8_24

Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.”https://doi.org/10.1007/3-540-18170-9_167__In Computation Theory and Logic, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987.https://doi.org/10.1007/3-540-18170-9_167 .
LibreCat: /record/19821
DOI: 10.1007/3-540-18170-9_167

Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.”https://doi.org/10.1007/3-540-16780-3_119__In 8th International Conference on Automated Deduction. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16780-3_119 .
LibreCat: /record/19819
DOI: 10.1007/3-540-16780-3_119

Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”https://doi.org/10.1007/3-540-16761-7_54__In Automata, Languages and Programming. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16761-7_54 .
LibreCat: /record/16774
DOI: 10.1007/3-540-16761-7_54