@inbook{16732,
  author       = {{Lürwer-Brüggemeier, Katharina and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540565031}},
  issn         = {{0302-9743}},
  title        = {{{Capabilities and complexity of computations with integer division}}},
  doi          = {{10.1007/3-540-56503-5_46}},
  year         = {{1993}},
}

@article{18936,
  abstract     = {{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       = {{Kutylowski, Miroslaw and Wanka, Rolf}},
  issn         = {{0129-6264}},
  journal      = {{Parallel Processing Letters 2}},
  pages        = {{213--220}},
  title        = {{{Periodic Sorting on Two-Dimensional Meshes}}},
  doi          = {{10.1142/s0129626492000349}},
  year         = {{1992}},
}

@inbook{16733,
  author       = {{Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Data structures and efficient algorithms}},
  isbn         = {{9783540554882}},
  issn         = {{0302-9743}},
  title        = {{{High performance universal hashing, with applications to shared memory simulations}}},
  doi          = {{10.1007/3-540-55488-2_31}},
  year         = {{1992}},
}

@inbook{16734,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540567318}},
  issn         = {{0302-9743}},
  title        = {{{Hashing strategies for simulating shared memory on distributed memory machines}}},
  doi          = {{10.1007/3-540-56731-3_3}},
  year         = {{1992}},
}

@inbook{16735,
  author       = {{Meyer auf der Heide, Friedhelm and Pham, Hieu Thien}},
  booktitle    = {{STACS 92}},
  isbn         = {{9783540552109}},
  issn         = {{0302-9743}},
  title        = {{{On the performance of networks with multiple busses}}},
  doi          = {{10.1007/3-540-55210-3_176}},
  year         = {{1992}},
}

@inproceedings{16736,
  author       = {{Karp, Richard M. and Luby, Michael and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC '92}},
  isbn         = {{0897915119}},
  title        = {{{Efficient PRAM simulation on a distributed memory machine}}},
  doi          = {{10.1145/129712.129743}},
  year         = {{1992}},
}

@inbook{16737,
  author       = {{Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{TEUBNER-TEXTE zur Informatik}},
  isbn         = {{9783815420331}},
  issn         = {{1615-4584}},
  title        = {{{Dynamic Hashing in Real Time}}},
  doi          = {{10.1007/978-3-322-95233-2_7}},
  year         = {{1992}},
}

@inbook{3050,
  author       = {{Alt, Helmut and Blömer, Johannes and Wagener, Hubert}},
  booktitle    = {{Automata, Languages and Programming}},
  isbn         = {{3540528261}},
  pages        = {{703--716}},
  publisher    = {{Springer-Verlag}},
  title        = {{{Approximation of convex polygons}}},
  doi          = {{10.1007/bfb0032068}},
  year         = {{1990}},
}

@inbook{16738,
  author       = {{Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Automata, Languages and Programming}},
  isbn         = {{3540528261}},
  title        = {{{A new universal class of hash functions and dynamic hashing in real time}}},
  doi          = {{10.1007/bfb0032018}},
  year         = {{1990}},
}

@inbook{16739,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{3540529535}},
  title        = {{{Dynamic hashing strategies}}},
  doi          = {{10.1007/bfb0029597}},
  year         = {{1990}},
}

@inbook{16740,
  author       = {{Karpinski, Marek and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{3540529535}},
  title        = {{{On the complexity of genuinely polynomial computation}}},
  doi          = {{10.1007/bfb0029630}},
  year         = {{1990}},
}

@inproceedings{16741,
  author       = {{Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90}},
  isbn         = {{0897913612}},
  title        = {{{How to distribute a dictionary in a complete network}}},
  doi          = {{10.1145/100216.100229}},
  year         = {{1990}},
}

@inproceedings{16742,
  author       = {{Gil, J. and Meyer auf der Heide, Friedhelm and Wigderson, A.}},
  booktitle    = {{Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90}},
  isbn         = {{0897913612}},
  title        = {{{Not all keys can be hashed in constant time}}},
  doi          = {{10.1145/100216.100247}},
  year         = {{1990}},
}

@article{16824,
  author       = {{Meyer auf der Heide, Friedhelm}},
  journal      = {{Informatik Spektrum}},
  number       = {{4}},
  pages        = {{231--232}},
  title        = {{{Das Heinz Nixdorf-Institut der Universität-GH Paderborn}}},
  volume       = {{13}},
  year         = {{1990}},
}

@article{16743,
  author       = {{Just, Bettina and Meyer auf der Heide, Friedhelm and Wigderson, Avi}},
  issn         = {{0988-3754}},
  journal      = {{RAIRO - Theoretical Informatics and Applications}},
  pages        = {{101--111}},
  title        = {{{On computations with integer division}}},
  doi          = {{10.1051/ita/1989230101011}},
  year         = {{1989}},
}

@inproceedings{16744,
  author       = {{Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA '89}},
  isbn         = {{089791323X}},
  title        = {{{An optimal parallel dictionary}}},
  doi          = {{10.1145/72935.72974}},
  year         = {{1989}},
}

@inbook{16745,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{STACS 89}},
  isbn         = {{3540508406}},
  title        = {{{On genuinely time bounded computations}}},
  doi          = {{10.1007/bfb0028969}},
  year         = {{1989}},
}

@inbook{16746,
  author       = {{Meyer auf der Heide, Friedhelm and Wanka, Rolf}},
  booktitle    = {{STACS 89}},
  isbn         = {{3540508406}},
  title        = {{{Time-optimal simulations of networks by universal parallel computers}}},
  doi          = {{10.1007/bfb0028978}},
  year         = {{1989}},
}

@inbook{16789,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{STACS 89}},
  isbn         = {{9783540508403}},
  issn         = {{0302-9743}},
  title        = {{{Computing minimum spanning forests on 1- and 2-dimensional processor arrays}}},
  doi          = {{10.1007/bfb0028983}},
  year         = {{1989}},
}

@article{16763,
  author       = {{Babai, László and Just, Bettina and Meyer auf der Heide, Friedhelm}},
  issn         = {{0890-5401}},
  journal      = {{Information and Computation}},
  pages        = {{99--107}},
  title        = {{{On the limits of computations with the floor function}}},
  doi          = {{10.1016/0890-5401(88)90031-4}},
  year         = {{1988}},
}