Computational Complexity of Loss Networks. - Graham Louth; Michael Mitzenmacher; Frank Kelly (Theor. Comput. Sci., 1994)

Parallel randomized load balancing (Preliminary Version). - Micah Adler; Soumen Chakrabarti; Michael Mitzenmacher; Lars Eilstrup Rasmussen (STOC, 1995)

Pattern-based Compression of Text Images. - Andrei Z. Broder; Michael Mitzenmacher (Data Compression Conference, 1996)

Load Balancing and Density Dependent Jump Markov Processes (extended abstract). - Michael Mitzenmacher (FOCS, 1996)

Bounds on the Greedy Routing Algorithm for Array Networks. - Michael Mitzenmacher (J. Comput. Syst. Sci., 1996)

Designing stimulating programming assignments for an algorithms course: a collection of exercises based on random graphs. - Michael Mitzenmacher (ACM SIGCSE Bull., 1996)

How Useful Is Old Information? (Extended Abstract). - Michael Mitzenmacher (PODC, 1997)

Practical Loss-Resilient Codes. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman; Volker Stemann (STOC, 1997)

Constant Time per Edge is Optimal on Rooted Tree Networks. - Michael Mitzenmacher (Distributed Comput., 1997)

Revisiting the Counter Algorithms for List Update. - Susanne Albers; Michael Mitzenmacher (Inf. Process. Lett., 1997)

On Balls and Bins with Deletions. - Richard Cole 001; Alan M. Frieze; Bruce M. Maggs; Michael Mitzenmacher; Andréa W. Richa; Ramesh K. Sitaraman; Eli Upfal (RANDOM, 1998)

A Digital Fountain Approach to Reliable Distribution of Bulk Data. - John W. Byers; Michael Luby; Michael Mitzenmacher; Ashutosh Rege (SIGCOMM, 1998)

Analysis of Random Processes via And-Or Tree Evaluation. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi (SODA, 1998)

Analyses of Load Stealing Models Based on Differential Equations. - Michael Mitzenmacher (SPAA, 1998)

Min-Wise Independent Permutations (Extended Abstract). - Andrei Z. Broder; Moses Charikar; Alan M. Frieze; Michael Mitzenmacher (STOC, 1998)

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. - Richard Cole 001; Bruce M. Maggs; Friedhelm Meyer auf der Heide; Michael Mitzenmacher; Andréa W. Richa; Klaus Schröder; Ramesh K. Sitaraman; Berthold Vöcking (STOC, 1998)

Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman (STOC, 1998)

Average Case Analyses of List Update Algorithms, with Applications to Data Compression. - Susanne Albers; Michael Mitzenmacher (Algorithmica, 1998)

Parallel randomized load balancing. - Micah Adler; Soumen Chakrabarti; Michael Mitzenmacher; Lars Eilstrup Rasmussen (Random Struct. Algorithms, 1998)

Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. - John W. Byers; Michael Luby; Michael Mitzenmacher (INFOCOM, 1999)

Unscrambling Address Lines. - Andrei Z. Broder; Michael Mitzenmacher; Laurent Moll (SODA, 1999)

Measuring Index Quality Using Random Walks on the Web. - Monika Rauch Henzinger; Allan Heydon; Michael Mitzenmacher; Marc Najork (Comput. Networks, 1999)

Studying Balanced Allocations With Differential Equations. - Michael Mitzenmacher (Comb. Probab. Comput., 1999)

On the Analysis of Randomized Load Balancing Schemes. - Michael Mitzenmacher (Theory Comput. Syst., 1999)

FLID-DL: congestion control for layered multicast. - John W. Byers; Michael Frumin; Gavin B. Horn; Michael Luby; Michael Mitzenmacher; Alex Roetter; William Shaver (Networked Group Communication, 2000)

Improved classification via connectivity information. - Andrei Z. Broder; Robert Krauthgamer; Michael Mitzenmacher (SODA, 2000)

An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). - Martin E. Dyer; Leslie Ann Goldberg; Catherine S. Greenhill; Mark Jerrum; Michael Mitzenmacher (SODA, 2000)

On near-uniform URL sampling. - Monika Rauch Henzinger; Allan Heydon; Michael Mitzenmacher; Marc Najork (Comput. Networks, 2000)

Min-Wise Independent Permutations. - Andrei Z. Broder; Moses Charikar; Alan M. Frieze; Michael Mitzenmacher (J. Comput. Syst. Sci., 2000)

Average-case analyses of first fit and random fit bin packing. - Susanne Albers; Michael Mitzenmacher (Random Struct. Algorithms, 2000)

An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. - Martin E. Dyer; Leslie Ann Goldberg; Catherine S. Greenhill; Mark Jerrum; Michael Mitzenmacher (SIAM J. Comput., 2000)

How Useful Is Old Information? - Michael Mitzenmacher (IEEE Trans. Parallel Distributed Syst., 2000)

Estimating Resemblance of MIDI Documents. - Michael Mitzenmacher; Sean Owen (ALENEX, 2001)

Towards Compressing Web Graphs. - Micah Adler; Michael Mitzenmacher (Data Compression Conference, 2001)

Using Multiple Hash Functions to Improve IP Lookups. - Andrei Z. Broder; Michael Mitzenmacher (INFOCOM, 2001)

Fine-Grained Layered Multicast. - John W. Byers; Michael Luby; Michael Mitzenmacher (INFOCOM, 2001)

IMproved results for route planning in stochastic transportation. - Justin A. Boyan; Michael Mitzenmacher (SODA, 2001)

