Michael Mitzenmacher
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
145
Venues
41
Active years
1994–2026
Best venue rank
A*
Where they publish
- A*SODA15 papers
- A*SIGCOMM9 papers
- BISIT9 papers
- BSPAA9 papers
- A*INFOCOM8 papers
- AESA7 papers
- A*ICML6 papers
- A*ICALP6 papers
- A*STOC6 papers
- BDCC6 papers
- A*PODS5 papers
- A*FOCS5 papers
- ACoNEXT4 papers
- AALENEX4 papers
- A*PODC4 papers
- A*ICLR3 papers
- BICNP3 papers
- A*WWW3 papers
- A*ICDE2 papers
- NationalHOTNETS2 papers
- NationalNSDI2 papers
- NationalITA2 papers
- A*AAAI2 papers
- A*KDD2 papers
- BITW2 papers
- ASTACS2 papers
- AWSDM2 papers
- BAVI2 papers
- A*SIGMETRICS1 paper
- BSOFSEM1 paper
- A*SIGMOD1 paper
- AAISTATS1 paper
- CWAW1 paper
- AMICCAI1 paper
- AESORICS1 paper
- A*CCS1 paper
- BISAAC1 paper
- AIMC1 paper
- BACNS1 paper
- AITC1 paper
- BRECOMB1 paper
Papers
145 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICDE | Spatiotemporal Sketch Disaggregation: Streaming Analytics with Heterogeneous Resources. | Jonatan Langlet, Peiqing Chen, Michael Mitzenmacher, Zaoxing Liu, Ran Ben Basat, Gianni Antichi |
| 2026 | SIGCOMM | DynamiQ: Accelerating Gradient Synchronization using Compressed Multi-hop All-reduce. | Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Ran Ben Basat |
| 2026 | SIGCOMM | POSTER: Prediction-Enhanced Expert Prefetching and Eviction for MoE Offloading via PRED-MoE. | Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Ran Ben Basat |
| 2026 | SIGMETRICS | Better than Optimal: Improving Adaptive Stochastic Quantization Using Shared Randomness. | Ran Ben Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik |
| 2025 | ICLR | Don't stop me Now: Embedding based Scheduling for LLMS. | Rana Shahout, Eran Malach, Chunwei Liu, Weifan Jiang, Minlan Yu, Michael Mitzenmacher |
| 2025 | SODA | Efficient | William Kuszmaul, Michael Mitzenmacher |
| 2025 | SIGCOMM | HACK: Homomorphic Acceleration via Compression of the Key-Value Cache for Disaggregated LLM Inference. | Zeyu Zhang, Haiying Shen, Shay Vargaftik, Ran Ben Basat, Michael Mitzenmacher, Minlan Yu |
| 2025 | SOFSEM | Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds. | Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher |
| 2024 | HOTNETS | Beyond Throughput and Compression Ratios: Towards High End-to-end Utility of Gradient Compression. | Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Brad Karp, Ran Ben Basat |
| 2024 | ICML | Accelerating Federated Learning with Quick Distributed Mean Estimation. | Ran Ben-Basat, Shay Vargaftik, Amit Portnoy, Gil Einziger, Yaniv Ben-Itzhak, Michael Mitzenmacher |
| 2024 | ICNP | Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams. | Rana Shahout, Michael Mitzenmacher |
| 2024 | ICNP | Learning-Augmented Frequency Estimation in Sliding Windows. | Rana Shahout, Ibrahim Sabek, Michael Mitzenmacher |
| 2024 | NSDI | THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. | Minghao Li, Ran Ben Basat, Shay Vargaftik, ChonLam Lao, Kevin Xu, Michael Mitzenmacher, Minlan Yu |
| 2023 | SIGCOMM | Direct Telemetry Access. | Jonatan Langlet, Ran Ben Basat, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi |
| 2022 | ICML | 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 |
| 2022 | SIGMOD | Proteus: A Self-Designing Range Filter. | Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen Zhang, Stratos Idreos, Michael Mitzenmacher |
| 2021 | HOTNETS | Zero-CPU Collection with Direct Telemetry Access. | Jonatan Langlet, Ran Ben-Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi |
| 2021 | ICALP | How to Send a Real Number Using a Single Bit (And Some Shared Randomness). | Ran Ben Basat, Michael Mitzenmacher, Shay Vargaftik |
| 2021 | ICDE | SALSA: Self-Adjusting Lean Streaming Analytics. | Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik |
| 2021 | ICLR | Partitioned Learned Bloom Filters. | Kapil Vaidya, Eric Knorr, Michael Mitzenmacher, Tim Kraska |
| 2021 | ICML | Putting the "Learning" into Learning-Augmented Algorithms for Frequency Estimation. | Elbert Du, Franklyn Wang, Michael Mitzenmacher |
| 2021 | ICML | Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix. | Maximilian Lam, Gu-Yeon Wei, David Brooks, Vijay Janapa Reddi, Michael Mitzenmacher |
| 2021 | SODA | Improved Sublinear Time Algorithm for Longest Increasing Subsequence. | Michael Mitzenmacher, Saeed Seddighin |
| 2020 | AISTATS | Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher |
| 2020 | CoNEXT | Detecting routing loops in the data plane. | Jan Kucera, Ran Ben Basat, Mrio Kuka, Gianni Antichi, Minlan Yu, Michael Mitzenmacher |
| 2020 | CoNEXT | DISCOvering the heavy hitters with disaggregated sketches. | Valerio Bruschi, Ran Ben Basat, Zaoxing Liu, Gianni Antichi, Giuseppe Bianchi, Michael Mitzenmacher |
| 2020 | INFOCOM | Faster and More Accurate Measurement through Additive-Error Counters. | Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik |
| 2020 | ISIT | Optimal Learning of Joint Alignments with a Faulty Oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | ITA | Optimal Learning of Joint Alignments with a Faulty Oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | WWW | Clustering with a faulty oracle. | Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2020 | STOC | Dynamic algorithms for LIS and distance to monotonicity. | Michael Mitzenmacher, Saeed Seddighin |
| 2020 | SIGCOMM | PINT: Probabilistic In-band Network Telemetry. | Ran Ben Basat, Sivaramakrishnan Ramanathan, Yuliang Li, Gianni Antichi, Minlan Yu, Michael Mitzenmacher |
| 2019 | AAAI | Online Pandora's Boxes and Bandits. | Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher |
| 2019 | PODS | Robust Set Reconciliation via Locality Sensitive Hashing. | Michael Mitzenmacher, Tom Morgan |
| 2018 | ALENEX | Adaptive Cuckoo Filters. | Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego |
| 2018 | DCC | Simulated Annealing for JPEG Quantization. | Max Hopkins, Michael Mitzenmacher, Sebastian Wagner-Carena |
| 2018 | FOCS | Metric Sublinear Algorithms via Linear Sampling. | Hossein Esfandiari, Michael Mitzenmacher |
| 2018 | ICLR | 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 |
| 2018 | ICML | Weightless: Lossy weight encoding for deep neural network compression. | Brandon Reagen, Udit Gupta, Bob Adolf, Michael Mitzenmacher, Alexander M. Rush, Gu-Yeon Wei, David Brooks |
| 2018 | PODS | Reconciling Graphs and Sets of Sets. | Michael Mitzenmacher, Tom Morgan |
| 2018 | WAW | Joint Alignment from Pairwise Differences with a Noisy Oracle. | Michael Mitzenmacher, Charalampos E. Tsourakakis |
| 2017 | MICCAI | Compresso: Efficient Compression of Segmentation Data for Connectomics. | Brian Matejek, Daniel Haehn, Fritz Lekschas, Michael Mitzenmacher, Hanspeter Pfister |
| 2017 | PODS | 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. | David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres |
| 2017 | WWW | Scalable Motif-aware Graph Clustering. | Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher |
| 2016 | ESORICS | More Practical and Secure History-Independent Hash Tables. | Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia |
| 2016 | ICALP | Voronoi Choice Games. | Meena Boppana, Rani Hod, Michael Mitzenmacher, Tom Morgan |
| 2016 | PODS | Space Lower Bounds for Itemset Frequency Sketches. | Edo Liberty, Michael Mitzenmacher, Justin Thaler, Jonathan R. Ullman |
| 2016 | SPAA | Better Bounds for Coalescing-Branching Random Walks. | Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche |
| 2015 | KDD | Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. | Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu |
| 2015 | SIGCOMM | Scaling Up Clustered Network Appliances with ScaleBricks. | Dong Zhou, Bin Fan, Hyeontaek Lim, David G. Andersen, Michael Kaminsky, Michael Mitzenmacher, Ren Wang, Ajaypal Singh |
| 2014 | CoNEXT | Cuckoo Filter: Practically Better Than Bloom. | Bin Fan, David G. Andersen, Michael Kaminsky, Michael Mitzenmacher |
| 2014 | ICML | Coding for Random Projections. | Ping Li, Michael Mitzenmacher, Anshumali Shrivastava |
| 2014 | ITW | Repeated deletion channels. | Bernhard Haeupler, Michael Mitzenmacher |
| 2014 | WWW | Efficient estimation for high similarities using odd sketches. | Michael Mitzenmacher, Rasmus Pagh, Ninh Pham |
| 2014 | SPAA | Parallel peeling algorithms. | Jiayang Jiang, Michael Mitzenmacher, Justin Thaler |
| 2014 | SPAA | Balanced allocations and double hashing. | Michael Mitzenmacher |
| 2012 | ALENEX | Hierarchical Heavy Hitters with the Space Saving Algorithm. | Justin Thaler, Michael Mitzenmacher, Thomas Steinke |
| 2012 | ICALP | Anonymous Card Shuffling and Its Applications to Parallel Mixnets. | Michael T. Goodrich, Michael Mitzenmacher |
| 2012 | ISIT | Continuous time channels with interference. | Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry S. Yuen |
| 2012 | ISIT | Biff (Bloom filter) codes: Fast error correction for large data sets. | Michael Mitzenmacher, George Varghese |
| 2012 | SODA | Privacy-preserving group data access via stateless oblivious RAM simulation. | Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia |
| 2012 | SODA | Information dissemination via random walks in | Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang |
| 2012 | STACS | Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. | Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher |
| 2012 | WSDM | Daily deals: prediction, social diffusion, and reputational ramifications. | John W. Byers, Michael Mitzenmacher, Georgios Zervas |
| 2011 | CCS | Oblivious RAM simulation with efficient worst-case access overhead. | Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia |
| 2011 | ESA | Cuckoo Hashing with Pages. | Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink |
| 2011 | ICALP | Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. | Michael T. Goodrich, Michael Mitzenmacher |
| 2011 | ISAAC | External-Memory Multimaps. | Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler |
| 2011 | ITA | On the zero-error capacity threshold for deletion channels. | Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jonathan R. Ullman |
| 2011 | SPAA | Brief announcement: large-scale multimaps. | Michael T. Goodrich, Michael Mitzenmacher |
| 2010 | ESA | Streaming Graph Computations with a Helpful Advisor. | Graham Cormode, Michael Mitzenmacher, Justin Thaler |
| 2010 | ICALP | Tight Thresholds for Cuckoo Hashing via XORSAT. | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
| 2010 | ISIT | Tight asymptotic bounds for the deletion channel with small deletion probabilities. | Adam Kalai, Michael Mitzenmacher, Madhu Sudan |
| 2010 | NSDI | Carousel: Scalable Logging for Intrusion Prevention Systems. | Vinh The Lam, Michael Mitzenmacher, George Varghese |
| 2010 | STACS | AMS Without 4-Wise Independence on Product Domains. | Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky |
| 2010 | WSDM | Adaptive weighing designs for keyword value computation. | John W. Byers, Michael Mitzenmacher, Georgios Zervas |
| 2009 | CoNEXT | Exploiting dynamicity in graph-based traffic analysis: techniques and applications. | Marios Iliofotou, Michalis Faloutsos, Michael Mitzenmacher |
| 2009 | ESA | Some Open Questions Related to Cuckoo Hashing. | Michael Mitzenmacher |
| 2009 | INFOCOM | An Economically-Principled Generative Model of AS Graph Connectivity. | Jacomo Corbo, Shaili Jain, Michael Mitzenmacher, David C. Parkes |
| 2009 | INFOCOM | Network Coding Meets TCP. | Jay Kumar Sundararajan, Devavrat Shah, Muriel Mdard, Michael Mitzenmacher, Joo Barros |
| 2009 | KDD | On compressing social networks. | Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan |
| 2009 | PODS | An efficient rigorous approach for identifying statistically significant frequent itemsets. | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2008 | ESA | More Robust Hashing: Cuckoo Hashing with a Stash. | Adam Kirsch, Michael Mitzenmacher, Udi Wieder |
| 2008 | INFOCOM | The Power of One Move: Hashing Schemes for Hardware. | Adam Kirsch, Michael Mitzenmacher |
| 2008 | ISIT | Distributed beamforming with binary signaling. | Mark Johnson, Michael Mitzenmacher, Kannan Ramchandran |
| 2008 | SODA | The hiring problem and Lake Wobegon strategies. | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii |
| 2008 | SODA | Trace reconstruction with constant deletion probability and related results. | Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder |
| 2008 | SODA | Why simple hash functions work: exploiting the entropy in a data stream. | Michael Mitzenmacher, Salil P. Vadhan |
| 2007 | ICNP | HEXA: Compact Data Structures for Faster Packet Processing. | Sailesh Kumar, Jonathan S. Turner, Patrick Crowley, Michael Mitzenmacher |
| 2007 | IMC | Network monitoring using traffic dispersion graphs (tdgs). | Marios Iliofotou, Prashanth Pappu, Michalis Faloutsos, Michael Mitzenmacher, Sumeet Singh, George Varghese |
| 2007 | ISIT | Capacity Upper Bounds for the Deletion Channel. | Suhas N. Diggavi, Michael Mitzenmacher, Henry D. Pfister |
| 2007 | ISIT | Codes for Deletion and Insertion Channels with Segmented Errors. | Zhenming Liu, Michael Mitzenmacher |
| 2006 | ALENEX | Distance-Sensitive Bloom Filters. | Adam Kirsch, Michael Mitzenmacher |
| 2006 | ESA | An Improved Construction for Counting Bloom Filters. | Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese |
| 2006 | ESA | Less Hashing, Same Performance: Building a Better Bloom Filter. | Adam Kirsch, Michael Mitzenmacher |
| 2006 | ESA | Stochastic Shortest Paths Via Quasi-convex Maximization. | Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher |
| 2006 | ISIT | On the Theory and Practice of Data Recovery with Multiple Versions. | Michael Mitzenmacher |
| 2006 | SIGCOMM | Beyond bloom filters: from approximate membership checks to approximate state machines. | Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese |
| 2005 | ACNS | Privacy Preserving Keyword Searches on Remote Encrypted Data. | Yan-Cheng Chang, Michael Mitzenmacher |
| 2005 | DCC | The Markov Expert for Finding Episodes in Time Series. | Jimming Cheng, Michael Mitzenmacher |
| 2005 | SODA | Multidimensional balanced allocations. | Andrei Z. Broder, Michael Mitzenmacher |
| 2004 | AVI | Interactive data summarization: an example application. | Neal Lesh, Michael Mitzenmacher |
| 2004 | ISIT | On lower bounds for the capacity of deletion channels. | Eleni Drinea, Michael Mitzenmacher |
| 2004 | ITC | X-Tolerant Signature Analysis. | Subhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher |
| 2004 | ITW | Digital fountains: a survey and look forward. | Michael Mitzenmacher |
| 2004 | SPAA | Geometric generalizations of the power of two choices. | John W. Byers, Jeffrey Considine, Michael Mitzenmacher |
| 2003 | DCC | Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. | Frederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao |
| 2003 | RECOMB | A complete and effective move set for simplified protein folding. | Neal Lesh, Michael Mitzenmacher, Sue Whitesides |
| 2002 | AAAI | Human-Guided Tabu Search. | Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher |
| 2002 | AVI | The HuGS platform: a toolkit for interactive optimization. | Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher, Guy T. Schafer |
| 2002 | FOCS | Load Balancing with Memory. | Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah |
| 2002 | INFOCOM | Exact sampling of TCP Window States. | Ashish Goel, Michael Mitzenmacher |
| 2002 | PODC | Optmial plans for aggregation. | Andrei Z. Broder, Michael Mitzenmacher |
| 2002 | SODA | Balls and bins models with feedback. | Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher |
| 2002 | SIGCOMM | Informed content delivery across adaptive overlay networks. | John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost |
| 2001 | ALENEX | Estimating Resemblance of MIDI Documents. | Michael Mitzenmacher, Sean Owen |
| 2001 | DCC | Towards Compressing Web Graphs. | Micah Adler, Michael Mitzenmacher |
| 2001 | DCC | On the Hardness of Finding Optimal Multiple Preset Dictionaries. | Michael Mitzenmacher |
| 2001 | INFOCOM | Using Multiple Hash Functions to Improve IP Lookups. | Andrei Z. Broder, Michael Mitzenmacher |
| 2001 | INFOCOM | Fine-Grained Layered Multicast. | John W. Byers, Michael Luby, Michael Mitzenmacher |
| 2001 | PODC | Compressed bloom filters. | Michael Mitzenmacher |
| 2001 | SODA | IMproved results for route planning in stochastic transportation. | Justin A. Boyan, Michael Mitzenmacher |
| 2000 | FOCS | Linear Waste of Best Fit Bin Packing on Skewed Distributions. | Claire Kenyon, Michael Mitzenmacher |
| 2000 | SODA | Improved classification via connectivity information. | Andrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher |
| 2000 | SODA | 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 |
| 1999 | INFOCOM | Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. | John W. Byers, Michael Luby, Michael Mitzenmacher |
| 1999 | PODC | Analysis of Timing-Based Mutual Exclusion with Random Times. | Eli Gafni, Michael Mitzenmacher |
| 1999 | SODA | Unscrambling Address Lines. | Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll |
| 1998 | FOCS | Delayed Information and Action in On-line Algorithms. | Susanne Albers, Moses Charikar, Michael Mitzenmacher |
| 1998 | SODA | Average-Case Analyses of First Fit and Random Fit Bin Packing. | Susanne Albers, Michael Mitzenmacher |
| 1998 | SODA | Analysis of Random Processes via And-Or Tree Evaluation. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi |
| 1998 | STOC | Min-Wise Independent Permutations (Extended Abstract). | Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher |
| 1998 | STOC | Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. | Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andra W. Richa, Klaus Schrder, Ramesh K. Sitaraman, Berthold Vcking |
| 1998 | STOC | Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman |
| 1998 | SIGCOMM | A Digital Fountain Approach to Reliable Distribution of Bulk Data. | John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege |
| 1998 | SPAA | Analyses of Load Stealing Models Based on Differential Equations. | Michael Mitzenmacher |
| 1997 | PODC | How Useful Is Old Information? (Extended Abstract). | Michael Mitzenmacher |
| 1997 | STOC | Practical Loss-Resilient Codes. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann |
| 1997 | SPAA | On the Analysis of Randomized Load Balancing Schemes. | Michael Mitzenmacher |
| 1996 | DCC | Pattern-based Compression of Text Images. | Andrei Z. Broder, Michael Mitzenmacher |
| 1996 | FOCS | Load Balancing and Density Dependent Jump Markov Processes (extended abstract). | Michael Mitzenmacher |
| 1996 | ICALP | Average Case Analyses of List Update Algorithms, with Applications to Data Compression. | Susanne Albers, Michael Mitzenmacher |
| 1996 | SPAA | Constant Time per Edge is Optimal on Rooted Tree Networks. | Michael Mitzenmacher |
| 1995 | STOC | Parallel randomized load balancing (Preliminary Version). | Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen |
| 1994 | SPAA | Bounds on the Greedy Routing Algorithm for Array Networks. | Michael Mitzenmacher |