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., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” In STACS 86. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_89.
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16779
Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, 101–5. https://doi.org/10.1016/0020-0190(85)90042-0.
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, 929–37. https://doi.org/10.1145/4221.4250.
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16781
Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, 325–30. https://doi.org/10.1016/0304-3975(85)90079-9.
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16782
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.58.
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16783
Fich, F E, Friedhelm 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. https://doi.org/10.1145/22145.22151.
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985. https://doi.org/10.1145/22145.22191.
LibreCat
| DOI
1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.38.
LibreCat
| DOI
1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control 67, no. 1–3 (1985): 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8.
LibreCat
| DOI
1984 | Journal Article | LibreCat-ID: 16785
Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, 668–76. https://doi.org/10.1145/828.322450.
LibreCat
| DOI