--- _id: '16776' author: - first_name: A. full_name: Borodin, A. last_name: Borodin - first_name: F. full_name: Fich, F. last_name: Fich - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: E. full_name: Upfal, E. last_name: Upfal - first_name: A. full_name: Wigderson, A. last_name: Wigderson citation: ama: 'Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_89' apa: 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 bibtex: '@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={10.1007/3-540-16078-7_89}, booktitle={STACS 86}, author={Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1986} }' chicago: 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. ieee: 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. mla: Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS 86, 1986, doi:10.1007/3-540-16078-7_89. short: 'A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.' date_created: 2020-04-21T10:08:23Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-16078-7_89 language: - iso: eng place: Berlin, Heidelberg publication: STACS 86 publication_identifier: isbn: - '9783540160786' - '9783540397588' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A time-space tradeoff for element distinctness type: book_chapter user_id: '15415' year: '1986' ... --- _id: '16779' author: - first_name: Clemens full_name: Lautemann, Clemens last_name: Lautemann - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming with two variables. Information Processing Letters. 1985:101-105. doi:10.1016/0020-0190(85)90042-0 apa: 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 bibtex: '@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for integer programming with two variables}, DOI={10.1016/0020-0190(85)90042-0}, journal={Information Processing Letters}, author={Lautemann, Clemens and Meyer auf der Heide, Friedhelm}, year={1985}, pages={101–105} }' chicago: 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. ieee: C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” Information Processing Letters, pp. 101–105, 1985. mla: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0. short: C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985) 101–105. date_created: 2020-04-21T10:15:46Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1016/0020-0190(85)90042-0 language: - iso: eng page: 101-105 publication: Information Processing Letters publication_identifier: issn: - 0020-0190 publication_status: published status: public title: Lower time bounds for integer programming with two variables type: journal_article user_id: '15415' year: '1985' ... --- _id: '16780' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM). 1985:929-937. doi:10.1145/4221.4250 apa: 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 bibtex: '@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear diophantine equations on random access machines}, DOI={10.1145/4221.4250}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={929–937} }' chicago: 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. ieee: 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. mla: Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, pp. 929–37, doi:10.1145/4221.4250. short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937. date_created: 2020-04-21T10:16:50Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1145/4221.4250 language: - iso: eng page: 929-937 publication: Journal of the ACM (JACM) publication_identifier: issn: - 0004-5411 - 1557-735X publication_status: published status: public title: Lower bounds for solving linear diophantine equations on random access machines type: journal_article user_id: '15415' year: '1985' ... --- _id: '16781' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science. 1985:325-330. doi:10.1016/0304-3975(85)90079-9 apa: 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 bibtex: '@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic algebraic computation trees}, DOI={10.1016/0304-3975(85)90079-9}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={325–330} }' chicago: 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. ieee: F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985. mla: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30, doi:10.1016/0304-3975(85)90079-9. short: F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330. date_created: 2020-04-21T11:18:44Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1016/0304-3975(85)90079-9 language: - iso: eng page: 325-330 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Simulating probabilistic by deterministic algebraic computation trees type: journal_article user_id: '15415' year: '1985' ... --- _id: '16782' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Avi full_name: Wigderson, Avi last_name: Wigderson citation: ama: 'Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ; 1985. doi:10.1109/sfcs.1985.58' apa: 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 bibtex: '@inproceedings{Meyer auf der Heide_Wigderson_1985, title={The complexity of parallel sorting}, DOI={10.1109/sfcs.1985.58}, booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, author={Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1985} }' chicago: 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. ieee: 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. mla: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58. short: 'F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.' date_created: 2020-04-21T11:19:34Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1109/sfcs.1985.58 language: - iso: eng publication: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) publication_identifier: isbn: - '0818606444' publication_status: published status: public title: The complexity of parallel sorting type: conference user_id: '15415' year: '1985' ... --- _id: '16783' author: - first_name: F E full_name: Fich, F E last_name: Fich - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: P full_name: Ragde, P last_name: Ragde - first_name: A full_name: Wigderson, A last_name: Wigderson citation: ama: 'Fich FE, Meyer auf der Heide F, Ragde P, Wigderson A. One, two, three . . . infinity: lower bounds for parallel computation. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85. ; 1985. doi:10.1145/22145.22151' apa: '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' bibtex: '@inproceedings{Fich_Meyer auf der Heide_Ragde_Wigderson_1985, title={One, two, three . . . infinity: lower bounds for parallel computation}, DOI={10.1145/22145.22151}, booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85}, author={Fich, F E and Meyer auf der Heide, Friedhelm and Ragde, P and Wigderson, A}, year={1985} }' chicago: '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.' ieee: '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.' mla: 'Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22151.' short: '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.' date_created: 2020-04-21T11:20:53Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1145/22145.22151 language: - iso: eng publication: Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 publication_identifier: isbn: - '0897911512' publication_status: published status: public title: 'One, two, three . . . infinity: lower bounds for parallel computation' type: conference user_id: '15415' year: '1985' ... --- _id: '16784' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. Fast algorithms for n-dimensional restrictions of hard problems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85. ; 1985. doi:10.1145/22145.22191' apa: 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 bibtex: '@inproceedings{Meyer auf der Heide_1985, title={Fast algorithms for n-dimensional restrictions of hard problems}, DOI={10.1145/22145.22191}, booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85}, author={Meyer auf der Heide, Friedhelm}, year={1985} }' chicago: 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. ieee: 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. mla: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22191. short: 'F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985.' date_created: 2020-04-21T11:24:17Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1145/22145.22191 language: - iso: eng publication: Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 publication_identifier: isbn: - '0897911512' publication_status: published status: public title: Fast algorithms for n-dimensional restrictions of hard problems type: conference user_id: '15415' year: '1985' ... --- _id: '16788' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. Nondeterministic versus probabilistic linear search algorithms. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ; 1985. doi:10.1109/sfcs.1985.38' apa: 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 bibtex: '@inproceedings{Meyer auf der Heide_1985, title={Nondeterministic versus probabilistic linear search algorithms}, DOI={10.1109/sfcs.1985.38}, booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, author={Meyer auf der Heide, Friedhelm}, year={1985} }' chicago: 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. ieee: F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985. mla: Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38. short: 'F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.' date_created: 2020-04-21T11:30:30Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1109/sfcs.1985.38 language: - iso: eng publication: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) publication_identifier: isbn: - '0818606444' publication_status: published status: public title: Nondeterministic versus probabilistic linear search algorithms type: conference user_id: '15415' year: '1985' ... --- _id: '16823' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control. 1985;67(1-3):195-211. doi:10.1016/S0019-9958(85)80035-8 apa: 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 bibtex: '@article{Meyer auf der Heide_1985, title={Lower time bounds for solving linear diophantine equations on several parallel computational models}, volume={67}, DOI={10.1016/S0019-9958(85)80035-8}, number={1–3}, journal={Information and Control}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={195–211} }' chicago: '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.' ieee: 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. mla: Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control, vol. 67, no. 1–3, 1985, pp. 195–211, doi:10.1016/S0019-9958(85)80035-8. short: F. Meyer auf der Heide, Information and Control 67 (1985) 195–211. date_created: 2020-04-22T09:58:17Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1016/S0019-9958(85)80035-8 intvolume: ' 67' issue: 1-3 language: - iso: eng page: 195-211 publication: Information and Control status: public title: Lower time bounds for solving linear diophantine equations on several parallel computational models type: journal_article user_id: '15415' volume: 67 year: '1985' ... --- _id: '16785' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM). 1984:668-676. doi:10.1145/828.322450 apa: 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 bibtex: '@article{Meyer auf der Heide_1984, title={A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem}, DOI={10.1145/828.322450}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1984}, pages={668–676} }' chicago: 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. ieee: 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. mla: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, pp. 668–76, doi:10.1145/828.322450. short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676. date_created: 2020-04-21T11:25:52Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1145/828.322450 language: - iso: eng page: 668-676 publication: Journal of the ACM (JACM) publication_identifier: issn: - 0004-5411 - 1557-735X publication_status: published status: public title: A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem type: journal_article user_id: '15415' year: '1984' ...