![]() | ![]() |
| 2008 | ||
|---|---|---|
| 9 | Martin Dietzfelbinger, Martin Hühne, Christoph Weidling: A dictionary implementation based on dynamic perfect hashing. ACM Journal of Experimental Algorithmics 12: (2008) | |
| 1999 | ||
| 8 | Martin Dietzfelbinger, Martin Hühne: Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. Computational Complexity 8(4): 371-392 (1999) | |
| 1997 | ||
| 7 | Thomas Hofmeister, Martin Hühne: Semidefinite Programming and Its Applications to Approximation Algorithms. Lectures on Proof Verification and Approximation Algorithms 1997: 263-298 | |
| 1996 | ||
| 6 | Martin Hühne: Concrete complexity theory - studies of the impact of the capabilities of the storage device on the efficiency of computations. Shaker 1996: I-II, 1-123 | |
| 1995 | ||
| 5 | Martin Hühne: The Hedge: An Efficient Storage Device for Turing Machines with One Head (Extended Abstract). MFCS 1995: 247-256 | |
| 4 | Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický: On the Average Case Circuit Delay of Disjunction. Parallel Processing Letters 5: 275-280 (1995) | |
| 1994 | ||
| 3 | Martin Dietzfelbinger, Martin Hühne: Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. FSTTCS 1994: 24-35 | |
| 1993 | ||
| 2 | Martin Hühne: Linear Speed-Up Does not Hold on Turing Machines with Tree Storages. Inf. Process. Lett. 47(6): 313-318 (1993) | |
| 1 | Martin Hühne: On the Power of Several Queues. Theor. Comput. Sci. 113(1): 75-91 (1993) | |
| 1 | Beate Bollig | [4] |
| 2 | Martin Dietzfelbinger | [3] [8] [9] |
| 3 | Thomas Hofmeister | [7] |
| 4 | Stefan Pölt | [4] |
| 5 | Petr Savický | [4] |
| 6 | Christoph Weidling | [9] |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page