Friedhelm Meyer auf der Heide

fmadh@uni-paderborn.de
ID
15523

298 Publications

Mark all

[298]
1999 | Book Chapter | LibreCat-ID: 17052
E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop on Communication and Data Management in Large Networks,” in Informatik aktuell, Berlin, Heidelberg, 1999.
LibreCat | DOI
 
[297]
1999 | Book Chapter | LibreCat-ID: 17053
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 | DOI
 
[296]
1998 | Journal Article | LibreCat-ID: 16503
F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998.
LibreCat | DOI
 
[295]
1998 | Journal Article | LibreCat-ID: 16504
A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 1998.
LibreCat | DOI
 
[294]
1998 | Book Chapter | LibreCat-ID: 16562
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 | DOI
 
[293]
1998 | Conference Paper | LibreCat-ID: 16563
R. Cole 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.
LibreCat | DOI
 
[292]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.
LibreCat | Files available
 
[291]
1997 | Journal Article | LibreCat-ID: 16564
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.
LibreCat | DOI
 
[290]
1997 | Journal Article | LibreCat-ID: 16565
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” Information and Computation, pp. 103–120, 1997.
LibreCat | DOI
 
[289]
1997 | Journal Article | LibreCat-ID: 16567
F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems, pp. 627–644, 1997, doi: 10.1007/s002240000071.
LibreCat | DOI
 
[288]
1997 | Conference Paper | LibreCat-ID: 16568
M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi: 10.1007/3-540-63397-9_13.
LibreCat | DOI
 
[287]
1997 | Book Chapter | LibreCat-ID: 16569
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 | DOI
 
[286]
1997 | Conference Paper | LibreCat-ID: 16604
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97, 1997.
LibreCat | DOI
 
[285]
1997 | Book Chapter | LibreCat-ID: 16605
A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat | DOI
 
[284]
1997 | Book Chapter | LibreCat-ID: 16687
E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 
[283]
1997 | Conference Paper | LibreCat-ID: 16689
B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.
LibreCat | DOI
 
[282]
1997 | Book Chapter | LibreCat-ID: 16693
F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in Informatik ’97 Informatik als Innovationsmotor, Berlin, Heidelberg, 1997.
LibreCat | DOI
 
[281]
1996 | Journal Article | LibreCat-ID: 19958
F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp. 299–306, 1996.
LibreCat
 
[280]
1996 | Report | LibreCat-ID: 17418
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations. 1996.
LibreCat
 
[279]
1996 | Conference Paper | LibreCat-ID: 17419
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC, 1996, vol. 65453, pp. 612–621.
LibreCat
 
[278]
1996 | Book Chapter | LibreCat-ID: 17564
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 | DOI
 
[277]
1996 | Journal Article | LibreCat-ID: 2182
F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput. Sci., no. 2, pp. 245--281, 1996.
LibreCat | DOI
 
[276]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.
LibreCat | Files available
 
[275]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33.
LibreCat | Files available
 
[274]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996, pp. 356--365.
LibreCat | Files available
 
[273]
1996 | Journal Article | LibreCat-ID: 16698
F. Ameur, P. Fischer, K.-U. Höffgen, and F. Meyer auf der Heide, “Trial and error. A new approach to space-bounded learning,” Acta Informatica, pp. 621–630, 1996.
LibreCat | DOI
 
[272]
1996 | Journal Article | LibreCat-ID: 16699
F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” Algorithmica, pp. 413–427, 1996, doi: 10.1007/bf01955042.
LibreCat | DOI
 
[271]
1996 | Journal Article | LibreCat-ID: 16700
R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” Algorithmica, pp. 517–542, 1996.
LibreCat | DOI
 
[270]
1996 | Journal Article | LibreCat-ID: 16701
J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing: Lower and Upper Bounds,” SIAM Journal on Computing, pp. 936–955, 1996.
LibreCat | DOI
 
