Authors: DIETZFELBINGER M HAGERUP T KATAJAINEN J PENTTONEN M

Citation: M. Dietzfelbinger et al., A RELIABLE RANDOMIZED ALGORITHM FOR THE CLOSEST-PAIR PROBLEM, Journal of algorithms, 25(1), 1997, pp. 19-51

Authors: DIETZFELBINGER M HROMKOVIC J SCHNITGER G

Citation: M. Dietzfelbinger et al., A COMPARISON OF 2 LOWER-BOUND METHODS FOR COMMUNICATION COMPLEXITY, Theoretical computer science, 168(1), 1996, pp. 39-51

Authors: DIETZFELBINGER M KUTYLOWSKI M REISCHUK R

Citation: M. Dietzfelbinger et al., FEASIBLE TIME-OPTIMAL ALGORITHMS FOR BOOLEAN FUNCTIONS ON EXCLUSIVE-WRITE PARALLEL RANDOM-ACCESS MACHINES, SIAM journal on computing, 25(6), 1996, pp. 1196-1230

Authors: DIETZFELBINGER M KARLIN A MEHLHORN K AUFDERHEIDE FM ROHNERT H TARJAN RE

Citation: M. Dietzfelbinger et al., DYNAMIC PERFECT HASHING - UPPER AND LOWER BOUNDS, SIAM journal on computing, 23(4), 1994, pp. 738-761

Authors: DIETZFELBINGER M KUTYLOWSKI M REISCHUK R

Citation: M. Dietzfelbinger et al., EXACT LOWER TIME-BOUNDS FOR COMPUTING BOOLEAN FUNCTIONS ON CREW PRAMS, Journal of computer and system sciences, 48(2), 1994, pp. 231-254