---
_id: '16705'
author:
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Volker
  full_name: Stemann, Volker
  last_name: Stemann
citation:
  ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with
    triple-logarithmic delay. In: <i>Lecture Notes in Computer Science</i>. Berlin,
    Heidelberg; 1995. doi:<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>'
  apa: Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Shared memory
    simulations with triple-logarithmic delay. In <i>Lecture Notes in Computer Science</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-60313-1_133">https://doi.org/10.1007/3-540-60313-1_133</a>
  bibtex: '@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg},
    title={Shared memory simulations with triple-logarithmic delay}, DOI={<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>},
    booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer
    auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }'
  chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared
    Memory Simulations with Triple-Logarithmic Delay.” In <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg, 1995. <a href="https://doi.org/10.1007/3-540-60313-1_133">https://doi.org/10.1007/3-540-60313-1_133</a>.
  ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations
    with triple-logarithmic delay,” in <i>Lecture Notes in Computer Science</i>, Berlin,
    Heidelberg, 1995.
  mla: Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”
    <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>.
  short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:40:52Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_133
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540603139'
  - '9783540449133'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Shared memory simulations with triple-logarithmic delay
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16717'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Matthias
  full_name: Westermann, Matthias
  last_name: Westermann
citation:
  ama: 'Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional
    tori. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg;
    1995. doi:<a href="https://doi.org/10.1007/3-540-60618-1_77">10.1007/3-540-60618-1_77</a>'
  apa: Meyer auf der Heide, F., &#38; Westermann, M. (1995). Hot-potato routing on
    multi-dimensional tori. In <i>Graph-Theoretic Concepts in Computer Science</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-60618-1_77">https://doi.org/10.1007/3-540-60618-1_77</a>
  bibtex: '@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg},
    title={Hot-potato routing on multi-dimensional tori}, DOI={<a href="https://doi.org/10.1007/3-540-60618-1_77">10.1007/3-540-60618-1_77</a>},
    booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
    Heide, Friedhelm and Westermann, Matthias}, year={1995} }'
  chicago: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
    on Multi-Dimensional Tori.” In <i>Graph-Theoretic Concepts in Computer Science</i>.
    Berlin, Heidelberg, 1995. <a href="https://doi.org/10.1007/3-540-60618-1_77">https://doi.org/10.1007/3-540-60618-1_77</a>.
  ieee: F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional
    tori,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Berlin, Heidelberg,
    1995.
  mla: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
    on Multi-Dimensional Tori.” <i>Graph-Theoretic Concepts in Computer Science</i>,
    1995, doi:<a href="https://doi.org/10.1007/3-540-60618-1_77">10.1007/3-540-60618-1_77</a>.
  short: 'F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer
    Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-17T07:46:18Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-60618-1_77
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
  isbn:
  - '9783540606185'
  - '9783540484875'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Hot-potato routing on multi-dimensional tori
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16874'
author:
- first_name: Armin
  full_name: Bäumker, Armin
  last_name: Bäumker
