| 1997 |
|---|
| 7 | | Rainer Feldmann,
Burkhard Monien,
Peter Mysliwietz,
Stefan Tschöke:
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract).
STACS 1997: 511-522 |
| 1996 |
|---|
| 6 | | Rainer Feldmann,
Peter Mysliwietz:
The Shuffle Exchange Network has a Hamiltonian Path.
Mathematical Systems Theory 29(5): 471-485 (1996) |
| 1994 |
|---|
| 5 | EE | Rainer Feldmann,
Peter Mysliwietz,
Burkhard Monien:
Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation.
SPAA 1994: 94-103 |
| 4 | | Rainer Feldmann,
Juraj Hromkovic,
Seshu Madhavapeddy,
Burkhard Monien,
Peter Mysliwietz:
Optimal algorithms for dissemination of information in generalized communication modes.
Discrete Applied Mathematics 53(1-3): 55-78 (1994) |
| 1992 |
|---|
| 3 | | Rainer Feldmann,
Peter Mysliwietz,
Burkhard Monien:
Distributed Game Tree Search on a Massively Parallel System.
Data Structures and Efficient Algorithms 1992: 270-288 |
| 2 | | Rainer Feldmann,
Peter Mysliwietz:
The Shuffle Exchange Network has a Hamiltonian Path.
MFCS 1992: 246-254 |
| 1 | | Rainer Feldmann,
Juraj Hromkovic,
Seshu Madhavapeddy,
Burkhard Monien,
Peter Mysliwietz:
Optimal Algorithms for Disemination of Information in Generalized Communication Modes.
PARLE 1992: 115-130 |
