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.

736 Publications


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
 

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
 

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
 

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
 

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
 

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
 

1983 | Journal Article | LibreCat-ID: 16808
Infinite cube-connected cycles
F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.
LibreCat | DOI
 

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
 

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
 

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

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
 

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
 

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
 

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
 

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
 

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
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Export / Embed