- first_name: Wolfgang
  full_name: Dittrich, Wolfgang
  last_name: Dittrich
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms:
    c-optimal multisearch for an extension of the BSP model. In: <i>Lecture Notes
    in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href="https://doi.org/10.1007/3-540-60313-1_131">10.1007/3-540-60313-1_131</a>'
  apa: 'Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1995). Truly efficient
    parallel algorithms: c-optimal multisearch for an extension of the BSP model.
    In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-60313-1_131">https://doi.org/10.1007/3-540-60313-1_131</a>'
  bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg},
    title={Truly efficient parallel algorithms: c-optimal multisearch for an extension
    of the BSP model}, DOI={<a href="https://doi.org/10.1007/3-540-60313-1_131">10.1007/3-540-60313-1_131</a>},
    booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
    Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }'
  chicago: 'Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide.
    “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of
    the BSP Model.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg,
    1995. <a href="https://doi.org/10.1007/3-540-60313-1_131">https://doi.org/10.1007/3-540-60313-1_131</a>.'
  ieee: 'A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel
    algorithms: c-optimal multisearch for an extension of the BSP model,” in <i>Lecture
    Notes in Computer Science</i>, Berlin, Heidelberg, 1995.'
  mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch
    for an Extension of the BSP Model.” <i>Lecture Notes in Computer Science</i>,
    1995, doi:<a href="https://doi.org/10.1007/3-540-60313-1_131">10.1007/3-540-60313-1_131</a>.'
  short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-27T13:59:05Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_131
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540603139'
  - '9783540449133'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'Truly efficient parallel algorithms: c-optimal multisearch for an extension
  of the BSP model'
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '17477'
citation:
  ama: 'Meyer auf der Heide F, Monien B, Rosenberg AL, eds. <i>Parallel Architectures
    and Their Efficient Use</i>. Berlin, Heidelberg: Springer; 1993. doi:<a href="https://doi.org/10.1007/3-540-56731-3">10.1007/3-540-56731-3</a>'
  apa: 'Meyer auf der Heide, F., Monien, B., &#38; Rosenberg, A. L. (Eds.). (1993).
    <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer.
    <a href="https://doi.org/10.1007/3-540-56731-3">https://doi.org/10.1007/3-540-56731-3</a>'
  bibtex: '@book{Meyer auf der Heide_Monien_Rosenberg_1993, place={Berlin, Heidelberg},
    title={Parallel Architectures and Their Efficient Use}, DOI={<a href="https://doi.org/10.1007/3-540-56731-3">10.1007/3-540-56731-3</a>},
    publisher={Springer}, year={1993} }'
  chicago: 'Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. <i>Parallel
    Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993.
    <a href="https://doi.org/10.1007/3-540-56731-3">https://doi.org/10.1007/3-540-56731-3</a>.'
  ieee: 'F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., <i>Parallel
    Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993.'
  mla: Meyer auf der Heide, Friedhelm, et al., editors. <i>Parallel Architectures
    and Their Efficient Use</i>. Springer, 1993, doi:<a href="https://doi.org/10.1007/3-540-56731-3">10.1007/3-540-56731-3</a>.
  short: F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures
    and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.
date_created: 2020-07-30T09:49:20Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
doi: 10.1007/3-540-56731-3
editor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: B.
  full_name: Monien, B.
  last_name: Monien
- first_name: A. L.
  full_name: Rosenberg, A. L.
  last_name: Rosenberg
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783540567318'
  - '9783540476375'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Parallel Architectures and Their Efficient Use
type: book_editor
user_id: '15415'
year: '1993'
...
---
_id: '16730'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Brigitte
  full_name: Oesterdiekhoff, Brigitte
  last_name: Oesterdiekhoff
- first_name: Rolf
  full_name: Wanka, Rolf
  last_name: Wanka
citation:
  ama: 'Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token
    distribution. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg;
    1993. doi:<a href="https://doi.org/10.1007/3-540-56939-1_89">10.1007/3-540-56939-1_89</a>'
  apa: Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1993). Strongly
    adaptive token distribution. In <i>Automata, Languages and Programming</i>. Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/3-540-56939-1_89">https://doi.org/10.1007/3-540-56939-1_89</a>
  bibtex: '@inbook{Meyer auf der Heide_Oesterdiekhoff_Wanka_1993, place={Berlin, Heidelberg},
    title={Strongly adaptive token distribution}, DOI={<a href="https://doi.org/10.1007/3-540-56939-1_89">10.1007/3-540-56939-1_89</a>},
    booktitle={Automata, Languages and Programming}, author={Meyer auf der Heide,
    Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1993} }'
  chicago: Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka.
    “Strongly Adaptive Token Distribution.” In <i>Automata, Languages and Programming</i>.
    Berlin, Heidelberg, 1993. <a href="https://doi.org/10.1007/3-540-56939-1_89">https://doi.org/10.1007/3-540-56939-1_89</a>.
  ieee: F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive
    token distribution,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg,
    1993.
  mla: Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”
    <i>Automata, Languages and Programming</i>, 1993, doi:<a href="https://doi.org/10.1007/3-540-56939-1_89">10.1007/3-540-56939-1_89</a>.
  short: 'F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages
    and Programming, Berlin, Heidelberg, 1993.'
