Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
792 Publications
1995 | Conference Paper | LibreCat-ID: 16707
Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: Proceedings Third Israel Symposium on the Theory of Computing and Systems. ; 1995. doi:10.1109/istcs.1995.377051
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60618-1_77
LibreCat
| DOI
1995 | Book Chapter | LibreCat-ID: 16874
Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_131
LibreCat
| DOI
1994 | Dissertation | LibreCat-ID: 19624
Wanka R. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität Paderborn; 1994.
LibreCat
| Files available
1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing. 1994:738-761. doi:10.1137/s0097539791194094
LibreCat
| DOI
1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide F, Monien B, Rosenberg AL, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer; 1993. doi:10.1007/3-540-56731-3
LibreCat
| DOI
1993 | Conference Paper | LibreCat-ID: 17479
Kastens U, Meyer auf der Heide F, Wachsmann A, Wichmann F. OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In: Proc. 3rd PASA Workshop, PARS Mitteilungen. ; 1993:50-55.
LibreCat
1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger M, Meyer auf der Heide F. An Optimal Parallel Dictionary. Information and Computation. 1993:196-217. doi:10.1006/inco.1993.1007
LibreCat
| DOI
1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. In: Automata, Languages and Programming. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56939-1_89
LibreCat
| DOI
1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger M, Meyer auf der Heide F. Simple, efficient shared memory simulations. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93. ; 1993. doi:10.1145/165231.165246
LibreCat
| DOI
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56503-5_46
LibreCat
| DOI
1992 | Journal Article | LibreCat-ID: 18936
Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2. Published online 1992:213-220. doi:10.1142/s0129626492000349
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55488-2_31
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1992. doi:10.1007/3-540-56731-3_3
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: STACS 92. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55210-3_176
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 16736
Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92. ; 1992. doi:10.1145/129712.129743
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger M, Meyer auf der Heide F. Dynamic Hashing in Real Time. In: TEUBNER-TEXTE Zur Informatik. Wiesbaden; 1992. doi:10.1007/978-3-322-95233-2_7
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger M, Meyer auf der Heide F. A new universal class of hash functions and dynamic hashing in real time. In: Automata, Languages and Programming. Berlin/Heidelberg; 1990. doi:10.1007/bfb0032018
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide F. Dynamic hashing strategies. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029597
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029630
LibreCat
| DOI
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger M, Meyer auf der Heide F. How to distribute a dictionary in a complete network. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90. ; 1990. doi:10.1145/100216.100229
LibreCat
| DOI
1990 | Conference Paper | LibreCat-ID: 16742
Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant time. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90. ; 1990. doi:10.1145/100216.100247
LibreCat
| DOI
1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide F. Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum. 1990;13(4):231-232.
LibreCat
1989 | Journal Article | LibreCat-ID: 16743
Just B, Meyer auf der Heide F, Wigderson A. On computations with integer division. RAIRO - Theoretical Informatics and Applications. 1989:101-111. doi:10.1051/ita/1989230101011
LibreCat
| DOI
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger M, Meyer auf der Heide F. An optimal parallel dictionary. In: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’89. ; 1989. doi:10.1145/72935.72974
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide F. On genuinely time bounded computations. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028969
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide F, Wanka R. Time-optimal simulations of networks by universal parallel computers. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028978
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: STACS 89. Berlin, Heidelberg; 1989. doi:10.1007/bfb0028983
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16763
Babai L, Just B, Meyer auf der Heide F. On the limits of computations with the floor function. Information and Computation. 1988:99-107. doi:10.1016/0890-5401(88)90031-4
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide F. Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM). 1988:740-747. doi:10.1145/44483.44490
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16765
Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science. 1988:57-68. doi:10.1016/0304-3975(88)90018-7
LibreCat
| DOI
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic perfect hashing: upper and lower bounds. In: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. ; 1988. doi:10.1109/sfcs.1988.21968
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16767
Just B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On computations with integer division. In: STACS 88. Berlin, Heidelberg; 1988. doi:10.1007/bfb0035829
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger M, Mehlhorn K, Meyer auf der Heide F, Rohnert H. Upper and lower bounds for the dictionary problem. In: SWAT 88. Berlin, Heidelberg; 1988. doi:10.1007/3-540-19487-8_24
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16772
Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing. 1987:97-99. doi:10.1137/0216007
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide F, Wigderson A. The Complexity of Parallel Sorting. SIAM Journal on Computing. 1987:100-107. doi:10.1137/0216008
LibreCat
| DOI
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide F. Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing. 1986:106-119. doi:10.1137/0215008
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16774
Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. In: Automata, Languages and Programming. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16761-7_54
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide F. Speeding up random access machines by few processors. In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_72
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16776
Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_89
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16779
Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming with two variables. Information Processing Letters. 1985:101-105. doi:10.1016/0020-0190(85)90042-0
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide F. Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM). 1985:929-937. doi:10.1145/4221.4250
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science. 1985:325-330. doi:10.1016/0304-3975(85)90079-9
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ; 1985. doi:10.1109/sfcs.1985.58
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16783
Fich FE, Meyer auf der Heide F, Ragde P, Wigderson A. One, two, three . . . infinity: lower bounds for parallel computation. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22151
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide F. Fast algorithms for n-dimensional restrictions of hard problems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22191
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide F. Nondeterministic versus probabilistic linear search algorithms. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ; 1985. doi:10.1109/sfcs.1985.38
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide F. Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control. 1985;67(1-3):195-211. doi:10.1016/S0019-9958(85)80035-8
LibreCat
| DOI
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide F. A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM). 1984:668-676. doi:10.1145/828.322450
LibreCat
| DOI
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide F, Reischuk R. On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In: 25th Annual Symposium OnFoundations of Computer Science, 1984. ; 1984. doi:10.1109/sfcs.1984.715901
LibreCat
| DOI
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide F. Efficient simulations among several models of parallel computers (extended abstract). In: STACS 84. Berlin, Heidelberg; 1984. doi:10.1007/3-540-12920-0_20
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide F. Efficiency of universal parallel computers. Acta Informatica. 1983:269-296. doi:10.1007/bf00265559
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16807
Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem on random access machines. Acta Informatica. 1983:385-395. doi:10.1007/bf00290735
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide F. Infinite cube-connected cycles. Information Processing Letters. 1983:1-2. doi:10.1016/0020-0190(83)90001-7
LibreCat
| DOI
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide F. A polynomial linear search algorithm for the n-dimensional knapsack problem. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83. ; 1983. doi:10.1145/800061.808734
LibreCat
| DOI
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide F. Efficiency of universal parallel computers. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1983. doi:10.1007/bfb0036483
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide F, Rollik A. Random access machines and straight-line programs. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10854-8_29
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide F. Time-processor trade-offs for universal parallel computers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10856-4_111
LibreCat
| DOI
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. Theoretical Computer Science. 1981:315-322. doi:10.1016/s0304-3975(81)80004-7
LibreCat
| DOI
1980 | Book Chapter | LibreCat-ID: 16815
Klein P, Meyer auf der Heide F. Untere Zeitschranken für das Rucksack-Problem. In: GI - 10. Jahrestagung. Berlin, Heidelberg; 1980. doi:10.1007/978-3-642-67838-7_34
LibreCat
| DOI
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming ICALP 1979. 1979:411-421. doi:10.1007/3-540-09510-1_32
LibreCat
| DOI