Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

778 Publications


1997 | Dissertation | LibreCat-ID: 19636
W. Dittrich, Communication and I/O Efficient Parallel Data Structures, vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat
 

1997 | Dissertation | LibreCat-ID: 19637
W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 19869
A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: 10.1007/3-540-63397-9_9.
LibreCat | DOI
 

1997 | Report | LibreCat-ID: 18955
W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.
LibreCat | Files available
 

1997 | Conference Paper | LibreCat-ID: 18575
C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its Point Set,” in Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat
 

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
 

1997 | Conference Paper | LibreCat-ID: 2179 | OA
M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.
LibreCat | Files available
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

1996 | Conference Paper | LibreCat-ID: 17483
M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the Communication Time in Parallel Programs,” in 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), 1996, pp. 13–27.
LibreCat | Files available
 

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
 

1996 | Report | LibreCat-ID: 18352
M. Fischer, J. Rethmann, and A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn, 1996.
LibreCat | Files available
 

1996 | Dissertation | LibreCat-ID: 2181
C. Scheideler, Universal routing strategies. University of Paderborn, Germany, 1996.
LibreCat
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

1995 | Dissertation | LibreCat-ID: 19623
V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, vol. 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
 

1995 | Dissertation | LibreCat-ID: 19627
A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, vol. 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat | Files available
 

1995 | Dissertation | LibreCat-ID: 19630
A. Wachsmann, Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher, vol. 6. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
 

1995 | Dissertation | LibreCat-ID: 19634
F. Ameur, Space-Bounded Learning Algorithms, vol. 10. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

1994 | Dissertation | LibreCat-ID: 19624
R. Wanka, Paralleles Sortieren auf mehrdimensionalen Gittern. Universität Paderborn, 1994.
LibreCat | Files available
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

1992 | Journal Article | LibreCat-ID: 18936
M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,” Parallel Processing Letters 2, pp. 213–220, 1992, doi: 10.1142/s0129626492000349.
LibreCat | DOI
 

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
 

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
 

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
 

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
 

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
 

1990 | Book Chapter | LibreCat-ID: 3050
H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.
LibreCat | DOI
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

1989 | Book Chapter | LibreCat-ID: 16745
F. Meyer auf der Heide, “On genuinely time bounded computations,” in STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

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
 

1983 | Journal Article | LibreCat-ID: 16806
F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta Informatica, pp. 269–296, 1983.
LibreCat | DOI
 

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
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed