---
_id: '16743'
author:
- first_name: Bettina
  full_name: Just, Bettina
  last_name: Just
- 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: Just B, Meyer auf der Heide F, Wigderson A. On computations with integer division.
    <i>RAIRO - Theoretical Informatics and Applications</i>. 1989:101-111. doi:<a
    href="https://doi.org/10.1051/ita/1989230101011">10.1051/ita/1989230101011</a>
  apa: Just, B., Meyer auf der Heide, F., &#38; Wigderson, A. (1989). On computations
    with integer division. <i>RAIRO - Theoretical Informatics and Applications</i>,
    101–111. <a href="https://doi.org/10.1051/ita/1989230101011">https://doi.org/10.1051/ita/1989230101011</a>
  bibtex: '@article{Just_Meyer auf der Heide_Wigderson_1989, title={On computations
    with integer division}, DOI={<a href="https://doi.org/10.1051/ita/1989230101011">10.1051/ita/1989230101011</a>},
    journal={RAIRO - Theoretical Informatics and Applications}, author={Just, Bettina
    and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1989}, pages={101–111}
    }'
  chicago: Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations
    with Integer Division.” <i>RAIRO - Theoretical Informatics and Applications</i>,
    1989, 101–11. <a href="https://doi.org/10.1051/ita/1989230101011">https://doi.org/10.1051/ita/1989230101011</a>.
  ieee: B. Just, F. Meyer auf der Heide, and A. Wigderson, “On computations with integer
    division,” <i>RAIRO - Theoretical Informatics and Applications</i>, pp. 101–111,
    1989.
  mla: Just, Bettina, et al. “On Computations with Integer Division.” <i>RAIRO - Theoretical
    Informatics and Applications</i>, 1989, pp. 101–11, doi:<a href="https://doi.org/10.1051/ita/1989230101011">10.1051/ita/1989230101011</a>.
  short: B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics
    and Applications (1989) 101–111.
date_created: 2020-04-20T11:49:38Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1051/ita/1989230101011
language:
- iso: eng
page: 101-111
publication: RAIRO - Theoretical Informatics and Applications
publication_identifier:
  issn:
  - 0988-3754
  - 1290-385X
publication_status: published
status: public
title: On computations with integer division
type: journal_article
user_id: '15415'
year: '1989'
...
---
_id: '16744'
author:
- first_name: M.
  full_name: Dietzfelbinger, M.
  last_name: Dietzfelbinger
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Dietzfelbinger M, Meyer auf der Heide F. An optimal parallel dictionary. In:
    <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures 
    - SPAA ’89</i>. ; 1989. doi:<a href="https://doi.org/10.1145/72935.72974">10.1145/72935.72974</a>'
  apa: Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1989). An optimal parallel
    dictionary. In <i>Proceedings of the first annual ACM symposium on Parallel algorithms
    and architectures  - SPAA ’89</i>. <a href="https://doi.org/10.1145/72935.72974">https://doi.org/10.1145/72935.72974</a>
  bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1989, title={An optimal
    parallel dictionary}, DOI={<a href="https://doi.org/10.1145/72935.72974">10.1145/72935.72974</a>},
    booktitle={Proceedings of the first annual ACM symposium on Parallel algorithms
    and architectures  - SPAA ’89}, author={Dietzfelbinger, M. and Meyer auf der Heide,
    Friedhelm}, year={1989} }'
  chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
    Dictionary.” In <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms
    and Architectures  - SPAA ’89</i>, 1989. <a href="https://doi.org/10.1145/72935.72974">https://doi.org/10.1145/72935.72974</a>.
  ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,”
    in <i>Proceedings of the first annual ACM symposium on Parallel algorithms and
    architectures  - SPAA ’89</i>, 1989.
  mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
    Dictionary.” <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms
    and Architectures  - SPAA ’89</i>, 1989, doi:<a href="https://doi.org/10.1145/72935.72974">10.1145/72935.72974</a>.
  short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First
    Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989.'
date_created: 2020-04-20T11:51:01Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/72935.72974
language:
- iso: eng
publication: Proceedings of the first annual ACM symposium on Parallel algorithms
  and architectures  - SPAA '89
publication_identifier:
  isbn:
  - 089791323X
publication_status: published
status: public
title: An optimal parallel dictionary
type: conference
user_id: '15415'
year: '1989'
...
---
_id: '16745'
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. On genuinely time bounded computations. In: <i>STACS
    89</i>. Berlin/Heidelberg; 1989. doi:<a href="https://doi.org/10.1007/bfb0028969">10.1007/bfb0028969</a>'
  apa: Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In
    <i>STACS 89</i>. Berlin/Heidelberg. <a href="https://doi.org/10.1007/bfb0028969">https://doi.org/10.1007/bfb0028969</a>
  bibtex: '@inbook{Meyer auf der Heide_1989, place={Berlin/Heidelberg}, title={On
    genuinely time bounded computations}, DOI={<a href="https://doi.org/10.1007/bfb0028969">10.1007/bfb0028969</a>},
    booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }'
  chicago: Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.”
    In <i>STACS 89</i>. Berlin/Heidelberg, 1989. <a href="https://doi.org/10.1007/bfb0028969">https://doi.org/10.1007/bfb0028969</a>.
  ieee: F. Meyer auf der Heide, “On genuinely time bounded computations,” in <i>STACS
    89</i>, Berlin/Heidelberg, 1989.
  mla: Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” <i>STACS
    89</i>, 1989, doi:<a href="https://doi.org/10.1007/bfb0028969">10.1007/bfb0028969</a>.
  short: 'F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.'
date_created: 2020-04-20T11:51:54Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0028969
language:
- iso: eng
place: Berlin/Heidelberg
publication: STACS 89
publication_identifier:
  isbn:
  - '3540508406'
publication_status: published
status: public
title: On genuinely time bounded computations
type: book_chapter
user_id: '15415'
year: '1989'
...
---
_id: '16746'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Rolf
  full_name: Wanka, Rolf
  last_name: Wanka
citation:
  ama: 'Meyer auf der Heide F, Wanka R. Time-optimal simulations of networks by universal
    parallel computers. In: <i>STACS 89</i>. Berlin/Heidelberg; 1989. doi:<a href="https://doi.org/10.1007/bfb0028978">10.1007/bfb0028978</a>'
  apa: Meyer auf der Heide, F., &#38; Wanka, R. (1989). Time-optimal simulations of
    networks by universal parallel computers. In <i>STACS 89</i>. Berlin/Heidelberg.
    <a href="https://doi.org/10.1007/bfb0028978">https://doi.org/10.1007/bfb0028978</a>
  bibtex: '@inbook{Meyer auf der Heide_Wanka_1989, place={Berlin/Heidelberg}, title={Time-optimal
    simulations of networks by universal parallel computers}, DOI={<a href="https://doi.org/10.1007/bfb0028978">10.1007/bfb0028978</a>},
    booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf},
    year={1989} }'
  chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations
    of Networks by Universal Parallel Computers.” In <i>STACS 89</i>. Berlin/Heidelberg,
    1989. <a href="https://doi.org/10.1007/bfb0028978">https://doi.org/10.1007/bfb0028978</a>.
  ieee: F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks
    by universal parallel computers,” in <i>STACS 89</i>, Berlin/Heidelberg, 1989.
  mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of
    Networks by Universal Parallel Computers.” <i>STACS 89</i>, 1989, doi:<a href="https://doi.org/10.1007/bfb0028978">10.1007/bfb0028978</a>.
  short: 'F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.'
date_created: 2020-04-20T11:52:46Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0028978
language:
- iso: eng
place: Berlin/Heidelberg
publication: STACS 89
publication_identifier:
  isbn:
  - '3540508406'
publication_status: published
status: public
title: Time-optimal simulations of networks by universal parallel computers
type: book_chapter
user_id: '15415'
year: '1989'
...
---
_id: '16789'
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. Computing minimum spanning forests on 1- and 2-dimensional
    processor arrays. In: <i>STACS 89</i>. Berlin, Heidelberg; 1989. doi:<a href="https://doi.org/10.1007/bfb0028983">10.1007/bfb0028983</a>'
  apa: Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and
    2-dimensional processor arrays. In <i>STACS 89</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/bfb0028983">https://doi.org/10.1007/bfb0028983</a>
  bibtex: '@inbook{Meyer auf der Heide_1989, place={Berlin, Heidelberg}, title={Computing
    minimum spanning forests on 1- and 2-dimensional processor arrays}, DOI={<a href="https://doi.org/10.1007/bfb0028983">10.1007/bfb0028983</a>},
    booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }'
  chicago: Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on
    1- and 2-Dimensional Processor Arrays.” In <i>STACS 89</i>. Berlin, Heidelberg,
    1989. <a href="https://doi.org/10.1007/bfb0028983">https://doi.org/10.1007/bfb0028983</a>.
  ieee: F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional
    processor arrays,” in <i>STACS 89</i>, Berlin, Heidelberg, 1989.
  mla: Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and
    2-Dimensional Processor Arrays.” <i>STACS 89</i>, 1989, doi:<a href="https://doi.org/10.1007/bfb0028983">10.1007/bfb0028983</a>.
  short: 'F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.'