Delayed Information and Action in On-Line Algorithms. - Susanne Albers; Moses Charikar; Michael Mitzenmacher (Inf. Comput., 2001)

Analyses of Load Stealing Models Based on Families of Differential Equations. - Michael Mitzenmacher (Theory Comput. Syst., 2001)

Completeness and robustness properties of min-wise independent permutations. - Andrei Z. Broder; Michael Mitzenmacher (Random Struct. Algorithms, 2001)

Analysis of Timing-Based Mutual Exclusion with Random Times. - Eli Gafni; Michael Mitzenmacher (SIAM J. Comput., 2001)

Challenging students with creative assignments. - Michael Mitzenmacher (SIGACT News, 2001)

An experimental assignment on random processes. - Michael Mitzenmacher (SIGACT News, 2001)

Efficient erasure correcting codes. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman (IEEE Trans. Inf. Theory, 2001)

Improved low-density parity-check codes using irregular graphs. - Michael Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman (IEEE Trans. Inf. Theory, 2001)

Towards More Complete Models of TCP Latency and Throughput. - Michael Mitzenmacher; Rajmohan Rajaraman (J. Supercomput., 2001)

The Power of Two Choices in Randomized Load Balancing. - Michael Mitzenmacher (IEEE Trans. Parallel Distributed Syst., 2001)

Human-Guided Tabu Search. - Gunnar W. Klau; Neal Lesh; Joe Marks; Michael Mitzenmacher (AAAI/IAAI, 2002)

The HuGS platform: a toolkit for interactive optimization. - Gunnar W. Klau; Neal Lesh; Joe Marks; Michael Mitzenmacher; Guy T. Schafer (AVI, 2002)

Load Balancing with Memory. - Michael Mitzenmacher; Balaji Prabhakar; Devavrat Shah (FOCS, 2002)

Exact sampling of TCP Window States. - Ashish Goel; Michael Mitzenmacher (INFOCOM, 2002)

Optmial plans for aggregation. - Andrei Z. Broder; Michael Mitzenmacher (PODC, 2002)

Balls and bins models with feedback. - Eleni Drinea; Alan M. Frieze; Michael Mitzenmacher (SODA, 2002)

FLID-DL: congestion control for layered multicast. - John W. Byers; Gavin B. Horn; Michael Luby; Michael Mitzenmacher; William Shaver (IEEE J. Sel. Areas Commun., 2002)

A digital fountain approach to asynchronous reliable multicast. - John W. Byers; Michael Luby; Michael Mitzenmacher (IEEE J. Sel. Areas Commun., 2002)

Linear waste of best fit bin packing on skewed distributions. - Claire Kenyon; Michael Mitzenmacher (Random Struct. Algorithms, 2002)

Compressed bloom filters. - Michael Mitzenmacher (IEEE/ACM Trans. Netw., 2002)

Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. - Frederic H. Behr; Victoria Fossum; Michael Mitzenmacher; David Xiao (DCC, 2003)

Simple Load Balancing for Distributed Hash Tables. - John W. Byers; Jeffrey Considine; Michael Mitzenmacher (IPTPS, 2003)

A complete and effective move set for simplified protein folding. - Neal Lesh; Michael Mitzenmacher; Sue Whitesides (RECOMB, 2003)

Survey: Network Applications of Bloom Filters: A Survey. - Andrei Z. Broder; Michael Mitzenmacher (Internet Math., 2003)

A Brief History of Generative Models for Power Law and Lognormal Distributions. - Michael Mitzenmacher (Internet Math., 2003)

Dynamic Models for File Sizes and Double Pareto Distributions. - Michael Mitzenmacher (Internet Math., 2003)

A derandomization using min-wise independent permutations. - Andrei Z. Broder; Moses Charikar; Michael Mitzenmacher (J. Discrete Algorithms, 2003)

Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. - Aleksandar Kavcic; Xiao Ma; Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2003)

Interactive data summarization: an example application. - Neal Lesh; Michael Mitzenmacher (AVI, 2004)

X-Tolerant Signature Analysis. - Subhasish Mitra; Steven S. Lumetta; Michael Mitzenmacher (ITC, 2004)

Digital fountains: a survey and look forward. - Michael Mitzenmacher (ITW, 2004)

Geometric generalizations of the power of two choices. - John W. Byers; Jeffrey Considine; Michael Mitzenmacher (SPAA, 2004)

A Scaling Result for Explosive Processes. - Michael Mitzenmacher; Roberto Imbuzeiro Oliveira; Joel H. Spencer (Electron. J. Comb., 2004)

Privacy Preserving Keyword Searches on Remote Encrypted Data. - Yan-Cheng Chang; Michael Mitzenmacher (IACR Cryptol. ePrint Arch., 2004)

Exhaustive approaches to 2D rectangular perfect packings. - Neal Lesh; Joe Marks; A. McMahon; Michael Mitzenmacher (Inf. Process. Lett., 2004)

Foreword. - Pilar de la Torre; Michael Mitzenmacher; Rajmohan Rajaraman; Berthold Vöcking (Theory Comput. Syst., 2004)

Power laws for monkeys typing randomly: the case of unequal probabilities. - Brian Conrad; Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2004)

On the hardness of finding optimal multiple preset dictionaries. - Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2004)

Informed content delivery across adaptive overlay networks. - John W. Byers; Jeffrey Considine; Michael Mitzenmacher; Stanislav Rost (IEEE/ACM Trans. Netw., 2004)

Probability and Computing: Randomized Algorithms and Probabilistic Analysis. - Michael Mitzenmacher; Eli Upfal (Cambridge University Press, 2005)