[269]
1996 | Book (Editor) | LibreCat-ID: 16702
F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg, 1996.
LibreCat | DOI
 
[268]
1996 | Book Chapter | LibreCat-ID: 16703
P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in STACS 96, Berlin, Heidelberg, 1996.
LibreCat | DOI
 
[267]
1995 | Conference Paper | LibreCat-ID: 17482
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating shared memory in real time: On the computation power of reconfigurable meshes,” in Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat
 
[266]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.
LibreCat | Files available | DOI
 
[265]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.
LibreCat | Files available
 
[264]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.
LibreCat | Files available
 
[263]
1995 | Journal Article | LibreCat-ID: 16566
D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” Information Processing Letters, pp. 103–110, 1995.
LibreCat | DOI
 
[262]
1995 | Book Chapter | LibreCat-ID: 16704
F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in STACS 95, Berlin, Heidelberg, 1995.
LibreCat | DOI
 
[261]
1995 | Book Chapter | LibreCat-ID: 16705
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 | DOI
 
[260]
1995 | Conference Paper | LibreCat-ID: 16706
F. Meyer auf der Heide, M. Storch, and R. Wanka, “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.
LibreCat | DOI
 
[259]
1995 | Conference Paper | LibreCat-ID: 16707
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.
LibreCat | DOI
 
[258]
1995 | Book Chapter | LibreCat-ID: 16717
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 | DOI
 
[257]
1995 | Book Chapter | LibreCat-ID: 16874
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 | DOI
 
[256]
1994 | Journal Article | LibreCat-ID: 16728
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, pp. 738–761, 1994.
LibreCat | DOI
 
[255]
1993 | Book (Editor) | LibreCat-ID: 17477
F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.
LibreCat | DOI
 
[254]
1993 | Conference Paper | LibreCat-ID: 17479
U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report),” in Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat
 
[253]
1993 | Journal Article | LibreCat-ID: 16729
M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” Information and Computation, pp. 196–217, 1993.
LibreCat | DOI
 
[252]
1993 | Book Chapter | LibreCat-ID: 16730
F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat | DOI
 
[251]
1993 | Conference Paper | LibreCat-ID: 16731
M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory simulations,” in Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93, 1993.
LibreCat | DOI
 
[250]
1993 | Book Chapter | LibreCat-ID: 16732
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 | DOI
 
[249]
1992 | Book Chapter | LibreCat-ID: 16733
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 | DOI
 
[248]
1992 | Book Chapter | LibreCat-ID: 16734
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 | DOI
 
[247]
1992 | Book Chapter | LibreCat-ID: 16735
F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in STACS 92, Berlin, Heidelberg, 1992.
LibreCat | DOI
 
[246]
1992 | Conference Paper | LibreCat-ID: 16736
R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” in Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92, 1992.
LibreCat | DOI
 
[245]
1992 | Book Chapter | LibreCat-ID: 16737
M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in TEUBNER-TEXTE zur Informatik, Wiesbaden, 1992.
LibreCat | DOI
 
[244]
1990 | Book Chapter | LibreCat-ID: 16738
M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in Automata, Languages and Programming, Berlin/Heidelberg, 1990.
LibreCat | DOI
 
[243]
1990 | Book Chapter | LibreCat-ID: 16739
F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 
[242]
1990 | Book Chapter | LibreCat-ID: 16740
M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 
[241]
1990 | Conference Paper | LibreCat-ID: 16741
M. Dietzfelbinger and F. Meyer auf der Heide, “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.
LibreCat | DOI
 
[240]
1990 | Conference Paper | LibreCat-ID: 16742
J. Gil, F. Meyer auf der Heide, and A. Wigderson, “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.
LibreCat | DOI
 
[239]
1990 | Journal Article | LibreCat-ID: 16824
F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,” Informatik Spektrum, vol. 13, no. 4, pp. 231–232, 1990.
LibreCat
 