date_created: 2020-04-21T11:37:58Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bfb0028983
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 89
publication_identifier:
  isbn:
  - '9783540508403'
  - '9783540460985'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Computing minimum spanning forests on 1- and 2-dimensional processor arrays
type: book_chapter
user_id: '15415'
year: '1989'
...
---
_id: '16763'
author:
- first_name: László
  full_name: Babai, László
  last_name: Babai
- first_name: Bettina
  full_name: Just, Bettina
  last_name: Just
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Babai L, Just B, Meyer auf der Heide F. On the limits of computations with
    the floor function. <i>Information and Computation</i>. 1988:99-107. doi:<a href="https://doi.org/10.1016/0890-5401(88)90031-4">10.1016/0890-5401(88)90031-4</a>
  apa: Babai, L., Just, B., &#38; Meyer auf der Heide, F. (1988). On the limits of
    computations with the floor function. <i>Information and Computation</i>, 99–107.
    <a href="https://doi.org/10.1016/0890-5401(88)90031-4">https://doi.org/10.1016/0890-5401(88)90031-4</a>
  bibtex: '@article{Babai_Just_Meyer auf der Heide_1988, title={On the limits of computations
    with the floor function}, DOI={<a href="https://doi.org/10.1016/0890-5401(88)90031-4">10.1016/0890-5401(88)90031-4</a>},
    journal={Information and Computation}, author={Babai, László and Just, Bettina
    and Meyer auf der Heide, Friedhelm}, year={1988}, pages={99–107} }'
  chicago: Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the
    Limits of Computations with the Floor Function.” <i>Information and Computation</i>,
    1988, 99–107. <a href="https://doi.org/10.1016/0890-5401(88)90031-4">https://doi.org/10.1016/0890-5401(88)90031-4</a>.
  ieee: L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations
    with the floor function,” <i>Information and Computation</i>, pp. 99–107, 1988.
  mla: Babai, László, et al. “On the Limits of Computations with the Floor Function.”
    <i>Information and Computation</i>, 1988, pp. 99–107, doi:<a href="https://doi.org/10.1016/0890-5401(88)90031-4">10.1016/0890-5401(88)90031-4</a>.
  short: L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988)
    99–107.
date_created: 2020-04-21T08:50:17Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0890-5401(88)90031-4
language:
- iso: eng
page: 99-107
publication: Information and Computation
publication_identifier:
  issn:
  - 0890-5401
publication_status: published
status: public
title: On the limits of computations with the floor function
type: journal_article
user_id: '15415'
year: '1988'
...
---
_id: '16764'
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. <i>Journal of the ACM (JACM)</i>. 1988:740-747. doi:<a href="https://doi.org/10.1145/44483.44490">10.1145/44483.44490</a>
  apa: Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions
    of hard problems. <i>Journal of the ACM (JACM)</i>, 740–747. <a href="https://doi.org/10.1145/44483.44490">https://doi.org/10.1145/44483.44490</a>
  bibtex: '@article{Meyer auf der Heide_1988, title={Fast algorithms for N-dimensional
    restrictions of hard problems}, DOI={<a href="https://doi.org/10.1145/44483.44490">10.1145/44483.44490</a>},
    journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm},
    year={1988}, pages={740–747} }'
  chicago: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
    of Hard Problems.” <i>Journal of the ACM (JACM)</i>, 1988, 740–47. <a href="https://doi.org/10.1145/44483.44490">https://doi.org/10.1145/44483.44490</a>.
  ieee: F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of
    hard problems,” <i>Journal of the ACM (JACM)</i>, pp. 740–747, 1988.
  mla: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
    of Hard Problems.” <i>Journal of the ACM (JACM)</i>, 1988, pp. 740–47, doi:<a
    href="https://doi.org/10.1145/44483.44490">10.1145/44483.44490</a>.
  short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.
date_created: 2020-04-21T08:51:54Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/44483.44490
language:
- iso: eng
page: 740-747
publication: Journal of the ACM (JACM)
publication_identifier:
  issn:
  - 0004-5411
  - 1557-735X
publication_status: published
status: public
title: Fast algorithms for N-dimensional restrictions of hard problems
type: journal_article
user_id: '15415'
year: '1988'
...
---
_id: '16765'
author:
- first_name: Allan
  full_name: Borodin, Allan
  last_name: Borodin
- first_name: Faith E.
  full_name: Fich, Faith E.
  last_name: Fich
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Eli
  full_name: Upfal, Eli
  last_name: Upfal
- first_name: Avi
  full_name: Wigderson, Avi
  last_name: Wigderson