A Case Study in Large-Scale Interactive Optimization. - Markus Chimani; Neal Lesh; Michael Mitzenmacher; Candy L. Sidner; Hidetoshi Tanaka (Artificial Intelligence and Applications, 2005)

The Markov Expert for Finding Episodes in Time Series. - Jimming Cheng; Michael Mitzenmacher (DCC, 2005)

Multidimensional balanced allocations. - Andrei Z. Broder; Michael Mitzenmacher (SODA, 2005)

Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. - Michael Mitzenmacher (DISC, 2005)

X-Tolerant Test Response Compaction. - Subhasish Mitra; Steven S. Lumetta; Michael Mitzenmacher; Nishant Patil (IEEE Des. Test Comput., 2005)

Editorial: The Future of Power Law Research. - Michael Mitzenmacher (Internet Math., 2005)

New heuristic and interactive approaches to 2D rectangular strip packing. - Neal Lesh; Joe Marks; A. McMahon; Michael Mitzenmacher (ACM J. Exp. Algorithmics, 2005)

Verification-based decoding for packet-based low-density parity-check codes. - Michael Luby; Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2005)

Distance-Sensitive Bloom Filters. - Adam Kirsch; Michael Mitzenmacher (ALENEX, 2006)

New Results and Open Problems for Deletion Channels. - Michael Mitzenmacher (ANALCO, 2006)

An Improved Construction for Counting Bloom Filters. - Flavio Bonomi; Michael Mitzenmacher; Rina Panigrahy; Sushil Singh; George Varghese (ESA, 2006)

Stochastic Shortest Paths Via Quasi-convex Maximization. - Evdokia Nikolova; Jonathan A. Kelner; Matthew Brand; Michael Mitzenmacher (ESA, 2006)

Network-Aware Overlays with Network Coordinates. - Peter R. Pietzuch; Jonathan Ledlie; Michael Mitzenmacher; Margo I. Seltzer (ICDCS Workshops, 2006)

On the Theory and Practice of Data Recovery with Multiple Versions. - Michael Mitzenmacher (ISIT, 2006)

Beyond bloom filters: from approximate membership checks to approximate state machines. - Flavio Bonomi; Michael Mitzenmacher; Rina Panigrahy; Sushil Singh; George Varghese (SIGCOMM, 2006)

BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. - Neal Lesh; Michael Mitzenmacher (Inf. Process. Lett., 2006)

Towards a theory of networked computation. - Joan Feigenbaum; Michael Mitzenmacher (SIGACT News, 2006)

On Lower Bounds for the Capacity of Deletion Channels. - Eleni Drinea; Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2006)

Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q. - Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2006)

A Simple Lower Bound for the Capacity of the Deletion Channel. - Michael Mitzenmacher; Eleni Drinea (IEEE Trans. Inf. Theory, 2006)

Fine-grained layered multicast with STAIR. - John W. Byers; Gu-In Kwon; Michael Luby; Michael Mitzenmacher (IEEE/ACM Trans. Netw., 2006)

HEXA: Compact Data Structures for Faster Packet Processing. - Sailesh Kumar; Jonathan S. Turner; Patrick Crowley; Michael Mitzenmacher (ICNP, 2007)

Network monitoring using traffic dispersion graphs (tdgs). - Marios Iliofotou; Prashanth Pappu; Michalis Faloutsos; Michael Mitzenmacher; Sumeet Singh; George Varghese (Internet Measurement Conference, 2007)

Wired Geometric Routing. - Jonathan Ledlie; Michael Mitzenmacher; Margo I. Seltzer; Peter R. Pietzuch (IPTPS, 2007)

Capacity Upper Bounds for the Deletion Channel. - Suhas N. Diggavi; Michael Mitzenmacher; Henry D. Pfister (ISIT, 2007)

Using the Power of Two Choices to Improve Bloom Filters. - Steven S. Lumetta; Michael Mitzenmacher (Internet Math., 2007)

Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels. - Eleni Drinea; Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2007)

Designing floating codes for expected performance. - Hilary K. Finucane; Zhenming Liu; Michael Mitzenmacher (Allerton, 2008)

On the performance of multiple choice hash tables with moves on deletes and inserts. - Adam Kirsch; Michael Mitzenmacher (Allerton, 2008)

Distributed beamforming with binary signaling. - Mark Johnson; Michael Mitzenmacher; Kannan Ramchandran (ISIT, 2008)

Trace reconstruction with constant deletion probability and related results. - Thomas Holenstein; Michael Mitzenmacher; Rina Panigrahy; Udi Wieder (SODA, 2008)

Why simple hash functions work: exploiting the entropy in a data stream. - Michael Mitzenmacher; Salil P. Vadhan (SODA, 2008)

A Survey of Results for Deletion Channels and Related Synchronization Channels. - Michael Mitzenmacher (SWAT, 2008)

Less hashing, same performance: Building a better Bloom filter. - Adam Kirsch; Michael Mitzenmacher (Random Struct. Algorithms, 2008)

Capacity Bounds for Sticky Channels. - Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2008)

Simple summaries for hashing with choices. - Adam Kirsch; Michael Mitzenmacher (IEEE/ACM Trans. Netw., 2008)

Exploiting dynamicity in graph-based traffic analysis: techniques and applications. - Marios Iliofotou; Michalis Faloutsos; Michael Mitzenmacher (CoNEXT, 2009)

Some Open Questions Related to Cuckoo Hashing. - Michael Mitzenmacher (ESA, 2009)

An Economically-Principled Generative Model of AS Graph Connectivity. - Jacomo Corbo; Shaili Jain; Michael Mitzenmacher; David C. Parkes (INFOCOM, 2009)

Network Coding Meets TCP. - Jay Kumar Sundararajan; Devavrat Shah; Muriel Médard; Michael Mitzenmacher; João Barros (INFOCOM, 2009)

On compressing social networks. - Flavio Chierichetti; Ravi Kumar 001; Silvio Lattanzi; Michael Mitzenmacher; Alessandro Panconesi; Prabhakar Raghavan (KDD, 2009)

Interfacing network coding with TCP: an implementation - Jay Kumar Sundararajan; Szymon Jakubczak; Muriel Médard; Michael Mitzenmacher; João Barros (CoRR, 2009)

The Hiring Problem and Lake Wobegon Strategies. - Andrei Z. Broder; Adam Kirsch; Ravi Kumar 001; Michael Mitzenmacher; Eli Upfal; Sergei Vassilvitskii (SIAM J. Comput., 2009)

More Robust Hashing: Cuckoo Hashing with a Stash. - Adam Kirsch; Michael Mitzenmacher; Udi Wieder (SIAM J. Comput., 2009)

Real-time parallel hashing on the GPU. - Dan A. Alcantara; Andrei Sharf; Fatemeh Abbasinejad; Shubhabrata Sengupta; Michael Mitzenmacher; John D. Owens; Nina Amenta (ACM Trans. Graph., 2009)

Bloom Filters. - Michael Mitzenmacher (Encyclopedia of Database Systems, 2009)

Tight Thresholds for Cuckoo Hashing via XORSAT. - Martin Dietzfelbinger; Andreas Goerdt; Michael Mitzenmacher; Andrea Montanari; Rasmus Pagh; Michael Rink 001 (ICALP (1), 2010)

Tight asymptotic bounds for the deletion channel with small deletion probabilities. - Adam Kalai; Michael Mitzenmacher; Madhu Sudan 001 (ISIT, 2010)

Carousel: Scalable Logging for Intrusion Prevention Systems. - Vinh The Lam; Michael Mitzenmacher; George Varghese (NSDI, 2010)

Information asymmetries in pay-per-bid auctions. - John W. Byers; Michael Mitzenmacher; Georgios Zervas (EC, 2010)

AMS Without 4-Wise Independence on Product Domains. - Vladimir Braverman; Kai-Min Chung; Zhenming Liu; Michael Mitzenmacher; Rafail Ostrovsky (STACS, 2010)

Popularity Is Everything: A New Approach to Protecting Passwords from Statistical-Guessing Attacks. - Stuart E. Schechter; Cormac Herley; Michael Mitzenmacher (HotSec, 2010)

Adaptive weighing designs for keyword value computation. - John W. Byers; Michael Mitzenmacher; Georgios Zervas (WSDM, 2010)

An improved analysis of the lossy difference aggregator. - Hilary K. Finucane; Michael Mitzenmacher (Comput. Commun. Rev., 2010)

Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank - John W. Byers; Michael Mitzenmacher; Georgios Zervas (CoRR, 2010)

MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations - Michael T. Goodrich; Michael Mitzenmacher (CoRR, 2010)

An introduction to human-guided search. - Michael Mitzenmacher (XRDS, 2010)

Human-guided search. - Gunnar W. Klau; Neal Lesh; Joe Marks; Michael Mitzenmacher (J. Heuristics, 2010)

Designing floating codes for expected performance. - Flavio Chierichetti; Hilary K. Finucane; Zhenming Liu; Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2010)

Codes for deletion and insertion channels with segmented errors. - Zhenming Liu; Michael Mitzenmacher (IEEE Trans. Inf. Theory, 2010)

The Power of One Move: Hashing Schemes for Hardware. - Adam Kirsch; Michael Mitzenmacher (IEEE/ACM Trans. Netw., 2010)

Hash-Based Techniques for High-Speed Packet Processing. - Adam Kirsch; Michael Mitzenmacher; George Varghese (Algorithms for Next Generation Networks, 2010)

Codes - Protecting Data Against Errors and Loss. - Michael Mitzenmacher (Algorithms Unplugged, 2011)

Invertible bloom lookup tables. - Michael T. Goodrich; Michael Mitzenmacher (Allerton, 2011)

Heapable Sequences and Subsequences. - John W. Byers; Brent Heeringa; Michael Mitzenmacher; Georgios Zervas (ANALCO, 2011)

Oblivious RAM simulation with efficient worst-case access overhead. - Michael T. Goodrich; Michael Mitzenmacher; Olga Ohrimenko; Roberto Tamassia (CCSW, 2011)

Cuckoo Hashing with Pages. - Martin Dietzfelbinger; Michael Mitzenmacher; Michael Rink 001 (ESA, 2011)

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. - Michael T. Goodrich; Michael Mitzenmacher (ICALP (2), 2011)

On the zero-error capacity threshold for deletion channels. - Ian A. Kash; Michael Mitzenmacher; Justin Thaler; Jonathan R. Ullman (ITA, 2011)

Brief announcement: large-scale multimaps. - Michael T. Goodrich; Michael Mitzenmacher (SPAA, 2011)

Graption: A graph-based P2P traffic classification framework for the internet backbone. - Marios Iliofotou; Hyunchul Kim; Michalis Faloutsos; Michael Mitzenmacher; Prashanth Pappu; George Varghese (Comput. Networks, 2011)

Information Dissemination via Random Walks in d-Dimensional Space - Henry Lam; Zhenming Liu; Michael Mitzenmacher; Xiaorui Sun; Yajun Wang 001 (CoRR, 2011)