date_created: 2020-04-20T10:33:56Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-56939-1_89
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
  isbn:
  - '9783540569398'
  - '9783540478263'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Strongly adaptive token distribution
type: book_chapter
user_id: '15415'
year: '1993'
...
---
_id: '16732'
author:
- first_name: Katharina
  full_name: Lürwer-Brüggemeier, Katharina
  last_name: Lürwer-Brüggemeier
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of
    computations with integer division. In: <i>Lecture Notes in Computer Science</i>.
    Berlin, Heidelberg; 1993. doi:<a href="https://doi.org/10.1007/3-540-56503-5_46">10.1007/3-540-56503-5_46</a>'
  apa: Lürwer-Brüggemeier, K., &#38; Meyer auf der Heide, F. (1993). Capabilities
    and complexity of computations with integer division. In <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-56503-5_46">https://doi.org/10.1007/3-540-56503-5_46</a>
  bibtex: '@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg},
    title={Capabilities and complexity of computations with integer division}, DOI={<a
    href="https://doi.org/10.1007/3-540-56503-5_46">10.1007/3-540-56503-5_46</a>},
    booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina
    and Meyer auf der Heide, Friedhelm}, year={1993} }'
  chicago: Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities
    and Complexity of Computations with Integer Division.” In <i>Lecture Notes in
    Computer Science</i>. Berlin, Heidelberg, 1993. <a href="https://doi.org/10.1007/3-540-56503-5_46">https://doi.org/10.1007/3-540-56503-5_46</a>.
  ieee: K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity
    of computations with integer division,” in <i>Lecture Notes in Computer Science</i>,
    Berlin, Heidelberg, 1993.
  mla: Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities
    and Complexity of Computations with Integer Division.” <i>Lecture Notes in Computer
    Science</i>, 1993, doi:<a href="https://doi.org/10.1007/3-540-56503-5_46">10.1007/3-540-56503-5_46</a>.
  short: 'K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 1993.'
date_created: 2020-04-20T11:25:51Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-56503-5_46
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540565031'
  - '9783540475743'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Capabilities and complexity of computations with integer division
type: book_chapter
user_id: '15415'
year: '1993'
...
---
_id: '3046'
author:
- first_name: Helmut
  full_name: Alt, Helmut
  last_name: Alt
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: <i>Data
    Structures and Efficient Algorithms</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    1992:1-24. doi:<a href="https://doi.org/10.1007/3-540-55488-2_19">10.1007/3-540-55488-2_19</a>'
  apa: 'Alt, H., &#38; Blömer, J. (1992). Resemblance and symmetries of geometric
    patterns. In <i>Data structures and efficient algorithms</i> (pp. 1–24). Berlin,
    Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-55488-2_19">https://doi.org/10.1007/3-540-55488-2_19</a>'
  bibtex: '@inbook{Alt_Blömer_1992, place={Berlin, Heidelberg}, title={Resemblance
    and symmetries of geometric patterns}, DOI={<a href="https://doi.org/10.1007/3-540-55488-2_19">10.1007/3-540-55488-2_19</a>},
    booktitle={Data structures and efficient algorithms}, publisher={Springer Berlin
    Heidelberg}, author={Alt, Helmut and Blömer, Johannes}, year={1992}, pages={1–24}
    }'
  chicago: 'Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric
    Patterns.” In <i>Data Structures and Efficient Algorithms</i>, 1–24. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 1992. <a href="https://doi.org/10.1007/3-540-55488-2_19">https://doi.org/10.1007/3-540-55488-2_19</a>.'
  ieee: 'H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,”
    in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg: Springer
    Berlin Heidelberg, 1992, pp. 1–24.'
  mla: Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric
    Patterns.” <i>Data Structures and Efficient Algorithms</i>, Springer Berlin Heidelberg,
    1992, pp. 1–24, doi:<a href="https://doi.org/10.1007/3-540-55488-2_19">10.1007/3-540-55488-2_19</a>.
  short: 'H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer
    Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.'