citation:
  ama: Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff
    between search and update time for the implicit dictionary problem. <i>Theoretical
    Computer Science</i>. 1988:57-68. doi:<a href="https://doi.org/10.1016/0304-3975(88)90018-7">10.1016/0304-3975(88)90018-7</a>
  apa: Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson,
    A. (1988). A tradeoff between search and update time for the implicit dictionary
    problem. <i>Theoretical Computer Science</i>, 57–68. <a href="https://doi.org/10.1016/0304-3975(88)90018-7">https://doi.org/10.1016/0304-3975(88)90018-7</a>
  bibtex: '@article{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1988, title={A
    tradeoff between search and update time for the implicit dictionary problem},
    DOI={<a href="https://doi.org/10.1016/0304-3975(88)90018-7">10.1016/0304-3975(88)90018-7</a>},
    journal={Theoretical Computer Science}, author={Borodin, Allan and Fich, Faith
    E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1988},
    pages={57–68} }'
  chicago: Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal,
    and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit
    Dictionary Problem.” <i>Theoretical Computer Science</i>, 1988, 57–68. <a href="https://doi.org/10.1016/0304-3975(88)90018-7">https://doi.org/10.1016/0304-3975(88)90018-7</a>.
  ieee: 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,”
    <i>Theoretical Computer Science</i>, pp. 57–68, 1988.
  mla: Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit
    Dictionary Problem.” <i>Theoretical Computer Science</i>, 1988, pp. 57–68, doi:<a
    href="https://doi.org/10.1016/0304-3975(88)90018-7">10.1016/0304-3975(88)90018-7</a>.
  short: A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical
    Computer Science (1988) 57–68.
date_created: 2020-04-21T08:53:13Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0304-3975(88)90018-7
language:
- iso: eng
page: 57-68
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: A tradeoff between search and update time for the implicit dictionary problem
type: journal_article
user_id: '15415'
year: '1988'
...
---
_id: '16766'
author:
- first_name: M.
  full_name: Dietzfelbinger, M.
  last_name: Dietzfelbinger
- first_name: A.
  full_name: Karlin, A.
  last_name: Karlin
- first_name: K.
  full_name: Mehlhorn, K.
  last_name: Mehlhorn
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: H.
  full_name: Rohnert, H.
  last_name: Rohnert
- first_name: R.E.
  full_name: Tarjan, R.E.
  last_name: Tarjan
citation:
  ama: 'Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H,
    Tarjan RE. Dynamic perfect hashing: upper and lower bounds. In: <i>[Proceedings
    1988] 29th Annual Symposium on Foundations of Computer Science</i>. ; 1988. doi:<a
    href="https://doi.org/10.1109/sfcs.1988.21968">10.1109/sfcs.1988.21968</a>'
  apa: 'Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert,
    H., &#38; Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds.
    In <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>.
    <a href="https://doi.org/10.1109/sfcs.1988.21968">https://doi.org/10.1109/sfcs.1988.21968</a>'
  bibtex: '@inproceedings{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1988,
    title={Dynamic perfect hashing: upper and lower bounds}, DOI={<a href="https://doi.org/10.1109/sfcs.1988.21968">10.1109/sfcs.1988.21968</a>},
    booktitle={[Proceedings 1988] 29th Annual Symposium on Foundations of Computer
    Science}, author={Dietzfelbinger, M. and Karlin, A. and Mehlhorn, K. and Meyer
    auf der Heide, Friedhelm and Rohnert, H. and Tarjan, R.E.}, year={1988} }'
  chicago: 'Dietzfelbinger, M., A. Karlin, K. Mehlhorn, Friedhelm Meyer auf der Heide,
    H. Rohnert, and R.E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.”
    In <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>,
    1988. <a href="https://doi.org/10.1109/sfcs.1988.21968">https://doi.org/10.1109/sfcs.1988.21968</a>.'
  ieee: '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 <i>[Proceedings
    1988] 29th Annual Symposium on Foundations of Computer Science</i>, 1988.'
  mla: 'Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.”
    <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>,
    1988, doi:<a href="https://doi.org/10.1109/sfcs.1988.21968">10.1109/sfcs.1988.21968</a>.'
  short: 'M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert,
    R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer
    Science, 1988.'
date_created: 2020-04-21T08:59:26Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1109/sfcs.1988.21968
language:
- iso: eng
publication: '[Proceedings 1988] 29th Annual Symposium on Foundations of Computer
  Science'
publication_identifier:
  isbn:
  - '0818608773'
publication_status: published
status: public
title: 'Dynamic perfect hashing: upper and lower bounds'
type: conference
user_id: '15415'
year: '1988'
...
---
_id: '16767'
author:
- first_name: Bettina
  full_name: Just, Bettina
  last_name: Just