A Month in the Life of Groupon - John W. Byers; Michael Mitzenmacher; Michalis Potamias; Georgios Zervas (CoRR, 2011)

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps - Michael T. Goodrich; Daniel S. Hirschberg; Michael Mitzenmacher; Justin Thaler (CoRR, 2011)

Oblivious Storage with Low I/O Overhead - Michael T. Goodrich; Michael Mitzenmacher; Olga Ohrimenko; Roberto Tamassia (CoRR, 2011)

Network Coding Meets TCP: Theory and Implementation. - Jay Kumar Sundararajan; Devavrat Shah; Muriel Médard; Szymon Jakubczak; Michael Mitzenmacher; João Barros (Proc. IEEE, 2011)

An Analysis of Random-Walk Cuckoo Hashing. - Alan M. Frieze; Páll Melsted; Michael Mitzenmacher (SIAM J. Comput., 2011)

Hierarchical Heavy Hitters with the Space Saving Algorithm. - Justin Thaler; Michael Mitzenmacher; Thomas Steinke 002 (ALENEX, 2012)

Peeling arguments and double hashing. - Michael Mitzenmacher; Justin Thaler (Allerton Conference, 2012)

The complexity of object reconciliation, and open problems related to set difference and coding. - Michael Mitzenmacher; George Varghese (Allerton Conference, 2012)

Practical oblivious storage. - Michael T. Goodrich; Michael Mitzenmacher; Olga Ohrimenko; Roberto Tamassia (CODASPY, 2012)

Verifiable Computation with Massively Parallel Interactive Proofs. - Justin Thaler; Mike Roberts 001; Michael Mitzenmacher; Hanspeter Pfister (HotCloud, 2012)

Anonymous Card Shuffling and Its Applications to Parallel Mixnets. - Michael T. Goodrich; Michael Mitzenmacher (ICALP (2), 2012)

Practical verified computation with streaming interactive proofs. - Graham Cormode; Michael Mitzenmacher; Justin Thaler (ITCS, 2012)

Continuous time channels with interference. - Ioana Ivan; Michael Mitzenmacher; Justin Thaler; Henry S. Yuen (ISIT, 2012)

Biff (Bloom filter) codes: Fast error correction for large data sets. - Michael Mitzenmacher; George Varghese (ISIT, 2012)

Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. - Michael T. Goodrich; Daniel S. Hirschberg; Michael Mitzenmacher; Justin Thaler (MedAlg, 2012)

The groupon effect on yelp ratings: a root cause analysis. - John W. Byers; Michael Mitzenmacher; Georgios Zervas (EC, 2012)

Privacy-preserving group data access via stateless oblivious RAM simulation. - Michael T. Goodrich; Michael Mitzenmacher; Olga Ohrimenko; Roberto Tamassia (SODA, 2012)

Information dissemination via random walks in d-dimensional space. - Henry Lam; Zhenming Liu; Michael Mitzenmacher; Xiaorui Sun; Yajun Wang 001 (SODA, 2012)

Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. - Kai-Min Chung; Henry Lam; Zhenming Liu; Michael Mitzenmacher (STACS, 2012)

An Economic Analysis of User-Privacy Options in Ad-Supported Services. - Joan Feigenbaum; Michael Mitzenmacher; Georgios Zervas (WINE, 2012)

Daily deals: prediction, social diffusion, and reputational ramifications. - John W. Byers; Michael Mitzenmacher; Georgios Zervas (WSDM, 2012)

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. - Adam Kirsch; Michael Mitzenmacher; Andrea Pietracaprina; Geppino Pucci; Eli Upfal; Fabio Vandin (J. ACM, 2012)

Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009). - Nicole Immorlica; Jonathan Katz; Michael Mitzenmacher; Rocco A. Servedio; Chris Umans (SIAM J. Comput., 2012)

The daily deals marketplace: empirical observations and managerial implications. - John W. Byers; Michael Mitzenmacher; Georgios Zervas (SIGecom Exch., 2012)

External-Memory Multimaps. - Elaine Angelino; Michael T. Goodrich; Michael Mitzenmacher; Justin Thaler (Algorithmica, 2013)

Streaming Graph Computations with a Helpful Advisor. - Graham Cormode; Michael Mitzenmacher; Justin Thaler (Algorithmica, 2013)

Equitability Analysis of the Maximal Information Coefficient, with Comparisons - David N. Reshef; Yakir Reshef; Michael Mitzenmacher; Pardis Sabeti (CoRR, 2013)

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. - Kai-Min Chung; Michael Mitzenmacher; Salil P. Vadhan (Theory Comput., 2013)

Some Practical Randomized Algorithms and Data Structures. - Michael Mitzenmacher; Eli Upfal (Computing Handbook, 3rd ed. (1), 2014)

Multi-party set reconciliation using characteristic polynomials. - Anudhyan Boral; Michael Mitzenmacher (Allerton, 2014)

Cuckoo Filter: Practically Better Than Bloom. - Bin Fan; David G. Andersen; Michael Kaminsky; Michael Mitzenmacher (CoNEXT, 2014)

Coding for Random Projections. - Ping Li 001; Michael Mitzenmacher; Anshumali Shrivastava (ICML, 2014)

Repeated deletion channels. - Bernhard Haeupler; Michael Mitzenmacher (ITW, 2014)

Balanced allocations and double hashing. - Michael Mitzenmacher (SPAA, 2014)

Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. - David Eppstein; Michael T. Goodrich; Michael Mitzenmacher; Pawel Pszona (SEA, 2014)