date_created: 2018-06-05T08:51:15Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
doi: 10.1007/3-540-55488-2_19
page: 1-24
place: Berlin, Heidelberg
publication: Data structures and efficient algorithms
publication_identifier:
  isbn:
  - '9783540554882'
  - '9783540471035'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Resemblance and symmetries of geometric patterns
type: book_chapter
user_id: '25078'
year: '1992'
...
---
_id: '16733'
author:
- first_name: Martin
  full_name: Dietzfelbinger, Martin
  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. High performance universal hashing,
    with applications to shared memory simulations. In: <i>Data Structures and Efficient
    Algorithms</i>. Berlin, Heidelberg; 1992. doi:<a href="https://doi.org/10.1007/3-540-55488-2_31">10.1007/3-540-55488-2_31</a>'
  apa: Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). High performance
    universal hashing, with applications to shared memory simulations. In <i>Data
    structures and efficient algorithms</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-55488-2_31">https://doi.org/10.1007/3-540-55488-2_31</a>
  bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg},
    title={High performance universal hashing, with applications to shared memory
    simulations}, DOI={<a href="https://doi.org/10.1007/3-540-55488-2_31">10.1007/3-540-55488-2_31</a>},
    booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger,
    Martin and Meyer auf der Heide, Friedhelm}, year={1992} }'
  chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance
    Universal Hashing, with Applications to Shared Memory Simulations.” In <i>Data
    Structures and Efficient Algorithms</i>. Berlin, Heidelberg, 1992. <a href="https://doi.org/10.1007/3-540-55488-2_31">https://doi.org/10.1007/3-540-55488-2_31</a>.
  ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal
    hashing, with applications to shared memory simulations,” in <i>Data structures
    and efficient algorithms</i>, Berlin, Heidelberg, 1992.
  mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance
    Universal Hashing, with Applications to Shared Memory Simulations.” <i>Data Structures
    and Efficient Algorithms</i>, 1992, doi:<a href="https://doi.org/10.1007/3-540-55488-2_31">10.1007/3-540-55488-2_31</a>.
  short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient
    Algorithms, Berlin, Heidelberg, 1992.'
date_created: 2020-04-20T11:27:50Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-55488-2_31
language:
- iso: eng
place: Berlin, Heidelberg
publication: Data structures and efficient algorithms
publication_identifier:
  isbn:
  - '9783540554882'
  - '9783540471035'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: High performance universal hashing, with applications to shared memory simulations
type: book_chapter
user_id: '15415'
year: '1992'
...
---
_id: '16734'
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. Hashing strategies for simulating shared memory on
    distributed memory machines. In: <i>Lecture Notes in Computer Science</i>. Berlin,
    Heidelberg; 1992. doi:<a href="https://doi.org/10.1007/3-540-56731-3_3">10.1007/3-540-56731-3_3</a>'
  apa: Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory
    on distributed memory machines. In <i>Lecture Notes in Computer Science</i>. Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/3-540-56731-3_3">https://doi.org/10.1007/3-540-56731-3_3</a>
  bibtex: '@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing
    strategies for simulating shared memory on distributed memory machines}, DOI={<a
    href="https://doi.org/10.1007/3-540-56731-3_3">10.1007/3-540-56731-3_3</a>}, booktitle={Lecture
    Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992}
    }'
  chicago: Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared
    Memory on Distributed Memory Machines.” In <i>Lecture Notes in Computer Science</i>.
    Berlin, Heidelberg, 1992. <a href="https://doi.org/10.1007/3-540-56731-3_3">https://doi.org/10.1007/3-540-56731-3_3</a>.
  ieee: F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on
    distributed memory machines,” in <i>Lecture Notes in Computer Science</i>, Berlin,
    Heidelberg, 1992.
  mla: Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory
    on Distributed Memory Machines.” <i>Lecture Notes in Computer Science</i>, 1992,
    doi:<a href="https://doi.org/10.1007/3-540-56731-3_3">10.1007/3-540-56731-3_3</a>.
  short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg,
    1992.'
