Michael Mitzenmacher - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

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

Adaptive weighing designs for keyword value computationJohn W. Byers, Michael Mitzenmacher, Georgios Zervas. wsdm 2010: 331-340 [doi]

Information asymmetries in pay-per-bid auctionsJohn W. Byers, Michael Mitzenmacher, Georgios Zervas. sigecom 2010: 1-12 [doi]

Designing floating codes for expected performanceFlavio Chierichetti, Hilary Finucane, Zhenming Liu, Michael Mitzenmacher. TIT, 56(3):968-978, 2010. [doi]

Streaming Graph Computations with a Helpful AdvisorGraham Cormode, Michael Mitzenmacher, Justin Thaler. esa 2010: 231-242 [doi]

Tight Thresholds for Cuckoo Hashing via XORSATMartin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink. icalp 2010: 213-225 [doi]

An improved analysis of the lossy difference aggregatorHilary Finucane, Michael Mitzenmacher. ccr, 40(2):4-11, 2010. [doi]

The Power of One Move: Hashing Schemes for HardwareAdam Kirsch, Michael Mitzenmacher. ton, 18(6):1752-1765, 2010. [doi]

Human-guided searchGunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher. heuristics, 16(3):289-310, 2010. [doi]

Carousel: Scalable Logging for Intrusion Prevention SystemsVinh The Lam, Michael Mitzenmacher, George Varghese. nsdi 2010: 361-376 [doi]

Codes for deletion and insertion channels with segmented errorsZhenming Liu, Michael Mitzenmacher. TIT, 56(1):224-232, 2010. [doi]

2009

Real-time parallel hashing on the GPUDan A. Alcantara, Andrei Sharf, Fatemeh Abbasinejad, Shubhabrata Sengupta, Michael Mitzenmacher, John D. Owens, Nina Amenta. tog, 28(5), 2009. [doi]

The Hiring Problem and Lake Wobegon StrategiesAndrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii. siamcomp, 39(4):1233-1255, 2009. [doi]

On compressing social networksFlavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan. kdd 2009: 219-228 [doi]

An Economically-Principled Generative Model of AS Graph ConnectivityJacomo Corbo, Shaili Jain, Michael Mitzenmacher, David C. Parkes. infocom 2009: 2941-2945 [doi]

An Analysis of Random-Walk Cuckoo HashingAlan M. Frieze, PÃ¡ll Melsted, Michael Mitzenmacher. approx 2009: 490-503 [doi]

Exploiting dynamicity in graph-based traffic analysis: techniques and applicationsMarios Iliofotou, Michalis Faloutsos, Michael Mitzenmacher. conext 2009: 241-252 [doi]

More Robust Hashing: Cuckoo Hashing with a StashAdam Kirsch, Michael Mitzenmacher, Udi Wieder. siamcomp, 39(4):1543-1561, 2009. [doi]

An efficient rigorous approach for identifying statistically significant frequent itemsetsAdam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin. pods 2009: 117-126 [doi]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009Michael Mitzenmacher, editor, ACM, 2009.

Some Open Questions Related to Cuckoo HashingMichael Mitzenmacher. esa 2009: 1-10 [doi]

Network Coding Meets TCPJay Kumar Sundararajan, Devavrat Shah, Muriel MÃ©dard, Michael Mitzenmacher, JoÃ£o Barros. infocom 2009: 280-288 [doi]

2008

The hiring problem and Lake Wobegon strategiesAndrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii. soda 2008: 1184-1193 [doi]

Trace reconstruction with constant deletion probability and related resultsThomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder. soda 2008: 389-398 [doi]

Less hashing, same performance: Building a better Bloom filterAdam Kirsch, Michael Mitzenmacher. rsa, 33(2):187-218, 2008. [doi]

The Power of One Move: Hashing Schemes for HardwareAdam Kirsch, Michael Mitzenmacher. infocom 2008: 106-110 [doi]

Simple summaries for hashing with choicesAdam Kirsch, Michael Mitzenmacher. ton, 16(1):218-231, 2008. [doi]

More Robust Hashing: Cuckoo Hashing with a StashAdam Kirsch, Michael Mitzenmacher, Udi Wieder. esa 2008: 611-622 [doi]

Capacity Bounds for Sticky ChannelsMichael Mitzenmacher. TIT, 54(1):72-77, 2008. [doi]

A Survey of Results for Deletion Channels and Related Synchronization ChannelsMichael Mitzenmacher. swat 2008: 1-3 [doi]

Why simple hash functions work: exploiting the entropy in a data streamMichael Mitzenmacher, Salil P. Vadhan. soda 2008: 746-755 [doi]

2007

2006

An Improved Construction for Counting Bloom FiltersFlavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese. esa 2006: 684-695 [doi]

Beyond bloom filters: from approximate membership checks to approximate state machinesFlavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese. sigcomm 2006: 315-326 [doi]

Fine-grained layered multicast with STAIRJohn W. Byers, Gu-In Kwon, Michael Luby, Michael Mitzenmacher. ton, 14(1):81-93, 2006. [doi]

On Lower Bounds for the Capacity of Deletion ChannelsEleni Drinea, Michael Mitzenmacher. TIT, 52(10):4648-4657, 2006. [doi]

Towards a theory of networked computationJoan Feigenbaum, Michael Mitzenmacher. sigact, 37(4):22-26, 2006. [doi]

Less Hashing, Same Performance: Building a Better Bloom FilterAdam Kirsch, Michael Mitzenmacher. esa 2006: 456-467 [doi]

BubbleSearch: A simple heuristic for improving priority-based greedy algorithmsNeal Lesh, Michael Mitzenmacher. ipl, 97(4):161-169, 2006. [doi]

A Simple Lower Bound for the Capacity of the Deletion ChannelMichael Mitzenmacher, Eleni Drinea. TIT, 52(10):4657-4660, 2006. [doi]

Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large qMichael Mitzenmacher. TIT, 52(12):5496-5501, 2006. [doi]

Stochastic Shortest Paths Via Quasi-convex MaximizationEvdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher. esa 2006: 552-563 [doi]

Network-Aware Overlays with Network CoordinatesPeter R. Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, Margo I. Seltzer. icdcsw 2006: 12 [doi]

2005

Multidimensional balanced allocationsAndrei Z. Broder, Michael Mitzenmacher. soda 2005: 195-196 [doi]

Privacy Preserving Keyword Searches on Remote Encrypted DataYan-Cheng Chang, Michael Mitzenmacher. acns 2005: 442-455 [doi]

The Markov Expert for Finding Episodes in Time SeriesJimming Cheng, Michael Mitzenmacher. dcc 2005: 454 [doi]

A Case Study in Large-Scale Interactive OptimizationMarkus Chimani, Neal Lesh, Michael Mitzenmacher, Candy L. Sidner, Hidetoshi Tanaka. aia 2005: 24-29

New heuristic and interactive approaches to 2D rectangular strip packingNeal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher. jea, 10, 2005. [doi]

Verification-based decoding for packet-based low-density parity-check codesMichael Luby, Michael Mitzenmacher. TIT, 51(1):120-127, 2005. [doi]

X-Tolerant Test Response CompactionSubhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher, Nishant Patil. dt, 22(6):566-574, 2005. [doi]

Editorial: The Future of Power Law ResearchMichael Mitzenmacher. im, 2(4), 2005.

Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay NetworksMichael Mitzenmacher. wdag 2005: 1 [doi]

2004

Geometric generalizations of the power of two choicesJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher. spaa 2004: 54-63 [doi]

Informed content delivery across adaptive overlay networksJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost. ton, 12(5):767-780, 2004. [doi]

Power laws for monkeys typing randomly: the case of unequal probabilitiesBrian Conrad, Michael Mitzenmacher. TIT, 50(7):1403-1414, 2004.

Interactive data summarization: an example applicationNeal Lesh, Michael Mitzenmacher. avi 2004: 183-187 [doi]

Exhaustive approaches to 2D rectangular perfect packingsNeal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher. ipl, 90(1):7-14, 2004. [doi]

X-Tolerant Signature AnalysisSubhasish Mitra, Steven S. Lumetta, Michael Mitzenmacher. itc 2003: 432-441 [doi]

A Scaling Result for Explosive ProcessesMichael Mitzenmacher, Roberto Imbuzeiro Oliveira, Joel H. Spencer. combinatorics, 11(1), 2004. [doi]

On the hardness of finding optimal multiple preset dictionariesMichael Mitzenmacher. TIT, 50(7):1536-1539, 2004.

2003