[238]
1989 | Journal Article | LibreCat-ID: 16743
B. Just, F. Meyer auf der Heide, and A. Wigderson, “On computations with integer division,” RAIRO - Theoretical Informatics and Applications, pp. 101–111, 1989.
LibreCat | DOI
 
[237]
1989 | Conference Paper | LibreCat-ID: 16744
M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,” in Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89, 1989.
LibreCat | DOI
 
[236]
1989 | Book Chapter | LibreCat-ID: 16745
F. Meyer auf der Heide, “On genuinely time bounded computations,” in STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 
[235]
1989 | Book Chapter | LibreCat-ID: 16746
F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks by universal parallel computers,” in STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 
[234]
1989 | Book Chapter | LibreCat-ID: 16789
F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in STACS 89, Berlin, Heidelberg, 1989.
LibreCat | DOI
 
[233]
1988 | Journal Article | LibreCat-ID: 16763
L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations with the floor function,” Information and Computation, pp. 99–107, 1988.
LibreCat | DOI
 
[232]
1988 | Journal Article | LibreCat-ID: 16764
F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of hard problems,” Journal of the ACM (JACM), pp. 740–747, 1988.
LibreCat | DOI
 
[231]
1988 | Journal Article | LibreCat-ID: 16765
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,” Theoretical Computer Science, pp. 57–68, 1988.
LibreCat | DOI
 
[230]
1988 | Conference Paper | LibreCat-ID: 16766
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
LibreCat | DOI
 
[229]
1988 | Book Chapter | LibreCat-ID: 16767
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 | DOI
 
[228]
1988 | Book Chapter | LibreCat-ID: 16768
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 | DOI
 
[227]
1987 | Journal Article | LibreCat-ID: 16772
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A Time-Space Tradeoff for Element Distinctness,” SIAM Journal on Computing, pp. 97–99, 1987.
LibreCat | DOI
 
[226]
1987 | Journal Article | LibreCat-ID: 16773
F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” SIAM Journal on Computing, pp. 100–107, 1987.
LibreCat | DOI
 
[225]
1986 | Journal Article | LibreCat-ID: 16771
F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” SIAM Journal on Computing, pp. 106–119, 1986.
LibreCat | DOI
 
[224]
1986 | Book Chapter | LibreCat-ID: 16774
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 | DOI
 
[223]
1986 | Book Chapter | LibreCat-ID: 16775
F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in STACS 86, Berlin, Heidelberg, 1986.
LibreCat | DOI
 
[222]
1986 | Book Chapter | LibreCat-ID: 16776
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 | DOI
 
[221]
1985 | Journal Article | LibreCat-ID: 16779
C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” Information Processing Letters, pp. 101–105, 1985.
LibreCat | DOI
 
[220]
1985 | Journal Article | LibreCat-ID: 16780
F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.
LibreCat | DOI
 
[219]
1985 | Journal Article | LibreCat-ID: 16781
F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
LibreCat | DOI
 
[218]
1985 | Conference Paper | LibreCat-ID: 16782
F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.
LibreCat | DOI
 
[217]
1985 | Conference Paper | LibreCat-ID: 16783
F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two, three . . . infinity: lower bounds for parallel computation,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.
LibreCat | DOI
 
[216]
1985 | Conference Paper | LibreCat-ID: 16784
F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.
LibreCat | DOI
 
[215]
1985 | Conference Paper | LibreCat-ID: 16788
F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.
LibreCat | DOI
 
[214]
1985 | Journal Article | LibreCat-ID: 16823
F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine equations on several parallel computational models,” Information and Control, vol. 67, no. 1–3, pp. 195–211, 1985.
LibreCat | DOI
 
[213]
1984 | Journal Article | LibreCat-ID: 16785
F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem,” Journal of the ACM (JACM), pp. 668–676, 1984.
LibreCat | DOI
 
