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

Steiger, Christoph, et al. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.”10.1007/978-3-540-45234-8_56__Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), Springer, 2003, pp. 575–84, doi: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.”10.1007/3-540-36379-3_36__Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”10.1007/3-540-45706-2_134__Proceedings of the 8th International Euro-Par Conference, 2002, doi:10.1007/3-540-45706-2_134.
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.”10.1007/3-540-45465-9_77__Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, doi:10.1007/3-540-45465-9_77.
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”10.1007/3-540-45706-2_133__Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi: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.”10.1007/3-540-48224-5_41__Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”10.1007/3-540-45294-x_21__Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001, doi: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.”10.1007/3-540-45335-0_23__Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), vol. 2064, 2001, pp. 378–88, doi: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.”10.1007/3-540-45477-2_2__Graph-Theoretic Concepts in Computer Science, vol. 2204, 2001, doi: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.”10.1007/3-540-45718-6_68__Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68.
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi: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.”10.1007/3-540-45022-x_22__Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Czumaj, Artur, et al. “Property Testing in Computational Geometry.”10.1007/3-540-45253-2_15__Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi: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.”10.1007/3-540-44411-4_34__SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.”10.1007/3-540-44520-x_59__Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Simon, Jens, et al. “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI.”10.1007/10704208__SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, edited by Hermann Hellwagner and Alexander Reinefeld, vol. 1734, Springer, 1999, pp. 367–81, doi:10.1007/10704208.
LibreCat: /record/2435
DOI: 10.1007/10704208

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

Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”10.1007/3-540-48481-7_9__Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Eisenring, Michael, et al. “Communication Synthesis for Reconfigurable Embedded Systems.”10.1007/978-3-540-48302-1_21__Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), vol. 1673, Springer, 1999, pp. 205–14, doi:10.1007/978-3-540-48302-1_21.
LibreCat: /record/13608
DOI: 10.1007/978-3-540-48302-1_21

Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”10.1007/3-540-68530-8_14__Algorithms — ESA’ 98, 1998, doi: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.”10.1007/bfb0054332__LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability Algorithms by Reconfigurable Hardware.”10.1007/bfb0055234__Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , Springer , 1998, pp. 69–78, doi:10.1007/bfb0055234.
LibreCat: /record/13606
DOI: 10.1007/bfb0055234

Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”10.1007/3-540-63397-9_9__Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997, doi: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.”10.1007/3-540-63397-9_5__Algorithms — ESA ’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”10.1007/3-540-63397-9_13__5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi: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.”10.1007/bfb0002716__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.”10.1007/3-540-63138-0_21__Solving Irregularly Structured Problems in Parallel, 1997, doi: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.”10.1007/bfb0002741__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

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

Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”10.1007/bfb0024725__Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

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

Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.”10.1007/3-540-60922-9_16__STACS 96, 1996, doi: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.”10.1007/3-540-59042-0_81__STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”10.1007/3-540-60313-1_133__Lecture Notes in Computer Science, 1995, doi: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.”10.1007/3-540-60618-1_77__Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77.
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”10.1007/3-540-60313-1_131__Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.
LibreCat: /record/17477
DOI: 10.1007/3-540-56731-3

Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”10.1007/3-540-56939-1_89__Automata, Languages and Programming, 1993, doi: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.”10.1007/3-540-56503-5_46__Lecture Notes in Computer Science, 1993, doi: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.”10.1007/3-540-55488-2_19__Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, 1992, pp. 1–24, doi: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.”10.1007/3-540-55488-2_31__Data Structures and Efficient Algorithms, 1992, doi: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.”10.1007/3-540-56731-3_3__Lecture Notes in Computer Science, 1992, doi: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.”10.1007/3-540-55210-3_176__STACS 92, 1992, doi: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.”10.1007/bfb0028983__STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

Just, Bettina, et al. “On Computations with Integer Division.”10.1007/bfb0035829__STACS 88, 1988, doi:10.1007/bfb0035829.
LibreCat: /record/16767
DOI: 10.1007/bfb0035829

Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.”10.1007/3-540-19487-8_24__SWAT 88, 1988, doi: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.”10.1007/3-540-18170-9_167__Computation Theory and Logic, edited by Egon Börger, 1987, pp. 208–23, doi: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.”10.1007/3-540-16780-3_119__8th International Conference on Automated Deduction, 1986, doi:10.1007/3-540-16780-3_119.
LibreCat: /record/19819
DOI: 10.1007/3-540-16780-3_119

Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”10.1007/3-540-16761-7_54__Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.
LibreCat: /record/16774
DOI: 10.1007/3-540-16761-7_54

Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.”10.1007/3-540-16078-7_72__STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
LibreCat: /record/16775
DOI: 10.1007/3-540-16078-7_72

Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.”10.1007/3-540-16078-7_89__STACS 86, 1986, doi:10.1007/3-540-16078-7_89.
LibreCat: /record/16776
DOI: 10.1007/3-540-16078-7_89

Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).”10.1007/3-540-12920-0_20__STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.”10.1007/3-540-10854-8_29__Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.”10.1007/3-540-10856-4_111__Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111