- first_name: Fb
  full_name: Mathematik, Fb
  last_name: Mathematik
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Fb
  full_name: Informatik, Fb
  last_name: Informatik
- first_name: Avi
  full_name: Wigderson, Avi
  last_name: Wigderson
citation:
  ama: 'Just B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On
    computations with integer division. In: <i>STACS 88</i>. Berlin, Heidelberg; 1988.
    doi:<a href="https://doi.org/10.1007/bfb0035829">10.1007/bfb0035829</a>'
  apa: Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., &#38; Wigderson,
    A. (1988). On computations with integer division. In <i>STACS 88</i>. Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/bfb0035829">https://doi.org/10.1007/bfb0035829</a>
  bibtex: '@inbook{Just_Mathematik_Meyer auf der Heide_Informatik_Wigderson_1988,
    place={Berlin, Heidelberg}, title={On computations with integer division}, DOI={<a
    href="https://doi.org/10.1007/bfb0035829">10.1007/bfb0035829</a>}, booktitle={STACS
    88}, author={Just, Bettina and Mathematik, Fb and Meyer auf der Heide, Friedhelm
    and Informatik, Fb and Wigderson, Avi}, year={1988} }'
  chicago: Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik,
    and Avi Wigderson. “On Computations with Integer Division.” In <i>STACS 88</i>.
    Berlin, Heidelberg, 1988. <a href="https://doi.org/10.1007/bfb0035829">https://doi.org/10.1007/bfb0035829</a>.
  ieee: B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson,
    “On computations with integer division,” in <i>STACS 88</i>, Berlin, Heidelberg,
    1988.
  mla: Just, Bettina, et al. “On Computations with Integer Division.” <i>STACS 88</i>,
    1988, doi:<a href="https://doi.org/10.1007/bfb0035829">10.1007/bfb0035829</a>.
  short: 'B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson,
    in: STACS 88, Berlin, Heidelberg, 1988.'
date_created: 2020-04-21T09:00:37Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0035829
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 88
publication_identifier:
  isbn:
  - '9783540188346'
  - '9783540481904'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: On computations with integer division
type: book_chapter
user_id: '15415'
year: '1988'
...
---
_id: '16768'
author:
- first_name: M.
  full_name: Dietzfelbinger, M.
  last_name: Dietzfelbinger
- first_name: K.
  full_name: Mehlhorn, K.
  last_name: Mehlhorn
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: H.
  full_name: Rohnert, H.
  last_name: Rohnert
citation:
  ama: 'Dietzfelbinger M, Mehlhorn K, Meyer auf der Heide F, Rohnert H. Upper and
    lower bounds for the dictionary problem. In: <i>SWAT 88</i>. Berlin, Heidelberg;
    1988. doi:<a href="https://doi.org/10.1007/3-540-19487-8_24">10.1007/3-540-19487-8_24</a>'
  apa: Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., &#38; Rohnert, H.
    (1988). Upper and lower bounds for the dictionary problem. In <i>SWAT 88</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-19487-8_24">https://doi.org/10.1007/3-540-19487-8_24</a>
  bibtex: '@inbook{Dietzfelbinger_Mehlhorn_Meyer auf der Heide_Rohnert_1988, place={Berlin,
    Heidelberg}, title={Upper and lower bounds for the dictionary problem}, DOI={<a
    href="https://doi.org/10.1007/3-540-19487-8_24">10.1007/3-540-19487-8_24</a>},
    booktitle={SWAT 88}, author={Dietzfelbinger, M. and Mehlhorn, K. and Meyer auf
    der Heide, Friedhelm and Rohnert, H.}, year={1988} }'
  chicago: Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H.
    Rohnert. “Upper and Lower Bounds for the Dictionary Problem.” In <i>SWAT 88</i>.
    Berlin, Heidelberg, 1988. <a href="https://doi.org/10.1007/3-540-19487-8_24">https://doi.org/10.1007/3-540-19487-8_24</a>.
  ieee: M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper
    and lower bounds for the dictionary problem,” in <i>SWAT 88</i>, Berlin, Heidelberg,
    1988.
  mla: Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.”
    <i>SWAT 88</i>, 1988, doi:<a href="https://doi.org/10.1007/3-540-19487-8_24">10.1007/3-540-19487-8_24</a>.
  short: 'M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in:
    SWAT 88, Berlin, Heidelberg, 1988.'
date_created: 2020-04-21T09:01:36Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-19487-8_24
language:
- iso: eng
place: Berlin, Heidelberg
publication: SWAT 88
publication_identifier:
  isbn:
  - '9783540194873'
  - '9783540392880'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Upper and lower bounds for the dictionary problem