[212]
1984 | Conference Paper | LibreCat-ID: 16786
F. Meyer auf der Heide and R. Reischuk, “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication,” in 25th Annual Symposium onFoundations of Computer Science, 1984., 1984.
LibreCat | DOI
 
[211]
1984 | Book Chapter | LibreCat-ID: 16787
F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in STACS 84, Berlin, Heidelberg, 1984.
LibreCat | DOI
 
[210]
1983 | Journal Article | LibreCat-ID: 16806
F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta Informatica, pp. 269–296, 1983.
LibreCat | DOI
 
[209]
1983 | Journal Article | LibreCat-ID: 16807
P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack problem on random access machines,” Acta Informatica, pp. 385–395, 1983.
LibreCat | DOI
 
[208]
1983 | Journal Article | LibreCat-ID: 16808
F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing Letters, pp. 1–2, 1983.
LibreCat | DOI
 
[207]
1983 | Conference Paper | LibreCat-ID: 16809
F. Meyer auf der Heide, “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.
LibreCat | DOI
 
[206]
1983 | Book Chapter | LibreCat-ID: 16810
F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.
LibreCat | DOI
 
[205]
1981 | Book Chapter | LibreCat-ID: 16813
F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat | DOI
 
[204]
1981 | Book Chapter | LibreCat-ID: 16814
F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat | DOI
 
[203]
1981 | Journal Article | LibreCat-ID: 16820
F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981.
LibreCat | DOI
 
[202]
1980 | Book Chapter | LibreCat-ID: 16815
P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
LibreCat | DOI
 
[201]
1979 | Journal Article | LibreCat-ID: 16812
F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Automata, Languages and Programming. ICALP 1979, pp. 411–421, 1979.
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

298 Publications

Mark all

[298]
1999 | Book Chapter | LibreCat-ID: 17052
E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop on Communication and Data Management in Large Networks,” in Informatik aktuell, Berlin, Heidelberg, 1999.
LibreCat | DOI
 
[297]
1999 | Book Chapter | LibreCat-ID: 17053
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 | DOI
 
[296]
1998 | Journal Article | LibreCat-ID: 16503
F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998.
LibreCat | DOI
 
[295]
1998 | Journal Article | LibreCat-ID: 16504
A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 1998.
LibreCat | DOI
 
[294]
1998 | Book Chapter | LibreCat-ID: 16562
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 | DOI
 
[293]
1998 | Conference Paper | LibreCat-ID: 16563
R. Cole 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.
LibreCat | DOI
 
[292]
1997 | Conference Paper | LibreCat-ID: 2175 | OA
S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.
LibreCat | Files available
 
[291]
1997 | Journal Article | LibreCat-ID: 16564
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.
LibreCat | DOI
 
[290]
1997 | Journal Article | LibreCat-ID: 16565
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” Information and Computation, pp. 103–120, 1997.
LibreCat | DOI
 
[289]
1997 | Journal Article | LibreCat-ID: 16567
F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems, pp. 627–644, 1997, doi: 10.1007/s002240000071.
LibreCat | DOI
 
[288]
1997 | Conference Paper | LibreCat-ID: 16568
M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi: 10.1007/3-540-63397-9_13.
LibreCat | DOI
 
[287]
1997 | Book Chapter | LibreCat-ID: 16569
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 | DOI
 
[286]
1997 | Conference Paper | LibreCat-ID: 16604
P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97, 1997.
LibreCat | DOI
 
[285]
1997 | Book Chapter | LibreCat-ID: 16605
A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat | DOI
 
[284]
1997 | Book Chapter | LibreCat-ID: 16687
E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat | DOI
 
[283]
1997 | Conference Paper | LibreCat-ID: 16689
B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.
LibreCat | DOI
 
[282]
1997 | Book Chapter | LibreCat-ID: 16693
F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in Informatik ’97 Informatik als Innovationsmotor, Berlin, Heidelberg, 1997.
LibreCat | DOI
 
