J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat: /record/3006
DOI: 10.1007/11426639_15

M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.
LibreCat: /record/3010
DOI: 10.1007/11426639_22

S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in Algorithms – ESA 2005, Berlin, Heidelberg, 2005.
LibreCat: /record/26991
DOI: 10.1007/11561071_5

G. Meschut, “Mischbauweise sorgt für frischen Wind,” Konstruktion, vol. 04, pp. 92–93, 2005.
LibreCat: /record/21219

M. Bdoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–877.
LibreCat: /record/18768
DOI: 10.1007/11523468_70

G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769.
LibreCat: /record/18867
DOI: 10.1007/11561071_67

M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in Proc. of the European Conference in Parallel Processing (Euro-Par), 2005.
LibreCat: /record/18912
DOI: 10.1007/11549468_105

M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 815–826.
LibreCat: /record/18915
DOI: 10.1007/11561071_72

M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3420, pp. 413–420.
LibreCat: /record/18924
DOI: 10.1007/978-3-540-31956-6_49

M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376.
LibreCat: /record/18925
DOI: 10.1007/978-3-540-31856-9_30

S. Köhler, C. Schindelhauer, and M. Ziegler, “On Approximating Real-World Halting Problems,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.
LibreCat: /record/17988
DOI: 10.1007/11537311_40

K. Meer and M. Ziegler, “An Explicit Solution to Post’s Problem over the Reals,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.
LibreCat: /record/17989
DOI: 10.1007/11537311_41

M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in Proc. CiE 2005: New Computational Paradigms, 2005, vol. 3526, pp. 562–571.
LibreCat: /record/18280
DOI: 10.1007/11494645_68

M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.
LibreCat: /record/16468
DOI: 10.1007/11558989_20

M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.
LibreCat: /record/16469
DOI: 10.1007/11549345_1

O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.
LibreCat: /record/16470
DOI: 10.1007/11752578_96

O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.
LibreCat: /record/16471
DOI: 10.1007/11752578_101

S. Böttcher and R. Steinmetz, “Detecting Privacy Violations in Sensitive XML Databases,” in Secure Data Management, Second VLDB Workshop, SDM 2005, 2005, pp. 143–154.
LibreCat: /record/15156
DOI: 10.1007/11552338_10

P. Briest et al., “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in Parallel Problem Solving from Nature - PPSN VIII, 2004.
LibreCat: /record/19692
DOI: 10.1007/978-3-540-30217-9_4

J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.
LibreCat: /record/3011
DOI: 10.1007/978-3-540-30564-4_5

J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230.
LibreCat: /record/3014
DOI: 10.1007/978-3-540-24632-9_16

A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in Advances in Cryptology – CRYPTO 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219.
LibreCat: /record/3015
DOI: 10.1007/978-3-540-28628-8_13

V. Damerow and C. Sohler, “Extreme Points Under Random Noise,” in Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004.
LibreCat: /record/18778
DOI: 10.1007/978-3-540-30140-0_25

M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,” in Proc. 12th Annual Symposium on Algorithms (ESA’04), 2004, vol. 3221, pp. 544–555.
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49

C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 2004, vol. 3341, pp. 805–821.
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in 12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221.
LibreCat: /record/16474
DOI: 10.1007/978-3-540-30140-0_9

H. Walder and M. Platzner, “A Runtime Environment for Reconfigurable Hardware Operating Systems,” in Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), 2004, pp. 831–835.
LibreCat: /record/13618
DOI: 10.1007/978-3-540-30117-2_84

K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” Algorithms for Memory Hierarchies, vol. 2625, 2003.
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.
LibreCat: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

M. Ziegler, “Fast Relative Approximation of Potential Fields,” in Lecture Notes in Computer Science, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

M. Dellnitz and R. Preis, “Congestion and Almost Invariant Sets in Dynamical Systems,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat: /record/16543
DOI: 10.1007/3-540-45084-x_8

O. Schütze, “A New Data Structure for the Nondominance Problem in Multi-objective Optimization,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat: /record/16664
DOI: 10.1007/3-540-36970-8_36

O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
LibreCat: /record/16665
DOI: 10.1007/3-540-36970-8_9

S. Böttcher and R. Steinmetz, “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients,” in Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, 2003, pp. 400–410.
LibreCat: /record/15077
DOI: 10.1007/978-3-540-39403-7_30

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

C. Steiger, H. Walder, and M. Platzner, “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices,” in Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), 2003, pp. 575–584.
LibreCat: /record/13615
DOI: 10.1007/978-3-540-45234-8_56

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

