Michael Mitzenmacher

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 124

Top Venues

Publications

Rana Shahout, Michael Mitzenmacher
Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams. CoRR (2024)
Rana Shahout, Michael Mitzenmacher
SkipPredict: When to Invest in Predictions for Scheduling. CoRR (2024)
Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Brad Karp, Ran Ben Basat
Beyond Throughput and Compression Ratios: Towards High End-to-end Utility of Gradient Compression. CoRR (2024)
Ran Ben-Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik
Optimal and Near-Optimal Adaptive Vector Quantization. CoRR (2024)
Minghao Li, Ran Ben Basat, Shay Vargaftik, ChonLam Lao, Kevin Xu, Michael Mitzenmacher, Minlan Yu
THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. NSDI (2024)
Minghao Li, Ran Ben Basat, Shay Vargaftik, ChonLam Lao, Kevin Xu, Xinran Tang, Michael Mitzenmacher, Minlan Yu
THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. CoRR (2023)
Jonatan Langlet, Ran Ben Basat, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
Direct Telemetry Access. SIGCOMM (2023)
Ibrahim Sabek, Kapil Vaidya, Dominik Horn, Andreas Kipf, Michael Mitzenmacher, Tim Kraska
Can Learned Models Replace Hash Functions? Proc. VLDB Endow. 16 (3) (2022)
Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learning. ICML (2022)
Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen Zhang, Stratos Idreos, Michael Mitzenmacher
Proteus: A Self-Designing Range Filter. SIGMOD Conference (2022)
Tianyi Chen, Brian Matejek, Michael Mitzenmacher, Charalampos E. Tsourakakis
Algorithmic Tools for Understanding the Motif Structure of Networks. ECML/PKDD (2) (2022)
Maximilian Lam, Michael Mitzenmacher, Vijay Janapa Reddi, Gu-Yeon Wei, David Brooks
Tabula: Efficiently Computing Nonlinear Activation Functions for Secure Neural Network Inference. CoRR (2022)
Wenchen Han, Vic Feng, Gregory Schwartzman, Michael Mitzenmacher, Minlan Yu, Ran Ben-Basat
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches. CoRR (2022)
Kapil Vaidya, Tim Kraska, Subarna Chatterjee, Eric R. Knorr, Michael Mitzenmacher, Stratos Idreos
SNARF: A Learning-Enhanced Range Filter. Proc. VLDB Endow. 15 (8) (2022)
Isaac Grosof, Michael Mitzenmacher
Incentive Compatible Queues Without Money. CoRR (2022)
Jonatan Langlet, Ran Ben Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
Direct Telemetry Access. CoRR (2022)
Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen Zhang, Stratos Idreos, Michael Mitzenmacher
Proteus: A Self-Designing Range Filter. CoRR (2022)
Michael Mitzenmacher, Matteo Dell'Amico
The Supermarket Model With Known and Predicted Service Times. IEEE Trans. Parallel Distributed Syst. 33 (11) (2022)
Ran Ben Basat, Shay Vargaftik, Amit Portnoy, Gil Einziger, Yaniv Ben-Itzhak, Michael Mitzenmacher
QUIC-FL: Quick Unbiased Compression for Federated Learning. CoRR (2022)
Ziv Scully, Isaac Grosof, Michael Mitzenmacher
Uniform Bounds for Scheduling with Job Size Estimates. ITCS (2022)
Michael Mitzenmacher, Sergei Vassilvitskii
Algorithms with predictions. Commun. ACM 65 (7) (2022)
Michael Mitzenmacher, Saeed Seddighin
Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem. CoRR (2021)
Jonatan Langlet, Ran Ben-Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
Zero-CPU Collection with Direct Telemetry Access. HotNets (2021)
Michael Mitzenmacher, Saeed Seddighin
Improved Sublinear Time Algorithm for Longest Increasing Subsequence. SODA (2021)
Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
DRIVE: One-bit Distributed Mean Estimation. CoRR (2021)
Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
SALSA: Self-Adjusting Lean Streaming Analytics. ICDE (2021)
Maximilian Lam, Gu-Yeon Wei, David Brooks, Vijay Janapa Reddi, Michael Mitzenmacher
Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix. ICML (2021)
Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
SALSA: Self-Adjusting Lean Streaming Analytics. CoRR (2021)
Maximilian Lam, Gu-Yeon Wei, David Brooks, Vijay Janapa Reddi, Michael Mitzenmacher
Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix. CoRR (2021)
Kapil Vaidya, Eric Knorr, Michael Mitzenmacher, Tim Kraska
Partitioned Learned Bloom Filters. ICLR (2021)
Shay Vargaftik, Ran Ben-Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
DRIVE: One-bit Distributed Mean Estimation. NeurIPS (2021)
Ran Ben Basat, Michael Mitzenmacher, Shay Vargaftik
How to Send a Real Number Using a Single Bit (And Some Shared Randomness). ICALP (2021)
Elbert Du, Franklyn Wang, Michael Mitzenmacher
Putting the "Learning" into Learning-Augmented Algorithms for Frequency Estimation. ICML (2021)
Jonatan Langlet, Ran Ben Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi
Zero-CPU Collection with Direct Telemetry Access. CoRR (2021)
Michael Mitzenmacher
Queues with Small Advice. ACDA (2021)
Ziv Scully, Isaac Grosof, Michael Mitzenmacher
Uniform Bounds for Scheduling with Job Size Estimates. CoRR (2021)
Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
Communication-Efficient Federated Learning via Robust Distributed Mean Estimation. CoRR (2021)
Michael Mitzenmacher, Sergei Vassilvitskii
Algorithms with Predictions. CoRR (2020)
Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
Adaptive Cuckoo Filters. ACM J. Exp. Algorithmics 25 (2020)
Michael Mitzenmacher, Saeed Seddighin
Erdös-Szekeres Partitioning Problem. CoRR (2020)
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. AISTATS (2020)
Valerio Bruschi, Ran Ben Basat, Zaoxing Liu, Gianni Antichi, Giuseppe Bianchi, Michael Mitzenmacher
DISCOvering the heavy hitters with disaggregated sketches. CoNEXT (2020)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Optimal Learning of Joint Alignments with a Faulty Oracle. ISIT (2020)
Kapil Vaidya, Eric Knorr, Tim Kraska, Michael Mitzenmacher
Partitioned Learned Bloom Filter. CoRR (2020)
Ran Ben Basat, Sivaramakrishnan Ramanathan, Yuliang Li, Gianni Antichi, Minlan Yu, Michael Mitzenmacher
PINT: Probabilistic In-band Network Telemetry. SIGCOMM (2020)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Optimal Learning of Joint Alignments with a Faulty Oracle. ITA (2020)
Michael Mitzenmacher, Saeed Seddighin
Dynamic algorithms for LIS and distance to monotonicity. STOC (2020)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Clustering with a faulty oracle. WWW (2020)
Ran Ben-Basat, Michael Mitzenmacher, Shay Vargaftik
How to send a real number using a single bit (and some shared randomness). CoRR (2020)
Michael Mitzenmacher, Charalampos E. Tsourakakis
Joint Alignment From Pairwise Differences with a Noisy Oracle. CoRR (2020)
Michael Mitzenmacher
Queues with Small Advice. CoRR (2020)
Jan Kucera, Ran Ben Basat, Mário Kuka, Gianni Antichi, Minlan Yu, Michael Mitzenmacher
Detecting routing loops in the data plane. CoNEXT (2020)
Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
Faster and More Accurate Measurement through Additive-Error Counters. CoRR (2020)
Michael Mitzenmacher
Scheduling with Predictions and the Price of Misprediction. ITCS (2020)
Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
Faster and More Accurate Measurement through Additive-Error Counters. INFOCOM (2020)
Ran Ben Basat, Sivaramakrishnan Ramanathan, Yuliang Li, Gianni Antichi, Minlan Yu, Michael Mitzenmacher
PINT: Probabilistic In-band Network Telemetry. CoRR (2020)
John W. Byers, Michael Luby, Michael Mitzenmacher
A digital fountain retrospective. Comput. Commun. Rev. 49 (5) (2019)
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
Online Pandora's Boxes and Bandits. CoRR (2019)
Michael Mitzenmacher
The Supermarket Model with Known and Predicted Service Times. CoRR (2019)
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. CoRR (2019)
Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis
Optimal Learning of Joint Alignments with a Faulty Oracle. CoRR (2019)
Michael Mitzenmacher, Tom Morgan
Robust Set Reconciliation via Locality Sensitive Hashing. PODS (2019)
Michael Mitzenmacher
Scheduling with Predictions and the Price of Misprediction. CoRR (2019)
Michael Mitzenmacher
A Model for Learned Bloom Filters, and Optimizing by Sandwiching. CoRR (2019)
Michael Mitzenmacher
Arithmetic Progression Hypergraphs: Examining the Second Moment Method. ANALCO (2019)
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher
Online Pandora's Boxes and Bandits. AAAI (2019)
Michael Mitzenmacher, Tom Morgan
Reconciling Graphs and Sets of Sets. PODS (2018)
Michael Mitzenmacher, Rasmus Pagh
Simple multi-party set reconciliation. Distributed Comput. 31 (6) (2018)
Michael Mitzenmacher, Tom Morgan
Directory Reconciliation. CoRR (2018)
Michael Mitzenmacher
Optimizing Learned Bloom Filters by Sandwiching. CoRR (2018)
Diana Cai, Michael Mitzenmacher, Ryan P. Adams
A Bayesian Nonparametric View on Count-Min Sketch. NeurIPS (2018)
Brandon Reagen, Udit Gupta, Bob Adolf, Michael Mitzenmacher, Alexander M. Rush, Gu-Yeon Wei, David Brooks
Weightless: Lossy weight encoding for deep neural network compression. ICML (2018)
Michael Mitzenmacher, Konstantinos Panagiotou, Stefan Walzer
Load Thresholds for Cuckoo Hashing with Double Hashing. SWAT (2018)
Michael Mitzenmacher
A Model for Learned Bloom Filters and Related Structures. CoRR (2018)
Michael Mitzenmacher, Charalampos E. Tsourakakis
Joint Alignment from Pairwise Differences with a Noisy Oracle. WAW (2018)
Michael Mitzenmacher
A Model for Learned Bloom Filters and Optimizing by Sandwiching. NeurIPS (2018)
Michael Mitzenmacher, Tom Morgan
Robust Set Reconciliation via Locality Sensitive Hashing. CoRR (2018)
Hossein Esfandiari, Michael Mitzenmacher
Metric Sublinear Algorithms via Linear Sampling. FOCS (2018)
Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche
Better Bounds for Coalescing-Branching Random Walks. ACM Trans. Parallel Comput. 5 (1) (2018)
Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher
EMOMA: Exact Match in One Memory Access. IEEE Trans. Knowl. Data Eng. 30 (11) (2018)
Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
Adaptive Cuckoo Filters. ALENEX (2018)
Brandon Reagen, Udit Gupta, Robert Adolf, Michael Mitzenmacher, Alexander M. Rush, Gu-Yeon Wei, David Brooks
Weightless: Lossy weight encoding for deep neural network compression. ICLR (Workshop) (2018)
Hossein Esfandiari, Michael Mitzenmacher
Metric Sublinear Algorithms via Linear Sampling. CoRR (2018)
Max Hopkins, Michael Mitzenmacher, Sebastian Wagner-Carena
Simulated Annealing for JPEG Quantization. DCC (2018)
Michael Mitzenmacher, Tom Morgan
Reconciling Graphs and Sets of Sets. CoRR (2017)
Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
Adaptive Cuckoo Filters. CoRR (2017)
Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher
Scalable Motif-aware Graph Clustering. WWW (2017)
Brian Matejek, Daniel Haehn, Fritz Lekschas, Michael Mitzenmacher, Hanspeter Pfister
Compresso: Efficient Compression of Segmentation Data for Connectomics. MICCAI (1) (2017)
David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. PODS (2017)
Michael Mitzenmacher
Arithmetic Progression Hypergraphs: Examining the Second Moment Method. CoRR (2017)
Michael Mitzenmacher
Technical Perspective: Building a better hash function. Commun. ACM 60 (7) (2017)
Martin Dietzfelbinger, Michael Mitzenmacher, Rasmus Pagh, David P. Woodruff, Martin Aumüller
Theory and Applications of Hashing (Dagstuhl Seminar 17181). Dagstuhl Reports 7 (5) (2017)
Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher
EMOMA: Exact Match in One Memory Access. CoRR (2017)
Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
Auditable Data Structures. EuroS&P (2017)
Max Hopkins, Michael Mitzenmacher, Sebastian Wagner-Carena
Simulated Annealing for JPEG Quantization. CoRR (2017)
Charalampos E. Tsourakakis, Michael Mitzenmacher, Jaroslaw Blasiok, Ben Lawson, Preetum Nakkiran, Vasileios Nakos
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. CoRR (2017)
Meena Boppana, Rani Hod, Michael Mitzenmacher, Tom Morgan
Voronoi Choice Games. ICALP (2016)
Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche
Better Bounds for Coalescing-Branching Random Walks. SPAA (2016)
Yakir A. Reshef, David N. Reshef, Hilary K. Finucane, Pardis C. Sabeti, Michael Mitzenmacher
Measuring Dependence Powerfully and Equitably. J. Mach. Learn. Res. 17 (2016)
Michael Mitzenmacher
More Analysis of Double Hashing for Balanced Allocations. ANALCO (2016)

Michael Mitzenmacher.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Mitzenmacher