Estimating and Comparing Entropies Across Written Natural Languages Using PPM CompressionFrederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao. dcc 2003: 416 [doi]

A derandomization using min-wise independent permutationsAndrei Z. Broder, Moses Charikar, Michael Mitzenmacher. jda, 1(1):11-20, 2003. [doi]

Survey: Network Applications of Bloom Filters: A SurveyAndrei Z. Broder, Michael Mitzenmacher. im, 1(4), 2003.

Simple Load Balancing for Distributed Hash TablesJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher. iptps 2003: 80-87 [doi]

Binary intersymbol interference channels: Gallager codes, density evolution, and code performance boundsAleksandar Kavcic, Xiao Ma, Michael Mitzenmacher. TIT, 49(7):1636-1652, 2003.

A complete and effective move set for simplified protein foldingNeal Lesh, Michael Mitzenmacher, Sue Whitesides. recomb 2003: 188-195 [doi]

Dynamic Models for File Sizes and Double Pareto DistributionsMichael Mitzenmacher. im, 1(3), 2003.

A Brief History of Generative Models for Power Law and Lognormal DistributionsMichael Mitzenmacher. im, 1(2), 2003.

2002

Optmial plans for aggregationAndrei Z. Broder, Michael Mitzenmacher. podc 2002: 144-152 [doi]

Informed content delivery across adaptive overlay networksJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost. sigcomm 2002: 47-60 [doi]

Balls and bins models with feedbackEleni Drinea, Alan M. Frieze, Michael Mitzenmacher. soda 2002: 308-315 [doi]

Exact sampling of TCP Window StatesAshish Goel, Michael Mitzenmacher. infocom 2002: [doi]

Linear waste of best fit bin packing on skewed distributionsClaire Kenyon, Michael Mitzenmacher. rsa, 20(3):441-464, 2002. [doi]

Human-Guided Tabu SearchGunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher. AAAI 2002: 41-47

Load Balancing with MemoryMichael Mitzenmacher, Balaji Prabhakar, Devavrat Shah. focs 2002: 799-808 [doi]

Compressed bloom filtersMichael Mitzenmacher. ton, 10(5):604-612, 2002. [doi]

2001

Towards Compressing Web GraphsMicah Adler, Michael Mitzenmacher. dcc 2001: 203-212 [doi]

Delayed Information and Action in On-Line AlgorithmsSusanne Albers, Moses Charikar, Michael Mitzenmacher. iandc, 170(2):135-152, 2001. [doi]

IMproved results for route planning in stochastic transportationJustin A. Boyan, Michael Mitzenmacher. soda 2001: 895-902 [doi]

Using Multiple Hash Functions to Improve IP LookupsAndrei Z. Broder, Michael Mitzenmacher. infocom 2001: 1454-1463 [doi]

Completeness and robustness properties of min-wise independent permutationsAndrei Z. Broder, Michael Mitzenmacher. rsa, 18(1):18-30, 2001.

Fine-Grained Layered MulticastJohn W. Byers, Michael Luby, Michael Mitzenmacher. infocom 2001: 1143-1151 [doi]

Analysis of Timing-Based Mutual Exclusion with Random TimesEli Gafni, Michael Mitzenmacher. siamcomp, 31(3):816-837, 2001. [doi]

Efficient erasure correcting codesMichael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman. TIT, 47(2):569-584, 2001.

Improved low-density parity-check codes using irregular graphsMichael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman. TIT, 47(2):585-598, 2001.

The Power of Two Choices in Randomized Load BalancingMichael Mitzenmacher. tpds, 12(10):1094-1104, 2001. [doi]

Compressed bloom filtersMichael Mitzenmacher. podc 2001: 144-150 [doi]

Estimating Resemblance of MIDI DocumentsMichael Mitzenmacher, Sean Owen. alenex 2001: 78-90 [doi]

On the Hardness of Finding Optimal Multiple Preset DictionariesMichael Mitzenmacher. dcc 2001: 411 [doi]

Challenging students with creative assignmentsMichael Mitzenmacher. sigact, 32(1):70-73, 2001. [doi]

Towards More Complete Models of TCP Latency and ThroughputMichael Mitzenmacher, Rajmohan Rajaraman. tjs, 20(2):137-160, 2001.

Analyses of Load Stealing Models Based on Families of Differential EquationsMichael Mitzenmacher. mst, 34(1):77-98, 2001. [doi]

PreviousNext