Friedhelm Meyer auf der Heide

fmadh@uni-paderborn.de
ID
15523

296 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Export / Embed

296 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Export / Embed