Efficient estimation for high similarities using odd sketches. - Michael Mitzenmacher; Rasmus Pagh; Ninh Pham (WWW, 2014)

Coding for Random Projections and Approximate Near Neighbor Search. - Ping Li 001; Michael Mitzenmacher; Anshumali Shrivastava (CoRR, 2014)

Space Lower Bounds for Itemset Frequency Sketches. - Edo Liberty; Michael Mitzenmacher; Justin Thaler (CoRR, 2014)

Theoretical Foundations of Equitability and the Maximal Information Coefficient. - Yakir A. Reshef; David N. Reshef; Pardis C. Sabeti; Michael Mitzenmacher (CoRR, 2014)

Improving the performance of Invertible Bloom Lookup Tables. - Salvatore Pontarelli; Pedro Reviriego; Michael Mitzenmacher (Inf. Process. Lett., 2014)

Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. - Michael Mitzenmacher; Jakub Pachocki; Richard Peng; Charalampos E. Tsourakakis; Shen Chen Xu (KDD, 2015)

Scaling Up Clustered Network Appliances with ScaleBricks. - Dong Zhou; Bin Fan; Hyeontaek Lim; David G. Andersen; Michael Kaminsky; Michael Mitzenmacher; Ren Wang 001; Ajaypal Singh (SIGCOMM, 2015)

Theory without experiments: have we gone too far? - Michael Mitzenmacher (Commun. ACM, 2015)

Equitability, interval estimation, and statistical power. - Yakir A. Reshef; David N. Reshef; Pardis C. Sabeti; Michael M. Mitzenmacher (CoRR, 2015)

An Empirical Study of Leading Measures of Dependence. - David N. Reshef; Yakir A. Reshef; Pardis C. Sabeti; Michael M. Mitzenmacher (CoRR, 2015)

Analyzing distributed Join-Idle-Queue: A fluid limit approach. - Michael Mitzenmacher (Allerton, 2016)

More Analysis of Double Hashing for Balanced Allocations. - Michael Mitzenmacher (ANALCO, 2016)

A New Approach to Analyzing Robin Hood Hashing. - Michael Mitzenmacher (ANALCO, 2016)

Voronoi Choice Games. - Meena Boppana; Rani Hod; Michael Mitzenmacher; Tom Morgan (ICALP, 2016)

Models and Algorithms for Graph Watermarking. - David Eppstein; Michael T. Goodrich; Jenny Lam; Nil Mamano; Michael Mitzenmacher; Manuel R. Torres (ISC, 2016)

Quantized Random Projections and Non-Linear Estimation of Cosine Similarity. - Ping Li 001; Michael Mitzenmacher; Martin Slawski (NIPS, 2016)

Space Lower Bounds for Itemset Frequency Sketches. - Edo Liberty; Michael Mitzenmacher; Justin Thaler; Jonathan R. Ullman (PODS, 2016)

Technical Perspective: Catching lies (and mistakes) in offloaded computation. - Michael Mitzenmacher; Justin Thaler (Commun. ACM, 2016)

2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search. - Ping Li 001; Michael Mitzenmacher; Anshumali Shrivastava (CoRR, 2016)

Predicting Signed Edges with O(n log n) Queries. - Michael Mitzenmacher; Charalampos E. Tsourakakis (CoRR, 2016)

More Practical and Secure History-Independent Hash Tables. - Michael T. Goodrich; Evgenios M. Kornaropoulos; Michael Mitzenmacher; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2016)

Auditable Data Structures. - Michael T. Goodrich; Evgenios M. Kornaropoulos; Michael Mitzenmacher; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2016)

Hardness of peeling with stashes. - Michael Mitzenmacher; Vikram Nathan (Inf. Process. Lett., 2016)

Measuring Dependence Powerfully and Equitably. - Yakir A. Reshef; David N. Reshef; Hilary K. Finucane; Pardis C. Sabeti; Michael Mitzenmacher (J. Mach. Learn. Res., 2016)

OMASS: One Memory Access Set Separation. - Michael Mitzenmacher; Pedro Reviriego; Salvatore Pontarelli (IEEE Trans. Knowl. Data Eng., 2016)

Parallel Peeling Algorithms. - Jiayang Jiang; Michael Mitzenmacher; Justin Thaler (ACM Trans. Parallel Comput., 2016)

Compresso: Efficient Compression of Segmentation Data for Connectomics. - Brian Matejek; Daniel Haehn; Fritz Lekschas; Michael Mitzenmacher; Hanspeter Pfister (MICCAI (1), 2017)

2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. - David Eppstein; Michael T. Goodrich; Michael Mitzenmacher; Manuel R. Torres (PODS, 2017)

Scalable Motif-aware Graph Clustering. - Charalampos E. Tsourakakis; Jakub Pachocki; Michael Mitzenmacher (WWW, 2017)

Technical Perspective: Building a better hash function. - Michael Mitzenmacher (Commun. ACM, 2017)

Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. - Charalampos E. Tsourakakis; Michael Mitzenmacher; Jaroslaw Blasiok; Ben Lawson; Preetum Nakkiran; Vasileios Nakos (CoRR, 2017)

Theory and Applications of Hashing (Dagstuhl Seminar 17181). - Martin Dietzfelbinger; Michael Mitzenmacher; Rasmus Pagh; David P. Woodruff; Martin Aumüller 001 (Dagstuhl Reports, 2017)

Simulated Annealing for JPEG Quantization. - Max Hopkins; Michael Mitzenmacher; Sebastian Wagner-Carena (DCC, 2018)