date_created: 2020-04-20T11:29:58Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-56731-3_3
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540567318'
  - '9783540476375'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Hashing strategies for simulating shared memory on distributed memory machines
type: book_chapter
user_id: '15415'
year: '1992'
...
---
_id: '16735'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Hieu Thien
  full_name: Pham, Hieu Thien
  last_name: Pham
citation:
  ama: 'Meyer auf der Heide F, Pham HT. On the performance of networks with multiple
    busses. In: <i>STACS 92</i>. Berlin, Heidelberg; 1992. doi:<a href="https://doi.org/10.1007/3-540-55210-3_176">10.1007/3-540-55210-3_176</a>'
  apa: Meyer auf der Heide, F., &#38; Pham, H. T. (1992). On the performance of networks
    with multiple busses. In <i>STACS 92</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-55210-3_176">https://doi.org/10.1007/3-540-55210-3_176</a>
  bibtex: '@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On
    the performance of networks with multiple busses}, DOI={<a href="https://doi.org/10.1007/3-540-55210-3_176">10.1007/3-540-55210-3_176</a>},
    booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien},
    year={1992} }'
  chicago: Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance
    of Networks with Multiple Busses.” In <i>STACS 92</i>. Berlin, Heidelberg, 1992.
    <a href="https://doi.org/10.1007/3-540-55210-3_176">https://doi.org/10.1007/3-540-55210-3_176</a>.
  ieee: F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with
    multiple busses,” in <i>STACS 92</i>, Berlin, Heidelberg, 1992.
  mla: Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of
    Networks with Multiple Busses.” <i>STACS 92</i>, 1992, doi:<a href="https://doi.org/10.1007/3-540-55210-3_176">10.1007/3-540-55210-3_176</a>.
  short: 'F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.'
date_created: 2020-04-20T11:31:58Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-55210-3_176
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 92
publication_identifier:
  isbn:
  - '9783540552109'
  - '9783540467755'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: On the performance of networks with multiple busses
type: book_chapter
user_id: '15415'
year: '1992'
...
---
_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: '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: '19821'
author:
- first_name: Hans Kleine
  full_name: Büning, Hans Kleine
  last_name: Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Büning HK, Lettmann T. Representation independent query and update operations
    on propositional definite Horn formulas. In: Börger E, ed. <i>Computation Theory
    and Logic</i>. Berlin, Heidelberg; 1987:208-223. doi:<a href="https://doi.org/10.1007/3-540-18170-9_167">10.1007/3-540-18170-9_167</a>'
  apa: Büning, H. K., &#38; Lettmann, T. (1987). Representation independent query
    and update operations on propositional definite Horn formulas. In E. Börger (Ed.),
    <i>Computation Theory and Logic</i> (pp. 208–223). Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-18170-9_167">https://doi.org/10.1007/3-540-18170-9_167</a>
  bibtex: '@inbook{Büning_Lettmann_1987, place={Berlin, Heidelberg}, title={Representation
    independent query and update operations on propositional definite Horn formulas},
    DOI={<a href="https://doi.org/10.1007/3-540-18170-9_167">10.1007/3-540-18170-9_167</a>},
    booktitle={Computation Theory and Logic}, author={Büning, Hans Kleine and Lettmann,
    Theodor}, editor={Börger, EgonEditor}, year={1987}, pages={208–223} }'
  chicago: Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent
    Query and Update Operations on Propositional Definite Horn Formulas.” In <i>Computation
    Theory and Logic</i>, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987.
    <a href="https://doi.org/10.1007/3-540-18170-9_167">https://doi.org/10.1007/3-540-18170-9_167</a>.
  ieee: H. K. Büning and T. Lettmann, “Representation independent query and update
    operations on propositional definite Horn formulas,” in <i>Computation Theory
    and Logic</i>, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.
  mla: Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query
    and Update Operations on Propositional Definite Horn Formulas.” <i>Computation
    Theory and Logic</i>, edited by Egon Börger, 1987, pp. 208–23, doi:<a href="https://doi.org/10.1007/3-540-18170-9_167">10.1007/3-540-18170-9_167</a>.
  short: 'H.K. Büning, T. Lettmann, in: E. Börger (Ed.), Computation Theory and Logic,
    Berlin, Heidelberg, 1987, pp. 208–223.'
date_created: 2020-10-01T09:08:05Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1007/3-540-18170-9_167
editor:
- first_name: Egon
  full_name: Börger, Egon
  last_name: Börger
language:
- iso: eng
page: 208-223
place: Berlin, Heidelberg
publication: Computation Theory and Logic
publication_identifier:
  isbn:
  - '9783540181705'
  - '9783540477952'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Representation independent query and update operations on propositional definite
  Horn formulas
type: book_chapter
user_id: '315'
year: '1987'
...
---
_id: '19819'
author:
- first_name: H.
  full_name: Kleine Büning, H.
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Kleine Büning H, Lettmann T. Classes of first order formulas under various
    satisfiability definitions. In: <i>8th International Conference on Automated Deduction</i>.
    Berlin, Heidelberg; 1986. doi:<a href="https://doi.org/10.1007/3-540-16780-3_119">10.1007/3-540-16780-3_119</a>'
  apa: Kleine Büning, H., &#38; Lettmann, T. (1986). Classes of first order formulas
    under various satisfiability definitions. In <i>8th International Conference on
    Automated Deduction</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-16780-3_119">https://doi.org/10.1007/3-540-16780-3_119</a>
  bibtex: '@inbook{Kleine Büning_Lettmann_1986, place={Berlin, Heidelberg}, title={Classes
    of first order formulas under various satisfiability definitions}, DOI={<a href="https://doi.org/10.1007/3-540-16780-3_119">10.1007/3-540-16780-3_119</a>},
    booktitle={8th International Conference on Automated Deduction}, author={Kleine
    Büning, H. and Lettmann, Theodor}, year={1986} }'
  chicago: Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas
    under Various Satisfiability Definitions.” In <i>8th International Conference
    on Automated Deduction</i>. Berlin, Heidelberg, 1986. <a href="https://doi.org/10.1007/3-540-16780-3_119">https://doi.org/10.1007/3-540-16780-3_119</a>.
  ieee: H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various
    satisfiability definitions,” in <i>8th International Conference on Automated Deduction</i>,
    Berlin, Heidelberg, 1986.
  mla: Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under
    Various Satisfiability Definitions.” <i>8th International Conference on Automated
    Deduction</i>, 1986, doi:<a href="https://doi.org/10.1007/3-540-16780-3_119">10.1007/3-540-16780-3_119</a>.
  short: 'H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated
    Deduction, Berlin, Heidelberg, 1986.'
date_created: 2020-10-01T08:56:14Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1007/3-540-16780-3_119
language:
- iso: eng
place: Berlin, Heidelberg
publication: 8th International Conference on Automated Deduction
publication_identifier:
  isbn:
  - '9783540167808'
  - '9783540398615'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Classes of first order formulas under various satisfiability definitions
type: book_chapter
user_id: '315'
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: '16787'
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 (extended abstract). In: <i>STACS 84</i>. Berlin, Heidelberg; 1984.
    doi:<a href="https://doi.org/10.1007/3-540-12920-0_20">10.1007/3-540-12920-0_20</a>'
  apa: Meyer auf der Heide, F. (1984). Efficient simulations among several models
    of parallel computers (extended abstract). In <i>STACS 84</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-12920-0_20">https://doi.org/10.1007/3-540-12920-0_20</a>
  bibtex: '@inbook{Meyer auf der Heide_1984, place={Berlin, Heidelberg}, title={Efficient
    simulations among several models of parallel computers (extended abstract)}, DOI={<a
    href="https://doi.org/10.1007/3-540-12920-0_20">10.1007/3-540-12920-0_20</a>},
    booktitle={STACS 84}, author={Meyer auf der Heide, Friedhelm}, year={1984} }'
  chicago: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
    of Parallel Computers (Extended Abstract).” In <i>STACS 84</i>. Berlin, Heidelberg,
    1984. <a href="https://doi.org/10.1007/3-540-12920-0_20">https://doi.org/10.1007/3-540-12920-0_20</a>.
  ieee: F. Meyer auf der Heide, “Efficient simulations among several models of parallel
    computers (extended abstract),” in <i>STACS 84</i>, Berlin, Heidelberg, 1984.
  mla: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
    of Parallel Computers (Extended Abstract).” <i>STACS 84</i>, 1984, doi:<a href="https://doi.org/10.1007/3-540-12920-0_20">10.1007/3-540-12920-0_20</a>.
  short: 'F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.'
date_created: 2020-04-21T11:28:40Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-12920-0_20
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 84
publication_identifier:
  isbn:
  - '9783540129202'
  - '9783540388050'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Efficient simulations among several models of parallel computers (extended
  abstract)
type: book_chapter
user_id: '15415'
year: '1984'
...
---
_id: '16813'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Anton
  full_name: Rollik, Anton
  last_name: Rollik
citation:
  ama: 'Meyer auf der Heide F, Rollik A. Random access machines and straight-line
    programs. In: <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg; 1981.
    doi:<a href="https://doi.org/10.1007/3-540-10854-8_29">10.1007/3-540-10854-8_29</a>'
  apa: Meyer auf der Heide, F., &#38; Rollik, A. (1981). Random access machines and
    straight-line programs. In <i>Fundamentals of Computation Theory</i>. Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/3-540-10854-8_29">https://doi.org/10.1007/3-540-10854-8_29</a>
  bibtex: '@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random
    access machines and straight-line programs}, DOI={<a href="https://doi.org/10.1007/3-540-10854-8_29">10.1007/3-540-10854-8_29</a>},
    booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm
    and Rollik, Anton}, year={1981} }'
  chicago: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines
    and Straight-Line Programs.” In <i>Fundamentals of Computation Theory</i>. Berlin,
    Heidelberg, 1981. <a href="https://doi.org/10.1007/3-540-10854-8_29">https://doi.org/10.1007/3-540-10854-8_29</a>.
  ieee: F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line
    programs,” in <i>Fundamentals of Computation Theory</i>, Berlin, Heidelberg, 1981.
  mla: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and
    Straight-Line Programs.” <i>Fundamentals of Computation Theory</i>, 1981, doi:<a
    href="https://doi.org/10.1007/3-540-10854-8_29">10.1007/3-540-10854-8_29</a>.
  short: 'F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory,
    Berlin, Heidelberg, 1981.'
date_created: 2020-04-22T09:03:21Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-10854-8_29
language:
- iso: eng
place: Berlin, Heidelberg
publication: Fundamentals of Computation Theory
publication_identifier:
  isbn:
  - '9783540108542'
  - '9783540387657'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Random access machines and straight-line programs
type: book_chapter
user_id: '15415'
year: '1981'
...