@inproceedings{16707,
  author       = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}},
  booktitle    = {{Proceedings Third Israel Symposium on the Theory of Computing and Systems}},
  isbn         = {{0818669152}},
  title        = {{{Improved optimal shared memory simulations, and the power of reconfiguration}}},
  doi          = {{10.1109/istcs.1995.377051}},
  year         = {{1995}},
}

@inbook{16717,
  author       = {{Meyer auf der Heide, Friedhelm and Westermann, Matthias}},
  booktitle    = {{Graph-Theoretic Concepts in Computer Science}},
  isbn         = {{9783540606185}},
  issn         = {{0302-9743}},
  title        = {{{Hot-potato routing on multi-dimensional tori}}},
  doi          = {{10.1007/3-540-60618-1_77}},
  year         = {{1995}},
}

@inbook{16874,
  author       = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540603139}},
  issn         = {{0302-9743}},
  title        = {{{Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}}},
  doi          = {{10.1007/3-540-60313-1_131}},
  year         = {{1995}},
}

@phdthesis{19624,
  author       = {{Wanka, Rolf}},
  title        = {{{Paralleles Sortieren auf mehrdimensionalen Gittern}}},
  year         = {{1994}},
}

@article{16728,
  author       = {{Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E.}},
  issn         = {{0097-5397}},
  journal      = {{SIAM Journal on Computing}},
  pages        = {{738--761}},
  title        = {{{Dynamic Perfect Hashing: Upper and Lower Bounds}}},
  doi          = {{10.1137/s0097539791194094}},
  year         = {{1994}},
}

@book{17477,
  editor       = {{Meyer auf der Heide, Friedhelm and Monien, B. and Rosenberg, A. L.}},
  isbn         = {{9783540567318}},
  issn         = {{0302-9743}},
  publisher    = {{Springer}},
  title        = {{{Parallel Architectures and Their Efficient Use}}},
  doi          = {{10.1007/3-540-56731-3}},
  year         = {{1993}},
}

@inproceedings{17479,
  author       = {{Kastens, Uwe and Meyer auf der Heide, Friedhelm and Wachsmann, Alf and Wichmann, Friedrich}},
  booktitle    = {{Proc. 3rd PASA Workshop, PARS Mitteilungen}},
  pages        = {{50--55}},
  title        = {{{OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)}}},
  year         = {{1993}},
}

@article{16729,
  author       = {{Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}},
  issn         = {{0890-5401}},
  journal      = {{Information and Computation}},
  pages        = {{196--217}},
  title        = {{{An Optimal Parallel Dictionary}}},
  doi          = {{10.1006/inco.1993.1007}},
  year         = {{1993}},
}

@inbook{16730,
  author       = {{Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}},
  booktitle    = {{Automata, Languages and Programming}},
  isbn         = {{9783540569398}},
  issn         = {{0302-9743}},
  title        = {{{Strongly adaptive token distribution}}},
  doi          = {{10.1007/3-540-56939-1_89}},
  year         = {{1993}},
}

@inproceedings{16731,
  author       = {{Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA '93}},
  isbn         = {{0897915992}},
  title        = {{{Simple, efficient shared memory simulations}}},
  doi          = {{10.1145/165231.165246}},
  year         = {{1993}},
}

@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}},
}