 | 2009 |
|---|
| 120 |       | Michael Mitzenmacher:
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009
ACM 2009 |
| 119 |  | Alan M. Frieze,
Páll Melsted,
Michael Mitzenmacher:
An Analysis of Random-Walk Cuckoo Hashing.
APPROX-RANDOM 2009: 490-503 |
| 118 | | Michael Mitzenmacher:
Some Open Questions Related to Cuckoo Hashing.
ESA 2009: 1-10 |
| 117 | | Flavio Chierichetti,
Ravi Kumar,
Silvio Lattanzi,
Michael Mitzenmacher,
Alessandro Panconesi,
Prabhakar Raghavan:
On compressing social networks.
KDD 2009: 219-228 |
| 116 | | Adam Kirsch,
Michael Mitzenmacher,
Andrea Pietracaprina,
Geppino Pucci,
Eli Upfal,
Fabio Vandin:
An efficient rigorous approach for identifying statistically significant frequent itemsets.
PODS 2009: 117-126 |
| 115 | | Michael Mitzenmacher:
Bloom Filters.
Encyclopedia of Database Systems 2009: 252-255 |
| 114 | | Jay Kumar Sundararajan,
Szymon Jakubczak,
Muriel Médard,
Michael Mitzenmacher,
João Barros:
Interfacing network coding with TCP: an implementation
CoRR abs/0908.1564: (2009) |
| 2008 |
|---|
| 113 | | Adam Kirsch,
Michael Mitzenmacher,
Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash.
ESA 2008: 611-622 |
| 112 | | Adam Kirsch,
Michael Mitzenmacher:
The Power of One Move: Hashing Schemes for Hardware.
INFOCOM 2008: 106-110 |
| 111 | | Andrei Z. Broder,
Adam Kirsch,
Ravi Kumar,
Michael Mitzenmacher,
Eli Upfal,
Sergei Vassilvitskii:
The hiring problem and Lake Wobegon strategies.
SODA 2008: 1184-1193 |
| 110 | | Thomas Holenstein,
Michael Mitzenmacher,
Rina Panigrahy,
Udi Wieder:
Trace reconstruction with constant deletion probability and related results.
SODA 2008: 389-398 |
| 109 | | Michael Mitzenmacher,
Salil P. Vadhan:
Why simple hash functions work: exploiting the entropy in a data stream.
SODA 2008: 746-755 |
| 108 | | Michael Mitzenmacher:
A Survey of Results for Deletion Channels and Related Synchronization Channels.
SWAT 2008: 1-3 |
| 107 | | Jay Kumar Sundararajan,
Devavrat Shah,
Muriel Médard,
Michael Mitzenmacher,
João Barros:
Network coding meets TCP
CoRR abs/0809.5022: (2008) |
| 106 | | Michael Mitzenmacher:
Capacity Bounds for Sticky Channels.
IEEE Transactions on Information Theory 54(1): 72-77 (2008) |
| 105 | | Adam Kirsch,
Michael Mitzenmacher:
Simple summaries for hashing with choices.
IEEE/ACM Trans. Netw. 16(1): 218-231 (2008) |
| 104 | | Adam Kirsch,
Michael Mitzenmacher:
Less hashing, same performance: Building a better Bloom filter.
Random Struct. Algorithms 33(2): 187-218 (2008) |
| 2007 |
|---|
| 103 | | Sailesh Kumar,
Jonathan S. Turner,
Patrick Crowley,
Michael Mitzenmacher:
HEXA: Compact Data Structures for Faster Packet Processing.
ICNP 2007: 246-255 |
| 102 | | Marios Iliofotou,
Prashanth Pappu,
Michalis Faloutsos,
Michael Mitzenmacher,
Sumeet Singh,
George Varghese:
Network monitoring using traffic dispersion graphs (tdgs).
Internet Measurement Comference 2007: 315-320 |
| 101 | | Eleni 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 |
|---|
| 100 | | Adam Kirsch,
Michael Mitzenmacher:
Less Hashing, Same Performance: Building a Better Bloom Filter.
ESA 2006: 456-467 |
| 99 | | Evdokia Nikolova,
Jonathan A. Kelner,
Matthew Brand,
Michael Mitzenmacher:
Stochastic Shortest Paths Via Quasi-convex Maximization.
ESA 2006: 552-563 |
| 98 | | Flavio Bonomi,
Michael Mitzenmacher,
Rina Panigrahy,
Sushil Singh,
George Varghese:
An Improved Construction for Counting Bloom Filters.
ESA 2006: 684-695 |
| 97 | | Peter R. Pietzuch,
Jonathan Ledlie,
Michael Mitzenmacher,
Margo I. Seltzer:
Network-Aware Overlays with Network Coordinates.
ICDCS Workshops 2006: 12 |
| 96 | | Flavio Bonomi,
Michael Mitzenmacher,
Rina Panigrahy,
Sushil Singh,
George Varghese:
Beyond bloom filters: from approximate membership checks to approximate state machines.
SIGCOMM 2006: 315-326 |
| 95 | | Eleni Drinea,
Michael Mitzenmacher:
On Lower Bounds for the Capacity of Deletion Channels.
IEEE Transactions on Information Theory 52(10): 4648-4657 (2006) |
| 94 | | Michael Mitzenmacher,
Eleni Drinea:
A Simple Lower Bound for the Capacity of the Deletion Channel.
IEEE Transactions on Information Theory 52(10): 4657-4660 (2006) |
| 93 | | Michael 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) |
| 92 | | John W. Byers,
Gu-In Kwon,
Michael Luby,
Michael Mitzenmacher:
Fine-grained layered multicast with STAIR.
IEEE/ACM Trans. Netw. 14(1): 81-93 (2006) |
| 91 | | Neal Lesh,
Michael Mitzenmacher:
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms.
Inf. Process. Lett. 97(4): 161-169 (2006) |
| 90 | | Joan Feigenbaum,
Michael Mitzenmacher:
Towards a theory of networked computation.
SIGACT News 37(4): 22-26 (2006) |
| 2005 |
|---|
| 89 | | Yan-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 |
| 87 | | Jimming Cheng,
Michael Mitzenmacher:
The Markov Expert for Finding Episodes in Time Series.
DCC 2005: 454 |
| 86 | | Michael Mitzenmacher:
Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks.
DISC 2005: 1 |
| 85 | | Andrei Z. Broder,
Michael Mitzenmacher:
Multidimensional balanced allocations.
SODA 2005: 195-196 |
| 84 | | Neal Lesh,
Joe Marks,
A. McMahon,
Michael Mitzenmacher:
New heuristic and interactive approaches to 2D rectangular strip packing.
ACM Journal of Experimental Algorithmics 10: (2005) |
| 83 | | Subhasish Mitra,
Steven S. Lumetta,
Michael Mitzenmacher,
Nishant Patil:
X-Tolerant Test Response Compaction.
IEEE Design & Test of Computers 22(6): 566-574 (2005) |
| 82 | | Michael 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 |
|---|
| 80 | | Neal Lesh,
Michael Mitzenmacher:
Interactive data summarization: an example application.
AVI 2004: 183-187 |
| 79 | | Subhasish Mitra,
Steven S. Lumetta,
Michael Mitzenmacher:
X-Tolerant Signature Analysis.
ITC 2004: 432-441 |
| 78 | | John W. Byers,
Jeffrey Considine,
Michael Mitzenmacher:
Geometric generalizations of the power of two choices.
SPAA 2004: 54-63 |
| 77 | | Michael 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) |
| 74 | | John W. Byers,
Jeffrey Considine,
Michael Mitzenmacher,
Stanislav Rost:
Informed content delivery across adaptive overlay networks.
IEEE/ACM Trans. Netw. 12(5): 767-780 (2004) |
| 73 | | Neal Lesh,
Joe Marks,
A. McMahon,
Michael Mitzenmacher:
Exhaustive approaches to 2D rectangular perfect packings.
Inf. Process. Lett. 90(1): 7-14 (2004) |
| 2003 |
|---|
| 72 | | Frederic H. Behr,
Victoria Fossum,
Michael Mitzenmacher,
David Xiao:
Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression.
DCC 2003: 416 |
| 71 | | John W. Byers,
Jeffrey Considine,
Michael Mitzenmacher:
Simple Load Balancing for Distributed Hash Tables.
IPTPS 2003: 80-87 |
| 70 | | Neal 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) |
| 65 | | Andrei 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 |
| 63 | | Michael Mitzenmacher,
Balaji Prabhakar,
Devavrat Shah:
Load Balancing with Memory.
FOCS 2002: 799-808 |
| 62 | | Ashish Goel,
Michael Mitzenmacher:
Exact sampling of TCP Window States.
INFOCOM 2002 |
| 61 | | Andrei Z. Broder,
Michael Mitzenmacher:
Optmial plans for aggregation.
PODC 2002: 144-152 |
| 60 | | John W. Byers,
Jeffrey Considine,
Michael Mitzenmacher,
Stanislav Rost:
Informed content delivery across adaptive overlay networks.
SIGCOMM 2002: 47-60 |
| 59 | | Eleni Drinea,
Alan M. Frieze,
Michael Mitzenmacher:
Balls and bins models with feedback.
SODA 2002: 308-315 |
| 58 | | Michael Mitzenmacher:
Compressed bloom filters.
IEEE/ACM Trans. Netw. 10(5): 604-612 (2002) |
| 57 | | Claire Kenyon,
Michael Mitzenmacher:
Linear waste of best fit bin packing on skewed distributions.
Random Struct. Algorithms 20(3): 441-464 (2002) |
| 2001 |
|---|
| 56 | | Michael Mitzenmacher,
Sean Owen:
Estimating Resemblance of MIDI Documents.
ALENEX 2001: 78-90 |
| 55 | | Micah Adler,
Michael Mitzenmacher:
Towards Compressing Web Graphs.
Data Compression Conference 2001: 203-212 |
| 54 | | Michael Mitzenmacher:
On the Hardness of Finding Optimal Multiple Preset Dictionaries.
Data Compression Conference 2001: 411- |
| 53 | | John W. Byers,
Michael Luby,
Michael Mitzenmacher:
Fine-Grained Layered Multicast.
INFOCOM 2001: 1143-1151 |
| 52 | | Andrei Z. Broder,
Michael Mitzenmacher:
Using Multiple Hash Functions to Improve IP Lookups.
INFOCOM 2001: 1454-1463 |
| 51 | | Michael Mitzenmacher:
Compressed bloom filters.
PODC 2001: 144-150 |
| 50 | | Justin A. Boyan,
Michael Mitzenmacher:
IMproved results for route planning in stochastic transportation.
SODA 2001: 895-902 |
| 49 | | Michael 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) |
| 46 | | Susanne 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) |
| 44 | | Eli 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) |
| 42 | | Michael 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 |
| 39 | | Andrei Z. Broder,
Robert Krauthgamer,
Michael Mitzenmacher:
Improved classification via connectivity information.
SODA 2000: 576-585 |
| 38 | | Martin 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 |
| 37 | | Monika Rauch Henzinger,
Allan Heydon,
Michael Mitzenmacher,
Marc Najork:
On near-uniform URL sampling.
Computer Networks 33(1-6): 295-308 (2000) |
| 36 | | Michael 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) |
| 33 | | Martin 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 |
| 31 | | Eli 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 |
| 29 | | Andrei 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) |
| 27 | | Monika 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) |
| 26 | | Michael Mitzenmacher:
On the Analysis of Randomized Load Balancing Schemes.
Theory Comput. Syst. 32(3): 361-386 (1999) |
| 1998 |
|---|
| 25 | | Susanne Albers,
Moses Charikar,
Michael Mitzenmacher:
Delayed Information and Action in On-line Algorithms.
FOCS 1998: 71-81 |
| 24 | | Richard 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 |
| 23 | | Andrei Z. Broder,
Moses Charikar,
Michael Mitzenmacher:
A Derandomization Using Min-Wise Independent Permutations.
RANDOM 1998: 15-24 |
| 22 | | John 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 |
| 19 | | Michael Mitzenmacher:
Analyses of Load Stealing Models Based on Differential Equations.
SPAA 1998: 212-221 |
| 18 | | Michael Luby,
Michael Mitzenmacher,
Mohammad Amin Shokrollahi,
Daniel A. Spielman:
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs.
STOC 1998: 249-258 |
| 17 | | Andrei Z. Broder,
Moses Charikar,
Alan M. Frieze,
Michael Mitzenmacher:
Min-Wise Independent Permutations (Extended Abstract).
STOC 1998: 327-336 |
| 16 | | Richard 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 |
| 12 | | Michael Mitzenmacher:
On the Analysis of Randomized Load Balancing Schemes.
SPAA 1997: 292-301 |
| 11 | | Michael Luby,
Michael Mitzenmacher,
Mohammad Amin Shokrollahi,
Daniel A. Spielman,
Volker Stemann:
Practical Loss-Resilient Codes.
STOC 1997: 150-159 |
| 10 | | Michael Mitzenmacher:
Constant Time per Edge is Optimal on Rooted Tree Networks.
Distributed Computing 10(4): 189-197 (1997) |
| 9 | | Susanne 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 |
|---|
| 3 | | Micah Adler,
Soumen Chakrabarti,
Michael Mitzenmacher,
Lars Eilstrup Rasmussen:
Parallel randomized load balancing (Preliminary Version).
STOC 1995: 238-247 |
| 1994 |
|---|
| 2 | | Michael 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) |