type: book_chapter
user_id: '15415'
year: '1988'
...
---
_id: '16772'
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. <i>SIAM Journal on Computing</i>. 1987:97-99.
    doi:<a href="https://doi.org/10.1137/0216007">10.1137/0216007</a>
  apa: Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson,
    A. (1987). A Time-Space Tradeoff for Element Distinctness. <i>SIAM Journal on
    Computing</i>, 97–99. <a href="https://doi.org/10.1137/0216007">https://doi.org/10.1137/0216007</a>
  bibtex: '@article{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1987, title={A
    Time-Space Tradeoff for Element Distinctness}, DOI={<a href="https://doi.org/10.1137/0216007">10.1137/0216007</a>},
    journal={SIAM Journal on Computing}, author={Borodin, A. and Fich, F. and Meyer
    auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1987}, pages={97–99}
    }'
  chicago: Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson.
    “A Time-Space Tradeoff for Element Distinctness.” <i>SIAM Journal on Computing</i>,
    1987, 97–99. <a href="https://doi.org/10.1137/0216007">https://doi.org/10.1137/0216007</a>.
  ieee: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A
    Time-Space Tradeoff for Element Distinctness,” <i>SIAM Journal on Computing</i>,
    pp. 97–99, 1987.
  mla: Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” <i>SIAM
    Journal on Computing</i>, 1987, pp. 97–99, doi:<a href="https://doi.org/10.1137/0216007">10.1137/0216007</a>.
  short: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM
    Journal on Computing (1987) 97–99.
date_created: 2020-04-21T10:00:29Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/0216007
language:
- iso: eng
page: 97-99
publication: SIAM Journal on Computing
publication_identifier:
  issn:
  - 0097-5397
  - 1095-7111
publication_status: published
status: public
title: A Time-Space Tradeoff for Element Distinctness
type: journal_article
user_id: '15415'
year: '1987'
...
---
_id: '16773'
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. <i>SIAM
    Journal on Computing</i>. 1987:100-107. doi:<a href="https://doi.org/10.1137/0216008">10.1137/0216008</a>
  apa: Meyer auf der Heide, F., &#38; Wigderson, A. (1987). The Complexity of Parallel
    Sorting. <i>SIAM Journal on Computing</i>, 100–107. <a href="https://doi.org/10.1137/0216008">https://doi.org/10.1137/0216008</a>
  bibtex: '@article{Meyer auf der Heide_Wigderson_1987, title={The Complexity of Parallel
    Sorting}, DOI={<a href="https://doi.org/10.1137/0216008">10.1137/0216008</a>},
    journal={SIAM Journal on Computing}, author={Meyer auf der Heide, Friedhelm and
    Wigderson, Avi}, year={1987}, pages={100–107} }'
  chicago: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
    Sorting.” <i>SIAM Journal on Computing</i>, 1987, 100–107. <a href="https://doi.org/10.1137/0216008">https://doi.org/10.1137/0216008</a>.
  ieee: F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,”
    <i>SIAM Journal on Computing</i>, pp. 100–107, 1987.
  mla: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
    Sorting.” <i>SIAM Journal on Computing</i>, 1987, pp. 100–07, doi:<a href="https://doi.org/10.1137/0216008">10.1137/0216008</a>.
  short: F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.
date_created: 2020-04-21T10:01:37Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/0216008
language:
- iso: eng
page: 100-107
publication: SIAM Journal on Computing
publication_identifier:
  issn:
  - 0097-5397
  - 1095-7111
publication_status: published
status: public
title: The Complexity of Parallel Sorting
type: journal_article
user_id: '15415'
year: '1987'
...
---
_id: '16771'
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. Efficient Simulations among Several Models of Parallel
    Computers. <i>SIAM Journal on Computing</i>. 1986:106-119. doi:<a href="https://doi.org/10.1137/0215008">10.1137/0215008</a>
  apa: Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models
    of Parallel Computers. <i>SIAM Journal on Computing</i>, 106–119. <a href="https://doi.org/10.1137/0215008">https://doi.org/10.1137/0215008</a>
  bibtex: '@article{Meyer auf der Heide_1986, title={Efficient Simulations among Several
    Models of Parallel Computers}, DOI={<a href="https://doi.org/10.1137/0215008">10.1137/0215008</a>},
    journal={SIAM Journal on Computing}, author={Meyer auf der Heide, Friedhelm},
    year={1986}, pages={106–119} }'
  chicago: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
    of Parallel Computers.” <i>SIAM Journal on Computing</i>, 1986, 106–19. <a href="https://doi.org/10.1137/0215008">https://doi.org/10.1137/0215008</a>.
  ieee: F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel
    Computers,” <i>SIAM Journal on Computing</i>, pp. 106–119, 1986.
  mla: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
    of Parallel Computers.” <i>SIAM Journal on Computing</i>, 1986, pp. 106–19, doi:<a
    href="https://doi.org/10.1137/0215008">10.1137/0215008</a>.
  short: F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119.
