| |
| 1986 | ||
|---|---|---|
| 3 | Thomas M. Fischer: Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional Space. MFCS 1986: 308-314 | |
| 2 | Thomas M. Fischer, K. Wolfrum: On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional Space. MFCS 1986: 315-324 | |
| 1979 | ||
| 1 | Thomas M. Fischer: On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities. MFCS 1979: 284-291 | |
| 1 | K. Wolfrum | [2] |