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.
792 Publications
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A time-space tradeoff for element distinctness. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_89
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16779
Lautemann, C., & Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. Information Processing Letters, 101–105. https://doi.org/10.1016/0020-0190(85)90042-0
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937. https://doi.org/10.1145/4221.4250
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, F., & Wigderson, A. (1985). The complexity of parallel sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.58
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16783
Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985). One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22151
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions of hard problems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22191
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear search algorithms. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.38
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control, 67(1–3), 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8
LibreCat
| DOI
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676. https://doi.org/10.1145/828.322450
LibreCat
| DOI
1984 | Conference Paper | LibreCat-ID: 16786
Meyer auf der Heide, F., & Reischuk, R. (1984). On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In 25th Annual Symposium onFoundations of Computer Science, 1984. https://doi.org/10.1109/sfcs.1984.715901
LibreCat
| DOI
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_20
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16806
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16807
Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395. https://doi.org/10.1007/bf00290735
LibreCat
| DOI
1983 | Journal Article | LibreCat-ID: 16808
Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7
LibreCat
| DOI
1983 | Conference Paper | LibreCat-ID: 16809
Meyer auf der Heide, F. (1983). 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. https://doi.org/10.1145/800061.808734
LibreCat
| DOI
1983 | Book Chapter | LibreCat-ID: 16810
Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_29
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111
LibreCat
| DOI
1981 | Journal Article | LibreCat-ID: 16820
Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7
LibreCat
| DOI
1980 | Book Chapter | LibreCat-ID: 16815
Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34
LibreCat
| DOI
1979 | Journal Article | LibreCat-ID: 16812
Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421. https://doi.org/10.1007/3-540-09510-1_32
LibreCat
| DOI