[281]
1996 | Journal Article | LibreCat-ID: 19958
F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp. 299–306, 1996.
LibreCat
 
[280]
1996 | Report | LibreCat-ID: 17418
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations. 1996.
LibreCat
 
[279]
1996 | Conference Paper | LibreCat-ID: 17419
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC, 1996, vol. 65453, pp. 612–621.
LibreCat
 
[278]
1996 | Book Chapter | LibreCat-ID: 17564
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 | DOI
 
[277]
1996 | Journal Article | LibreCat-ID: 2182
F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput. Sci., no. 2, pp. 245--281, 1996.
LibreCat | DOI
 
[276]
1996 | Conference Paper | LibreCat-ID: 2183 | OA
F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.
LibreCat | Files available
 
[275]
1996 | Conference Paper | LibreCat-ID: 2184 | OA
F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33.
LibreCat | Files available
 
[274]
1996 | Conference Paper | LibreCat-ID: 2186 | OA
R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996, pp. 356--365.
LibreCat | Files available
 
[273]
1996 | Journal Article | LibreCat-ID: 16698
F. Ameur, P. Fischer, K.-U. Höffgen, and F. Meyer auf der Heide, “Trial and error. A new approach to space-bounded learning,” Acta Informatica, pp. 621–630, 1996.
LibreCat | DOI
 
[272]
1996 | Journal Article | LibreCat-ID: 16699
F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” Algorithmica, pp. 413–427, 1996, doi: 10.1007/bf01955042.
LibreCat | DOI
 
[271]
1996 | Journal Article | LibreCat-ID: 16700
R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” Algorithmica, pp. 517–542, 1996.
LibreCat | DOI
 
[270]
1996 | Journal Article | LibreCat-ID: 16701
J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing: Lower and Upper Bounds,” SIAM Journal on Computing, pp. 936–955, 1996.
LibreCat | DOI
 
[269]
1996 | Book (Editor) | LibreCat-ID: 16702
F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg, 1996.
LibreCat | DOI
 
[268]
1996 | Book Chapter | LibreCat-ID: 16703
P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in STACS 96, Berlin, Heidelberg, 1996.
LibreCat | DOI
 
[267]
1995 | Conference Paper | LibreCat-ID: 17482
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating shared memory in real time: On the computation power of reconfigurable meshes,” in Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.
LibreCat
 
[266]
1995 | Conference Paper | LibreCat-ID: 2187 | OA
F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.
LibreCat | Files available | DOI
 
[265]
1995 | Conference Paper | LibreCat-ID: 2207 | OA
F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.
LibreCat | Files available
 
[264]
1995 | Conference Paper | LibreCat-ID: 2208 | OA
F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.
LibreCat | Files available
 
[263]
1995 | Journal Article | LibreCat-ID: 16566
D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” Information Processing Letters, pp. 103–110, 1995.
LibreCat | DOI
 
[262]
1995 | Book Chapter | LibreCat-ID: 16704
F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in STACS 95, Berlin, Heidelberg, 1995.
LibreCat | DOI
 
[261]
1995 | Book Chapter | LibreCat-ID: 16705
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 | DOI
 
[260]
1995 | Conference Paper | LibreCat-ID: 16706
F. Meyer auf der Heide, M. Storch, and R. Wanka, “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.
LibreCat | DOI
 
[259]
1995 | Conference Paper | LibreCat-ID: 16707
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.
LibreCat | DOI
 
[258]
1995 | Book Chapter | LibreCat-ID: 16717
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 | DOI
 
[257]
1995 | Book Chapter | LibreCat-ID: 16874
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 | DOI
 
[256]
1994 | Journal Article | LibreCat-ID: 16728
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, pp. 738–761, 1994.
LibreCat | DOI
 
[255]
1993 | Book (Editor) | LibreCat-ID: 17477
F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.
LibreCat | DOI
 
