Michael Mitzenmacher

403 papers A* 77A 28B 35C 3Misc 6Journal 203Unranked 42

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	DynamiQ: Accelerating Gradient Synchronization using Compressed Multi-hop All-reduce. CoRR Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Ran Ben Basat
2026	J	`jnl`	Orla: A Library for Serving LLM-Based Multi-Agent Systems. CoRR Rana Shahout, Hayder Tirmazi, Minlan Yu, Michael Mitzenmacher
2026	A	`conf`	The Mixed Birth-Death/death-Birth Moran Process (Extended Abstract). ITCS David A. Brewster, Yichen Huang, Michael Mitzenmacher, Martin A. Nowak
2025	J	`jnl`	Better than Optimal: Improving Adaptive Stochastic Quantization Using Shared Randomness. Proc. ACM Meas. Anal. Comput. Syst. Ran Ben Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik
2025	A*	`conf`	Don't stop me Now: Embedding based Scheduling for LLMS. ICLR Rana Shahout, Eran Malach, Chunwei Liu, Weifan Jiang, Minlan Yu, Michael Mitzenmacher
2025	A*	`conf`	Efficient SODA William Kuszmaul, Michael Mitzenmacher
2025	J	`jnl`	Efficient CoRR William Kuszmaul, Michael Mitzenmacher
2025	J	`jnl`	From Score Distributions to Balance: Plug-and-Play Mixture-of-Experts Routing. CoRR Rana Shahout, Colin Cai, Yilun Du, Minlan Yu, Michael Mitzenmacher
2025	A*	`conf`	HACK: Homomorphic Acceleration via Compression of the Key-Value Cache for Disaggregated LLM Inference. SIGCOMM Zeyu Zhang, Haiying Shen, Shay Vargaftik, Ran Ben Basat, Michael Mitzenmacher, Minlan Yu
2025	J	`jnl`	HACK: Homomorphic Acceleration via Compression of the Key-Value Cache for Disaggregated LLM Inference. CoRR Zeyu Zhang, Haiying Shen, Shay Vargaftik, Ran Ben Basat, Michael Mitzenmacher, Minlan Yu
2025	J	`jnl`	Intra-request branch orchestration for efficient LLM reasoning. CoRR Weifan Jiang, Rana Shahout, Yilun Du, Michael Mitzenmacher, Minlan Yu
2025	J	`jnl`	Leveraging parameterized Chernoff bounds for simplified algorithm analyses. Inf. Process. Lett. Michael B. Dillencourt, Michael T. Goodrich, Michael Mitzenmacher
2025	J	`jnl`	Lyra: An Efficient and Expressive Subquadratic Architecture for Modeling Biological Sequences. CoRR Krithik Ramesh, Sameed M. Siddiqui, Albert Gu, Michael Mitzenmacher, Pardis C. Sabeti
2025	J	`jnl`	Multi-Queue SSD I/O Modeling & Its Implications for Data Structure Design. CoRR Erin Ransom, Andrew Lim, Michael Mitzenmacher
2025	—	`conf`	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds. SOFSEM (2) Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher
2025	J	`jnl`	Queueing, Predictions, and LLMs: Challenges and Open Problems. CoRR Michael Mitzenmacher, Rana Shahout
2025	J	`jnl`	Sketch Disaggregation Across Time and Space. CoRR Jonatan Langlet, Peiqing Chen, Michael Mitzenmacher, Ran Ben Basat, Zaoxing Liu, Gianni Antichi
2025	J	`jnl`	The Mixed Birth-death/death-Birth Moran Process. CoRR David A. Brewster, Yichen Huang, Michael Mitzenmacher, Martin A. Nowak
2024	A*	`conf`	Accelerating Federated Learning with Quick Distributed Mean Estimation. ICML Ran Ben-Basat, Shay Vargaftik, Amit Portnoy, Gil Einziger, Yaniv Ben-Itzhak, Michael Mitzenmacher
2024	Misc	`conf`	Beyond Throughput and Compression Ratios: Towards High End-to-end Utility of Gradient Compression. HotNets Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Brad Karp, Ran Ben Basat
2024	J	`jnl`	Beyond Throughput and Compression Ratios: Towards High End-to-end Utility of Gradient Compression. CoRR Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Brad Karp, Ran Ben Basat
2024	J	`jnl`	Don't Stop Me Now: Embedding Based Scheduling for LLMs. CoRR Rana Shahout, Eran Malach, Chunwei Liu, Weifan Jiang, Minlan Yu, Michael Mitzenmacher
2024	J	`jnl`	Fast Inference for Augmented Large Language Models. CoRR Rana Shahout, Cong Liang, Shiji Xin, Qianru Lao, Yong Cui, Minlan Yu, Michael Mitzenmacher
2024	B	`conf`	Learning-Augmented Frequency Estimation in Sliding Windows. ICNP Rana Shahout, Ibrahim Sabek, Michael Mitzenmacher
2024	J	`jnl`	Learning-Augmented Frequency Estimation in Sliding Windows. CoRR Rana Shahout, Ibrahim Sabek, Michael Mitzenmacher
2024	B	`conf`	Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams. ICNP Rana Shahout, Michael Mitzenmacher
2024	J	`jnl`	Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams. CoRR Rana Shahout, Michael Mitzenmacher
2024	A*	`conf`	Optimal and Approximate Adaptive Stochastic Quantization. NeurIPS Ran Ben-Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik
2024	J	`jnl`	Optimal and Near-Optimal Adaptive Vector Quantization. CoRR Ran Ben-Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik
2024	A*	`conf`	SkipPredict: When to Invest in Predictions for Scheduling. NeurIPS Rana Shahout, Michael Mitzenmacher
2024	J	`jnl`	SkipPredict: When to Invest in Predictions for Scheduling. CoRR Rana Shahout, Michael Mitzenmacher
2024	Misc	`conf`	THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. NSDI Minghao Li, Ran Ben Basat, Shay Vargaftik, ChonLam Lao, Kevin Xu, Michael Mitzenmacher, Minlan Yu
2024	J	`jnl`	Tabula: Efficiently Computing Nonlinear Activation Functions for Secure Neural Network Inference. Trans. Mach. Learn. Res. Max Lam, Michael Mitzenmacher, Vijay Janapa Reddi, Gu-Yeon Wei, David Brooks
2023	A*	`conf`	Direct Telemetry Access. SIGCOMM Jonatan Langlet, Ran Ben Basat, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
2023	J	`jnl`	Separating Theory Comput. Elbert Du, Michael Mitzenmacher, David P. Woodruff, Guang Yang
2023	J	`jnl`	THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. CoRR Minghao Li, Ran Ben Basat, Shay Vargaftik, ChonLam Lao, Kevin Xu, Xinran Tang, Michael Mitzenmacher, Minlan Yu
2022	—	`conf`	Algorithmic Tools for Understanding the Motif Structure of Networks. ECML/PKDD (2) Tianyi Chen, Brian Matejek, Michael Mitzenmacher, Charalampos E. Tsourakakis
2022	J	`jnl`	Algorithms with predictions. Commun. ACM Michael Mitzenmacher, Sergei Vassilvitskii
2022	J	`jnl`	Can Learned Models Replace Hash Functions? Proc. VLDB Endow. Ibrahim Sabek, Kapil Vaidya, Dominik Horn, Andreas Kipf, Michael Mitzenmacher, Tim Kraska
2022	J	`jnl`	Direct Telemetry Access. CoRR Jonatan Langlet, Ran Ben Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
2022	A*	`conf`	EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learning. ICML Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
2022	J	`jnl`	FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches. CoRR Wenchen Han, Vic Feng, Gregory Schwartzman, Michael Mitzenmacher, Minlan Yu, Ran Ben-Basat
2022	J	`jnl`	Incentive Compatible Queues Without Money. CoRR Isaac Grosof, Michael Mitzenmacher
2022	—	`conf`	Proteus: A Self-Designing Range Filter. SIGMOD Conference Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen Zhang, Stratos Idreos, Michael Mitzenmacher
2022	J	`jnl`	Proteus: A Self-Designing Range Filter. CoRR Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen Zhang, Stratos Idreos, Michael Mitzenmacher
2022	J	`jnl`	QUIC-FL: Quick Unbiased Compression for Federated Learning. CoRR Ran Ben Basat, Shay Vargaftik, Amit Portnoy, Gil Einziger, Yaniv Ben-Itzhak, Michael Mitzenmacher
2022	J	`jnl`	SNARF: A Learning-Enhanced Range Filter. Proc. VLDB Endow. Kapil Vaidya, Tim Kraska, Subarna Chatterjee, Eric R. Knorr, Michael Mitzenmacher, Stratos Idreos
2022	J	`jnl`	Tabula: Efficiently Computing Nonlinear Activation Functions for Secure Neural Network Inference. CoRR Maximilian Lam, Michael Mitzenmacher, Vijay Janapa Reddi, Gu-Yeon Wei, David Brooks
2022	J	`jnl`	The Supermarket Model With Known and Predicted Service Times. IEEE Trans. Parallel Distributed Syst. Michael Mitzenmacher, Matteo Dell'Amico
2022	A	`conf`	Uniform Bounds for Scheduling with Job Size Estimates. ITCS Ziv Scully, Isaac Grosof, Michael Mitzenmacher
2021	J	`jnl`	Communication-Efficient Federated Learning via Robust Distributed Mean Estimation. CoRR Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
2021	A*	`conf`	DRIVE: One-bit Distributed Mean Estimation. NeurIPS Shay Vargaftik, Ran Ben-Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
2021	J	`jnl`	DRIVE: One-bit Distributed Mean Estimation. CoRR Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
2021	J	`jnl`	Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem. CoRR Michael Mitzenmacher, Saeed Seddighin
2021	A*	`conf`	Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix. ICML Maximilian Lam, Gu-Yeon Wei, David Brooks, Vijay Janapa Reddi, Michael Mitzenmacher
2021	J	`jnl`	Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix. CoRR Maximilian Lam, Gu-Yeon Wei, David Brooks, Vijay Janapa Reddi, Michael Mitzenmacher
2021	A*	`conf`	How to Send a Real Number Using a Single Bit (And Some Shared Randomness). ICALP Ran Ben Basat, Michael Mitzenmacher, Shay Vargaftik
2021	A*	`conf`	Improved Sublinear Time Algorithm for Longest Increasing Subsequence. SODA Michael Mitzenmacher, Saeed Seddighin
2021	A*	`conf`	Partitioned Learned Bloom Filters. ICLR Kapil Vaidya, Eric Knorr, Michael Mitzenmacher, Tim Kraska
2021	A*	`conf`	Putting the "Learning" into Learning-Augmented Algorithms for Frequency Estimation. ICML Elbert Du, Franklyn Wang, Michael Mitzenmacher
2021	—	`conf`	Queues with Small Advice. ACDA Michael Mitzenmacher
2021	A*	`conf`	SALSA: Self-Adjusting Lean Streaming Analytics. ICDE Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
2021	J	`jnl`	SALSA: Self-Adjusting Lean Streaming Analytics. CoRR Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
2021	J	`jnl`	Uniform Bounds for Scheduling with Job Size Estimates. CoRR Ziv Scully, Isaac Grosof, Michael Mitzenmacher
2021	Misc	`conf`	Zero-CPU Collection with Direct Telemetry Access. HotNets Jonatan Langlet, Ran Ben-Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
2021	J	`jnl`	Zero-CPU Collection with Direct Telemetry Access. CoRR Jonatan Langlet, Ran Ben Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
2020	J	`jnl`	Adaptive Cuckoo Filters. ACM J. Exp. Algorithmics Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
2020	—	`ch.`	Algorithms with Predictions. Beyond the Worst-Case Analysis of Algorithms Michael Mitzenmacher, Sergei Vassilvitskii
2020	J	`jnl`	Algorithms with Predictions. CoRR Michael Mitzenmacher, Sergei Vassilvitskii
2020	A*	`conf`	Clustering with a faulty oracle. WWW Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	A	`conf`	DISCOvering the heavy hitters with disaggregated sketches. CoNEXT Valerio Bruschi, Ran Ben Basat, Zaoxing Liu, Gianni Antichi, Giuseppe Bianchi, Michael Mitzenmacher
2020	A	`conf`	Detecting routing loops in the data plane. CoNEXT Jan Kucera, Ran Ben Basat, Mário Kuka, Gianni Antichi, Minlan Yu, Michael Mitzenmacher
2020	A*	`conf`	Dynamic algorithms for LIS and distance to monotonicity. STOC Michael Mitzenmacher, Saeed Seddighin
2020	J	`jnl`	Erdös-Szekeres Partitioning Problem. CoRR Michael Mitzenmacher, Saeed Seddighin
2020	A*	`conf`	Faster and More Accurate Measurement through Additive-Error Counters. INFOCOM Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
2020	J	`jnl`	Faster and More Accurate Measurement through Additive-Error Counters. CoRR Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
2020	J	`jnl`	How to send a real number using a single bit (and some shared randomness). CoRR Ran Ben-Basat, Michael Mitzenmacher, Shay Vargaftik
2020	J	`jnl`	Joint Alignment From Pairwise Differences with a Noisy Oracle. CoRR Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	B	`conf`	Optimal Learning of Joint Alignments with a Faulty Oracle. ISIT Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	Misc	`conf`	Optimal Learning of Joint Alignments with a Faulty Oracle. ITA Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2020	A*	`conf`	PINT: Probabilistic In-band Network Telemetry. SIGCOMM Ran Ben Basat, Sivaramakrishnan Ramanathan, Yuliang Li, Gianni Antichi, Minlan Yu, Michael Mitzenmacher
2020	J	`jnl`	PINT: Probabilistic In-band Network Telemetry. CoRR Ran Ben Basat, Sivaramakrishnan Ramanathan, Yuliang Li, Gianni Antichi, Minlan Yu, Michael Mitzenmacher
2020	J	`jnl`	Partitioned Learned Bloom Filter. CoRR Kapil Vaidya, Eric Knorr, Tim Kraska, Michael Mitzenmacher
2020	A	`conf`	Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. AISTATS Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
2020	J	`jnl`	Queues with Small Advice. CoRR Michael Mitzenmacher
2020	A	`conf`	Scheduling with Predictions and the Price of Misprediction. ITCS Michael Mitzenmacher
2020	—	`ch.`	When Simple Hash Functions Suffice. Beyond the Worst-Case Analysis of Algorithms Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan
2019	—	`ed.`	2nd Symposium on Simplicity in Algorithms, SOSA 2019, San Diego, CA, USA, January 8-9, 2019 SOSA Jeremy T. Fineman, Michael Mitzenmacher
2019	J	`jnl`	A Model for Learned Bloom Filters, and Optimizing by Sandwiching. CoRR Michael Mitzenmacher
2019	J	`jnl`	A digital fountain retrospective. Comput. Commun. Rev. John W. Byers, Michael Luby, Michael Mitzenmacher
2019	—	`conf`	Arithmetic Progression Hypergraphs: Examining the Second Moment Method. ANALCO Michael Mitzenmacher
2019	A*	`conf`	Online Pandora's Boxes and Bandits. AAAI Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
2019	J	`jnl`	Online Pandora's Boxes and Bandits. CoRR Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
2019	J	`jnl`	Optimal Learning of Joint Alignments with a Faulty Oracle. CoRR Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
2019	J	`jnl`	Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. CoRR Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
2019	A*	`conf`	Robust Set Reconciliation via Locality Sensitive Hashing. PODS Michael Mitzenmacher, Tom Morgan
2019	J	`jnl`	Scheduling with Predictions and the Price of Misprediction. CoRR Michael Mitzenmacher
2019	J	`jnl`	The Supermarket Model with Known and Predicted Service Times. CoRR Michael Mitzenmacher
2018	A*	`conf`	A Bayesian Nonparametric View on Count-Min Sketch. NeurIPS Diana Cai, Michael Mitzenmacher, Ryan P. Adams
2018	A*	`conf`	A Model for Learned Bloom Filters and Optimizing by Sandwiching. NeurIPS Michael Mitzenmacher
2018	J	`jnl`	A Model for Learned Bloom Filters and Related Structures. CoRR Michael Mitzenmacher
2018	A	`conf`	Adaptive Cuckoo Filters. ALENEX Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
2018	J	`jnl`	Better Bounds for Coalescing-Branching Random Walks. ACM Trans. Parallel Comput. Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche
2018	—	`ch.`	Bloom Filters. Encyclopedia of Database Systems (2nd ed.) Michael Mitzenmacher
2018	J	`jnl`	Directory Reconciliation. CoRR Michael Mitzenmacher, Tom Morgan
2018	J	`jnl`	EMOMA: Exact Match in One Memory Access. IEEE Trans. Knowl. Data Eng. Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher
2018	C	`conf`	Joint Alignment from Pairwise Differences with a Noisy Oracle. WAW Michael Mitzenmacher, Charalampos E. Tsourakakis
2018	—	`conf`	Load Thresholds for Cuckoo Hashing with Double Hashing. SWAT Michael Mitzenmacher, Konstantinos Panagiotou, Stefan Walzer
2018	A*	`conf`	Metric Sublinear Algorithms via Linear Sampling. FOCS Hossein Esfandiari, Michael Mitzenmacher
2018	J	`jnl`	Metric Sublinear Algorithms via Linear Sampling. CoRR Hossein Esfandiari, Michael Mitzenmacher
2018	J	`jnl`	Optimizing Learned Bloom Filters by Sandwiching. CoRR Michael Mitzenmacher
2018	A*	`conf`	Reconciling Graphs and Sets of Sets. PODS Michael Mitzenmacher, Tom Morgan
2018	J	`jnl`	Robust Set Reconciliation via Locality Sensitive Hashing. CoRR Michael Mitzenmacher, Tom Morgan
2018	J	`jnl`	Simple multi-party set reconciliation. Distributed Comput. Michael Mitzenmacher, Rasmus Pagh
2018	B	`conf`	Simulated Annealing for JPEG Quantization. DCC Max Hopkins, Michael Mitzenmacher, Sebastian Wagner-Carena
2018	—	`conf`	Weightless: Lossy weight encoding for deep neural network compression. ICLR (Workshop) Brandon Reagen, Udit Gupta, Robert Adolf, Michael Mitzenmacher, Alexander M. Rush, Gu-Yeon Wei, David Brooks
2018	A*	`conf`	Weightless: Lossy weight encoding for deep neural network compression. ICML Brandon Reagen, Udit Gupta, Bob Adolf, Michael Mitzenmacher, Alexander M. Rush, Gu-Yeon Wei, David Brooks
2017	A*	`conf`	2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. PODS David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres
2017	J	`jnl`	Adaptive Cuckoo Filters. CoRR Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
2017	J	`jnl`	Arithmetic Progression Hypergraphs: Examining the Second Moment Method. CoRR Michael Mitzenmacher
2017	A	`conf`	Auditable Data Structures. EuroS&P Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2017	—	`conf`	Compresso: Efficient Compression of Segmentation Data for Connectomics. MICCAI (1) Brian Matejek, Daniel Haehn, Fritz Lekschas, Michael Mitzenmacher, Hanspeter Pfister
2017	J	`jnl`	EMOMA: Exact Match in One Memory Access. CoRR Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher
2017	J	`jnl`	Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos
2017	J	`jnl`	Reconciling Graphs and Sets of Sets. CoRR Michael Mitzenmacher, Tom Morgan
2017	A*	`conf`	Scalable Motif-aware Graph Clustering. WWW Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher
2017	J	`jnl`	Simulated Annealing for JPEG Quantization. CoRR Max Hopkins, Michael Mitzenmacher, Sebastian Wagner-Carena
2017	J	`jnl`	Technical Perspective: Building a better hash function. Commun. ACM Michael Mitzenmacher
2017	J	`jnl`	Theory and Applications of Hashing (Dagstuhl Seminar 17181). Dagstuhl Reports Martin Dietzfelbinger, Michael Mitzenmacher, Rasmus Pagh, David P. Woodruff, Martin Aumüller
2016	J	`jnl`	2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search. CoRR Ping Li, Michael Mitzenmacher, Anshumali Shrivastava
2016	A*	`ed.`	43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, July 11-15, 2016 ICALP Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, Davide Sangiorgi
2016	—	`conf`	A New Approach to Analyzing Robin Hood Hashing. ANALCO Michael Mitzenmacher
2016	J	`jnl`	Analyzing Distributed Join-Idle-Queue: A Fluid Limit Approach. CoRR Michael Mitzenmacher
2016	—	`conf`	Analyzing distributed Join-Idle-Queue: A fluid limit approach. Allerton Michael Mitzenmacher
2016	J	`jnl`	Auditable Data Structures. IACR Cryptol. ePrint Arch. Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2016	B	`conf`	Better Bounds for Coalescing-Branching Random Walks. SPAA Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche
2016	J	`jnl`	Better bounds for coalescing-branching random walks. CoRR Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche
2016	J	`jnl`	Hardness of peeling with stashes. Inf. Process. Lett. Michael Mitzenmacher, Vikram Nathan
2016	J	`jnl`	Measuring Dependence Powerfully and Equitably. J. Mach. Learn. Res. Yakir A. Reshef, David N. Reshef, Hilary K. Finucane, Pardis C. Sabeti, Michael Mitzenmacher
2016	C	`conf`	Models and Algorithms for Graph Watermarking. ISC David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres
2016	J	`jnl`	Models and Algorithms for Graph Watermarking. CoRR David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres
2016	—	`conf`	More Analysis of Double Hashing for Balanced Allocations. ANALCO Michael Mitzenmacher
2016	—	`conf`	More Practical and Secure History-Independent Hash Tables. ESORICS (2) Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2016	J	`jnl`	More Practical and Secure History-Independent Hash Tables. IACR Cryptol. ePrint Arch. Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2016	J	`jnl`	OMASS: One Memory Access Set Separation. IEEE Trans. Knowl. Data Eng. Michael Mitzenmacher, Pedro Reviriego, Salvatore Pontarelli
2016	J	`jnl`	Parallel Peeling Algorithms. ACM Trans. Parallel Comput. Jiayang Jiang, Michael Mitzenmacher, Justin Thaler
2016	J	`jnl`	Predicting Signed Edges with O(n log n) Queries. CoRR Michael Mitzenmacher, Charalampos E. Tsourakakis
2016	A	`ed.`	Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016 ALENEX Michael T. Goodrich, Michael Mitzenmacher
2016	—	`conf`	Quantized Random Projections and Non-Linear Estimation of Cosine Similarity. NIPS Ping Li, Michael Mitzenmacher, Martin Slawski
2016	J	`jnl`	Scalable motif-aware graph clustering. CoRR Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher
2016	A*	`conf`	Space Lower Bounds for Itemset Frequency Sketches. PODS Edo Liberty, Michael Mitzenmacher, Justin Thaler, Jonathan R. Ullman
2016	J	`jnl`	Technical Perspective: Catching lies (and mistakes) in offloaded computation. Commun. ACM Michael Mitzenmacher, Justin Thaler
2016	A*	`conf`	Voronoi Choice Games. ICALP Meena Boppana, Rani Hod, Michael Mitzenmacher, Tom Morgan
2016	J	`jnl`	Voronoi Choice Games. CoRR Meena Boppana, Rani Hod, Michael Mitzenmacher, Tom Morgan
2015	J	`jnl`	More Analysis of Double Hashing for Balanced Allocations. CoRR Michael Mitzenmacher
2015	A*	`conf`	Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. KDD Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu
2015	A*	`conf`	Scaling Up Clustered Network Appliances with ScaleBricks. SIGCOMM Dong Zhou, Bin Fan, Hyeontaek Lim, David G. Andersen, Michael Kaminsky, Michael Mitzenmacher, Ren Wang, Ajaypal Singh
2015	J	`jnl`	Theory without experiments: have we gone too far? Commun. ACM Michael Mitzenmacher
2014	J	`jnl`	A New Approach to Analyzing Robin Hood Hashing. CoRR Michael Mitzenmacher
2014	B	`conf`	Balanced allocations and double hashing. SPAA Michael Mitzenmacher
2014	J	`jnl`	Coding for Random Projections and Approximate Near Neighbor Search. CoRR Ping Li, Michael Mitzenmacher, Anshumali Shrivastava
2014	A*	`conf`	Coding for Random Projections. ICML Ping Li, Michael Mitzenmacher, Anshumali Shrivastava
2014	A	`conf`	Cuckoo Filter: Practically Better Than Bloom. CoNEXT Bin Fan, David G. Andersen, Michael Kaminsky, Michael Mitzenmacher
2014	A*	`conf`	Efficient estimation for high similarities using odd sketches. WWW Michael Mitzenmacher, Rasmus Pagh, Ninh Pham
2014	J	`jnl`	Hardness of Peeling with Stashes. CoRR Michael Mitzenmacher, Vikram Nathan
2014	J	`jnl`	Improving the performance of Invertible Bloom Lookup Tables. Inf. Process. Lett. Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher
2014	J	`jnl`	Multi-Party Set Reconciliation Using Characteristic Polynomials. CoRR Anudhyan Boral, Michael Mitzenmacher
2014	—	`conf`	Multi-party set reconciliation using characteristic polynomials. Allerton Anudhyan Boral, Michael Mitzenmacher
2014	B	`conf`	Parallel peeling algorithms. SPAA Jiayang Jiang, Michael Mitzenmacher, Justin Thaler
2014	B	`conf`	Repeated deletion channels. ITW Bernhard Haeupler, Michael Mitzenmacher
2014	—	`ch.`	Some Practical Randomized Algorithms and Data Structures. Computing Handbook, 3rd ed. (1) Michael Mitzenmacher, Eli Upfal
2014	J	`jnl`	Space Lower Bounds for Itemset Frequency Sketches. CoRR Edo Liberty, Michael Mitzenmacher, Justin Thaler
2014	J	`jnl`	Theoretical Foundations of Equitability and the Maximal Information Coefficient. CoRR Yakir A. Reshef, David N. Reshef, Pardis C. Sabeti, Michael Mitzenmacher
2014	B	`conf`	Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. SEA David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona
2014	J	`jnl`	Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. CoRR David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona
2013	C	`ed.`	Algorithms and Models for the Web Graph - 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings WAW Anthony Bonato, Michael Mitzenmacher, Pawel Pralat
2013	J	`jnl`	Coding for Random Projections. CoRR Ping Li, Michael Mitzenmacher, Anshumali Shrivastava
2013	J	`jnl`	Equitability Analysis of the Maximal Information Coefficient, with Comparisons CoRR David N. Reshef, Yakir Reshef, Michael Mitzenmacher, Pardis Sabeti
2013	J	`jnl`	External-Memory Multimaps. Algorithmica Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
2013	J	`jnl`	Parallel Peeling Algorithms CoRR Jiayang Jiang, Michael Mitzenmacher, Justin Thaler
2013	J	`jnl`	Simple Multi-Party Set Reconciliation. CoRR Michael Mitzenmacher, Rasmus Pagh
2013	J	`jnl`	Streaming Graph Computations with a Helpful Advisor. Algorithmica Graham Cormode, Michael Mitzenmacher, Justin Thaler
2013	J	`jnl`	Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Theory Comput. Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan
2012	J	`jnl`	An Economic Analysis of User-Privacy Options in Ad-Supported Services CoRR Joan Feigenbaum, Michael Mitzenmacher, Georgios Zervas
2012	—	`conf`	An Economic Analysis of User-Privacy Options in Ad-Supported Services. WINE Joan Feigenbaum, Michael Mitzenmacher, Georgios Zervas
2012	J	`jnl`	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2012	—	`conf`	Anonymous Card Shuffling and Its Applications to Parallel Mixnets. ICALP (2) Michael T. Goodrich, Michael Mitzenmacher
2012	J	`jnl`	Anonymous Card Shuffling and its Applications to Parallel Mixnets CoRR Michael T. Goodrich, Michael Mitzenmacher
2012	J	`jnl`	Balanced Allocations and Double Hashing CoRR Michael Mitzenmacher
2012	J	`jnl`	Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets CoRR Michael Mitzenmacher, George Varghese
2012	B	`conf`	Biff (Bloom filter) codes: Fast error correction for large data sets. ISIT Michael Mitzenmacher, George Varghese
2012	—	`conf`	Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2012	A	`conf`	Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. STACS Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher
2012	J	`jnl`	Continuous Time Channels with Interference CoRR Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry S. Yuen
2012	B	`conf`	Continuous time channels with interference. ISIT Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry S. Yuen
2012	A	`conf`	Daily deals: prediction, social diffusion, and reputational ramifications. WSDM John W. Byers, Michael Mitzenmacher, Georgios Zervas
2012	A	`conf`	Hierarchical Heavy Hitters with the Space Saving Algorithm. ALENEX Justin Thaler, Michael Mitzenmacher, Thomas Steinke
2012	A*	`conf`	Information dissemination via random walks in SODA Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang
2012	—	`conf`	Peeling arguments and double hashing. Allerton Conference Michael Mitzenmacher, Justin Thaler
2012	—	`conf`	Practical oblivious storage. CODASPY Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2012	A	`conf`	Practical verified computation with streaming interactive proofs. ITCS Graham Cormode, Michael Mitzenmacher, Justin Thaler
2012	A*	`conf`	Privacy-preserving group data access via stateless oblivious RAM simulation. SODA Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2012	J	`jnl`	Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009). SIAM J. Comput. Nicole Immorlica, Jonathan Katz, Michael Mitzenmacher, Rocco A. Servedio, Chris Umans
2012	J	`jnl`	The Groupon Effect on Yelp Ratings: A Root Cause Analysis CoRR John W. Byers, Michael Mitzenmacher, Georgios Zervas
2012	—	`conf`	The complexity of object reconciliation, and open problems related to set difference and coding. Allerton Conference Michael Mitzenmacher, George Varghese
2012	J	`jnl`	The daily deals marketplace: empirical observations and managerial implications. SIGecom Exch. John W. Byers, Michael Mitzenmacher, Georgios Zervas
2012	A*	`conf`	The groupon effect on yelp ratings: a root cause analysis. EC John W. Byers, Michael Mitzenmacher, Georgios Zervas
2012	J	`jnl`	Verifiable Computation with Massively Parallel Interactive Proofs CoRR Justin Thaler, Mike Roberts, Michael Mitzenmacher, Hanspeter Pfister
2012	—	`conf`	Verifiable Computation with Massively Parallel Interactive Proofs. HotCloud Justin Thaler, Mike Roberts, Michael Mitzenmacher, Hanspeter Pfister
2011	J	`jnl`	A Month in the Life of Groupon CoRR John W. Byers, Michael Mitzenmacher, Michalis Potamias, Georgios Zervas
2011	J	`jnl`	An Analysis of Random-Walk Cuckoo Hashing. SIAM J. Comput. Alan M. Frieze, Páll Melsted, Michael Mitzenmacher
2011	B	`conf`	Brief announcement: large-scale multimaps. SPAA Michael T. Goodrich, Michael Mitzenmacher
2011	—	`ch.`	Codes - Protecting Data Against Errors and Loss. Algorithms Unplugged Michael Mitzenmacher
2011	J	`jnl`	Cuckoo Hashing with Pages CoRR Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink
2011	A	`conf`	Cuckoo Hashing with Pages. ESA Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink
2011	J	`jnl`	Daily Deals: Prediction, Social Diffusion, and Reputational Ramifications CoRR John W. Byers, Michael Mitzenmacher, Georgios Zervas
2011	J	`jnl`	External-Memory Multimaps CoRR Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
2011	B	`conf`	External-Memory Multimaps. ISAAC Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
2011	J	`jnl`	Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps CoRR Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2011	J	`jnl`	Graption: A graph-based P2P traffic classification framework for the internet backbone. Comput. Networks Marios Iliofotou, Hyunchul Kim, Michalis Faloutsos, Michael Mitzenmacher, Prashanth Pappu, George Varghese
2011	—	`conf`	Heapable Sequences and Subsequences. ANALCO John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas
2011	J	`jnl`	Hierarchical Heavy Hitters with the Space Saving Algorithm CoRR Michael Mitzenmacher, Thomas Steinke, Justin Thaler
2011	J	`jnl`	Information Dissemination via Random Walks in d-Dimensional Space CoRR Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang
2011	J	`jnl`	Invertible Bloom Lookup Tables CoRR Michael T. Goodrich, Michael Mitzenmacher
2011	—	`conf`	Invertible bloom lookup tables. Allerton Michael T. Goodrich, Michael Mitzenmacher
2011	J	`jnl`	Network Coding Meets TCP: Theory and Implementation. Proc. IEEE Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Szymon Jakubczak, Michael Mitzenmacher, João Barros
2011	J	`jnl`	Oblivious RAM Simulation with Efficient Worst-Case Access Overhead CoRR Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	—	`conf`	Oblivious RAM simulation with efficient worst-case access overhead. CCSW Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	J	`jnl`	Oblivious Storage with Low I/O Overhead CoRR Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	J	`jnl`	On the Zero-Error Capacity Threshold for Deletion Channels CoRR Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jonathan R. Ullman
2011	Misc	`conf`	On the zero-error capacity threshold for deletion channels. ITA Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jonathan R. Ullman
2011	J	`jnl`	Practical Verified Computation with Streaming Interactive Proofs CoRR Graham Cormode, Michael Mitzenmacher, Justin Thaler
2011	—	`conf`	Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. ICALP (2) Michael T. Goodrich, Michael Mitzenmacher
2011	J	`jnl`	Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation CoRR Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	J	`jnl`	Streaming Graph Computations with a Helpful Advisor. Electron. Colloquium Comput. Complex. Graham Cormode, Michael Mitzenmacher, Justin Thaler
2010	A	`conf`	AMS Without 4-Wise Independence on Product Domains. STACS Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky
2010	A	`conf`	Adaptive weighing designs for keyword value computation. WSDM John W. Byers, Michael Mitzenmacher, Georgios Zervas
2010	J	`jnl`	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets CoRR Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2010	J	`jnl`	An improved analysis of the lossy difference aggregator. Comput. Commun. Rev. Hilary K. Finucane, Michael Mitzenmacher
2010	J	`jnl`	An introduction to human-guided search. XRDS Michael Mitzenmacher
2010	Misc	`conf`	Carousel: Scalable Logging for Intrusion Prevention Systems. NSDI Vinh The Lam, Michael Mitzenmacher, George Varghese
2010	J	`jnl`	Codes for deletion and insertion channels with segmented errors. IEEE Trans. Inf. Theory Zhenming Liu, Michael Mitzenmacher
2010	J	`jnl`	Designing floating codes for expected performance. IEEE Trans. Inf. Theory Flavio Chierichetti, Hilary K. Finucane, Zhenming Liu, Michael Mitzenmacher
2010	—	`ch.`	Hash-Based Techniques for High-Speed Packet Processing. Algorithms for Next Generation Networks Adam Kirsch, Michael Mitzenmacher, George Varghese
2010	J	`jnl`	Heapable Sequences and Subsequences CoRR John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas
2010	J	`jnl`	Human-guided search. J. Heuristics Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher
2010	J	`jnl`	Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank CoRR John W. Byers, Michael Mitzenmacher, Georgios Zervas
2010	A*	`conf`	Information asymmetries in pay-per-bid auctions. EC John W. Byers, Michael Mitzenmacher, Georgios Zervas
2010	J	`jnl`	MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations CoRR Michael T. Goodrich, Michael Mitzenmacher
2010	—	`conf`	Popularity Is Everything: A New Approach to Protecting Passwords from Statistical-Guessing Attacks. HotSec Stuart E. Schechter, Cormac Herley, Michael Mitzenmacher
2010	J	`jnl`	Streaming Graph Computations with a Helpful Advisor CoRR Graham Cormode, Michael Mitzenmacher, Justin Thaler
2010	—	`conf`	Streaming Graph Computations with a Helpful Advisor. ESA (1) Graham Cormode, Michael Mitzenmacher, Justin Thaler
2010	J	`jnl`	The Power of One Move: Hashing Schemes for Hardware. IEEE/ACM Trans. Netw. Adam Kirsch, Michael Mitzenmacher
2010	—	`conf`	Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
2010	B	`conf`	Tight asymptotic bounds for the deletion channel with small deletion probabilities. ISIT Adam Kalai, Michael Mitzenmacher, Madhu Sudan
2009	—	`conf`	An Analysis of Random-Walk Cuckoo Hashing. APPROX-RANDOM Alan M. Frieze, Páll Melsted, Michael Mitzenmacher
2009	A*	`conf`	An Economically-Principled Generative Model of AS Graph Connectivity. INFOCOM Jacomo Corbo, Shaili Jain, Michael Mitzenmacher, David C. Parkes
2009	A*	`conf`	An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
2009	—	`ch.`	Bloom Filters. Encyclopedia of Database Systems Michael Mitzenmacher
2009	A	`conf`	Exploiting dynamicity in graph-based traffic analysis: techniques and applications. CoNEXT Marios Iliofotou, Michalis Faloutsos, Michael Mitzenmacher
2009	J	`jnl`	Interfacing network coding with TCP: an implementation CoRR Jay Kumar Sundararajan, Szymon Jakubczak, Muriel Médard, Michael Mitzenmacher, João Barros
2009	J	`jnl`	More Robust Hashing: Cuckoo Hashing with a Stash. SIAM J. Comput. Adam Kirsch, Michael Mitzenmacher, Udi Wieder
2009	A*	`conf`	Network Coding Meets TCP. INFOCOM Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros
2009	A*	`conf`	On compressing social networks. KDD Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan
2009	A*	`ed.`	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 STOC Michael Mitzenmacher
2009	J	`jnl`	Real-time parallel hashing on the GPU. ACM Trans. Graph. Dan A. Alcantara, Andrei Sharf, Fatemeh Abbasinejad, Shubhabrata Sengupta, Michael Mitzenmacher, John D. Owens, Nina Amenta
2009	A	`conf`	Some Open Questions Related to Cuckoo Hashing. ESA Michael Mitzenmacher
2009	J	`jnl`	The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii
2009	J	`jnl`	Tight Thresholds for Cuckoo Hashing via XORSAT CoRR Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink
2008	—	`conf`	A Survey of Results for Deletion Channels and Related Synchronization Channels. SWAT Michael Mitzenmacher
2008	J	`jnl`	Capacity Bounds for Sticky Channels. IEEE Trans. Inf. Theory Michael Mitzenmacher
2008	—	`conf`	Designing floating codes for expected performance. Allerton Hilary K. Finucane, Zhenming Liu, Michael Mitzenmacher
2008	B	`conf`	Distributed beamforming with binary signaling. ISIT Mark Johnson, Michael Mitzenmacher, Kannan Ramchandran
2008	J	`jnl`	Less hashing, same performance: Building a better Bloom filter. Random Struct. Algorithms Adam Kirsch, Michael Mitzenmacher
2008	A	`conf`	More Robust Hashing: Cuckoo Hashing with a Stash. ESA Adam Kirsch, Michael Mitzenmacher, Udi Wieder
2008	J	`jnl`	Network coding meets TCP CoRR Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros
2008	—	`conf`	On the performance of multiple choice hash tables with moves on deletes and inserts. Allerton Adam Kirsch, Michael Mitzenmacher
2008	J	`jnl`	Simple summaries for hashing with choices. IEEE/ACM Trans. Netw. Adam Kirsch, Michael Mitzenmacher
2008	A*	`conf`	The Power of One Move: Hashing Schemes for Hardware. INFOCOM Adam Kirsch, Michael Mitzenmacher
2008	A*	`conf`	The hiring problem and Lake Wobegon strategies. SODA Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii
2008	A*	`conf`	Trace reconstruction with constant deletion probability and related results. SODA Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder
2008	A*	`conf`	Why simple hash functions work: exploiting the entropy in a data stream. SODA Michael Mitzenmacher, Salil P. Vadhan
2007	B	`conf`	Capacity Upper Bounds for the Deletion Channel. ISIT Suhas N. Diggavi, Michael Mitzenmacher, Henry D. Pfister
2007	B	`conf`	Codes for Deletion and Insertion Channels with Segmented Errors. ISIT Zhenming Liu, Michael Mitzenmacher
2007	B	`conf`	HEXA: Compact Data Structures for Faster Packet Processing. ICNP Sailesh Kumar, Jonathan S. Turner, Patrick Crowley, Michael Mitzenmacher
2007	J	`jnl`	Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels. IEEE Trans. Inf. Theory Eleni Drinea, Michael Mitzenmacher
2007	A	`conf`	Network monitoring using traffic dispersion graphs (tdgs). Internet Measurement Conference Marios Iliofotou, Prashanth Pappu, Michalis Faloutsos, Michael Mitzenmacher, Sumeet Singh, George Varghese
2007	J	`jnl`	Using the Power of Two Choices to Improve Bloom Filters. Internet Math. Steven S. Lumetta, Michael Mitzenmacher
2007	—	`conf`	Wired Geometric Routing. IPTPS Jonathan Ledlie, Michael Mitzenmacher, Margo I. Seltzer, Peter R. Pietzuch
2006	J	`jnl`	A Simple Lower Bound for the Capacity of the Deletion Channel. IEEE Trans. Inf. Theory Michael Mitzenmacher, Eleni Drinea
2006	A	`conf`	An Improved Construction for Counting Bloom Filters. ESA Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
2006	A*	`conf`	Beyond bloom filters: from approximate membership checks to approximate state machines. SIGCOMM Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
2006	J	`jnl`	BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. Inf. Process. Lett. Neal Lesh, Michael Mitzenmacher
2006	A	`conf`	Distance-Sensitive Bloom Filters. ALENEX Adam Kirsch, Michael Mitzenmacher
2006	J	`jnl`	Fine-grained layered multicast with STAIR. IEEE/ACM Trans. Netw. John W. Byers, Gu-In Kwon, Michael Luby, Michael Mitzenmacher
2006	A	`conf`	Less Hashing, Same Performance: Building a Better Bloom Filter. ESA Adam Kirsch, Michael Mitzenmacher
2006	—	`conf`	Network-Aware Overlays with Network Coordinates. ICDCS Workshops Peter R. Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, Margo I. Seltzer
2006	—	`conf`	New Results and Open Problems for Deletion Channels. ANALCO Michael Mitzenmacher
2006	J	`jnl`	On Lower Bounds for the Capacity of Deletion Channels. IEEE Trans. Inf. Theory Eleni Drinea, Michael Mitzenmacher
2006	B	`conf`	On the Theory and Practice of Data Recovery with Multiple Versions. ISIT Michael Mitzenmacher
2006	J	`jnl`	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 Trans. Inf. Theory Michael Mitzenmacher
2006	A	`conf`	Stochastic Shortest Paths Via Quasi-convex Maximization. ESA Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher
2006	J	`jnl`	Towards a theory of networked computation. SIGACT News Joan Feigenbaum, Michael Mitzenmacher
2005	—	`conf`	A Case Study in Large-Scale Interactive Optimization. Artificial Intelligence and Applications Markus Chimani, Neal Lesh, Michael Mitzenmacher, Candy L. Sidner, Hidetoshi Tanaka
2005	A	`conf`	Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. DISC Michael Mitzenmacher
2005	J	`jnl`	Editorial: The Future of Power Law Research. Internet Math. Michael Mitzenmacher
2005	A*	`conf`	Multidimensional balanced allocations. SODA Andrei Z. Broder, Michael Mitzenmacher
2005	J	`jnl`	New heuristic and interactive approaches to 2D rectangular strip packing. ACM J. Exp. Algorithmics Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher
2005	B	`conf`	Privacy Preserving Keyword Searches on Remote Encrypted Data. ACNS Yan-Cheng Chang, Michael Mitzenmacher
2005	—	`book`	Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Michael Mitzenmacher, Eli Upfal
2005	B	`conf`	The Markov Expert for Finding Episodes in Time Series. DCC Jimming Cheng, Michael Mitzenmacher
2005	J	`jnl`	Verification-based decoding for packet-based low-density parity-check codes. IEEE Trans. Inf. Theory Michael Luby, Michael Mitzenmacher
2005	J	`jnl`	X-Tolerant Test Response Compaction. IEEE Des. Test Comput. Subhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher, Nishant Patil
2004	J	`jnl`	A Scaling Result for Explosive Processes. Electron. J. Comb. Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer
2004	B	`conf`	Digital fountains: a survey and look forward. ITW Michael Mitzenmacher
2004	J	`jnl`	Exhaustive approaches to 2D rectangular perfect packings. Inf. Process. Lett. Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher
2004	J	`jnl`	Foreword. Theory Comput. Syst. Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking
2004	B	`conf`	Geometric generalizations of the power of two choices. SPAA John W. Byers, Jeffrey Considine, Michael Mitzenmacher
2004	J	`jnl`	Informed content delivery across adaptive overlay networks. IEEE/ACM Trans. Netw. John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost
2004	B	`conf`	Interactive data summarization: an example application. AVI Neal Lesh, Michael Mitzenmacher
2004	B	`conf`	On lower bounds for the capacity of deletion channels. ISIT Eleni Drinea, Michael Mitzenmacher
2004	J	`jnl`	On the hardness of finding optimal multiple preset dictionaries. IEEE Trans. Inf. Theory Michael Mitzenmacher
2004	J	`jnl`	Power laws for monkeys typing randomly: the case of unequal probabilities. IEEE Trans. Inf. Theory Brian Conrad, Michael Mitzenmacher
2004	J	`jnl`	Privacy Preserving Keyword Searches on Remote Encrypted Data. IACR Cryptol. ePrint Arch. Yan-Cheng Chang, Michael Mitzenmacher
2004	A	`conf`	X-Tolerant Signature Analysis. ITC Subhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher
2003	J	`jnl`	A Brief History of Generative Models for Power Law and Lognormal Distributions. Internet Math. Michael Mitzenmacher
2003	B	`conf`	A complete and effective move set for simplified protein folding. RECOMB Neal Lesh, Michael Mitzenmacher, Sue Whitesides
2003	J	`jnl`	A derandomization using min-wise independent permutations. J. Discrete Algorithms Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
2003	J	`jnl`	Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. IEEE Trans. Inf. Theory Aleksandar Kavcic, Xiao Ma, Michael Mitzenmacher
2003	J	`jnl`	Dynamic Models for File Sizes and Double Pareto Distributions. Internet Math. Michael Mitzenmacher
2003	B	`conf`	Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. DCC Frederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao
2003	—	`conf`	Simple Load Balancing for Distributed Hash Tables. IPTPS John W. Byers, Jeffrey Considine, Michael Mitzenmacher
2003	J	`jnl`	Survey: Network Applications of Bloom Filters: A Survey. Internet Math. Andrei Z. Broder, Michael Mitzenmacher
2002	J	`jnl`	A digital fountain approach to asynchronous reliable multicast. IEEE J. Sel. Areas Commun. John W. Byers, Michael Luby, Michael Mitzenmacher
2002	A*	`conf`	Balls and bins models with feedback. SODA Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher
2002	J	`jnl`	Compressed bloom filters. IEEE/ACM Trans. Netw. Michael Mitzenmacher
2002	A*	`conf`	Exact sampling of TCP Window States. INFOCOM Ashish Goel, Michael Mitzenmacher
2002	J	`jnl`	FLID-DL: congestion control for layered multicast. IEEE J. Sel. Areas Commun. John W. Byers, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, William Shaver
2002	—	`conf`	Human-Guided Tabu Search. AAAI/IAAI Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher
2002	A*	`conf`	Informed content delivery across adaptive overlay networks. SIGCOMM John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost
2002	J	`jnl`	Linear waste of best fit bin packing on skewed distributions. Random Struct. Algorithms Claire Kenyon, Michael Mitzenmacher
2002	A*	`conf`	Load Balancing with Memory. FOCS Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah
2002	A*	`conf`	Optmial plans for aggregation. PODC Andrei Z. Broder, Michael Mitzenmacher
2002	B	`conf`	The HuGS platform: a toolkit for interactive optimization. AVI Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher, Guy T. Schafer
2001	J	`jnl`	An experimental assignment on random processes. SIGACT News Michael Mitzenmacher
2001	J	`jnl`	Analyses of Load Stealing Models Based on Families of Differential Equations. Theory Comput. Syst. Michael Mitzenmacher
2001	J	`jnl`	Analysis of Timing-Based Mutual Exclusion with Random Times. SIAM J. Comput. Eli Gafni, Michael Mitzenmacher
2001	J	`jnl`	Challenging students with creative assignments. SIGACT News Michael Mitzenmacher
2001	J	`jnl`	Completeness and robustness properties of min-wise independent permutations. Random Struct. Algorithms Andrei Z. Broder, Michael Mitzenmacher
2001	A*	`conf`	Compressed bloom filters. PODC Michael Mitzenmacher
2001	J	`jnl`	Delayed Information and Action in On-Line Algorithms. Inf. Comput. Susanne Albers, Moses Charikar, Michael Mitzenmacher
2001	J	`jnl`	Efficient erasure correcting codes. IEEE Trans. Inf. Theory Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
2001	A	`conf`	Estimating Resemblance of MIDI Documents. ALENEX Michael Mitzenmacher, Sean Owen
2001	A*	`conf`	Fine-Grained Layered Multicast. INFOCOM John W. Byers, Michael Luby, Michael Mitzenmacher
2001	A*	`conf`	IMproved results for route planning in stochastic transportation. SODA Justin A. Boyan, Michael Mitzenmacher
2001	J	`jnl`	Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inf. Theory Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
2001	B	`conf`	On the Hardness of Finding Optimal Multiple Preset Dictionaries. Data Compression Conference Michael Mitzenmacher
2001	J	`jnl`	The Power of Two Choices in Randomized Load Balancing. IEEE Trans. Parallel Distributed Syst. Michael Mitzenmacher
2001	B	`conf`	Towards Compressing Web Graphs. Data Compression Conference Micah Adler, Michael Mitzenmacher
2001	J	`jnl`	Towards More Complete Models of TCP Latency and Throughput. J. Supercomput. Michael Mitzenmacher, Rajmohan Rajaraman
2001	A*	`conf`	Using Multiple Hash Functions to Improve IP Lookups. INFOCOM Andrei Z. Broder, Michael Mitzenmacher
2000	J	`jnl`	An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	A*	`conf`	An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	J	`jnl`	Average-case analyses of first fit and random fit bin packing. Random Struct. Algorithms Susanne Albers, Michael Mitzenmacher
2000	—	`conf`	FLID-DL: congestion control for layered multicast. Networked Group Communication John W. Byers, Michael Frumin, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, Alex Roetter, William Shaver
2000	J	`jnl`	How Useful Is Old Information? IEEE Trans. Parallel Distributed Syst. Michael Mitzenmacher
2000	A*	`conf`	Improved classification via connectivity information. SODA Andrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher
2000	A*	`conf`	Linear Waste of Best Fit Bin Packing on Skewed Distributions. FOCS Claire Kenyon, Michael Mitzenmacher
2000	J	`jnl`	Min-Wise Independent Permutations. J. Comput. Syst. Sci. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
2000	J	`jnl`	On near-uniform URL sampling. Comput. Networks Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork
1999	A*	`conf`	Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. INFOCOM John W. Byers, Michael Luby, Michael Mitzenmacher
1999	A*	`conf`	Analysis of Timing-Based Mutual Exclusion with Random Times. PODC Eli Gafni, Michael Mitzenmacher
1999	—	`conf`	Completeness and Robustness Properties of Min-Wise Independent Permutations. RANDOM-APPROX Andrei Z. Broder, Michael Mitzenmacher
1999	J	`jnl`	Measuring Index Quality Using Random Walks on the Web. Comput. Networks Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork
1999	J	`jnl`	On the Analysis of Randomized Load Balancing Schemes. Theory Comput. Syst. Michael Mitzenmacher
1999	J	`jnl`	Studying Balanced Allocations With Differential Equations. Comb. Probab. Comput. Michael Mitzenmacher
1999	A*	`conf`	Unscrambling Address Lines. SODA Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll
1998	—	`conf`	A Derandomization Using Min-Wise Independent Permutations. RANDOM Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
1998	A*	`conf`	A Digital Fountain Approach to Reliable Distribution of Bulk Data. SIGCOMM John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege
1998	B	`conf`	Analyses of Load Stealing Models Based on Differential Equations. SPAA Michael Mitzenmacher
1998	A*	`conf`	Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. STOC Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman
1998	A*	`conf`	Analysis of Random Processes via And-Or Tree Evaluation. SODA Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi
1998	J	`jnl`	Average Case Analyses of List Update Algorithms, with Applications to Data Compression. Algorithmica Susanne Albers, Michael Mitzenmacher
1998	A*	`conf`	Average-Case Analyses of First Fit and Random Fit Bin Packing. SODA Susanne Albers, Michael Mitzenmacher
1998	A*	`conf`	Delayed Information and Action in On-line Algorithms. FOCS Susanne Albers, Moses Charikar, Michael Mitzenmacher
1998	A*	`conf`	Min-Wise Independent Permutations (Extended Abstract). STOC Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
1998	—	`conf`	On Balls and Bins with Deletions. RANDOM Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
1998	J	`jnl`	Parallel randomized load balancing. Random Struct. Algorithms Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen
1998	A*	`conf`	Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 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
1997	J	`jnl`	Constant Time per Edge is Optimal on Rooted Tree Networks. Distributed Comput. Michael Mitzenmacher
1997	A*	`conf`	How Useful Is Old Information? (Extended Abstract). PODC Michael Mitzenmacher
1997	B	`conf`	On the Analysis of Randomized Load Balancing Schemes. SPAA Michael Mitzenmacher
1997	A*	`conf`	Practical Loss-Resilient Codes. STOC Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann
1997	J	`jnl`	Revisiting the Counter Algorithms for List Update. Inf. Process. Lett. Susanne Albers, Michael Mitzenmacher
1996	A*	`conf`	Average Case Analyses of List Update Algorithms, with Applications to Data Compression. ICALP Susanne Albers, Michael Mitzenmacher
1996	J	`jnl`	Bounds on the Greedy Routing Algorithm for Array Networks. J. Comput. Syst. Sci. Michael Mitzenmacher
1996	B	`conf`	Constant Time per Edge is Optimal on Rooted Tree Networks. SPAA Michael Mitzenmacher
1996	J	`jnl`	Designing stimulating programming assignments for an algorithms course: a collection of exercises based on random graphs. ACM SIGCSE Bull. Michael Mitzenmacher
1996	A*	`conf`	Load Balancing and Density Dependent Jump Markov Processes (extended abstract). FOCS Michael Mitzenmacher
1996	B	`conf`	Pattern-based Compression of Text Images. Data Compression Conference Andrei Z. Broder, Michael Mitzenmacher
1995	A*	`conf`	Parallel randomized load balancing (Preliminary Version). STOC Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen
1994	B	`conf`	Bounds on the Greedy Routing Algorithm for Array Networks. SPAA Michael Mitzenmacher
1994	J	`jnl`	Computational Complexity of Loss Networks. Theor. Comput. Sci. Graham Louth, Michael Mitzenmacher, Frank Kelly