M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,”10.1007/3-540-45706-2_134__2002, doi:10.1007/3-540-45706-2_134 .
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

O. Hahn, M. Koyro, and G. Meschut, “Lipirea în combinatie cu îmbinarile obtinute prin deformare,” sudura, vol. 2, pp. 10–13, 2002.
LibreCat: /record/21050

M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002.
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

G. Meschut, “Hybridfügen – Grundlagen, Technologie, Anwendungen,” in DVM-Bericht 668, Berlin, 2001, vol. 668, pp. 119–134.
LibreCat: /record/21009

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

T. Lukovszki, A. Maheshwari, and N. Zeh, “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, 2001.
LibreCat: /record/18964
DOI: 10.1007/3-540-45294-x_21

M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2001, vol. 2064, pp. 378–388.
LibreCat: /record/18152
DOI: 10.1007/3-540-45335-0_23

F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
LibreCat: /record/16493
DOI: 10.1007/3-540-45477-2_2

F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.
LibreCat: /record/16722
DOI: 10.1007/3-540-44676-1

J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 2000, vol. 4698, pp. 155–166.
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

J. Fromme, S. Ganguin, S. Iske, D. M. Meister, and U. Sander, Eds., Medienbildung und Gesellschaft. VS Verlag, 2000.
LibreCat: /record/18121

M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in SOFSEM 2000: Theory and Practice of Informatics, 2000, vol. 1963, pp. 450–458.
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

F. Meyer auf der Heide, M. Kutyowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

J. Simon, A. Reinefeld, and O. Heinz, “Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI,” in SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters, vol. 1734, H. Hellwagner and A. Reinefeld, Eds. Berlin / Heidelberg: Springer, 1999, pp. 367–381.
LibreCat: /record/2435
DOI: 10.1007/10704208

M. Koyro and G. 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, 1999, pp. 173–184.
LibreCat: /record/20992

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

F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

M. Eisenring, M. Platzner, and L. Thiele, “Communication Synthesis for Reconfigurable Embedded Systems,” in Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL), 1999, vol. 1673, pp. 205–214.
LibreCat: /record/13608
DOI: 10.1007/978-3-540-48302-1_21

M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

M. Platzner and G. De Micheli, “Acceleration of satisfiability algorithms by reconfigurable hardware,” in Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) , 1998, pp. 69–78.
LibreCat: /record/13606
DOI: 10.1007/bfb0055234

A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,”10.1007/3-540-63397-9_9__1997, doi:10.1007/3-540-63397-9_9 .
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,”10.1007/3-540-63397-9_13__in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi:10.1007/3-540-63397-9_13 .
LibreCat: /record/16568
DOI: 10.1007/3-540-63397-9_13

F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable formulas,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.
LibreCat: /record/19816
DOI: 10.1007/3-540-61863-5_33

A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming, 23rd International Colloquium, ICAL. Berlin, Heidelberg, 1996.
LibreCat: /record/16702
DOI: 10.1007/3-540-61440-0

P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in STACS 96, Berlin, Heidelberg, 1996.
LibreCat: /record/16703
DOI: 10.1007/3-540-60922-9_16

F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in STACS 95, Berlin, Heidelberg, 1995.
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

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

F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in Data structures and efficient algorithms, Berlin, Heidelberg, 1992.
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in STACS 92, Berlin, Heidelberg, 1992.
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in STACS 89, Berlin, Heidelberg, 1989.
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson, “On computations with integer division,” in STACS 88, Berlin, Heidelberg, 1988.
LibreCat: /record/16767
DOI: 10.1007/bfb0035829

M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper and lower bounds for the dictionary problem,” in SWAT 88, Berlin, Heidelberg, 1988.
LibreCat: /record/16768
DOI: 10.1007/3-540-19487-8_24

H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in Computation Theory and Logic, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.
LibreCat: /record/19821
DOI: 10.1007/3-540-18170-9_167

H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat: /record/19819
DOI: 10.1007/3-540-16780-3_119

A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in Automata, Languages and Programming, Berlin, Heidelberg, 1986.
LibreCat: /record/16774
DOI: 10.1007/3-540-16761-7_54

F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in STACS 86, Berlin, Heidelberg, 1986.
LibreCat: /record/16775
DOI: 10.1007/3-540-16078-7_72

A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in STACS 86, Berlin, Heidelberg, 1986.
LibreCat: /record/16776
DOI: 10.1007/3-540-16078-7_89

F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in STACS 84, Berlin, Heidelberg, 1984.
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111