[254]
1993 | Conference Paper | LibreCat-ID: 17479
U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report),” in Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat
 
[253]
1993 | Journal Article | LibreCat-ID: 16729
M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” Information and Computation, pp. 196–217, 1993.
LibreCat | DOI
 
[252]
1993 | Book Chapter | LibreCat-ID: 16730
F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat | DOI
 
[251]
1993 | Conference Paper | LibreCat-ID: 16731
M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory simulations,” in Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93, 1993.
LibreCat | DOI
 
[250]
1993 | Book Chapter | LibreCat-ID: 16732
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 | DOI
 
[249]
1992 | Book Chapter | LibreCat-ID: 16733
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 | DOI
 
[248]
1992 | Book Chapter | LibreCat-ID: 16734
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 | DOI
 
[247]
1992 | Book Chapter | LibreCat-ID: 16735
F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in STACS 92, Berlin, Heidelberg, 1992.
LibreCat | DOI
 
[246]
1992 | Conference Paper | LibreCat-ID: 16736
R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” in Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92, 1992.
LibreCat | DOI
 
[245]
1992 | Book Chapter | LibreCat-ID: 16737
M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in TEUBNER-TEXTE zur Informatik, Wiesbaden, 1992.
LibreCat | DOI
 
[244]
1990 | Book Chapter | LibreCat-ID: 16738
M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in Automata, Languages and Programming, Berlin/Heidelberg, 1990.
LibreCat | DOI
 
[243]
1990 | Book Chapter | LibreCat-ID: 16739
F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 
[242]
1990 | Book Chapter | LibreCat-ID: 16740
M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 
[241]
1990 | Conference Paper | LibreCat-ID: 16741
M. Dietzfelbinger and F. Meyer auf der Heide, “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.
LibreCat | DOI
 
[240]
1990 | Conference Paper | LibreCat-ID: 16742
J. Gil, F. Meyer auf der Heide, and A. Wigderson, “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.
LibreCat | DOI
 
[239]
1990 | Journal Article | LibreCat-ID: 16824
F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,” Informatik Spektrum, vol. 13, no. 4, pp. 231–232, 1990.
LibreCat
 
[238]
1989 | Journal Article | LibreCat-ID: 16743
B. Just, F. Meyer auf der Heide, and A. Wigderson, “On computations with integer division,” RAIRO - Theoretical Informatics and Applications, pp. 101–111, 1989.
LibreCat | DOI
 
[237]
1989 | Conference Paper | LibreCat-ID: 16744
M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,” in Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89, 1989.
LibreCat | DOI
 
[236]
1989 | Book Chapter | LibreCat-ID: 16745
F. Meyer auf der Heide, “On genuinely time bounded computations,” in STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 
[235]
1989 | Book Chapter | LibreCat-ID: 16746
F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks by universal parallel computers,” in STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 
[234]
1989 | Book Chapter | LibreCat-ID: 16789
F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in STACS 89, Berlin, Heidelberg, 1989.
LibreCat | DOI
 
[233]
1988 | Journal Article | LibreCat-ID: 16763
L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations with the floor function,” Information and Computation, pp. 99–107, 1988.
LibreCat | DOI
 
[232]
1988 | Journal Article | LibreCat-ID: 16764
F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of hard problems,” Journal of the ACM (JACM), pp. 740–747, 1988.
LibreCat | DOI
 
[231]
1988 | Journal Article | LibreCat-ID: 16765
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,” Theoretical Computer Science, pp. 57–68, 1988.
LibreCat | DOI
 
[230]
1988 | Conference Paper | LibreCat-ID: 16766
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
LibreCat | DOI
 
[229]
1988 | Book Chapter | LibreCat-ID: 16767
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 | DOI
 
[228]
1988 | Book Chapter | LibreCat-ID: 16768
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 | DOI
 
