Friedhelm Meyer auf der Heide

fmadh@uni-paderborn.de
ID
15523

298 Publications

Mark all

[298]
1999 | Book Chapter | LibreCat-ID: 17052
Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication and Data Management in Large Networks. In: Informatik Aktuell. ; 1999. doi:10.1007/978-3-662-01069-3_47
LibreCat | DOI
 
[297]
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’ 99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9
LibreCat | DOI
 
[296]
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. Theoretical Computer Science. 1998;196:181-200. doi:10.1016/s0304-3975(97)86791-6
LibreCat | DOI
 
[295]
1998 | Journal Article | LibreCat-ID: 16504
Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6
LibreCat | DOI
 
[294]
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics. Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332
LibreCat | DOI
 
[293]
1998 | Conference Paper | LibreCat-ID: 16563
Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98. ; 1998. doi:10.1145/276698.276790
LibreCat | DOI
 
[292]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.
LibreCat | Files available
 
[291]
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387
LibreCat | DOI
 
[290]
1997 | Journal Article | LibreCat-ID: 16565
Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation. 1997:103-120. doi:10.1006/inco.1997.2642
LibreCat | DOI
 
[289]
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems. Published online 1997:627-644. doi:10.1007/s002240000071
LibreCat | DOI
 
[288]
1997 | Conference Paper | LibreCat-ID: 16568
Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13
LibreCat | DOI
 
[287]
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716
LibreCat | DOI
 
[286]
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97. ; 1997. doi:10.1145/258492.258522
LibreCat | DOI
 
[285]
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg; 1997. doi:10.1007/3-540-63138-0_21
LibreCat | DOI
 
[284]
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741
LibreCat | DOI
 
[283]
1997 | Conference Paper | LibreCat-ID: 16689
Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: Proceedings 38th Annual Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117
LibreCat | DOI
 
[282]
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22
LibreCat | DOI
 
[281]
1996 | Journal Article | LibreCat-ID: 19958
Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.
LibreCat
 
[280]
1996 | Report | LibreCat-ID: 17418
Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.; 1996.
LibreCat
 
[279]
1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.
LibreCat
 
[278]
1996 | Book Chapter | LibreCat-ID: 17564
Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725
LibreCat | DOI
 
[277]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281. doi:10.1016/0304-3975(96)00032-1
LibreCat | DOI
 
[276]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.
LibreCat | Files available
 
[275]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.
LibreCat | Files available
 
[274]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.
LibreCat | Files available
 
[273]
1996 | Journal Article | LibreCat-ID: 16698
Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A new approach to space-bounded learning. Acta Informatica. 1996:621-630. doi:10.1007/bf03036467
LibreCat | DOI
 
[272]
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. Algorithmica. Published online 1996:413-427. doi:10.1007/bf01955042
LibreCat | DOI
 
[271]
1996 | Journal Article | LibreCat-ID: 16700
Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. Algorithmica. 1996:517-542. doi:10.1007/bf01940878
LibreCat | DOI
 
[270]
1996 | Journal Article | LibreCat-ID: 16701
Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722
LibreCat | DOI
 
[269]
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide F, Monien B, eds. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61440-0
LibreCat | DOI
 
[268]
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16
LibreCat | DOI
 
[267]
1995 | Conference Paper | LibreCat-ID: 17482
Czumaj A, Meyer auf der Heide F, Stemann V. Simulating shared memory in real time: On the computation power of reconfigurable meshes. In: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures. ; 1995:46--59.
LibreCat
 
[266]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 
[265]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: SPAA. ; 1995:137--146.
LibreCat | Files available
 
[264]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: STACS. ; 1995:267--278.
LibreCat | Files available
 
[263]
1995 | Journal Article | LibreCat-ID: 16566
Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x
LibreCat | DOI
 
[262]
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81
LibreCat | DOI
 
[261]
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_133
LibreCat | DOI
 
[260]
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95. ; 1995. doi:10.1145/215399.215430
LibreCat | DOI
 
[259]
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
 
[258]
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
 
[257]
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
 
[256]
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
 
[255]
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
 
[254]
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
 
[253]
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
 
[252]
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
 
[251]
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
 
[250]
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
 
[249]
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
 
[248]
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
 
[247]
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
 
[246]
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
 
[245]
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
 
[244]
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
 
[243]
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
 
[242]
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
 
[241]
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
 
[240]
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
 
[239]
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
 
[238]
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
 
[237]
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
 
[236]
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
 
[235]
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
 
[234]
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
 
[233]
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
 
[232]
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
 
[231]
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
 
[230]
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
 
[229]
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
 
[228]
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
 
[227]
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
 
[226]
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
 
[225]
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
 
[224]
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
 
[223]
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
 
[222]
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
 
[221]
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
 
[220]
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
 
[219]
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
 
[218]
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
 
[217]
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
 
[216]
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
 
[215]
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
 
[214]
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
 
[213]
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
 
[212]
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
 
[211]
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
 
[210]
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
 
[209]
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
 
[208]
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
 
[207]
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
 
[206]
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
 
[205]
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
 
[204]
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
 
[203]
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
 
[202]
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
 
[201]
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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

298 Publications

Mark all

[298]
1999 | Book Chapter | LibreCat-ID: 17052
Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication and Data Management in Large Networks. In: Informatik Aktuell. ; 1999. doi:10.1007/978-3-662-01069-3_47
LibreCat | DOI
 
[297]
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’ 99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9
LibreCat | DOI
 
[296]
1998 | Journal Article | LibreCat-ID: 16503
Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. Theoretical Computer Science. 1998;196:181-200. doi:10.1016/s0304-3975(97)86791-6
LibreCat | DOI
 
[295]
1998 | Journal Article | LibreCat-ID: 16504
Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6
LibreCat | DOI
 
[294]
1998 | Book Chapter | LibreCat-ID: 16562
Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics. Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332
LibreCat | DOI
 
[293]
1998 | Conference Paper | LibreCat-ID: 16563
Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98. ; 1998. doi:10.1145/276698.276790
LibreCat | DOI
 
[292]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.
LibreCat | Files available
 
[291]
1997 | Journal Article | LibreCat-ID: 16564
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387
LibreCat | DOI
 
[290]
1997 | Journal Article | LibreCat-ID: 16565
Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation. 1997:103-120. doi:10.1006/inco.1997.2642
LibreCat | DOI
 
[289]
1997 | Journal Article | LibreCat-ID: 16567
Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems. Published online 1997:627-644. doi:10.1007/s002240000071
LibreCat | DOI
 
[288]
1997 | Conference Paper | LibreCat-ID: 16568
Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13
LibreCat | DOI
 
[287]
1997 | Book Chapter | LibreCat-ID: 16569
Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716
LibreCat | DOI
 
[286]
1997 | Conference Paper | LibreCat-ID: 16604
Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97. ; 1997. doi:10.1145/258492.258522
LibreCat | DOI
 
[285]
1997 | Book Chapter | LibreCat-ID: 16605
Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg; 1997. doi:10.1007/3-540-63138-0_21
LibreCat | DOI
 
[284]
1997 | Book Chapter | LibreCat-ID: 16687
Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741
LibreCat | DOI
 
[283]
1997 | Conference Paper | LibreCat-ID: 16689
Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: Proceedings 38th Annual Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117
LibreCat | DOI
 
[282]
1997 | Book Chapter | LibreCat-ID: 16693
Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22
LibreCat | DOI
 
[281]
1996 | Journal Article | LibreCat-ID: 19958
Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.
LibreCat
 
[280]
1996 | Report | LibreCat-ID: 17418
Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.; 1996.
LibreCat
 
[279]
1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.
LibreCat
 
[278]
1996 | Book Chapter | LibreCat-ID: 17564
Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725
LibreCat | DOI
 
[277]
1996 | Journal Article | LibreCat-ID: 2182
Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281. doi:10.1016/0304-3975(96)00032-1
LibreCat | DOI
 
[276]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.
LibreCat | Files available
 
[275]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.
LibreCat | Files available
 
[274]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.
LibreCat | Files available
 
[273]
1996 | Journal Article | LibreCat-ID: 16698
Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A new approach to space-bounded learning. Acta Informatica. 1996:621-630. doi:10.1007/bf03036467
LibreCat | DOI
 
[272]
1996 | Journal Article | LibreCat-ID: 16699
Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. Algorithmica. Published online 1996:413-427. doi:10.1007/bf01955042
LibreCat | DOI
 
[271]
1996 | Journal Article | LibreCat-ID: 16700
Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. Algorithmica. 1996:517-542. doi:10.1007/bf01940878
LibreCat | DOI
 
[270]
1996 | Journal Article | LibreCat-ID: 16701
Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722
LibreCat | DOI
 
[269]
1996 | Book (Editor) | LibreCat-ID: 16702
Meyer auf der Heide F, Monien B, eds. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61440-0
LibreCat | DOI
 
[268]
1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16
LibreCat | DOI
 
[267]
1995 | Conference Paper | LibreCat-ID: 17482
Czumaj A, Meyer auf der Heide F, Stemann V. Simulating shared memory in real time: On the computation power of reconfigurable meshes. In: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures. ; 1995:46--59.
LibreCat
 
[266]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154
LibreCat | Files available | DOI
 
[265]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: SPAA. ; 1995:137--146.
LibreCat | Files available
 
[264]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: STACS. ; 1995:267--278.
LibreCat | Files available
 
[263]
1995 | Journal Article | LibreCat-ID: 16566
Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x
LibreCat | DOI
 
[262]
1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81
LibreCat | DOI
 
[261]
1995 | Book Chapter | LibreCat-ID: 16705
Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_133
LibreCat | DOI
 
[260]
1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95. ; 1995. doi:10.1145/215399.215430
LibreCat | DOI
 
[259]
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
 
[258]
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
 
[257]
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
 
[256]
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
 
[255]
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
 
[254]
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
 
[253]
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
 
[252]
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
 
[251]
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
 
[250]
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
 
[249]
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
 
[248]
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
 
[247]
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
 
[246]
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
 
[245]
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
 
[244]
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
 
[243]
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
 
[242]
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
 
[241]
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
 
[240]
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
 
[239]
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
 
[238]
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
 
[237]
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
 
[236]
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
 
[235]
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
 
[234]
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
 
[233]
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
 
[232]
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
 
[231]
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
 
[230]
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
 
[229]
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
 
[228]
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
 
[227]
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
 
[226]
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
 
[225]
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
 
[224]
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
 
[223]
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
 
[222]
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
 
[221]
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
 
[220]
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
 
[219]
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
 
[218]
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
 
[217]
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
 
[216]
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
 
[215]
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
 
[214]
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
 
[213]
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
 
[212]
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
 
[211]
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
 
[210]
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
 
[209]
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
 
[208]
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
 
[207]
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
 
[206]
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
 
[205]
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
 
[204]
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
 
[203]
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
 
[202]
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
 
[201]
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
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed