---
_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: '18936'
abstract:
- lang: eng
  text: 'We consider the following periodic sorting procedure on two-dimensional meshes
    of processors: Initially, each node contains one number. We proceed in rounds
    each round consisting of sorting the columns of the grid, and, in the second phase,
    of sorting the rows according to the snake-like ordering. We exactly characterize
    the number of rounds necessary to sort on an l × m-grid in the worst case, where
    l is the number of the rows and m the number of the columns. An upper bound of
    ⌈ log l⌉ + 1was known before. This bound is tight for the case that m is not a
    power of 2. Surprisingly, it turns out that far fewer rounds are necessary if
    m is a power of 2 (and m ≪ l) in this case, exactly min { log m + 1, ⌈ log l⌉
    + 1} rounds are needed in the worst case.'
author:
- first_name: Miroslaw
  full_name: Kutylowski, Miroslaw
  last_name: Kutylowski
- first_name: Rolf
  full_name: Wanka, Rolf
  last_name: Wanka
citation:
  ama: Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. <i>Parallel
    Processing Letters 2</i>. Published online 1992:213-220. doi:<a href="https://doi.org/10.1142/s0129626492000349">10.1142/s0129626492000349</a>
  apa: Kutylowski, M., &#38; Wanka, R. (1992). Periodic Sorting on Two-Dimensional
    Meshes. <i>Parallel Processing Letters 2</i>, 213–220. <a href="https://doi.org/10.1142/s0129626492000349">https://doi.org/10.1142/s0129626492000349</a>
  bibtex: '@article{Kutylowski_Wanka_1992, title={Periodic Sorting on Two-Dimensional
    Meshes}, DOI={<a href="https://doi.org/10.1142/s0129626492000349">10.1142/s0129626492000349</a>},
    journal={Parallel Processing Letters 2}, author={Kutylowski, Miroslaw and Wanka,
    Rolf}, year={1992}, pages={213–220} }'
  chicago: Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional
    Meshes.” <i>Parallel Processing Letters 2</i>, 1992, 213–20. <a href="https://doi.org/10.1142/s0129626492000349">https://doi.org/10.1142/s0129626492000349</a>.
  ieee: 'M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,”
    <i>Parallel Processing Letters 2</i>, pp. 213–220, 1992, doi: <a href="https://doi.org/10.1142/s0129626492000349">10.1142/s0129626492000349</a>.'
  mla: Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional
    Meshes.” <i>Parallel Processing Letters 2</i>, 1992, pp. 213–20, doi:<a href="https://doi.org/10.1142/s0129626492000349">10.1142/s0129626492000349</a>.
  short: M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.
date_created: 2020-09-03T11:05:14Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1142/s0129626492000349
language:
- iso: eng
page: 213-220
publication: Parallel Processing Letters 2
publication_identifier:
  issn:
  - 0129-6264
  - 1793-642X
publication_status: published
status: public
title: Periodic Sorting on Two-Dimensional Meshes
type: journal_article
user_id: '15415'
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: '16736'
author:
- first_name: Richard M.
  full_name: Karp, Richard M.
  last_name: Karp
- first_name: Michael
  full_name: Luby, Michael
  last_name: Luby
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed
    memory machine. In: <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on
    Theory of Computing  - STOC ’92</i>. ; 1992. doi:<a href="https://doi.org/10.1145/129712.129743">10.1145/129712.129743</a>'
  apa: Karp, R. M., Luby, M., &#38; Meyer auf der Heide, F. (1992). Efficient PRAM
    simulation on a distributed memory machine. In <i>Proceedings of the twenty-fourth
    annual ACM symposium on Theory of computing  - STOC ’92</i>. <a href="https://doi.org/10.1145/129712.129743">https://doi.org/10.1145/129712.129743</a>
  bibtex: '@inproceedings{Karp_Luby_Meyer auf der Heide_1992, title={Efficient PRAM
    simulation on a distributed memory machine}, DOI={<a href="https://doi.org/10.1145/129712.129743">10.1145/129712.129743</a>},
    booktitle={Proceedings of the twenty-fourth annual ACM symposium on Theory of
    computing  - STOC ’92}, author={Karp, Richard M. and Luby, Michael and Meyer auf
    der Heide, Friedhelm}, year={1992} }'
  chicago: Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient
    PRAM Simulation on a Distributed Memory Machine.” In <i>Proceedings of the Twenty-Fourth
    Annual ACM Symposium on Theory of Computing  - STOC ’92</i>, 1992. <a href="https://doi.org/10.1145/129712.129743">https://doi.org/10.1145/129712.129743</a>.
  ieee: R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation
    on a distributed memory machine,” in <i>Proceedings of the twenty-fourth annual
    ACM symposium on Theory of computing  - STOC ’92</i>, 1992.
  mla: Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory
    Machine.” <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of
    Computing  - STOC ’92</i>, 1992, doi:<a href="https://doi.org/10.1145/129712.129743">10.1145/129712.129743</a>.
  short: 'R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth
    Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992.'
date_created: 2020-04-20T11:33:22Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/129712.129743
language:
- iso: eng
publication: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  -
  STOC '92
publication_identifier:
  isbn:
  - '0897915119'
publication_status: published
status: public
title: Efficient PRAM simulation on a distributed memory machine
type: conference
user_id: '15415'
year: '1992'
...
---
_id: '16737'
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. Dynamic Hashing in Real Time. In:
    <i>TEUBNER-TEXTE Zur Informatik</i>. Wiesbaden; 1992. doi:<a href="https://doi.org/10.1007/978-3-322-95233-2_7">10.1007/978-3-322-95233-2_7</a>'
  apa: Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). Dynamic Hashing in
    Real Time. In <i>TEUBNER-TEXTE zur Informatik</i>. Wiesbaden. <a href="https://doi.org/10.1007/978-3-322-95233-2_7">https://doi.org/10.1007/978-3-322-95233-2_7</a>
  bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Wiesbaden}, title={Dynamic
    Hashing in Real Time}, DOI={<a href="https://doi.org/10.1007/978-3-322-95233-2_7">10.1007/978-3-322-95233-2_7</a>},
    booktitle={TEUBNER-TEXTE zur Informatik}, author={Dietzfelbinger, Martin and Meyer
    auf der Heide, Friedhelm}, year={1992} }'
  chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing
    in Real Time.” In <i>TEUBNER-TEXTE Zur Informatik</i>. Wiesbaden, 1992. <a href="https://doi.org/10.1007/978-3-322-95233-2_7">https://doi.org/10.1007/978-3-322-95233-2_7</a>.
  ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,”
    in <i>TEUBNER-TEXTE zur Informatik</i>, Wiesbaden, 1992.
  mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing
    in Real Time.” <i>TEUBNER-TEXTE Zur Informatik</i>, 1992, doi:<a href="https://doi.org/10.1007/978-3-322-95233-2_7">10.1007/978-3-322-95233-2_7</a>.
  short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik,
    Wiesbaden, 1992.'
date_created: 2020-04-20T11:35:06Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/978-3-322-95233-2_7
language:
- iso: eng
place: Wiesbaden
publication: TEUBNER-TEXTE zur Informatik
publication_identifier:
  isbn:
  - '9783815420331'
  - '9783322952332'
  issn:
  - 1615-4584
publication_status: published
status: public
title: Dynamic Hashing in Real Time
type: book_chapter
user_id: '15415'
year: '1992'
...
---
_id: '3050'
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
- first_name: Hubert
  full_name: Wagener, Hubert
  last_name: Wagener
citation:
  ama: 'Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: <i>Automata,
    Languages and Programming</i>. Berlin/Heidelberg: Springer-Verlag; 1990:703-716.
    doi:<a href="https://doi.org/10.1007/bfb0032068">10.1007/bfb0032068</a>'
  apa: 'Alt, H., Blömer, J., &#38; Wagener, H. (1990). Approximation of convex polygons.
    In <i>Automata, Languages and Programming</i> (pp. 703–716). Berlin/Heidelberg:
    Springer-Verlag. <a href="https://doi.org/10.1007/bfb0032068">https://doi.org/10.1007/bfb0032068</a>'
  bibtex: '@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation
    of convex polygons}, DOI={<a href="https://doi.org/10.1007/bfb0032068">10.1007/bfb0032068</a>},
    booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag},
    author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716}
    }'
  chicago: 'Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex
    Polygons.” In <i>Automata, Languages and Programming</i>, 703–16. Berlin/Heidelberg:
    Springer-Verlag, 1990. <a href="https://doi.org/10.1007/bfb0032068">https://doi.org/10.1007/bfb0032068</a>.'
  ieee: 'H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in
    <i>Automata, Languages and Programming</i>, Berlin/Heidelberg: Springer-Verlag,
    1990, pp. 703–716.'
  mla: Alt, Helmut, et al. “Approximation of Convex Polygons.” <i>Automata, Languages
    and Programming</i>, Springer-Verlag, 1990, pp. 703–16, doi:<a href="https://doi.org/10.1007/bfb0032068">10.1007/bfb0032068</a>.
  short: 'H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming,
    Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.'
date_created: 2018-06-05T08:56:43Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
- _id: '63'
doi: 10.1007/bfb0032068
extern: '1'
language:
- iso: eng
page: 703-716
place: Berlin/Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
  isbn:
  - '3540528261'
publication_status: published
publisher: Springer-Verlag
status: public
title: Approximation of convex polygons
type: book_chapter
user_id: '14955'
year: '1990'
...
---
_id: '16738'
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. A new universal class of hash functions
    and dynamic hashing in real time. In: <i>Automata, Languages and Programming</i>.
    Berlin/Heidelberg; 1990. doi:<a href="https://doi.org/10.1007/bfb0032018">10.1007/bfb0032018</a>'
  apa: Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1990). A new universal class
    of hash functions and dynamic hashing in real time. In <i>Automata, Languages
    and Programming</i>. Berlin/Heidelberg. <a href="https://doi.org/10.1007/bfb0032018">https://doi.org/10.1007/bfb0032018</a>
  bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1990, place={Berlin/Heidelberg},
    title={A new universal class of hash functions and dynamic hashing in real time},
    DOI={<a href="https://doi.org/10.1007/bfb0032018">10.1007/bfb0032018</a>}, booktitle={Automata,
    Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide,
    Friedhelm}, year={1990} }'
  chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal
    Class of Hash Functions and Dynamic Hashing in Real Time.” In <i>Automata, Languages
    and Programming</i>. Berlin/Heidelberg, 1990. <a href="https://doi.org/10.1007/bfb0032018">https://doi.org/10.1007/bfb0032018</a>.
  ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash
    functions and dynamic hashing in real time,” in <i>Automata, Languages and Programming</i>,
    Berlin/Heidelberg, 1990.
  mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal
    Class of Hash Functions and Dynamic Hashing in Real Time.” <i>Automata, Languages
    and Programming</i>, 1990, doi:<a href="https://doi.org/10.1007/bfb0032018">10.1007/bfb0032018</a>.
  short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming,
    Berlin/Heidelberg, 1990.'
date_created: 2020-04-20T11:37:37Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0032018
language:
- iso: eng
place: Berlin/Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
  isbn:
  - '3540528261'
publication_status: published
status: public
title: A new universal class of hash functions and dynamic hashing in real time
type: book_chapter
user_id: '15415'
year: '1990'
...
---
_id: '16739'
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. Dynamic hashing strategies. In: <i>Lecture Notes in
    Computer Science</i>. Berlin/Heidelberg; 1990. doi:<a href="https://doi.org/10.1007/bfb0029597">10.1007/bfb0029597</a>'
  apa: Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In <i>Lecture Notes
    in Computer Science</i>. Berlin/Heidelberg. <a href="https://doi.org/10.1007/bfb0029597">https://doi.org/10.1007/bfb0029597</a>
  bibtex: '@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic
    hashing strategies}, DOI={<a href="https://doi.org/10.1007/bfb0029597">10.1007/bfb0029597</a>},
    booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm},
    year={1990} }'
  chicago: Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In <i>Lecture
    Notes in Computer Science</i>. Berlin/Heidelberg, 1990. <a href="https://doi.org/10.1007/bfb0029597">https://doi.org/10.1007/bfb0029597</a>.
  ieee: F. Meyer auf der Heide, “Dynamic hashing strategies,” in <i>Lecture Notes
    in Computer Science</i>, Berlin/Heidelberg, 1990.
  mla: Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” <i>Lecture Notes
    in Computer Science</i>, 1990, doi:<a href="https://doi.org/10.1007/bfb0029597">10.1007/bfb0029597</a>.
  short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg,
    1990.'
date_created: 2020-04-20T11:39:31Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0029597
language:
- iso: eng
place: Berlin/Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '3540529535'
publication_status: published
status: public
title: Dynamic hashing strategies
type: book_chapter
user_id: '15415'
year: '1990'
...
---
_id: '16740'
author:
- first_name: Marek
  full_name: Karpinski, Marek
  last_name: Karpinski
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial
    computation. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg;
    1990. doi:<a href="https://doi.org/10.1007/bfb0029630">10.1007/bfb0029630</a>'
  apa: Karpinski, M., &#38; Meyer auf der Heide, F. (1990). On the complexity of genuinely
    polynomial computation. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg.
    <a href="https://doi.org/10.1007/bfb0029630">https://doi.org/10.1007/bfb0029630</a>
  bibtex: '@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg},
    title={On the complexity of genuinely polynomial computation}, DOI={<a href="https://doi.org/10.1007/bfb0029630">10.1007/bfb0029630</a>},
    booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer
    auf der Heide, Friedhelm}, year={1990} }'
  chicago: Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity
    of Genuinely Polynomial Computation.” In <i>Lecture Notes in Computer Science</i>.
    Berlin/Heidelberg, 1990. <a href="https://doi.org/10.1007/bfb0029630">https://doi.org/10.1007/bfb0029630</a>.
  ieee: M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial
    computation,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg,
    1990.
  mla: Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of
    Genuinely Polynomial Computation.” <i>Lecture Notes in Computer Science</i>, 1990,
    doi:<a href="https://doi.org/10.1007/bfb0029630">10.1007/bfb0029630</a>.
  short: 'M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science,
    Berlin/Heidelberg, 1990.'
date_created: 2020-04-20T11:40:17Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0029630
language:
- iso: eng
place: Berlin/Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '3540529535'
publication_status: published
status: public
title: On the complexity of genuinely polynomial computation
type: book_chapter
user_id: '15415'
year: '1990'
...
---
_id: '16741'
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. How to distribute a dictionary in
    a complete network. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium
    on Theory of Computing  - STOC ’90</i>. ; 1990. doi:<a href="https://doi.org/10.1145/100216.100229">10.1145/100216.100229</a>'
  apa: Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1990). How to distribute
    a dictionary in a complete network. In <i>Proceedings of the twenty-second annual
    ACM symposium on Theory of computing  - STOC ’90</i>. <a href="https://doi.org/10.1145/100216.100229">https://doi.org/10.1145/100216.100229</a>
  bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1990, title={How to distribute
    a dictionary in a complete network}, DOI={<a href="https://doi.org/10.1145/100216.100229">10.1145/100216.100229</a>},
    booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of
    computing  - STOC ’90}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm},
    year={1990} }'
  chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute
    a Dictionary in a Complete Network.” In <i>Proceedings of the Twenty-Second Annual
    ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href="https://doi.org/10.1145/100216.100229">https://doi.org/10.1145/100216.100229</a>.
  ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary
    in a complete network,” in <i>Proceedings of the twenty-second annual ACM symposium
    on Theory of computing  - STOC ’90</i>, 1990.
  mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a
    Dictionary in a Complete Network.” <i>Proceedings of the Twenty-Second Annual
    ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990, doi:<a href="https://doi.org/10.1145/100216.100229">10.1145/100216.100229</a>.
  short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second
    Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.'
date_created: 2020-04-20T11:41:08Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/100216.100229
language:
- iso: eng
publication: Proceedings of the twenty-second annual ACM symposium on Theory of computing  -
  STOC '90
publication_identifier:
  isbn:
  - '0897913612'
publication_status: published
status: public
title: How to distribute a dictionary in a complete network
type: conference
user_id: '15415'
year: '1990'
...
---
_id: '16742'
author:
- first_name: J.
  full_name: Gil, J.
  last_name: Gil
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: A.
  full_name: Wigderson, A.
  last_name: Wigderson
citation:
  ama: 'Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant
    time. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of
    Computing  - STOC ’90</i>. ; 1990. doi:<a href="https://doi.org/10.1145/100216.100247">10.1145/100216.100247</a>'
  apa: Gil, J., Meyer auf der Heide, F., &#38; Wigderson, A. (1990). Not all keys
    can be hashed in constant time. In <i>Proceedings of the twenty-second annual
    ACM symposium on Theory of computing  - STOC ’90</i>. <a href="https://doi.org/10.1145/100216.100247">https://doi.org/10.1145/100216.100247</a>
  bibtex: '@inproceedings{Gil_Meyer auf der Heide_Wigderson_1990, title={Not all keys
    can be hashed in constant time}, DOI={<a href="https://doi.org/10.1145/100216.100247">10.1145/100216.100247</a>},
    booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of
    computing  - STOC ’90}, author={Gil, J. and Meyer auf der Heide, Friedhelm and
    Wigderson, A.}, year={1990} }'
  chicago: Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys
    Can Be Hashed in Constant Time.” In <i>Proceedings of the Twenty-Second Annual
    ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href="https://doi.org/10.1145/100216.100247">https://doi.org/10.1145/100216.100247</a>.
  ieee: J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed
    in constant time,” in <i>Proceedings of the twenty-second annual ACM symposium
    on Theory of computing  - STOC ’90</i>, 1990.
  mla: Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” <i>Proceedings
    of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>,
    1990, doi:<a href="https://doi.org/10.1145/100216.100247">10.1145/100216.100247</a>.
  short: 'J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second
    Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.'
date_created: 2020-04-20T11:41:55Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/100216.100247
language:
- iso: eng
publication: Proceedings of the twenty-second annual ACM symposium on Theory of computing  -
  STOC '90
publication_identifier:
  isbn:
  - '0897913612'
publication_status: published
status: public
title: Not all keys can be hashed in constant time
type: conference
user_id: '15415'
year: '1990'
...
---
_id: '16824'
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. Das Heinz Nixdorf-Institut der Universität-GH Paderborn.
    <i>Informatik Spektrum</i>. 1990;13(4):231-232.
  apa: Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH
    Paderborn. <i>Informatik Spektrum</i>, <i>13</i>(4), 231–232.
  bibtex: '@article{Meyer auf der Heide_1990, title={Das Heinz Nixdorf-Institut der
    Universität-GH Paderborn}, volume={13}, number={4}, journal={Informatik Spektrum},
    author={Meyer auf der Heide, Friedhelm}, year={1990}, pages={231–232} }'
  chicago: 'Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH
    Paderborn.” <i>Informatik Spektrum</i> 13, no. 4 (1990): 231–32.'
  ieee: F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,”
    <i>Informatik Spektrum</i>, vol. 13, no. 4, pp. 231–232, 1990.
  mla: Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH
    Paderborn.” <i>Informatik Spektrum</i>, vol. 13, no. 4, 1990, pp. 231–32.
  short: F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232.
date_created: 2020-04-22T10:28:27Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
intvolume: '        13'
issue: '4'
language:
- iso: eng
page: 231-232
publication: Informatik Spektrum
status: public
title: Das Heinz Nixdorf-Institut der Universität-GH Paderborn
type: journal_article
user_id: '15415'
volume: 13
year: '1990'
...
---
_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'
...