Michael Mitzenmacher

Graham Cormode, Michael Mitzenmacher, Justin Thaler: Streaming Graph Computations with a Helpful Advisor. Algorithmica 65(2): 409-442 (2013)

David Reshef, Yakir Reshef, Michael Mitzenmacher, Pardis Sabeti: Equitability Analysis of the Maximal Information Coefficient, with Comparisons. CoRR abs/1301.6314 (2013)

Jiayang Jiang, Michael Mitzenmacher, Justin Thaler: Parallel Peeling Algorithms. CoRR abs/1302.7014 (2013)

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

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

Justin Thaler, Michael Mitzenmacher, Thomas Steinke: Hierarchical Heavy Hitters with the Space Saving Algorithm. ALENEX 2012: 160-174

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Practical oblivious storage. CODASPY 2012: 13-24

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

Graham Cormode, Michael Mitzenmacher, Justin Thaler: Practical verified computation with streaming interactive proofs. ITCS 2012: 90-112

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

Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry Yuen: Continuous time channels with interference. ISIT 2012: 860-864

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler: Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg 2012: 203-218

John W. Byers, Michael Mitzenmacher, Georgios Zervas: The groupon effect on yelp ratings: a root cause analysis. ACM Conference on Electronic Commerce 2012: 248-265

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Privacy-preserving group data access via stateless oblivious RAM simulation. SODA 2012: 157-167

Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang: Information dissemination via random walks in d-dimensional space. SODA 2012: 1612-1622

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

Joan Feigenbaum, Michael Mitzenmacher, Georgios Zervas: An Economic Analysis of User-Privacy Options in Ad-Supported Services. WINE 2012: 30-43

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

Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry Yuen: Continuous Time Channels with Interference. CoRR abs/1201.6117 (2012)

Justin Thaler, Mike Roberts, Michael Mitzenmacher, Hanspeter Pfister: Verifiable Computation with Massively Parallel Interactive Proofs. CoRR abs/1202.1350 (2012)

John W. Byers, Michael Mitzenmacher, Georgios Zervas: The Groupon Effect on Yelp Ratings: A Root Cause Analysis. CoRR abs/1202.2369 (2012)

Michael T. Goodrich, Michael Mitzenmacher: Anonymous Card Shuffling and its Applications to Parallel Mixnets. CoRR abs/1205.1579 (2012)

Joan Feigenbaum, Michael Mitzenmacher, Georgios Zervas: An Economic Analysis of User-Privacy Options in Ad-Supported Services. CoRR abs/1208.0383 (2012)

Michael Mitzenmacher, George Varghese: Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets. CoRR abs/1208.0798 (2012)

Michael Mitzenmacher: Balanced Allocations and Double Hashing. CoRR abs/1209.5360 (2012)

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

Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Szymon Jakubczak, Michael Mitzenmacher, João Barros: Network Coding Meets TCP: Theory and Implementation. Proceedings of the IEEE 99(3): 490-512 (2011)

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

Michael Mitzenmacher: Codes - Protecting Data Against Errors and Loss. Algorithms Unplugged 2011: 203-217

John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas: Heapable Sequences and Subsequences. ANALCO 2011: 33-44

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious RAM simulation with efficient worst-case access overhead. CCSW 2011: 95-100

Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink: Cuckoo Hashing with Pages. ESA 2011: 615-627

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

Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler: External-Memory Multimaps. ISAAC 2011: 384-394

Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman: On the zero-error capacity threshold for deletion channels. ITA 2011: 285-289

Michael T. Goodrich, Michael Mitzenmacher: Brief announcement: large-scale multimaps. SPAA 2011: 259-260

Michael T. Goodrich, Michael Mitzenmacher: Invertible Bloom Lookup Tables. CoRR abs/1101.2245 (2011)

Ian A. Kash, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman: On the Zero-Error Capacity Threshold for Deletion Channels. CoRR abs/1102.0040 (2011)

Michael Mitzenmacher, Thomas Steinke, Justin Thaler: Hierarchical Heavy Hitters with the Space Saving Algorithm. CoRR abs/1102.5540 (2011)

Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink: Cuckoo Hashing with Pages. CoRR abs/1104.5111 (2011)

Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang: Information Dissemination via Random Walks in d-Dimensional Space. CoRR abs/1104.5268 (2011)

Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler: External-Memory Multimaps. CoRR abs/1104.5533 (2011)

