Michael Mitzenmacher

Michael Mitzenmacher's AcademicInfluence.com Rankings

Computer Science

#855

World Rank

#886

Historical Rank

#464

USA Rank

Database

#865

World Rank

#907

Historical Rank

#263

USA Rank

computer-science Degrees

Download Badge

Computer Science

Michael Mitzenmacher's Degrees

PhD Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Michael Mitzenmacher Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michael David Mitzenmacher is an American computer scientist working in algorithms. He is Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences and was area dean of computer science July 2010 to June 2013. He also runs My Biased Coin, a blog about theoretical computer science.

(See a Problem?)

Michael Mitzenmacher's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Detecting Novel Associations in Large Data Sets (2011) (2257)
Network Applications of Bloom Filters: A Survey (2004) (2241)
Probability and Computing: Randomized Algorithms and Probabilistic Analysis (2005) (2021)
A Brief History of Generative Models for Power Law and Lognormal Distributions (2004) (1746)
A digital fountain approach to reliable distribution of bulk data (1998) (1388)
The Power of Two Choices in Randomized Load Balancing (2001) (1338)
Efficient erasure correcting codes (2001) (1237)
Privacy Preserving Keyword Searches on Remote Encrypted Data (2005) (1206)
Min-Wise Independent Permutations (2000) (895)
Improved low-density parity-check codes using irregular graphs (2001) (842)
Practical loss-resilient codes (1997) (796)
A digital fountain approach to asynchronous reliable multicast (2002) (627)
Compressed bloom filters (2001) (604)
Cuckoo Filter: Practically Better Than Bloom (2014) (520)
The power of two random choices: a survey of tech-niques and results (2001) (434)
Less hashing, same performance: Building a better Bloom filter (2006) (397)
Informed content delivery across adaptive overlay networks (2002) (368)
On compressing social networks (2009) (354)
An Improved Construction for Counting Bloom Filters (2006) (353)
Analysis of random processes via And-Or tree evaluation (1998) (344)
Analysis of low density codes and improved designs using irregular graphs (1998) (344)
Min-wise independent permutations (extended abstract) (1998) (333)
Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads (1999) (331)
Simple Load Balancing for Distributed Hash Tables (2003) (326)
On near-uniform URL sampling (2000) (291)
Digital fountains: a survey and look forward (2004) (274)
Network Coding Meets TCP: Theory and Implementation (2011) (272)
Network Coding Meets TCP (2008) (267)
Using multiple hash functions to improve IP lookups (2001) (258)
How Useful Is Old Information? (2000) (256)
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (2010) (256)
Towards compressing Web graphs (2001) (245)
Privacy-preserving group data access via stateless oblivious RAM simulation (2011) (237)
Practical verified computation with streaming interactive proofs (2011) (226)
FLID-DL: congestion control for layered multicast (2000) (226)
A Survey of Results for Deletion Channels and Related Synchronization Channels (2008) (215)
Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds (2003) (214)
Network monitoring using traffic dispersion graphs (tdgs) (2007) (206)
Beyond bloom filters: from approximate membership checks to approximate state machines (2006) (191)
Invertible bloom lookup tables (2011) (188)
Real-time parallel hashing on the GPU (2009) (188)
More Robust Hashing: Cuckoo Hashing with a Stash (2008) (184)
Parallel randomized load balancing (1995) (180)
Compressed bloom filters (2002) (173)
Why simple hash functions work: exploiting the entropy in a data stream (2008) (170)
A complete and effective move set for simplified protein folding (2003) (165)
Probability And Computing (2005) (157)
Stochastic Shortest Paths Via Quasi-convex Maximization (2006) (155)
Measuring Index Quality Using Random Walks on the Web (1999) (154)
Oblivious RAM simulation with efficient worst-case access overhead (2011) (149)
Dynamic Models for File Sizes and Double Pareto Distributions (2004) (147)
Popularity Is Everything: A New Approach to Protecting Passwords from Statistical-Guessing Attacks (2010) (139)
Tight Thresholds for Cuckoo Hashing via XORSAT (2009) (133)
Scalable Motif-aware Graph Clustering (2016) (123)
A Model for Learned Bloom Filters and Optimizing by Sandwiching (2018) (121)
Fine-grained layered multicast (2001) (115)
On the Analysis of Randomized Load Balancing Schemes (1997) (107)
Daily deals: prediction, social diffusion, and reputational ramifications (2011) (106)
Load balancing and density dependent jump Markov processes (1996) (104)
The groupon effect on yelp ratings: a root cause analysis (2012) (101)
Distance-Sensitive Bloom Filters (2006) (99)
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling (2015) (98)
Exhaustive approaches to 2D rectangular perfect packings (2004) (95)
Computational Complexity of Loss Networks (1994) (94)
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified (2012) (93)
PINT: Probabilistic In-band Network Telemetry (2020) (92)
Trace reconstruction with constant deletion probability and related results (2008) (91)
Practical oblivious storage (2012) (88)
Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels (2007) (87)
Load balancing with memory (2002) (87)
Algorithms with predictions (2020) (87)
Verifiable Computation with Massively Parallel Interactive Proofs (2012) (82)
Editorial: The Future of Power Law Research (2005) (81)
Local cluster aggregation models of explosive percolation. (2010) (79)
Hash-Based Techniques for High-Speed Packet Processing (2010) (76)
Equitability Analysis of the Maximal Information Coefficient, with Comparisons (2013) (75)
Scheduling with Predictions and the Price of Misprediction (2019) (74)
Measuring Dependence Powerfully and Equitably (2015) (71)
Graption: A graph-based P2P traffic classification framework for the internet backbone (2011) (71)
Exploiting dynamicity in graph-based traffic analysis: techniques and applications (2009) (71)
Variations on Random Graph Models for the Web (2001) (69)
X-tolerant signature analysis (2004) (68)
The Power of One Move: Hashing Schemes for Hardware (2008) (68)
Geometric generalizations of the power of two choices (2004) (68)
Graph-Based P2P Traffic Classification at the Internet Backbone (2009) (67)
Analyses of load stealing models based on differential equations (1998) (65)
Human-guided search (2010) (65)
Efficient estimation for high similarities using odd sketches (2014) (62)
Informed content delivery across adaptive overlay networks (2004) (61)
Human-guided tabu search (2002) (61)
Verification-based decoding for packet-based low-density parity-check codes (2005) (61)
Average-case analyses of first fit and random fit bin packing (2000) (61)
New heuristic and interactive approaches to 2D rectangular strip packing (2005) (60)
Network-Aware Overlays with Network Coordinates (2006) (60)
A Simple Lower Bound for the Capacity of the Deletion Channel (2006) (59)
Capacity Upper Bounds for the Deletion Channel (2007) (57)
Building an Efficient Hash Table on the GPU (2012) (57)
Designing Floating Codes for Expected Performance (2008) (56)
An Analysis of Random-Walk Cuckoo Hashing (2009) (56)
Average Case Analyses of List Update Algorithms, with Applications to Data Compression (1996) (56)
Tight asymptotic bounds for the deletion channel with small deletion probabilities (2010) (55)
Probability and Computing: Chernoff Bounds (2005) (55)
Codes for Deletion and Insertion Channels With Segmented Errors (2007) (53)
Adaptive Cuckoo Filters (2017) (53)
Capacity Bounds for Sticky Channels (2008) (52)
A Month in the Life of Groupon (2011) (52)
Balls and bins models with feedback (2002) (51)
On Balls and Bins with Deletions (1998) (51)
Some Open Questions Related to Cuckoo Hashing (2009) (50)
The Asymptotics of Selecting the Shortest of Two, Improved (1999) (50)
Hierarchical Heavy Hitters with the Space Saving Algorithm (2011) (49)
Using the Power of Two Choices to Improve Bloom Filters (2007) (47)
Randomized protocols for low-congestion circuit routing in multistage interconnection networks (1998) (47)
Bounds on the greedy routing algorithm for array networks (1994) (47)
Studying Balanced Allocations with Differential Equations (1999) (46)
The hiring problem and Lake Wobegon strategies (2008) (44)
Improved results for route planning in stochastic transportation (2000) (44)
Proceedings of the forty-first annual ACM symposium on Theory of computing (2009) (43)
Biff (Bloom filter) codes: Fast error correction for large data sets (2012) (42)
Power laws for monkeys typing randomly: the case of unequal probabilities (2004) (41)
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (2001) (41)
On Lower Bounds for the Capacity of Deletion Channels (2006) (41)
An efficient rigorous approach for identifying statistically significant frequent itemsets (2009) (41)
MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations (2010) (40)
Coding for Random Projections (2013) (40)
Streaming Graph Computations with a Helpful Advisor (2010) (38)
Using a Queue to De-amortize Cuckoo Hashing in Hardware (2007) (38)
X-tolerant test response compaction (2005) (38)
Simple Summaries for Hashing With Choices (2008) (37)
HEXA: Compact Data Structures for Faster Packet Processing (2007) (37)
The HuGS platform: a toolkit for interactive optimization (2002) (36)
Fast Approximate Reconciliation of Set Differences (2002) (36)
Bloom Filters via d-Left Hashing and Dynamic Bit Reassignment Extended Abstract (2006) (35)
Estimating and comparing entropies across written natural languages using PPM compression (2003) (34)
Wired Geometric Routing (2007) (34)
A derandomization using min-wise independent permutations (1998) (33)
Analyses of Load Stealing Models Based on Families of Differential Equations (2000) (31)
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms (2006) (31)
Cleaning up the record on the maximal information coefficient and equitability (2014) (31)
Tight Thresholds for The Pure Literal Rule (1997) (30)
Analysis of timing-based mutual exclusion with random times (1999) (30)
Parallel Peeling Algorithms (2013) (30)
Weightless: Lossy Weight Encoding For Deep Neural Network Compression (2017) (30)
Scaling Up Clustered Network Appliances with ScaleBricks (2015) (29)
Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank (2010) (29)
How useful is old information (extended abstract)? (1997) (29)
An empirical study of the maximal and total information coefficients and leading measures of dependence (2018) (29)
Information asymmetries in pay-per-bid auctions (2010) (29)
A Model for Learned Bloom Filters and Related Structures (2018) (28)
Delayed information and action in on-line algorithms (1998) (28)
Analyzing distributed Join-Idle-Queue: A fluid limit approach (2016) (27)
A brief history of lognormal and power law distributions (2001) (26)
Information Dissemination via Random Walks in d-Dimensional Space (2011) (26)
Concatenated codes for deletion channels (2003) (25)
Simple multi-party set reconciliation (2013) (24)
Distributed beamforming with binary signaling (2008) (24)
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket (2014) (23)
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection (2017) (22)
Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix (2021) (22)
Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (1999) (21)
Building a Better Bloom Filter (2005) (21)
Bounds and Improvements for BiBa Signature Schemes (2002) (20)
An Empirical Study of Leading Measures of Dependence (2015) (20)
An Economically-Principled Generative Model of AS Graph Connectivity (2009) (20)
AMS Without 4-Wise Independence on Product Domains (2008) (20)
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice (2017) (20)
Graption : Automated Detection of P 2 P Applications using Traffic Dispersion Graphs ( TDGs ) (2008) (19)
Repeated deletion channels (2014) (18)
Linear waste of best fit bin packing on skewed distributions (2000) (18)
A Scaling Result for Explosive Processes (2004) (18)
A Note on Low Density Parity Check Codes for Erasures and Errors (1998) (18)
Constant time per edge is optimal on rooted tree networks (1996) (17)
Equitability, interval estimation, and statistical power (2015) (17)
DRIVE: One-bit Distributed Mean Estimation (2021) (17)
Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$ (2006) (17)
Proceedings of the forty-second ACM symposium on Theory of computing (2010) (17)
Network Traffic Analysis using Traffic Dispersion Graphs (TDGs): Techniques and Hardware Implementation (2007) (16)
Online Pandora's Boxes and Bandits (2019) (16)
On the Theory and Practice of Data Recovery with Multiple Versions (2006) (16)
Putting the "Learning" into Learning-Augmented Algorithms for Frequency Estimation (2021) (16)
Simulated Annealing for JPEG Quantization (2017) (16)
Biological Pathways (2009) (16)
Interfacing network coding with TCP: an implementation (2009) (16)
Partitioned Learned Bloom Filter (2020) (16)
Cuckoo Hashing with Pages (2011) (15)
Towards More Complete Models of TCP Latency and Throughput (2001) (15)
EMOMA: Exact Match in One Memory Access (2017) (15)
Peeling arguments and double hashing (2012) (15)
On lower bounds for the capacity of deletion channels (2004) (15)
Improved classification via connectivity information (2000) (15)
Designing sensitive viral diagnostics with machine learning (2022) (14)
On the zero-error capacity threshold for deletion channels (2011) (14)
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 (2009) (13)
Simple Summaries for Hashing with Multiple Choices (2005) (13)
Models and Algorithms for Graph Watermarking (2016) (12)
Fine-grained Layered multicast with STAIR (2006) (12)
OMASS: One Memory Access Set Separation (2016) (12)
On the hardness of finding optimal multiple preset dictionaries (2004) (12)
Balanced allocations and double hashing (2012) (12)
Uniform Bounds for Scheduling with Job Size Estimates (2021) (12)
Compresso: Efficient Compression of Segmentation Data for Connectomics (2017) (12)
Reliability-and capacity-based selection in distributed hash tables (2003) (12)
Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks (2005) (12)
The complexity of object reconciliation, and open problems related to set difference and coding (2012) (11)
Queues with Small Advice (2020) (11)
Partitioned Learned Bloom Filters (2021) (11)
Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps (2011) (11)
Optimal plans for aggregation (2002) (11)
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best (2019) (10)
A Bayesian Nonparametric View on Count-Min Sketch (2018) (10)
Carousel: Scalable Logging for Intrusion Prevention Systems (2010) (10)
Dynamic algorithms for LIS and distance to monotonicity (2020) (10)
Detecting routing loops in the data plane (2020) (10)
Verification Codes (2002) (10)
Multi-party set reconciliation using characteristic polynomials (2014) (10)
The MARKOV EXPERT for finding episodes in time series (2005) (10)
A Case Study in Large-Scale Interactive Optimization (2005) (10)
Heapable Sequences and Subsequences (2010) (10)
Improving the performance of Invertible Bloom Lookup Tables (2014) (9)
Space Lower Bounds for Itemset Frequency Sketches (2014) (9)
Anonymous Card Shuffling and Its Applications to Parallel Mixnets (2012) (9)
How to send a real number using a single bit (and some shared randomness) (2020) (9)
Faster and More Accurate Measurement through Additive-Error Counters (2020) (9)
BU/NSF Workshop on Internet Measurement Instrumentation and Characterization (1999) (9)
Pattern-based compression of text images (1996) (8)
Completeness and robustness properties of min-wise independent permutations (1999) (8)
EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learning (2021) (8)
A New Approach to Analyzing Robin Hood Hashing (2014) (8)
Human-Guided Search for Jobshop Scheduling (2003) (8)
Probability and Computing: Martingales (2005) (8)
Interactive data summarization: an example application (2004) (8)
Coding for Random Projections and Approximate Near Neighbor Search (2014) (8)
Reconciling Graphs and Sets of Sets (2017) (8)
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability (2012) (8)
Revisiting the Counter Algorithms for List Update (1997) (8)
Improved Sublinear Time Algorithm for Longest Increasing Subsequence (2021) (8)
Theoretical Foundations of Equitability and the Maximal Information Coefficient (2014) (8)
The Supermarket Model with Known and Predicted Service Times (2019) (7)
On the performance of multiple choice hash tables with moves on deletes and inserts (2008) (7)
Optimizing Learned Bloom Filters by Sandwiching (2018) (7)
SALSA: Self-Adjusting Lean Streaming Analytics (2021) (7)
Better Bounds for Coalescing-Branching Random Walks (2016) (7)
Multidimensional balanced allocations (2005) (6)
Designing viral diagnostics with model-based optimization (2021) (6)
PINT (2020) (6)
Oblivious Storage with Low I/O Overhead (2011) (6)
On the hardness of finding optimal multiple preset dictionaries (2001) (6)
Broder and Mitzenmacher : Network Applications of Bloom Filters : A Survey 487 (2002) (6)
Clustering with a faulty oracle (2020) (6)
Load Thresholds for Cuckoo Hashing with Double Hashing (2018) (6)
Parallel randomized load balancing (Preliminary Version). (1995) (6)
Deriving performance bounds for ISI channels using Gallager codes (2001) (6)
Probability and Computing: Events and Probability (2005) (6)
Voronoi Choice Games (2016) (5)
Quantized Random Projections and Non-Linear Estimation of Cosine Similarity (2016) (5)
Predicting Signed Edges with $O(n^{1+o(1)} \log{n})$ Queries (2016) (5)
A digital fountain retrospective (2019) (5)
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract) (2000) (5)
Human-Guided Search : Survey and Recent Results (2003) (5)
Metric Sublinear Algorithms via Linear Sampling (2018) (5)
More Practical and Secure History-Independent Hash Tables (2016) (5)
Probability and computing : an introduction to randomizedalgorithms and probabilistic analysis (2005) (5)
More Analysis of Double Hashing for Balanced Allocations (2015) (5)
Estimating Resemblance of MIDI Documents (2001) (5)
Worst-Case and Average-Case Floating Codes for Flash Memory (2009) (4)
Auditable Data Structures (2017) (4)
Communication-Efficient Federated Learning via Robust Distributed Mean Estimation (2021) (4)
An improved analysis of the lossy difference aggregator (2010) (4)
Parallel peeling algorithms (2014) (4)
Load Balancing and Density Dependent Jump Markov Processes EXTENDED ABSTRACT (1996) (4)
Zero-CPU Collection with Direct Telemetry Access (2021) (4)
2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search (2016) (3)
The Monty Hall Problem: A Study (2005) (3)
QUIC-FL: Quick Unbiased Compression for Federated Learning (2022) (3)
Better Bounds for Coalescing-Branching Random Walks (2018) (3)
Verification Codes : Simple Low-Density Parity-Check Codes for Large Alphabets (2002) (3)
Predicting Signed Edges with O(n log n) Queries (2016) (3)
Joint Alignment from Pairwise Differences with a Noisy Oracle (2018) (3)
The daily deals marketplace: empirical observations and managerial implications (2012) (3)
Tossing a Biased Coin (2007) (3)
An Economic Analysis of User-Privacy Options in Ad-Supported Services (2012) (3)
DISCOvering the heavy hitters with disaggregated sketches (2020) (3)
How to Read a Research Paper (2012) (3)
The Evolution of Two-Sided Markets: A Dynamic Model (2010) (2)
Towards Better Definitions and Measures of Internet Security (2011) (2)
Probability and Computing: Coupling of Markov Chains (2005) (2)
Tabula: Efficiently Computing Nonlinear Activation Functions for Secure Neural Network Inference (2022) (2)
Capacity Approaching Signal Constellations for Channels with Memory (2001) (2)
Can Learned Models Replace Hash Functions? (2022) (2)
A rigorous statistical approach for identifying significant itemsets (2009) (2)
Efficient design of maximally active and specific nucleic acid diagnostics for thousands of viruses (2020) (2)
Erdös-Szekeres Partitioning Problem (2020) (2)
Technical Perspective: Catching lies (and mistakes) in offloaded computation (2016) (2)
On -Dual Binary Codes (2007) (2)
Testing k-Wise Independence over Streaming Data (2009) (2)
The power spectra of good codes for partial response channels (2003) (2)
Designing stimulating programming assignments for an algorithms course: a collection of exercises based on random graphs (1996) (2)
Algorithmic Tools for Understanding the Motif Structure of Networks (2022) (2)
Business Process Optimization (2002) (2)
Adaptive weighing designs for keyword value computation (2010) (2)
External-Memory Multimaps (2011) (2)
Towards a theory of networked computation (2006) (2)
Optimal Learning of Joint Alignments with a Faulty Oracle (2019) (2)
Exact sampling of TCP window states (2002) (1)
Pairwise Independence and Universal Hash Functions (2005) (1)
Subexponential time algorithms for embedding H-Minor free graphs (2016) (1)
Streaming Graph Computations with a Helpful Advisor (2011) (1)
Bloom Filters (2009) (1)
Hardness of peeling with stashes (2014) (1)
SNARF: A Learning-Enhanced Range Filter (2022) (1)
Codes - Protecting Data Against Errors and Loss (2011) (1)
An experimental assignment on random processes (2001) (1)
When Simple Hash Functions Suffice (2020) (1)
Technical Perspective: Building a better hash function (2017) (1)
Theory and Applications of Hashing (Dagstuhl Seminar 17181) (2017) (1)
New Results and Open Problems for Deletion Channels (2006) (1)
Approximate Hamming Distance in a Stream (2016) (1)
Algorithms and models for the web graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, proceedings (2013) (1)
Optimal Learning of Joint Alignments with a Faulty Oracle (2020) (1)
Fast Approximate Reconciliation of Set Di erences John Byers (2002) (1)
Unscrambling address lines (1999) (1)
Higher Order Hidden Markov Models for Dna-binding Site Identiication (2007) (0)
Entropy, Randomness, and Information (2005) (0)
Diagnostic design with machine learning model-based optimization (2021) (0)
Shaking the Tree Shannon, Beethoven, and the Compact Disc Kees A. Schouhamer Immink (0)
A Digital Fountain Approach to Asynchronous (2002) (0)
Algorithms and Models for the Web Graph (2013) (0)
Direct Telemetry Access (2022) (0)
Incentive Compatible Queues Without Money (2022) (0)
Session details: Session 5B (2002) (0)
Probability and Computing: Discrete Random Variables and Expectation (2005) (0)
Continuous Distributions and the Poisson Process (2005) (0)
Theory without experiments (2015) (0)
Arithmetic Progression Hypergraphs: Examining the Second Moment Method (2017) (0)
CS 222 Lecture 3 : September 30 , 1999 Fall (2009) (0)
Theory and applications of hashing : report from Dagstuhl Seminar 17181 (2017) (0)
Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009) (2012) (0)
The Probabilistic Method (2005) (0)
Proteus: A Self-Designing Range Filter (2022) (0)
A Derandomization Using Min-Wise Independent Permutations Extended abstract for submission to Random ’ 98 not for distribution (1998) (0)
Directory Reconciliation (2018) (0)
Session details: Session 1B (2002) (0)
Session details: Markov chains (2009) (0)
Optimal Plans for Aggregation Andrei (2002) (0)
. By Theorem 5, we P (0)
Lower bounds for the capacity of channels with i.i.d. deletions and insertions (2005) (0)
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches (2022) (0)
An introduction to human-guided search (2010) (0)
External-Memory Multimaps (2013) (0)
Catching Lies (and Mistakes) in Offloaded Computation (2016) (0)
HEXA: CompactDataStructures forFaster Packet Processing (2007) (0)
2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA (2019) (0)
Challenging students with creative assignments (2001) (0)
Markov Chains and Random Walks (2005) (0)
Traffic Analysis using Dynamic Traffic Dispersion Graphs : A study in Time and Space (2008) (0)
Front Matter, Table of Contents, Preface, Organization, List of Authors (2016) (0)
Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem (2021) (0)
Probability and Computing : Solutions to Selected Exercises (2006) (0)
Simple multi-party set reconciliation (2017) (0)
The Monte Carlo Method (2005) (0)
Some Practical Randomized Algorithms and Data Structures (2014) (0)
Probability and Computing: Balls, Bins, and Random Graphs (2005) (0)
Robust Set Reconciliation via Locality Sensitive Hashing (2018) (0)
SNARF (2022) (0)
Hash-based data structures for extreme conditions (2008) (0)
2002 Information Theory Society Paper Award (2001) (0)
2 Subexponential Time Algorithms for Embedding H-Minor Free Graphs (2016) (0)
Continuous time channels with interference (2012) (0)
Session details: Approximation algorithms II (2009) (0)
Session details: Award papers (2009) (0)
37 40 v 4 [ cs . D S ] 9 M ar 2 01 6 Space Lower Bounds for Itemset Frequency Sketches ∗ Edo Liberty (2018) (0)
Session details: Session 3A (2002) (0)
Algorithm alley: unbiasing random bits (2002) (0)
Moments and Deviations (2005) (0)
Bloom Filters, Cuckoo Hashing, Cuckoo Filters, Adaptive Cuckoo Filters, and Learned Bloom Filters (2018) (0)
LIPIcs, Volume 55, ICALP'16, Complete Volume (2016) (0)
Tight Thresholds for Cuckoo Hashing via XORSAT ( Extended Abstract ) (2010) (0)
Codes forDeletion and Insertion Channels with SegmentedErrors (2007) (0)
Brief announcement: large-scale multimaps (2011) (0)
Bulk Data Distribution Paper Review " a Digital Fountain Approach to Reliable Distribution of Bulk Data " Was Published (2010) (0)
Report from Dagstuhl Seminar 17181 Theory and Applications of Hashing (2017) (0)
The 2013 principles of distributed computing doctoral dissertation award (2013) (0)
THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression (2023) (0)

This paper list is powered by the following services:

Other Resources About Michael Mitzenmacher

What Schools Are Affiliated With Michael Mitzenmacher?

Michael Mitzenmacher is affiliated with the following schools:

Michael Mitzenmacher's Academic­Influence.com Rankings