Search the dblp DataBase
Martin Dietzfelbinger :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Martin Dietzfelbinger , Anna R. Karlin , Kurt Mehlhorn , Friedhelm Meyer auf der Heide , Hans Rohnert , Robert Endre Tarjan Dynamic Perfect Hashing: Upper and Lower Bounds [Citation Graph (4, 0)][DBLP ] FOCS, 1988, pp:524-531 [Conf ] Martin Dietzfelbinger , Torben Hagerup , Jyrki Katajainen , Martti Penttonen A Reliable Randomized Algorithm for the Closest-Pair Problem. [Citation Graph (1, 0)][DBLP ] J. Algorithms, 1997, v:25, n:1, pp:19-51 [Journal ] Martin Dietzfelbinger , Wolfgang Maass two Lower Bound Arguments with "Inaccessible" Numbers. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1986, pp:163-183 [Conf ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide High Performance Universal Hashing, with Applications to Shared Memory Simulations. [Citation Graph (0, 0)][DBLP ] Data Structures and Efficient Algorithms, 1992, pp:250-269 [Conf ] Martin Dietzfelbinger , Torben Hagerup Simple Minimal Perfect Hashing in Less Space. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:109-120 [Conf ] Martin Dietzfelbinger Simulations Between Different Models of Parallel Computers. [Citation Graph (0, 0)][DBLP ] FCT, 1993, pp:16-30 [Conf ] Martin Dietzfelbinger , Martin Hühne Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1994, pp:24-35 [Conf ] Martin Dietzfelbinger Lower Bounds for Sorting of Sums. [Citation Graph (0, 0)][DBLP ] ICALP, 1987, pp:457-466 [Conf ] Martin Dietzfelbinger , Joseph Gil , Yossi Matias , Nicholas Pippenger Polynomial Hash Functions Are Reliable (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1992, pp:235-246 [Conf ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. [Citation Graph (0, 0)][DBLP ] ICALP, 1990, pp:6-19 [Conf ] Martin Dietzfelbinger , Wolfgang Maass The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. [Citation Graph (0, 0)][DBLP ] ICALP, 1988, pp:188-200 [Conf ] Martin Dietzfelbinger , Christoph Weidling Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:166-178 [Conf ] Martin Dietzfelbinger The Probability of a Rendezvous is Minimal in Complete Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2002, pp:55-66 [Conf ] Holger Bast , Martin Dietzfelbinger , Torben Hagerup A Perfect Parallel Dictionary. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:133-141 [Conf ] Martin Dietzfelbinger , Juraj Hromkovic , Georg Schnitger A Comparison of Two Lower Bound Methods for Communication Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1994, pp:326-335 [Conf ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide An Optimal Parallel Dictionary. [Citation Graph (0, 0)][DBLP ] SPAA, 1989, pp:360-368 [Conf ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide Simple, Efficient Shared Memory Simulations. [Citation Graph (0, 0)][DBLP ] SPAA, 1993, pp:110-119 [Conf ] Martin Dietzfelbinger , Miroslaw Kutylowski , Rüdiger Reischuk Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. [Citation Graph (0, 0)][DBLP ] SPAA, 1990, pp:125-135 [Conf ] Martin Dietzfelbinger Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:569-580 [Conf ] Martin Dietzfelbinger Gossiping and Broadcasting versus Computing Functions in Networks. [Citation Graph (0, 0)][DBLP ] STACS, 1997, pp:189-200 [Conf ] Noga Alon , Martin Dietzfelbinger , Peter Bro Miltersen , Erez Petrank , Gábor Tardos Is Linear Hashing Good? [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:465-474 [Conf ] Martin Dietzfelbinger The Linear-Array Problem in Communication Complexity Resolved. [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:373-382 [Conf ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide How to Distribute a Dictionary in a Complete Network [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:117-127 [Conf ] Martin Dietzfelbinger , Philipp Woelfel Almost random graphs with simple hash functions. [Citation Graph (0, 0)][DBLP ] STOC, 2003, pp:629-638 [Conf ] Martin Dietzfelbinger , Kurt Mehlhorn , Friedhelm Meyer auf der Heide , Hans Rohnert Upper and Lower Bounds for the Dictionary Problem (Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1988, pp:214-215 [Conf ] Martin Dietzfelbinger , Martin Hühne Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1999, v:8, n:4, pp:371-392 [Journal ] Martin Dietzfelbinger Gossiping and broadcasting versus computing functions in networks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:137, n:2, pp:127-153 [Journal ] Martin Dietzfelbinger , Manfred Kunde A case against using Stirling's formula (unless you really need it). [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2003, v:80, n:, pp:153-158 [Journal ] Martin Dietzfelbinger , Miroslaw Kutylowski , Rüdiger Reischuk Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:4, pp:- [Journal ] Martin Dietzfelbinger Gossiping and Broadcasting versus Computing Functions in Networks [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:52, pp:- [Journal ] Martin Dietzfelbinger The Linear-Array Problem in Communication Complexity Resolved [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:63, pp:- [Journal ] Martin Dietzfelbinger , Anna Gambin , Slawomir Lasota On Different Models for Packet Flow in Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2001, v:46, n:4, pp:287-314 [Journal ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide An Optimal Parallel Dictionary [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1993, v:102, n:2, pp:196-217 [Journal ] Martin Dietzfelbinger The Speed of Copying on One-Tape Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:33, n:2, pp:83-89 [Journal ] Martin Dietzfelbinger , Henning Wunderlich A characterization of average case communication complexity. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:101, n:6, pp:245-249 [Journal ] Noga Alon , Martin Dietzfelbinger , Peter Bro Miltersen , Erez Petrank , Gábor Tardos Linear Hash Functions. [Citation Graph (0, 0)][DBLP ] J. ACM, 1999, v:46, n:5, pp:667-683 [Journal ] Martin Dietzfelbinger , Miroslaw Kutylowski , Rüdiger Reischuk Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1994, v:48, n:2, pp:231-254 [Journal ] Martin Dietzfelbinger , Wolfgang Maass Lower Bound Arguments with "Inaccessible" Numbers. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1988, v:36, n:3, pp:313-335 [Journal ] Martin Dietzfelbinger , Hisao Tamaki On the probability of rendezvous in graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2005, v:26, n:3, pp:266-288 [Journal ] Martin Dietzfelbinger , Anna R. Karlin , Kurt Mehlhorn , Friedhelm Meyer auf der Heide , Hans Rohnert , Robert Endre Tarjan Dynamic Perfect Hashing: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:4, pp:738-761 [Journal ] Martin Dietzfelbinger , Miroslaw Kutylowski , Rüdiger Reischuk Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1996, v:25, n:6, pp:1196-123 [Journal ] Martin Dietzfelbinger Lower Bounds for Sorting of Sums. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1989, v:66, n:2, pp:137-155 [Journal ] Martin Dietzfelbinger , Juraj Hromkovic , Georg Schnitger A Comparison of Two Lower-Bound Methods for Communication Complexity. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:168, n:1, pp:39-51 [Journal ] Martin Dietzfelbinger , Wolfgang Maass The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:108, n:2, pp:271-290 [Journal ] Martin Dietzfelbinger , Wolfgang Maass , Georg Schnitger The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:82, n:1, pp:113-129 [Journal ] Martin Dietzfelbinger , Bart Naudts , Clarissa Van Hoyweghen , Ingo Wegener The analysis of a recombinative hill-climber on H-IFF. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Evolutionary Computation, 2003, v:7, n:5, pp:417-423 [Journal ] Martin Dietzfelbinger Design Strategies for Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP ] SAGA, 2007, pp:2-17 [Conf ] Martin Dietzfelbinger , Christoph Weidling Balanced allocation and dictionaries with tightly packed constant size bins. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:380, n:1-2, pp:47-68 [Journal ] 07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. [Citation Graph (, )][DBLP ] Experimental Variations of a Theoretically Good Retrieval Data Structure. [Citation Graph (, )][DBLP ] Hash, Displace, and Compress. [Citation Graph (, )][DBLP ] Precision, local search and unimodal functions. [Citation Graph (, )][DBLP ] Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). [Citation Graph (, )][DBLP ] Applications of a Splitting Trick. [Citation Graph (, )][DBLP ] Tight Thresholds for Cuckoo Hashing via XORSAT. [Citation Graph (, )][DBLP ] Perfect Hashing for State Spaces in BDD Representation. [Citation Graph (, )][DBLP ] Brief announcement: tight lower bounds for greedy routing in uniform small world rings. [Citation Graph (, )][DBLP ] On risks of using cuckoo hashing with simple universal hash classes. [Citation Graph (, )][DBLP ] Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. [Citation Graph (, )][DBLP ] Three disjoint path paradigms in star networks. [Citation Graph (, )][DBLP ] Tight Bounds for Blind Search on the Integers. [Citation Graph (, )][DBLP ] Tight lower bounds for greedy routing in uniform small world rings. [Citation Graph (, )][DBLP ] Tight Bounds for Blind Search on the Integers [Citation Graph (, )][DBLP ] Succinct Data Structures for Retrieval and Approximate Membership [Citation Graph (, )][DBLP ] Tight Thresholds for Cuckoo Hashing via XORSAT [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.510secs