John W. Byers, Michael Mitzenmacher, Michalis Potamias, Georgios Zervas: A Month in the Life of Groupon. CoRR abs/1105.0903 (2011)

Graham Cormode, Michael Mitzenmacher, Justin Thaler: Practical Verified Computation with Streaming Interactive Proofs. CoRR abs/1105.2003 (2011)

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation. CoRR abs/1105.4125 (2011)

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

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. CoRR abs/1107.5093 (2011)

John W. Byers, Michael Mitzenmacher, Georgios Zervas: Daily Deals: Prediction, Social Diffusion, and Reputational Ramifications. CoRR abs/1109.1530 (2011)

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

Graham Cormode, Michael Mitzenmacher, Justin Thaler: Streaming Graph Computations with a Helpful Advisor. Electronic Colloquium on Computational Complexity (ECCC) 18: 105 (2011)

Hilary Finucane, Michael Mitzenmacher: An improved analysis of the lossy difference aggregator. Computer Communication Review 40(2): 4-11 (2010)

Michael Mitzenmacher: An introduction to human-guided search. ACM Crossroads 17(2): 34-35 (2010)

Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher: Human-guided search. J. Heuristics 16(3): 289-310 (2010)

Zhenming Liu, Michael Mitzenmacher: Codes for deletion and insertion channels with segmented errors. IEEE Transactions on Information Theory 56(1): 224-232 (2010)

Flavio Chierichetti, Hilary Finucane, Zhenming Liu, Michael Mitzenmacher: Designing floating codes for expected performance. IEEE Transactions on Information Theory 56(3): 968-978 (2010)

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

Graham Cormode, Michael Mitzenmacher, Justin Thaler: Streaming Graph Computations with a Helpful Advisor. ESA (1) 2010: 231-242

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

Adam Kalai, Michael Mitzenmacher, Madhu Sudan: Tight asymptotic bounds for the deletion channel with small deletion probabilities. ISIT 2010: 997-1001

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

John W. Byers, Michael Mitzenmacher, Georgios Zervas: Information asymmetries in pay-per-bid auctions. ACM Conference on Electronic Commerce 2010: 1-12

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

John W. Byers, Michael Mitzenmacher, Georgios Zervas: Adaptive weighing designs for keyword value computation. WSDM 2010: 331-340

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

Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. CoRR abs/1002.1104 (2010)

Graham Cormode, Michael Mitzenmacher, Justin Thaler: Streaming Graph Computations with a Helpful Advisor. CoRR abs/1004.2899 (2010)

Michael T. Goodrich, Michael Mitzenmacher: MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations. CoRR abs/1007.1259 (2010)

John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas: Heapable Sequences and Subsequences. CoRR abs/1007.2365 (2010)

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

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

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

Alan M. Frieze, Páll Melsted, Michael Mitzenmacher: An Analysis of Random-Walk Cuckoo Hashing. APPROX-RANDOM 2009: 490-503

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

Michael Mitzenmacher: Some Open Questions Related to Cuckoo Hashing. ESA 2009: 1-10

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

Jacomo Corbo, Shaili Jain, Michael Mitzenmacher, David C. Parkes: An Economically-Principled Generative Model of AS Graph Connectivity. INFOCOM 2009: 2941-2945

Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan: On compressing social networks. KDD 2009: 219-228

Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS 2009: 117-126

Michael Mitzenmacher: Bloom Filters. Encyclopedia of Database Systems 2009: 252-255

Michael Mitzenmacher (Ed.): Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. ACM 2009, isbn 978-1-60558-506-2

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

Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink: Tight Thresholds for Cuckoo Hashing via XORSAT. CoRR abs/0912.0287 (2009)

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

Michael Mitzenmacher: Capacity Bounds for Sticky Channels. IEEE Transactions on Information Theory 54(1): 72-77 (2008)

Adam Kirsch, Michael Mitzenmacher: Simple summaries for hashing with choices. IEEE/ACM Trans. Netw. 16(1): 218-231 (2008)