date_created: 2020-04-21T09:59:29Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/0215008
language:
- iso: eng
page: 106-119
publication: SIAM Journal on Computing
publication_identifier:
  issn:
  - 0097-5397
  - 1095-7111
publication_status: published
status: public
title: Efficient Simulations among Several Models of Parallel Computers
type: journal_article
user_id: '15415'
year: '1986'
...
---
_id: '16774'
author:
- first_name: Allan
  full_name: Borodin, Allan
  last_name: Borodin
- first_name: Faith E.
  full_name: Fich, Faith E.
  last_name: Fich
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Eli
  full_name: Upfal, Eli
  last_name: Upfal
- first_name: Avi
  full_name: Wigderson, Avi
  last_name: Wigderson
citation:
  ama: 'Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff
    between search and update time for the implicit dictionary problem. In: <i>Automata,
    Languages and Programming</i>. Berlin, Heidelberg; 1986. doi:<a href="https://doi.org/10.1007/3-540-16761-7_54">10.1007/3-540-16761-7_54</a>'
  apa: Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson,
    A. (1986). A tradeoff between search and update time for the implicit dictionary
    problem. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a
    href="https://doi.org/10.1007/3-540-16761-7_54">https://doi.org/10.1007/3-540-16761-7_54</a>
  bibtex: '@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin,
    Heidelberg}, title={A tradeoff between search and update time for the implicit
    dictionary problem}, DOI={<a href="https://doi.org/10.1007/3-540-16761-7_54">10.1007/3-540-16761-7_54</a>},
    booktitle={Automata, Languages and Programming}, author={Borodin, Allan and Fich,
    Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi},
    year={1986} }'
  chicago: Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal,
    and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit
    Dictionary Problem.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg,
    1986. <a href="https://doi.org/10.1007/3-540-16761-7_54">https://doi.org/10.1007/3-540-16761-7_54</a>.
  ieee: 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 <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 1986.
  mla: Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit
    Dictionary Problem.” <i>Automata, Languages and Programming</i>, 1986, doi:<a
    href="https://doi.org/10.1007/3-540-16761-7_54">10.1007/3-540-16761-7_54</a>.
  short: 'A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in:
    Automata, Languages and Programming, Berlin, Heidelberg, 1986.'
date_created: 2020-04-21T10:05:54Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-16761-7_54
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
  isbn:
  - '9783540167617'
  - '9783540398592'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: A tradeoff between search and update time for the implicit dictionary problem
type: book_chapter
user_id: '15415'
year: '1986'
...
---
_id: '16775'
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. Speeding up random access machines by few processors.
    In: <i>STACS 86</i>. Berlin, Heidelberg; 1986. doi:<a href="https://doi.org/10.1007/3-540-16078-7_72">10.1007/3-540-16078-7_72</a>'
  apa: Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors.
    In <i>STACS 86</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-16078-7_72">https://doi.org/10.1007/3-540-16078-7_72</a>
  bibtex: '@inbook{Meyer auf der Heide_1986, place={Berlin, Heidelberg}, title={Speeding
    up random access machines by few processors}, DOI={<a href="https://doi.org/10.1007/3-540-16078-7_72">10.1007/3-540-16078-7_72</a>},
    booktitle={STACS 86}, author={Meyer auf der Heide, Friedhelm}, year={1986} }'
  chicago: Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by
    Few Processors.” In <i>STACS 86</i>. Berlin, Heidelberg, 1986. <a href="https://doi.org/10.1007/3-540-16078-7_72">https://doi.org/10.1007/3-540-16078-7_72</a>.
  ieee: F. Meyer auf der Heide, “Speeding up random access machines by few processors,”
    in <i>STACS 86</i>, Berlin, Heidelberg, 1986.
  mla: Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few
    Processors.” <i>STACS 86</i>, 1986, doi:<a href="https://doi.org/10.1007/3-540-16078-7_72">10.1007/3-540-16078-7_72</a>.
  short: 'F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.'