Metric Sublinear Algorithms via Linear Sampling. - Hossein Esfandiari; Michael Mitzenmacher (FOCS, 2018)

Weightless: Lossy weight encoding for deep neural network compression. - Brandon Reagen; Udit Gupta; Robert Adolf; Michael Mitzenmacher; Alexander M. Rush; Gu-Yeon Wei; David Brooks 001 (ICLR (Workshop), 2018)

A Bayesian Nonparametric View on Count-Min Sketch. - Diana Cai; Michael Mitzenmacher; Ryan P. Adams (NeurIPS, 2018)

A Model for Learned Bloom Filters and Optimizing by Sandwiching. - Michael Mitzenmacher (NeurIPS, 2018)

Reconciling Graphs and Sets of Sets. - Michael Mitzenmacher; Tom Morgan (PODS, 2018)

Load Thresholds for Cuckoo Hashing with Double Hashing. - Michael Mitzenmacher; Konstantinos Panagiotou; Stefan Walzer (SWAT, 2018)

Joint Alignment from Pairwise Differences with a Noisy Oracle. - Michael Mitzenmacher; Charalampos E. Tsourakakis (WAW, 2018)

A Model for Learned Bloom Filters and Related Structures. - Michael Mitzenmacher (CoRR, 2018)

Optimizing Learned Bloom Filters by Sandwiching. - Michael Mitzenmacher (CoRR, 2018)

Directory Reconciliation. - Michael Mitzenmacher; Tom Morgan (CoRR, 2018)

Simple multi-party set reconciliation. - Michael Mitzenmacher; Rasmus Pagh (Distributed Comput., 2018)

EMOMA: Exact Match in One Memory Access. - Salvatore Pontarelli; Pedro Reviriego; Michael Mitzenmacher (IEEE Trans. Knowl. Data Eng., 2018)

Better Bounds for Coalescing-Branching Random Walks. - Michael Mitzenmacher; Rajmohan Rajaraman; Scott T. Roche (ACM Trans. Parallel Comput., 2018)

Bloom Filters. - Michael Mitzenmacher (Encyclopedia of Database Systems (2nd ed.), 2018)

Online Pandora's Boxes and Bandits. - Hossein Esfandiari; Mohammad Taghi Hajiaghayi; Brendan Lucier; Michael Mitzenmacher (AAAI, 2019)

Arithmetic Progression Hypergraphs: Examining the Second Moment Method. - Michael Mitzenmacher (ANALCO, 2019)

Robust Set Reconciliation via Locality Sensitive Hashing. - Michael Mitzenmacher; Tom Morgan (PODS, 2019)

A digital fountain retrospective. - John W. Byers; Michael Luby; Michael Mitzenmacher (Comput. Commun. Rev., 2019)

The Supermarket Model with Known and Predicted Service Times. - Michael Mitzenmacher (CoRR, 2019)

When Simple Hash Functions Suffice. - Kai-Min Chung; Michael Mitzenmacher; Salil P. Vadhan (Beyond the Worst-Case Analysis of Algorithms, 2020)

Algorithms with Predictions. - Michael Mitzenmacher; Sergei Vassilvitskii (Beyond the Worst-Case Analysis of Algorithms, 2020)

Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. - Hossein Esfandiari; MohammadTaghi Hajiaghayi; Brendan Lucier; Michael Mitzenmacher (AISTATS, 2020)

Detecting routing loops in the data plane. - Jan Kucera 004; Ran Ben Basat; Mário Kuka; Gianni Antichi; Minlan Yu; Michael Mitzenmacher (CoNEXT, 2020)

DISCOvering the heavy hitters with disaggregated sketches. - Valerio Bruschi; Ran Ben Basat; Zaoxing Liu; Gianni Antichi; Giuseppe Bianchi 001; Michael Mitzenmacher (CoNEXT, 2020)

Faster and More Accurate Measurement through Additive-Error Counters. - Ran Ben Basat; Gil Einziger; Michael Mitzenmacher; Shay Vargaftik (INFOCOM, 2020)

Scheduling with Predictions and the Price of Misprediction. - Michael Mitzenmacher (ITCS, 2020)

Optimal Learning of Joint Alignments with a Faulty Oracle. - Kasper Green Larsen; Michael Mitzenmacher; Charalampos E. Tsourakakis (ISIT, 2020)

PINT: Probabilistic In-band Network Telemetry. - Ran Ben Basat; Sivaramakrishnan Ramanathan; Yuliang Li; Gianni Antichi; Minlan Yu; Michael Mitzenmacher (SIGCOMM, 2020)

Dynamic algorithms for LIS and distance to monotonicity. - Michael Mitzenmacher; Saeed Seddighin (STOC, 2020)

Clustering with a faulty oracle. - Kasper Green Larsen; Michael Mitzenmacher; Charalampos E. Tsourakakis (WWW, 2020)

Partitioned Learned Bloom Filter. - Kapil Vaidya; Eric Knorr; Tim Kraska; Michael Mitzenmacher (CoRR, 2020)

Erdös-Szekeres Partitioning Problem. - Michael Mitzenmacher; Saeed Seddighin (CoRR, 2020)

Adaptive Cuckoo Filters. - Michael Mitzenmacher; Salvatore Pontarelli; Pedro Reviriego (ACM J. Exp. Algorithmics, 2020)

Queues with Small Advice. - Michael Mitzenmacher (ACDA, 2021)