Adam Kirsch, Michael Mitzenmacher, Udi Wieder: More Robust Hashing: Cuckoo Hashing with a Stash. ESA 2008: 611-622

Adam Kirsch, Michael Mitzenmacher: The Power of One Move: Hashing Schemes for Hardware. INFOCOM 2008: 106-110

Mark Johnson, Michael Mitzenmacher, Kannan Ramchandran: Distributed beamforming with binary signaling. ISIT 2008: 890-894

Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder: Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398

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

Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193

Michael Mitzenmacher: A Survey of Results for Deletion Channels and Related Synchronization Channels. SWAT 2008: 1-3

Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros: Network coding meets TCP. CoRR abs/0809.5022 (2008)

Steven S. Lumetta, Michael Mitzenmacher: Using the Power of Two Choices to Improve Bloom Filters. Internet Mathematics 4(1): 17-33 (2007)

Eleni Drinea, Michael Mitzenmacher: Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels. IEEE Transactions on Information Theory 53(8): 2693-2714 (2007)

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

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

Jonathan Ledlie, Michael Mitzenmacher, Margo I. Seltzer, Peter Pietzuch: Wired Geometric Routing. IPTPS 2007

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

Joan Feigenbaum, Michael Mitzenmacher: Towards a theory of networked computation. SIGACT News 37(4): 22-26 (2006)

Eleni Drinea, Michael Mitzenmacher: On Lower Bounds for the Capacity of Deletion Channels. IEEE Transactions on Information Theory 52(10): 4648-4657 (2006)

Michael Mitzenmacher, Eleni Drinea: A Simple Lower Bound for the Capacity of the Deletion Channel. IEEE Transactions on Information Theory 52(10): 4657-4660 (2006)

Michael Mitzenmacher: 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 Transactions on Information Theory 52(12): 5496-5501 (2006)

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

Adam Kirsch, Michael Mitzenmacher: Distance-Sensitive Bloom Filters. ALENEX 2006: 41-50

Michael Mitzenmacher: New Results and Open Problems for Deletion Channels. ANALCO 2006: 222

Adam Kirsch, Michael Mitzenmacher: Less Hashing, Same Performance: Building a Better Bloom Filter. ESA 2006: 456-467

Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher: Stochastic Shortest Paths Via Quasi-convex Maximization. ESA 2006: 552-563

Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese: An Improved Construction for Counting Bloom Filters. ESA 2006: 684-695

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

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

Michael Mitzenmacher, Eli Upfal: Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University Press 2005, isbn 978-0-521-83540-4, pp. I-XVI, 1-352

Subhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher, Nishant Patil: X-Tolerant Test Response Compaction. IEEE Design & Test of Computers 22(6): 566-574 (2005)

Michael Mitzenmacher: Editorial: The Future of Power Law Research. Internet Mathematics 2(4): 525-534 (2005)

Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher: New heuristic and interactive approaches to 2D rectangular strip packing. ACM Journal of Experimental Algorithmics 10 (2005)

Michael Luby, Michael Mitzenmacher: Verification-based decoding for packet-based low-density parity-check codes. IEEE Transactions on Information Theory 51(1): 120-127 (2005)

Yan-Cheng Chang, Michael Mitzenmacher: Privacy Preserving Keyword Searches on Remote Encrypted Data. ACNS 2005: 442-455

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

Jimming Cheng, Michael Mitzenmacher: The Markov Expert for Finding Episodes in Time Series. DCC 2005: 454

Andrei Z. Broder, Michael Mitzenmacher: Multidimensional balanced allocations. SODA 2005: 195-196

Michael Mitzenmacher: Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. DISC 2005: 1

Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer: A Scaling Result for Explosive Processes. Electr. J. Comb. 11(1) (2004)

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

Brian Conrad, Michael Mitzenmacher: Power laws for monkeys typing randomly: the case of unequal probabilities. IEEE Transactions on Information Theory 50(7): 1403-1414 (2004)

Michael Mitzenmacher: On the hardness of finding optimal multiple preset dictionaries. IEEE Transactions on Information Theory 50(7): 1536-1539 (2004)

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

Neal Lesh, Michael Mitzenmacher: Interactive data summarization: an example application. AVI 2004: 183-187

Subhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher: X-Tolerant Signature Analysis. ITC 2004: 432-441

John W. Byers, Jeffrey Considine, Michael Mitzenmacher: Geometric generalizations of the power of two choices. SPAA 2004: 54-63

Yan-Cheng Chang, Michael Mitzenmacher: Privacy Preserving Keyword Searches on Remote Encrypted Data. IACR Cryptology ePrint Archive 2004: 51 (2004)

Michael Mitzenmacher: A Brief History of Generative Models for Power Law and Lognormal Distributions. Internet Mathematics 1(2): 226-251 (2003)

Michael Mitzenmacher: Dynamic Models for File Sizes and Double Pareto Distributions. Internet Mathematics 1(3): 305-333 (2003)

Andrei Z. Broder, Michael Mitzenmacher: Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1(4): 485-509 (2003)

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

Aleksandar Kavcic, Xiao Ma, Michael Mitzenmacher: Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. IEEE Transactions on Information Theory 49(7): 1636-1652 (2003)

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

John W. Byers, Jeffrey Considine, Michael Mitzenmacher: Simple Load Balancing for Distributed Hash Tables. IPTPS 2003: 80-87

Neal Lesh, Michael Mitzenmacher, Sue Whitesides: A complete and effective move set for simplified protein folding. RECOMB 2003: 188-195

Claire Kenyon, Michael Mitzenmacher: Linear waste of best fit bin packing on skewed distributions. Random Struct. Algorithms 20(3): 441-464 (2002)

Michael Mitzenmacher: Compressed bloom filters. IEEE/ACM Trans. Netw. 10(5): 604-612 (2002)

Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher: Human-Guided Tabu Search. AAAI/IAAI 2002: 41-47

Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah: Load Balancing with Memory. FOCS 2002: 799-808

Ashish Goel, Michael Mitzenmacher: Exact sampling of TCP Window States. INFOCOM 2002

Andrei Z. Broder, Michael Mitzenmacher: Optmial plans for aggregation. PODC 2002: 144-152

John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost: Informed content delivery across adaptive overlay networks. SIGCOMM 2002: 47-60

Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher: Balls and bins models with feedback. SODA 2002: 308-315

Susanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-Line Algorithms. Inf. Comput. 170(2): 135-152 (2001)

Michael Mitzenmacher: Analyses of Load Stealing Models Based on Families of Differential Equations. Theory Comput. Syst. 34(1): 77-98 (2001)

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

Eli Gafni, Michael Mitzenmacher: Analysis of Timing-Based Mutual Exclusion with Random Times. SIAM J. Comput. 31(3): 816-837 (2001)

Michael Mitzenmacher: Challenging students with creative assignments. SIGACT News 32(1): 70-73 (2001)

Michael Mitzenmacher: An experimental assignment on random processes. SIGACT News 32(1): 74-78 (2001)

Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Efficient erasure correcting codes. IEEE Transactions on Information Theory 47(2): 569-584 (2001)

Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Improved low-density parity-check codes using irregular graphs. IEEE Transactions on Information Theory 47(2): 585-598 (2001)

Michael Mitzenmacher, Rajmohan Rajaraman: Towards More Complete Models of TCP Latency and Throughput. The Journal of Supercomputing 20(2): 137-160 (2001)

Michael Mitzenmacher: The Power of Two Choices in Randomized Load Balancing. IEEE Trans. Parallel Distrib. Syst. 12(10): 1094-1104 (2001)

Michael Mitzenmacher, Sean Owen: Estimating Resemblance of MIDI Documents. ALENEX 2001: 78-90

Micah Adler, Michael Mitzenmacher: Towards Compressing Web Graphs. Data Compression Conference 2001: 203-212

Michael Mitzenmacher: On the Hardness of Finding Optimal Multiple Preset Dictionaries. Data Compression Conference 2001: 411-

John W. Byers, Michael Luby, Michael Mitzenmacher: Fine-Grained Layered Multicast. INFOCOM 2001: 1143-1151

Andrei Z. Broder, Michael Mitzenmacher: Using Multiple Hash Functions to Improve IP Lookups. INFOCOM 2001: 1454-1463

Michael Mitzenmacher: Compressed bloom filters. PODC 2001: 144-150

Justin A. Boyan, Michael Mitzenmacher: IMproved results for route planning in stochastic transportation. SODA 2001: 895-902

Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork: On near-uniform URL sampling. Computer Networks 33(1-6): 295-308 (2000)

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

Susanne Albers, Michael Mitzenmacher: Average-case analyses of first fit and random fit bin packing. Random Struct. Algorithms 16(3): 240-259 (2000)

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

Michael Mitzenmacher: How Useful Is Old Information? IEEE Trans. Parallel Distrib. Syst. 11(1): 6-20 (2000)

Claire Kenyon, Michael Mitzenmacher: Linear Waste of Best Fit Bin Packing on Skewed Distributions. FOCS 2000: 582-589

John W. Byers, Michael Frumin, Gavin B. Horn, Michael Luby, Michael Mitzenmacher, Alex Roetter, William Shaver: FLID-DL. Networked Group Communication 2000: 71-81

Andrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher: Improved classification via connectivity information. SODA 2000: 576-585

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

Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork: Measuring Index Quality Using Random Walks on the Web. Computer Networks 31(11-16): 1291-1303 (1999)

Michael Mitzenmacher: Studying Balanced Allocations With Differential Equations. Combinatorics, Probability & Computing 8(5): 473-482 (1999)

Michael Mitzenmacher: On the Analysis of Randomized Load Balancing Schemes. Theory Comput. Syst. 32(3): 361-386 (1999)

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

Eli Gafni, Michael Mitzenmacher: Analysis of Timing-Based Mutual Exclusion with Random Times. PODC 1999: 13-21

Andrei Z. Broder, Michael Mitzenmacher: Completeness and Robustness Properties of Min-Wise Independent Permutations. RANDOM-APPROX 1999: 1-10

Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll: Unscrambling Address Lines. SODA 1999: 870-871

Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. Algorithmica 21(3): 312-329 (1998)

Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen: Parallel randomized load balancing. Random Struct. Algorithms 13(2): 159-188 (1998)

Susanne Albers, Moses Charikar, Michael Mitzenmacher: Delayed Information and Action in On-line Algorithms. FOCS 1998: 71-81

Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher: A Derandomization Using Min-Wise Independent Permutations. RANDOM 1998: 15-24

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

John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege: A Digital Fountain Approach to Reliable Distribution of Bulk Data. SIGCOMM 1998: 56-67

Susanne Albers, Michael Mitzenmacher: Average-Case Analyses of First Fit and Random Fit Bin Packing. SODA 1998: 290-299

Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi: Analysis of Random Processes via And-Or Tree Evaluation. SODA 1998: 364-373

Michael Mitzenmacher: Analyses of Load Stealing Models Based on Differential Equations. SPAA 1998: 212-221

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

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

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: Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: 378-388

Michael Mitzenmacher: Constant Time per Edge is Optimal on Rooted Tree Networks. Distributed Computing 10(4): 189-197 (1997)

Susanne Albers, Michael Mitzenmacher: Revisiting the Counter Algorithms for List Update. Inf. Process. Lett. 64(3): 155-160 (1997)

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

Michael Mitzenmacher: On the Analysis of Randomized Load Balancing Schemes. SPAA 1997: 292-301

Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann: Practical Loss-Resilient Codes. STOC 1997: 150-159

Michael Mitzenmacher: Bounds on the Greedy Routing Algorithm for Array Networks. J. Comput. Syst. Sci. 53(3): 317-327 (1996)

Andrei Z. Broder, Michael Mitzenmacher: Pattern-based Compression of Text Images. Data Compression Conference 1996: 300-309

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

Susanne Albers, Michael Mitzenmacher: Average Case Analyses of List Update Algorithms, with Applications to Data Compression. ICALP 1996: 514-525

Michael Mitzenmacher: Constant Time per Edge is Optimal on Rooted Tree Networks. SPAA 1996: 162-169

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

Graham Louth, Michael Mitzenmacher, Frank Kelly: Computational Complexity of Loss Networks. Theor. Comput. Sci. 125(1): 45-59 (1994)

Michael Mitzenmacher: Bounds on the Greedy Routing Algorithm for Array Networks. SPAA 1994: 346-353