date_created: 2020-04-21T10:07:06Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-16078-7_72
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: Speeding up random access machines by few processors
type: book_chapter
user_id: '15415'
year: '1986'
...
---
_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: <i>STACS 86</i>. Berlin, Heidelberg; 1986.
    doi:<a href="https://doi.org/10.1007/3-540-16078-7_89">10.1007/3-540-16078-7_89</a>'
  apa: Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson,
    A. (1986). A time-space tradeoff for element distinctness. In <i>STACS 86</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-16078-7_89">https://doi.org/10.1007/3-540-16078-7_89</a>
  bibtex: '@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin,
    Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={<a href="https://doi.org/10.1007/3-540-16078-7_89">10.1007/3-540-16078-7_89</a>},
    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 <i>STACS 86</i>. Berlin,
    Heidelberg, 1986. <a href="https://doi.org/10.1007/3-540-16078-7_89">https://doi.org/10.1007/3-540-16078-7_89</a>.
  ieee: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A
    time-space tradeoff for element distinctness,” in <i>STACS 86</i>, Berlin, Heidelberg,
    1986.
  mla: Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” <i>STACS
    86</i>, 1986, doi:<a href="https://doi.org/10.1007/3-540-16078-7_89">10.1007/3-540-16078-7_89</a>.
  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. <i>Information Processing Letters</i>. 1985:101-105. doi:<a
    href="https://doi.org/10.1016/0020-0190(85)90042-0">10.1016/0020-0190(85)90042-0</a>
  apa: Lautemann, C., &#38; Meyer auf der Heide, F. (1985). Lower time bounds for
    integer programming with two variables. <i>Information Processing Letters</i>,
    101–105. <a href="https://doi.org/10.1016/0020-0190(85)90042-0">https://doi.org/10.1016/0020-0190(85)90042-0</a>
  bibtex: '@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for
    integer programming with two variables}, DOI={<a href="https://doi.org/10.1016/0020-0190(85)90042-0">10.1016/0020-0190(85)90042-0</a>},
    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.” <i>Information Processing Letters</i>,
    1985, 101–5. <a href="https://doi.org/10.1016/0020-0190(85)90042-0">https://doi.org/10.1016/0020-0190(85)90042-0</a>.
  ieee: C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming
    with two variables,” <i>Information Processing Letters</i>, pp. 101–105, 1985.
  mla: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for
    Integer Programming with Two Variables.” <i>Information Processing Letters</i>,
    1985, pp. 101–05, doi:<a href="https://doi.org/10.1016/0020-0190(85)90042-0">10.1016/0020-0190(85)90042-0</a>.
  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. <i>Journal of the ACM (JACM)</i>. 1985:929-937. doi:<a
    href="https://doi.org/10.1145/4221.4250">10.1145/4221.4250</a>
  apa: Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine
    equations on random access machines. <i>Journal of the ACM (JACM)</i>, 929–937.
    <a href="https://doi.org/10.1145/4221.4250">https://doi.org/10.1145/4221.4250</a>
  bibtex: '@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear
    diophantine equations on random access machines}, DOI={<a href="https://doi.org/10.1145/4221.4250">10.1145/4221.4250</a>},
    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.” <i>Journal of the ACM (JACM)</i>, 1985,
    929–37. <a href="https://doi.org/10.1145/4221.4250">https://doi.org/10.1145/4221.4250</a>.
  ieee: F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations
    on random access machines,” <i>Journal of the ACM (JACM)</i>, pp. 929–937, 1985.
  mla: Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine
    Equations on Random Access Machines.” <i>Journal of the ACM (JACM)</i>, 1985,
    pp. 929–37, doi:<a href="https://doi.org/10.1145/4221.4250">10.1145/4221.4250</a>.
  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. <i>Theoretical Computer Science</i>. 1985:325-330. doi:<a href="https://doi.org/10.1016/0304-3975(85)90079-9">10.1016/0304-3975(85)90079-9</a>
  apa: Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic
    computation trees. <i>Theoretical Computer Science</i>, 325–330. <a href="https://doi.org/10.1016/0304-3975(85)90079-9">https://doi.org/10.1016/0304-3975(85)90079-9</a>
  bibtex: '@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic
    algebraic computation trees}, DOI={<a href="https://doi.org/10.1016/0304-3975(85)90079-9">10.1016/0304-3975(85)90079-9</a>},
    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.” <i>Theoretical Computer Science</i>, 1985, 325–30.
    <a href="https://doi.org/10.1016/0304-3975(85)90079-9">https://doi.org/10.1016/0304-3975(85)90079-9</a>.
  ieee: F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic
    computation trees,” <i>Theoretical Computer Science</i>, pp. 325–330, 1985.
  mla: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic
    Algebraic Computation Trees.” <i>Theoretical Computer Science</i>, 1985, pp. 325–30,
    doi:<a href="https://doi.org/10.1016/0304-3975(85)90079-9">10.1016/0304-3975(85)90079-9</a>.
  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'
...