[227]
1987 | Journal Article | LibreCat-ID: 16772
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A Time-Space Tradeoff for Element Distinctness,” SIAM Journal on Computing, pp. 97–99, 1987.
LibreCat | DOI
 
[226]
1987 | Journal Article | LibreCat-ID: 16773
F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” SIAM Journal on Computing, pp. 100–107, 1987.
LibreCat | DOI
 
[225]
1986 | Journal Article | LibreCat-ID: 16771
F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” SIAM Journal on Computing, pp. 106–119, 1986.
LibreCat | DOI
 
[224]
1986 | Book Chapter | LibreCat-ID: 16774
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 | DOI
 
[223]
1986 | Book Chapter | LibreCat-ID: 16775
F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in STACS 86, Berlin, Heidelberg, 1986.
LibreCat | DOI
 
[222]
1986 | Book Chapter | LibreCat-ID: 16776
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 | DOI
 
[221]
1985 | Journal Article | LibreCat-ID: 16779
C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” Information Processing Letters, pp. 101–105, 1985.
LibreCat | DOI
 
[220]
1985 | Journal Article | LibreCat-ID: 16780
F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.
LibreCat | DOI
 
[219]
1985 | Journal Article | LibreCat-ID: 16781
F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
LibreCat | DOI
 
[218]
1985 | Conference Paper | LibreCat-ID: 16782
F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.
LibreCat | DOI
 
[217]
1985 | Conference Paper | LibreCat-ID: 16783
F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two, three . . . infinity: lower bounds for parallel computation,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.
LibreCat | DOI
 
[216]
1985 | Conference Paper | LibreCat-ID: 16784
F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.
LibreCat | DOI
 
[215]
1985 | Conference Paper | LibreCat-ID: 16788
F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.
LibreCat | DOI
 
[214]
1985 | Journal Article | LibreCat-ID: 16823
F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine equations on several parallel computational models,” Information and Control, vol. 67, no. 1–3, pp. 195–211, 1985.
LibreCat | DOI
 
[213]
1984 | Journal Article | LibreCat-ID: 16785
F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem,” Journal of the ACM (JACM), pp. 668–676, 1984.
LibreCat | DOI
 
[212]
1984 | Conference Paper | LibreCat-ID: 16786
F. Meyer auf der Heide and R. Reischuk, “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication,” in 25th Annual Symposium onFoundations of Computer Science, 1984., 1984.
LibreCat | DOI
 
[211]
1984 | Book Chapter | LibreCat-ID: 16787
F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in STACS 84, Berlin, Heidelberg, 1984.
LibreCat | DOI
 
[210]
1983 | Journal Article | LibreCat-ID: 16806
F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta Informatica, pp. 269–296, 1983.
LibreCat | DOI
 
[209]
1983 | Journal Article | LibreCat-ID: 16807
P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack problem on random access machines,” Acta Informatica, pp. 385–395, 1983.
LibreCat | DOI
 
[208]
1983 | Journal Article | LibreCat-ID: 16808
F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing Letters, pp. 1–2, 1983.
LibreCat | DOI
 
[207]
1983 | Conference Paper | LibreCat-ID: 16809
F. Meyer auf der Heide, “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.
LibreCat | DOI
 
[206]
1983 | Book Chapter | LibreCat-ID: 16810
F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.
LibreCat | DOI
 
[205]
1981 | Book Chapter | LibreCat-ID: 16813
F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat | DOI
 
[204]
1981 | Book Chapter | LibreCat-ID: 16814
F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat | DOI
 
[203]
1981 | Journal Article | LibreCat-ID: 16820
F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981.
LibreCat | DOI
 
[202]
1980 | Book Chapter | LibreCat-ID: 16815
P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
LibreCat | DOI
 
[201]
1979 | Journal Article | LibreCat-ID: 16812
F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Automata, Languages and Programming. ICALP 1979, pp. 411–421, 1979.
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed