dblp.uni-trier.dewww.uni-trier.de

Michael Mitzenmacher

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
113EEAdam Kirsch, Michael Mitzenmacher, Udi Wieder: More Robust Hashing: Cuckoo Hashing with a Stash. ESA 2008: 611-622
112EEAdam Kirsch, Michael Mitzenmacher: The Power of One Move: Hashing Schemes for Hardware. INFOCOM 2008: 106-110
111EEAndrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193
110EEThomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder: Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398
109EEMichael Mitzenmacher, Salil P. Vadhan: Why simple hash functions work: exploiting the entropy in a data stream. SODA 2008: 746-755
108EEMichael Mitzenmacher: A Survey of Results for Deletion Channels and Related Synchronization Channels. SWAT 2008: 1-3
107EEJay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros: Network coding meets TCP CoRR abs/0809.5022: (2008)
106EEMichael Mitzenmacher: Capacity Bounds for Sticky Channels. IEEE Transactions on Information Theory 54(1): 72-77 (2008)
105EEAdam Kirsch, Michael Mitzenmacher: Simple summaries for hashing with choices. IEEE/ACM Trans. Netw. 16(1): 218-231 (2008)
104EEAdam Kirsch, Michael Mitzenmacher: Less hashing, same performance: Building a better Bloom filter. Random Struct. Algorithms 33(2): 187-218 (2008)
2007
103EESailesh Kumar, Jonathan S. Turner, Patrick Crowley, Michael Mitzenmacher: HEXA: Compact Data Structures for Faster Packet Processing. ICNP 2007: 246-255
102EEMarios Iliofotou, Prashanth Pappu, Michalis Faloutsos, Michael Mitzenmacher, Sumeet Singh, George Varghese: Network monitoring using traffic dispersion graphs (tdgs). Internet Measurement Comference 2007: 315-320
101EEEleni Drinea, Michael Mitzenmacher: Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels. IEEE Transactions on Information Theory 53(8): 2693-2714 (2007)
2006
100EEAdam Kirsch, Michael Mitzenmacher: Less Hashing, Same Performance: Building a Better Bloom Filter. ESA 2006: 456-467
99EEEvdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher: Stochastic Shortest Paths Via Quasi-convex Maximization. ESA 2006: 552-563
98EEFlavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese: An Improved Construction for Counting Bloom Filters. ESA 2006: 684-695
97EEPeter R. Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, Margo I. Seltzer: Network-Aware Overlays with Network Coordinates. ICDCS Workshops 2006: 12
96EEFlavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese: Beyond bloom filters: from approximate membership checks to approximate state machines. SIGCOMM 2006: 315-326
95EEEleni Drinea, Michael Mitzenmacher: On Lower Bounds for the Capacity of Deletion Channels. IEEE Transactions on Information Theory 52(10): 4648-4657 (2006)
94EEMichael Mitzenmacher, Eleni Drinea: A Simple Lower Bound for the Capacity of the Deletion Channel. IEEE Transactions on Information Theory 52(10): 4657-4660 (2006)
93EEMichael Mitzenmacher: Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q. IEEE Transactions on Information Theory 52(12): 5496-5501 (2006)
92EEJohn W. Byers, Gu-In Kwon, Michael Luby, Michael Mitzenmacher: Fine-grained layered multicast with STAIR. IEEE/ACM Trans. Netw. 14(1): 81-93 (2006)
91EENeal Lesh, Michael Mitzenmacher: BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. Inf. Process. Lett. 97(4): 161-169 (2006)
90EEJoan Feigenbaum, Michael Mitzenmacher: Towards a theory of networked computation. SIGACT News 37(4): 22-26 (2006)
2005
89EEYan-Cheng Chang, Michael Mitzenmacher: Privacy Preserving Keyword Searches on Remote Encrypted Data. ACNS 2005: 442-455
88 Markus Chimani, Neal Lesh, Michael Mitzenmacher, Candy L. Sidner, Hidetoshi Tanaka: A Case Study in Large-Scale Interactive Optimization. Artificial Intelligence and Applications 2005: 24-29
87EEJimming Cheng, Michael Mitzenmacher: The Markov Expert for Finding Episodes in Time Series. DCC 2005: 454
86EEMichael Mitzenmacher: Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. DISC 2005: 1
85EEAndrei Z. Broder, Michael Mitzenmacher: Multidimensional balanced allocations. SODA 2005: 195-196
84EENeal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher: New heuristic and interactive approaches to 2D rectangular strip packing. ACM Journal of Experimental Algorithmics 10: (2005)
83EESubhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher, Nishant Patil: X-Tolerant Test Response Compaction. IEEE Design & Test of Computers 22(6): 566-574 (2005)
82EEMichael Luby, Michael Mitzenmacher: Verification-based decoding for packet-based low-density parity-check codes. IEEE Transactions on Information Theory 51(1): 120-127 (2005)
81 Michael Mitzenmacher: Editorial: The Future of Power Law Research. Internet Mathematics 2(4): (2005)
2004
80EENeal Lesh, Michael Mitzenmacher: Interactive data summarization: an example application. AVI 2004: 183-187
79EESubhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher: X-Tolerant Signature Analysis. ITC 2004: 432-441
78EEJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher: Geometric generalizations of the power of two choices. SPAA 2004: 54-63
77EEMichael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer: A Scaling Result for Explosive Processes. Electr. J. Comb. 11(1): (2004)
76 Brian Conrad, Michael Mitzenmacher: Power laws for monkeys typing randomly: the case of unequal probabilities. IEEE Transactions on Information Theory 50(7): 1403-1414 (2004)
75 Michael Mitzenmacher: On the hardness of finding optimal multiple preset dictionaries. IEEE Transactions on Information Theory 50(7): 1536-1539 (2004)
74EEJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost: Informed content delivery across adaptive overlay networks. IEEE/ACM Trans. Netw. 12(5): 767-780 (2004)
73EENeal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher: Exhaustive approaches to 2D rectangular perfect packings. Inf. Process. Lett. 90(1): 7-14 (2004)
2003
72EEFrederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao: Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. DCC 2003: 416
71EEJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher: Simple Load Balancing for Distributed Hash Tables. IPTPS 2003: 80-87
70EENeal Lesh, Michael Mitzenmacher, Sue Whitesides: A complete and effective move set for simplified protein folding. RECOMB 2003: 188-195
69 Aleksandar Kavcic, Xiao Ma, Michael Mitzenmacher: Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. IEEE Transactions on Information Theory 49(7): 1636-1652 (2003)
68 Michael Mitzenmacher: A Brief History of Generative Models for Power Law and Lognormal Distributions. Internet Mathematics 1(2): (2003)
67 Michael Mitzenmacher: Dynamic Models for File Sizes and Double Pareto Distributions. Internet Mathematics 1(3): (2003)
66 Andrei Z. Broder, Michael Mitzenmacher: Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1(4): (2003)
65EEAndrei Z. Broder, Moses Charikar, Michael Mitzenmacher: A derandomization using min-wise independent permutations. J. Discrete Algorithms 1(1): 11-20 (2003)
2002
64 Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher: Human-Guided Tabu Search. AAAI/IAAI 2002: 41-47
63EEMichael Mitzenmacher, Balaji Prabhakar, Devavrat Shah: Load Balancing with Memory. FOCS 2002: 799-808
62EEAshish Goel, Michael Mitzenmacher: Exact sampling of TCP Window States. INFOCOM 2002
61EEAndrei Z. Broder, Michael Mitzenmacher: Optmial plans for aggregation. PODC 2002: 144-152
60EEJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost: Informed content delivery across adaptive overlay networks. SIGCOMM 2002: 47-60
59EEEleni Drinea, Alan M. Frieze, Michael Mitzenmacher: Balls and bins models with feedback. SODA 2002: 308-315
58EEMichael Mitzenmacher: Compressed bloom filters. IEEE/ACM Trans. Netw. 10(5): 604-612 (2002)
57EEClaire Kenyon, Michael Mitzenmacher: Linear waste of best fit bin packing on skewed distributions. Random Struct. Algorithms 20(3): 441-464 (2002)
2001
56EEMichael Mitzenmacher, Sean Owen: Estimating Resemblance of MIDI Documents. ALENEX 2001: 78-90
55EEMicah Adler, Michael Mitzenmacher: Towards Compressing Web Graphs. Data Compression Conference 2001: 203-212
54EEMichael Mitzenmacher: On the Hardness of Finding Optimal Multiple Preset Dictionaries. Data Compression Conference 2001: 411-
53EEJohn W. Byers, Michael Luby, Michael Mitzenmacher: Fine-Grained Layered Multicast. INFOCOM 2001: 1143-1151
52EEAndrei Z. Broder, Michael Mitzenmacher: Using Multiple Hash Functions to Improve IP Lookups. INFOCOM 2001: 1454-1463
51EEMichael Mitzenmacher: Compressed bloom filters. PODC 2001: 144-150
50EEJustin A. Boyan, Michael Mitzenmacher: IMproved results for route planning in stochastic transportation. SODA 2001: 895-902
49EEMichael Mitzenmacher: The Power of Two Choices in Randomized Load Balancing. IEEE Trans. Parallel Distrib. Syst. 12(10): 1094-1104 (2001)
48 Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Efficient erasure correcting codes. IEEE Transactions on Information Theory 47(2): 569-584 (2001)
47 Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Improved low-density parity-check codes using irregular graphs. IEEE Transactions on Information Theory 47(2): 585-598 (2001)
46EESusanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-Line Algorithms. Inf. Comput. 170(2): 135-152 (2001)
45 Andrei Z. Broder, Michael Mitzenmacher: Completeness and robustness properties of min-wise independent permutations. Random Struct. Algorithms 18(1): 18-30 (2001)
44EEEli Gafni, Michael Mitzenmacher: Analysis of Timing-Based Mutual Exclusion with Random Times. SIAM J. Comput. 31(3): 816-837 (2001)
43 Michael Mitzenmacher, Rajmohan Rajaraman: Towards More Complete Models of TCP Latency and Throughput. The Journal of Supercomputing 20(2): 137-160 (2001)
42EEMichael Mitzenmacher: Analyses of Load Stealing Models Based on Families of Differential Equations. Theory Comput. Syst. 34(1): 77-98 (2001)
2000
41 Claire Kenyon, Michael Mitzenmacher: Linear Waste of Best Fit Bin Packing on Skewed Distributions. FOCS 2000: 582-589
40 John W. Byers, Michael Frumin, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, Alex Roetter, William Shaver: FLID-DL. Networked Group Communication 2000: 71-81
39EEAndrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher: Improved classification via connectivity information. SODA 2000: 576-585
38EEMartin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher: An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA 2000: 616-624
37EEMonika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork: On near-uniform URL sampling. Computer Networks 33(1-6): 295-308 (2000)
36EEMichael Mitzenmacher: How Useful Is Old Information? IEEE Trans. Parallel Distrib. Syst. 11(1): 6-20 (2000)
35 Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher: Min-Wise Independent Permutations. J. Comput. Syst. Sci. 60(3): 630-659 (2000)
34 Susanne Albers, Michael Mitzenmacher: Average-case analyses of first fit and random fit bin packing. Random Struct. Algorithms 16(3): 240-259 (2000)
33EEMartin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher: An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. 30(6): 1962-1975 (2000)
1999
32 John W. Byers, Michael Luby, Michael Mitzenmacher: Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. INFOCOM 1999: 275-283
31EEEli Gafni, Michael Mitzenmacher: Analysis of Timing-Based Mutual Exclusion with Random Times. PODC 1999: 13-21
30 Andrei Z. Broder, Michael Mitzenmacher: Completeness and Robustness Properties of Min-Wise Independent Permutations. RANDOM-APPROX 1999: 1-10
29EEAndrei Z. Broder, Michael Mitzenmacher, Laurent Moll: Unscrambling Address Lines. SODA 1999: 870-871
28 Michael Mitzenmacher: Studying Balanced Allocations With Differential Equations Combinatorics, Probability & Computing 8(5): (1999)
27EEMonika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork: Measuring Index Quality Using Random Walks on the Web. Computer Networks 31(11-16): 1291-1303 (1999)
26EEMichael Mitzenmacher: On the Analysis of Randomized Load Balancing Schemes. Theory Comput. Syst. 32(3): 361-386 (1999)
1998
25EESusanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-line Algorithms. FOCS 1998: 71-81
24EERichard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal: On Balls and Bins with Deletions. RANDOM 1998: 145-158
23EEAndrei Z. Broder, Moses Charikar, Michael Mitzenmacher: A Derandomization Using Min-Wise Independent Permutations. RANDOM 1998: 15-24
22EEJohn W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege: A Digital Fountain Approach to Reliable Distribution of Bulk Data. SIGCOMM 1998: 56-67
21 Susanne Albers, Michael Mitzenmacher: Average-Case Analyses of First Fit and Random Fit Bin Packing. SODA 1998: 290-299
20 Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi: Analysis of Random Processes via And-Or Tree Evaluation. SODA 1998: 364-373
19EEMichael Mitzenmacher: Analyses of Load Stealing Models Based on Differential Equations. SPAA 1998: 212-221
18EEMichael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. STOC 1998: 249-258
17EEAndrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher: Min-Wise Independent Permutations (Extended Abstract). STOC 1998: 327-336
16EERichard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking: Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: 378-388
15 Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. Algorithmica 21(3): 312-329 (1998)
14 Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen: Parallel randomized load balancing. Random Struct. Algorithms 13(2): 159-188 (1998)
1997
13 Michael Mitzenmacher: How Useful Is Old Information? (Extended Abstract). PODC 1997: 83-91
12EEMichael Mitzenmacher: On the Analysis of Randomized Load Balancing Schemes. SPAA 1997: 292-301
11EEMichael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann: Practical Loss-Resilient Codes. STOC 1997: 150-159
10EEMichael Mitzenmacher: Constant Time per Edge is Optimal on Rooted Tree Networks. Distributed Computing 10(4): 189-197 (1997)
9EESusanne Albers, Michael Mitzenmacher: Revisiting the Counter Algorithms for List Update. Inf. Process. Lett. 64(3): 155-160 (1997)
1996
8 Andrei Z. Broder, Michael Mitzenmacher: Pattern-based Compression of Text Images. Data Compression Conference 1996: 300-309
7 Michael Mitzenmacher: Load Balancing and Density Dependent Jump Markov Processes (extended abstract). FOCS 1996: 213-222
6 Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. ICALP 1996: 514-525
5 Michael Mitzenmacher: Constant Time per Edge is Optimal on Rooted Tree Networks. SPAA 1996: 162-169
4 Michael Mitzenmacher: Bounds on the Greedy Routing Algorithm for Array Networks. J. Comput. Syst. Sci. 53(3): 317-327 (1996)
1995
3EEMicah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen: Parallel randomized load balancing (Preliminary Version). STOC 1995: 238-247
1994
2EEMichael Mitzenmacher: Bounds on the Greedy Routing Algorithm for Array Networks. SPAA 1994: 346-353
1 Graham Louth, Michael Mitzenmacher, Frank Kelly: Computational Complexity of Loss Networks. Theor. Comput. Sci. 125(1): 45-59 (1994)

Coauthor Index

1Micah Adler [3] [14] [55]
2Susanne Albers [6] [9] [15] [21] [25] [34] [46]
3João Barros [107]
4Frederic H. Behr [72]
5Flavio Bonomi [96] [98]
6Justin A. Boyan [50]
7Matthew Brand [99]
8Andrei Z. Broder [8] [17] [23] [29] [30] [35] [39] [45] [52] [61] [65] [66] [85] [111]
9John W. Byers [22] [32] [40] [53] [60] [71] [74] [78] [92]
10Soumen Chakrabarti [3] [14]
11Yan-Cheng Chang [89]
12Moses Charikar [17] [23] [25] [35] [46] [65]
13Jimming Cheng [87]
14Markus Chimani [88]
15Richard Cole [16] [24]
16Brian Conrad [76]
17Jeffrey Considine [60] [71] [74] [78]
18Patrick Crowley [103]
19Eleni Drinea [59] [94] [95] [101]
20Martin E. Dyer [33] [38]
21Michalis Faloutsos [102]
22Joan Feigenbaum [90]
23Victoria Fossum [72]
24Alan M. Frieze [17] [24] [35] [59]
25Michael Frumin [40]
26Eli Gafni [31] [44]
27Ashish Goel [62]
28Leslie Ann Goldberg [33] [38]
29Catherine S. Greenhill [33] [38]
30Friedhelm Meyer auf der Heide [16]
31Monika Rauch Henzinger (Monika Rauch) [27] [37]
32Allan Heydon [27] [37]
33Thomas Holenstein [110]
34Gavin B. Horn [40]
35Marios Iliofotou [102]
36Mark Jerrum [33] [38]
37Aleksandar Kavcic [69]
38Frank Kelly [1]
39Jonathan A. Kelner [99]
40Adam Kirsch [100] [104] [105] [111] [112] [113]
41Gunnar W. Klau [64]
42Robert Krauthgamer [39]
43Ravi Kumar (S. Ravi Kumar) [111]
44Sailesh Kumar [103]
45Gu-In Kwon [92]
46Jonathan Ledlie [97]
47Neal Lesh [64] [70] [73] [80] [84] [88] [91]
48Graham Louth [1]
49Michael Luby [11] [18] [20] [22] [32] [40] [47] [48] [53] [82] [92]
50Steven S. Lumetta (Steven Lumetta) [79] [83]
51Xiao Ma [69]
52Bruce M. Maggs [16] [24]
53Joe Marks [64] [73] [84]
54Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [41] [57]
55A. McMahon [73] [84]
56Muriel Médard [107]
57Subhasish Mitra [79] [83]
58Laurent Moll [29]
59Marc Najork [27] [37]
60Evdokia Nikolova [99]
61Roberto Imbuzeiro Oliveira [77]
62Sean Owen [56]
63Rina Panigrahy [96] [98] [110]
64Prashanth Pappu [102]
65Nishant Patil [83]
66Peter R. Pietzuch [97]
67Balaji Prabhakar [63]
68Rajmohan Rajaraman [43]
69Lars Eilstrup Rasmussen [3] [14]
70Ashutosh Rege [22]
71Andréa W. Richa [16] [24]
72Alex Roetter [40]
73Stanislav Rost [60] [74]
74Klaus Schröder [16]
75Margo I. Seltzer [97]
76Devavrat Shah [63] [107]
77William Shaver [40]
78Mohammad Amin Shokrollahi [11] [18] [20] [47] [48]
79Candy L. Sidner [88]
80Sumeet Singh [102]
81Sushil Singh [96] [98]
82Ramesh K. Sitaraman [16] [24]
83Joel H. Spencer (Joel Spencer) [77]
84Daniel A. Spielman [11] [18] [47] [48]
85Volker Stemann [11]
86Jay Kumar Sundararajan [107]
87Hidetoshi Tanaka [88]
88Jonathan S. Turner [103]
89Eli Upfal [24] [111]
90Salil P. Vadhan [109]
91George Varghese [96] [98] [102]
92Sergei Vassilvitskii [111]
93Berthold Vöcking [16]
94Sue Whitesides [70]
95Udi Wieder [110] [113]
96David Xiao [72]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)