Zero-CPU Collection with Direct Telemetry Access. - Jonatan Langlet; Ran Ben-Basat; Sivaramakrishnan Ramanathan; Gabriele Oliaro; Michael Mitzenmacher; Minlan Yu; Gianni Antichi (HotNets, 2021)

How to Send a Real Number Using a Single Bit (And Some Shared Randomness). - Ran Ben Basat; Michael Mitzenmacher; Shay Vargaftik (ICALP, 2021)

SALSA: Self-Adjusting Lean Streaming Analytics. - Ran Ben Basat; Gil Einziger; Michael Mitzenmacher; Shay Vargaftik (ICDE, 2021)

Partitioned Learned Bloom Filters. - Kapil Vaidya; Eric Knorr; Michael Mitzenmacher; Tim Kraska (ICLR, 2021)

Putting the "Learning" into Learning-Augmented Algorithms for Frequency Estimation. - Elbert Du; Franklyn Wang; Michael Mitzenmacher (ICML, 2021)

Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix. - Maximilian Lam; Gu-Yeon Wei; David Brooks 001; Vijay Janapa Reddi; Michael Mitzenmacher (ICML, 2021)

DRIVE: One-bit Distributed Mean Estimation. - Shay Vargaftik; Ran Ben-Basat; Amit Portnoy; Gal Mendelson; Yaniv Ben-Itzhak; Michael Mitzenmacher (NeurIPS, 2021)

Improved Sublinear Time Algorithm for Longest Increasing Subsequence. - Michael Mitzenmacher; Saeed Seddighin (SODA, 2021)

Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem. - Michael Mitzenmacher; Saeed Seddighin (CoRR, 2021)

Communication-Efficient Federated Learning via Robust Distributed Mean Estimation. - Shay Vargaftik; Ran Ben Basat; Amit Portnoy; Gal Mendelson; Yaniv Ben-Itzhak; Michael Mitzenmacher (CoRR, 2021)

EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learning. - Shay Vargaftik; Ran Ben Basat; Amit Portnoy; Gal Mendelson; Yaniv Ben-Itzhak; Michael Mitzenmacher (ICML, 2022)

Uniform Bounds for Scheduling with Job Size Estimates. - Ziv Scully; Isaac Grosof; Michael Mitzenmacher (ITCS, 2022)

Algorithmic Tools for Understanding the Motif Structure of Networks. - Tianyi Chen; Brian Matejek; Michael Mitzenmacher; Charalampos E. Tsourakakis (ECML/PKDD (2), 2022)

Proteus: A Self-Designing Range Filter. - Eric R. Knorr; Baptiste Lemaire; Andrew Lim; Siqiang Luo; Huanchen Zhang; Stratos Idreos; Michael Mitzenmacher (SIGMOD Conference, 2022)

Algorithms with predictions. - Michael Mitzenmacher; Sergei Vassilvitskii (Commun. ACM, 2022)

Direct Telemetry Access. - Jonatan Langlet; Ran Ben Basat; Sivaramakrishnan Ramanathan; Gabriele Oliaro; Michael Mitzenmacher; Minlan Yu; Gianni Antichi (CoRR, 2022)

Incentive Compatible Queues Without Money. - Isaac Grosof; Michael Mitzenmacher (CoRR, 2022)

Tabula: Efficiently Computing Nonlinear Activation Functions for Secure Neural Network Inference. - Maximilian Lam; Michael Mitzenmacher; Vijay Janapa Reddi; Gu-Yeon Wei; David Brooks 001 (CoRR, 2022)

FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches. - Wenchen Han; Vic Feng; Gregory Schwartzman; Michael Mitzenmacher; Minlan Yu; Ran Ben-Basat (CoRR, 2022)

QUIC-FL: Quick Unbiased Compression for Federated Learning. - Ran Ben Basat; Shay Vargaftik; Amit Portnoy; Gil Einziger; Yaniv Ben-Itzhak; Michael Mitzenmacher (CoRR, 2022)

Can Learned Models Replace Hash Functions? - Ibrahim Sabek; Kapil Vaidya; Dominik Horn; Andreas Kipf; Michael Mitzenmacher; Tim Kraska (Proc. VLDB Endow., 2022)

SNARF: A Learning-Enhanced Range Filter. - Kapil Vaidya; Tim Kraska; Subarna Chatterjee; Eric R. Knorr; Michael Mitzenmacher; Stratos Idreos (Proc. VLDB Endow., 2022)

The Supermarket Model With Known and Predicted Service Times. - Michael Mitzenmacher; Matteo Dell'Amico (IEEE Trans. Parallel Distributed Syst., 2022)

Direct Telemetry Access. - Jonatan Langlet; Ran Ben Basat; Gabriele Oliaro; Michael Mitzenmacher; Minlan Yu; Gianni Antichi (SIGCOMM, 2023)

THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. - Minghao Li; Ran Ben Basat; Shay Vargaftik; ChonLam Lao; Kevin Xu; Xinran Tang; Michael Mitzenmacher; Minlan Yu (CoRR, 2023)

THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. - Minghao Li; Ran Ben Basat; Shay Vargaftik; ChonLam Lao; Kevin Xu; Michael Mitzenmacher; Minlan Yu (NSDI, 2024)

Optimal and Near-Optimal Adaptive Vector Quantization. - Ran Ben-Basat; Yaniv Ben-Itzhak; Michael Mitzenmacher; Shay Vargaftik (CoRR, 2024)

SkipPredict: When to Invest in Predictions for Scheduling. - Rana Shahout; Michael Mitzenmacher (CoRR, 2024)

Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams. - Rana Shahout; Michael Mitzenmacher (CoRR, 2024)