Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michael Mitzenmacher
@inproceedings{DBLP:conf/nsdi/LiBVLXMY24,
author = {Minghao Li and
Ran Ben Basat and
Shay Vargaftik and
ChonLam Lao and
Kevin Xu and
Michael Mitzenmacher and
Minlan Yu},
editor = {Laurent Vanbever and
Irene Zhang},
title = {{THC:} Accelerating Distributed Deep Learning Using Tensor Homomorphic
Compression},
booktitle = {21st {USENIX} Symposium on Networked Systems Design and Implementation,
{NSDI} 2024, Santa Clara, CA, April 15-17, 2024},
publisher = {{USENIX} Association},
year = {2024},
url = {https://www.usenix.org/conference/nsdi24/presentation/li-minghao},
timestamp = {Fri, 19 Apr 2024 11:29:16 +0200},
biburl = {https://dblp.org/rec/conf/nsdi/LiBVLXMY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-03158,
author = {Ran Ben{-}Basat and
Yaniv Ben{-}Itzhak and
Michael Mitzenmacher and
Shay Vargaftik},
title = {Optimal and Near-Optimal Adaptive Vector Quantization},
journal = {CoRR},
volume = {abs/2402.03158},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.03158},
doi = {10.48550/ARXIV.2402.03158},
eprinttype = {arXiv},
eprint = {2402.03158},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-03158.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-03564,
author = {Rana Shahout and
Michael Mitzenmacher},
title = {SkipPredict: When to Invest in Predictions for Scheduling},
journal = {CoRR},
volume = {abs/2402.03564},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.03564},
doi = {10.48550/ARXIV.2402.03564},
eprinttype = {arXiv},
eprint = {2402.03564},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-03564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/LangletBOMYA23,
author = {Jonatan Langlet and
Ran Ben Basat and
Gabriele Oliaro and
Michael Mitzenmacher and
Minlan Yu and
Gianni Antichi},
editor = {Henning Schulzrinne and
Vishal Misra and
Eddie Kohler and
David A. Maltz},
title = {Direct Telemetry Access},
booktitle = {Proceedings of the {ACM} {SIGCOMM} 2023 Conference, {ACM} {SIGCOMM}
2023, New York, NY, USA, 10-14 September 2023},
pages = {832--849},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3603269.3604827},
doi = {10.1145/3603269.3604827},
timestamp = {Sun, 24 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/LangletBOMYA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-08545,
author = {Minghao Li and
Ran Ben Basat and
Shay Vargaftik and
ChonLam Lao and
Kevin Xu and
Xinran Tang and
Michael Mitzenmacher and
Minlan Yu},
title = {{THC:} Accelerating Distributed Deep Learning Using Tensor Homomorphic
Compression},
journal = {CoRR},
volume = {abs/2302.08545},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.08545},
doi = {10.48550/ARXIV.2302.08545},
eprinttype = {arXiv},
eprint = {2302.08545},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-08545.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/MitzenmacherV22,
author = {Michael Mitzenmacher and
Sergei Vassilvitskii},
title = {Algorithms with predictions},
journal = {Commun. {ACM}},
volume = {65},
number = {7},
pages = {33--35},
year = {2022},
url = {https://doi.org/10.1145/3528087},
doi = {10.1145/3528087},
timestamp = {Thu, 30 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/MitzenmacherV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/VaidyaKCKMI22,
author = {Kapil Vaidya and
Tim Kraska and
Subarna Chatterjee and
Eric R. Knorr and
Michael Mitzenmacher and
Stratos Idreos},
title = {{SNARF:} {A} Learning-Enhanced Range Filter},
journal = {Proc. {VLDB} Endow.},
volume = {15},
number = {8},
pages = {1632--1644},
year = {2022},
url = {https://www.vldb.org/pvldb/vol15/p1632-vaidya.pdf},
doi = {10.14778/3529337.3529347},
timestamp = {Mon, 23 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/VaidyaKCKMI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/SabekVHKMK22,
author = {Ibrahim Sabek and
Kapil Vaidya and
Dominik Horn and
Andreas Kipf and
Michael Mitzenmacher and
Tim Kraska},
title = {Can Learned Models Replace Hash Functions?},
journal = {Proc. {VLDB} Endow.},
volume = {16},
number = {3},
pages = {532--545},
year = {2022},
url = {https://www.vldb.org/pvldb/vol16/p532-sabek.pdf},
doi = {10.14778/3570690.3570702},
timestamp = {Mon, 23 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/SabekVHKMK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/MitzenmacherD22,
author = {Michael Mitzenmacher and
Matteo Dell'Amico},
title = {The Supermarket Model With Known and Predicted Service Times},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {33},
number = {11},
pages = {2740--2751},
year = {2022},
url = {https://doi.org/10.1109/TPDS.2022.3146195},
doi = {10.1109/TPDS.2022.3146195},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/MitzenmacherD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/VargaftikBPMBM22,
author = {Shay Vargaftik and
Ran Ben Basat and
Amit Portnoy and
Gal Mendelson and
Yaniv Ben{-}Itzhak and
Michael Mitzenmacher},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {{EDEN:} Communication-Efficient and Robust Distributed Mean Estimation
for Federated Learning},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {21984--22014},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/vargaftik22a.html},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/VargaftikBPMBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ScullyGM22,
author = {Ziv Scully and
Isaac Grosof and
Michael Mitzenmacher},
editor = {Mark Braverman},
title = {Uniform Bounds for Scheduling with Job Size Estimates},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {114:1--114:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.114},
doi = {10.4230/LIPICS.ITCS.2022.114},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ScullyGM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkdd/ChenMMT22,
author = {Tianyi Chen and
Brian Matejek and
Michael Mitzenmacher and
Charalampos E. Tsourakakis},
editor = {Massih{-}Reza Amini and
St{\'{e}}phane Canu and
Asja Fischer and
Tias Guns and
Petra Kralj Novak and
Grigorios Tsoumakas},
title = {Algorithmic Tools for Understanding the Motif Structure of Networks},
booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference,
{ECML} {PKDD} 2022, Grenoble, France, September 19-23, 2022, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {13714},
pages = {3--19},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-26390-3\_1},
doi = {10.1007/978-3-031-26390-3\_1},
timestamp = {Mon, 20 Mar 2023 16:00:26 +0100},
biburl = {https://dblp.org/rec/conf/pkdd/ChenMMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/KnorrLLLZIM22,
author = {Eric R. Knorr and
Baptiste Lemaire and
Andrew Lim and
Siqiang Luo and
Huanchen Zhang and
Stratos Idreos and
Michael Mitzenmacher},
editor = {Zachary G. Ives and
Angela Bonifati and
Amr El Abbadi},
title = {Proteus: {A} Self-Designing Range Filter},
booktitle = {{SIGMOD} '22: International Conference on Management of Data, Philadelphia,
PA, USA, June 12 - 17, 2022},
pages = {1670--1684},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3514221.3526167},
doi = {10.1145/3514221.3526167},
timestamp = {Thu, 16 Mar 2023 09:51:25 +0100},
biburl = {https://dblp.org/rec/conf/sigmod/KnorrLLLZIM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-02270,
author = {Jonatan Langlet and
Ran Ben Basat and
Sivaramakrishnan Ramanathan and
Gabriele Oliaro and
Michael Mitzenmacher and
Minlan Yu and
Gianni Antichi},
title = {Direct Telemetry Access},
journal = {CoRR},
volume = {abs/2202.02270},
year = {2022},
url = {https://arxiv.org/abs/2202.02270},
eprinttype = {arXiv},
eprint = {2202.02270},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-02270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05747,
author = {Isaac Grosof and
Michael Mitzenmacher},
title = {Incentive Compatible Queues Without Money},
journal = {CoRR},
volume = {abs/2202.05747},
year = {2022},
url = {https://arxiv.org/abs/2202.05747},
eprinttype = {arXiv},
eprint = {2202.05747},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05747.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-02833,
author = {Maximilian Lam and
Michael Mitzenmacher and
Vijay Janapa Reddi and
Gu{-}Yeon Wei and
David Brooks},
title = {Tabula: Efficiently Computing Nonlinear Activation Functions for Secure
Neural Network Inference},
journal = {CoRR},
volume = {abs/2203.02833},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.02833},
doi = {10.48550/ARXIV.2203.02833},
eprinttype = {arXiv},
eprint = {2203.02833},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-02833.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-14138,
author = {Wenchen Han and
Vic Feng and
Gregory Schwartzman and
Michael Mitzenmacher and
Minlan Yu and
Ran Ben{-}Basat},
title = {{FRANCIS:} Fast Reaction Algorithms for Network Coordination In Switches},
journal = {CoRR},
volume = {abs/2204.14138},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.14138},
doi = {10.48550/ARXIV.2204.14138},
eprinttype = {arXiv},
eprint = {2204.14138},
timestamp = {Mon, 02 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-14138.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-13341,
author = {Ran Ben Basat and
Shay Vargaftik and
Amit Portnoy and
Gil Einziger and
Yaniv Ben{-}Itzhak and
Michael Mitzenmacher},
title = {{QUIC-FL:} Quick Unbiased Compression for Federated Learning},
journal = {CoRR},
volume = {abs/2205.13341},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.13341},
doi = {10.48550/ARXIV.2205.13341},
eprinttype = {arXiv},
eprint = {2205.13341},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-13341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-01503,
author = {Eric R. Knorr and
Baptiste Lemaire and
Andrew Lim and
Siqiang Luo and
Huanchen Zhang and
Stratos Idreos and
Michael Mitzenmacher},
title = {Proteus: {A} Self-Designing Range Filter},
journal = {CoRR},
volume = {abs/2207.01503},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.01503},
doi = {10.48550/ARXIV.2207.01503},
eprinttype = {arXiv},
eprint = {2207.01503},
timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-01503.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/Mitzenmacher21,
author = {Michael Mitzenmacher},
editor = {Michael Bender and
John Gilbert and
Bruce Hendrickson and
Blair D. Sullivan},
title = {Queues with Small Advice},
booktitle = {Proceedings of the 2021 {SIAM} Conference on Applied and Computational
Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21,
2021},
pages = {1--12},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976830.1},
doi = {10.1137/1.9781611976830.1},
timestamp = {Wed, 03 Nov 2021 11:57:03 +0100},
biburl = {https://dblp.org/rec/conf/acda/Mitzenmacher21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hotnets/LangletBROMYA21,
author = {Jonatan Langlet and
Ran Ben{-}Basat and
Sivaramakrishnan Ramanathan and
Gabriele Oliaro and
Michael Mitzenmacher and
Minlan Yu and
Gianni Antichi},
title = {Zero-CPU Collection with Direct Telemetry Access},
booktitle = {HotNets '21: The 20th {ACM} Workshop on Hot Topics in Networks, Virtual
Event, United Kingdom, November 10-12, 2021},
pages = {108--115},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3484266.3487366},
doi = {10.1145/3484266.3487366},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/hotnets/LangletBROMYA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BasatMV21,
author = {Ran Ben Basat and
Michael Mitzenmacher and
Shay Vargaftik},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {How to Send a Real Number Using a Single Bit (And Some Shared Randomness)},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {25:1--25:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.25},
doi = {10.4230/LIPICS.ICALP.2021.25},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BasatMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/BasatEMV21,
author = {Ran Ben Basat and
Gil Einziger and
Michael Mitzenmacher and
Shay Vargaftik},
title = {{SALSA:} Self-Adjusting Lean Streaming Analytics},
booktitle = {37th {IEEE} International Conference on Data Engineering, {ICDE} 2021,
Chania, Greece, April 19-22, 2021},
pages = {864--875},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICDE51399.2021.00080},
doi = {10.1109/ICDE51399.2021.00080},
timestamp = {Fri, 25 Jun 2021 11:30:58 +0200},
biburl = {https://dblp.org/rec/conf/icde/BasatEMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/VaidyaKMK21,
author = {Kapil Vaidya and
Eric Knorr and
Michael Mitzenmacher and
Tim Kraska},
title = {Partitioned Learned Bloom Filters},
booktitle = {9th International Conference on Learning Representations, {ICLR} 2021,
Virtual Event, Austria, May 3-7, 2021},
publisher = {OpenReview.net},
year = {2021},
url = {https://openreview.net/forum?id=6BRLOfrMhW},
timestamp = {Wed, 23 Jun 2021 17:36:39 +0200},
biburl = {https://dblp.org/rec/conf/iclr/VaidyaKMK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/DuWM21,
author = {Elbert Du and
Franklyn Wang and
Michael Mitzenmacher},
editor = {Marina Meila and
Tong Zhang},
title = {Putting the "Learning" into Learning-Augmented Algorithms
for Frequency Estimation},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {2860--2869},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/du21d.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/DuWM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LamW0RM21,
author = {Maximilian Lam and
Gu{-}Yeon Wei and
David Brooks and
Vijay Janapa Reddi and
Michael Mitzenmacher},
editor = {Marina Meila and
Tong Zhang},
title = {Gradient Disaggregation: Breaking Privacy in Federated Learning by
Reconstructing the User Participant Matrix},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {5959--5968},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/lam21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/LamW0RM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/VargaftikBPMBM21,
author = {Shay Vargaftik and
Ran Ben{-}Basat and
Amit Portnoy and
Gal Mendelson and
Yaniv Ben{-}Itzhak and
Michael Mitzenmacher},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {{DRIVE:} One-bit Distributed Mean Estimation},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {362--377},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/0397758f8990c1b41b81b43ac389ab9f-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/VargaftikBPMBM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MitzenmacherS21,
author = {Michael Mitzenmacher and
Saeed Seddighin},
editor = {D{\'{a}}niel Marx},
title = {Improved Sublinear Time Algorithm for Longest Increasing Subsequence},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1934--1947},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.115},
doi = {10.1137/1.9781611976465.115},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/MitzenmacherS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-07360,
author = {Michael Mitzenmacher and
Saeed Seddighin},
title = {Dynamic Longest Increasing Subsequence and the Erd{\"{o}}s-Szekeres
Partitioning Problem},
journal = {CoRR},
volume = {abs/2101.07360},
year = {2021},
url = {https://arxiv.org/abs/2101.07360},
eprinttype = {arXiv},
eprint = {2101.07360},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-07360.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-12531,
author = {Ran Ben Basat and
Gil Einziger and
Michael Mitzenmacher and
Shay Vargaftik},
title = {{SALSA:} Self-Adjusting Lean Streaming Analytics},
journal = {CoRR},
volume = {abs/2102.12531},
year = {2021},
url = {https://arxiv.org/abs/2102.12531},
eprinttype = {arXiv},
eprint = {2102.12531},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-12531.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08339,
author = {Shay Vargaftik and
Ran Ben Basat and
Amit Portnoy and
Gal Mendelson and
Yaniv Ben{-}Itzhak and
Michael Mitzenmacher},
title = {{DRIVE:} One-bit Distributed Mean Estimation},
journal = {CoRR},
volume = {abs/2105.08339},
year = {2021},
url = {https://arxiv.org/abs/2105.08339},
eprinttype = {arXiv},
eprint = {2105.08339},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08339.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-06089,
author = {Maximilian Lam and
Gu{-}Yeon Wei and
David Brooks and
Vijay Janapa Reddi and
Michael Mitzenmacher},
title = {Gradient Disaggregation: Breaking Privacy in Federated Learning by
Reconstructing the User Participant Matrix},
journal = {CoRR},
volume = {abs/2106.06089},
year = {2021},
url = {https://arxiv.org/abs/2106.06089},
eprinttype = {arXiv},
eprint = {2106.06089},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-06089.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-08842,
author = {Shay Vargaftik and
Ran Ben Basat and
Amit Portnoy and
Gal Mendelson and
Yaniv Ben{-}Itzhak and
Michael Mitzenmacher},
title = {Communication-Efficient Federated Learning via Robust Distributed
Mean Estimation},
journal = {CoRR},
volume = {abs/2108.08842},
year = {2021},
url = {https://arxiv.org/abs/2108.08842},
eprinttype = {arXiv},
eprint = {2108.08842},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-08842.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-00633,
author = {Ziv Scully and
Isaac Grosof and
Michael Mitzenmacher},
title = {Uniform Bounds for Scheduling with Job Size Estimates},
journal = {CoRR},
volume = {abs/2110.00633},
year = {2021},
url = {https://arxiv.org/abs/2110.00633},
eprinttype = {arXiv},
eprint = {2110.00633},
timestamp = {Fri, 08 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-00633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-05438,
author = {Jonatan Langlet and
Ran Ben Basat and
Sivaramakrishnan Ramanathan and
Gabriele Oliaro and
Michael Mitzenmacher and
Minlan Yu and
Gianni Antichi},
title = {Zero-CPU Collection with Direct Telemetry Access},
journal = {CoRR},
volume = {abs/2110.05438},
year = {2021},
url = {https://arxiv.org/abs/2110.05438},
eprinttype = {arXiv},
eprint = {2110.05438},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-05438.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MitzenmacherPR20,
author = {Michael Mitzenmacher and
Salvatore Pontarelli and
Pedro Reviriego},
title = {Adaptive Cuckoo Filters},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--20},
year = {2020},
url = {https://doi.org/10.1145/3339504},
doi = {10.1145/3339504},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MitzenmacherPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/EsfandiariHLM20,
author = {Hossein Esfandiari and
MohammadTaghi Hajiaghayi and
Brendan Lucier and
Michael Mitzenmacher},
editor = {Silvia Chiappa and
Roberto Calandra},
title = {Prophets, Secretaries, and Maximizing the Probability of Choosing
the Best},
booktitle = {The 23rd International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy]},
series = {Proceedings of Machine Learning Research},
volume = {108},
pages = {3717--3727},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v108/esfandiari20a.html},
timestamp = {Mon, 29 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aistats/EsfandiariHLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/conext/0004BKAYM20,
author = {Jan Kucera and
Ran Ben Basat and
M{\'{a}}rio Kuka and
Gianni Antichi and
Minlan Yu and
Michael Mitzenmacher},
editor = {Dongsu Han and
Anja Feldmann},
title = {Detecting routing loops in the data plane},
booktitle = {CoNEXT '20: The 16th International Conference on emerging Networking
EXperiments and Technologies, Barcelona, Spain, December, 2020},
pages = {466--473},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3386367.3431303},
doi = {10.1145/3386367.3431303},
timestamp = {Sat, 30 Sep 2023 09:37:43 +0200},
biburl = {https://dblp.org/rec/conf/conext/0004BKAYM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/conext/BruschiBLA0M20,
author = {Valerio Bruschi and
Ran Ben Basat and
Zaoxing Liu and
Gianni Antichi and
Giuseppe Bianchi and
Michael Mitzenmacher},
editor = {Dongsu Han and
Anja Feldmann},
title = {DISCOvering the heavy hitters with disaggregated sketches},
booktitle = {CoNEXT '20: The 16th International Conference on emerging Networking
EXperiments and Technologies, Barcelona, Spain, December, 2020},
pages = {536--537},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3386367.3431674},
doi = {10.1145/3386367.3431674},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/conext/BruschiBLA0M20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/BasatEMV20,
author = {Ran Ben Basat and
Gil Einziger and
Michael Mitzenmacher and
Shay Vargaftik},
title = {Faster and More Accurate Measurement through Additive-Error Counters},
booktitle = {39th {IEEE} Conference on Computer Communications, {INFOCOM} 2020,
Toronto, ON, Canada, July 6-9, 2020},
pages = {1251--1260},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/INFOCOM41043.2020.9155340},
doi = {10.1109/INFOCOM41043.2020.9155340},
timestamp = {Mon, 10 Aug 2020 16:29:29 +0200},
biburl = {https://dblp.org/rec/conf/infocom/BasatEMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Mitzenmacher20,
author = {Michael Mitzenmacher},
editor = {Thomas Vidick},
title = {Scheduling with Predictions and the Price of Misprediction},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {14:1--14:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.14},
doi = {10.4230/LIPICS.ITCS.2020.14},
timestamp = {Mon, 06 Jan 2020 16:50:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Mitzenmacher20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/LarsenMT20,
author = {Kasper Green Larsen and
Michael Mitzenmacher and
Charalampos E. Tsourakakis},
title = {Optimal Learning of Joint Alignments with a Faulty Oracle},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2020,
Los Angeles, CA, USA, June 21-26, 2020},
pages = {2492--2497},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ISIT44484.2020.9174310},
doi = {10.1109/ISIT44484.2020.9174310},
timestamp = {Tue, 15 Sep 2020 10:18:53 +0200},
biburl = {https://dblp.org/rec/conf/isit/LarsenMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ita/LarsenMT20,
author = {Kasper Green Larsen and
Michael Mitzenmacher and
Charalampos E. Tsourakakis},
title = {Optimal Learning of Joint Alignments with a Faulty Oracle},
booktitle = {Information Theory and Applications Workshop, {ITA} 2020, San Diego,
CA, USA, February 2-7, 2020},
pages = {1--10},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ITA50056.2020.9244966},
doi = {10.1109/ITA50056.2020.9244966},
timestamp = {Thu, 19 Nov 2020 14:03:02 +0100},
biburl = {https://dblp.org/rec/conf/ita/LarsenMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/BasatRLAYM20,
author = {Ran Ben Basat and
Sivaramakrishnan Ramanathan and
Yuliang Li and
Gianni Antichi and
Minlan Yu and
Michael Mitzenmacher},
editor = {Henning Schulzrinne and
Vishal Misra},
title = {{PINT:} Probabilistic In-band Network Telemetry},
booktitle = {{SIGCOMM} '20: Proceedings of the 2020 Annual conference of the {ACM}
Special Interest Group on Data Communication on the applications,
technologies, architectures, and protocols for computer communication,
Virtual Event, USA, August 10-14, 2020},
pages = {662--680},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3387514.3405894},
doi = {10.1145/3387514.3405894},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/BasatRLAYM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MitzenmacherS20,
author = {Michael Mitzenmacher and
Saeed Seddighin},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Dynamic algorithms for {LIS} and distance to monotonicity},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {671--684},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384240},
doi = {10.1145/3357713.3384240},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MitzenmacherS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/LarsenMT20,
author = {Kasper Green Larsen and
Michael Mitzenmacher and
Charalampos E. Tsourakakis},
editor = {Yennun Huang and
Irwin King and
Tie{-}Yan Liu and
Maarten van Steen},
title = {Clustering with a faulty oracle},
booktitle = {{WWW} '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020},
pages = {2831--2834},
publisher = {{ACM} / {IW3C2}},
year = {2020},
url = {https://doi.org/10.1145/3366423.3380045},
doi = {10.1145/3366423.3380045},
timestamp = {Fri, 25 Dec 2020 01:14:58 +0100},
biburl = {https://dblp.org/rec/conf/www/LarsenMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/cu/20/ChungMV20,
author = {Kai{-}Min Chung and
Michael Mitzenmacher and
Salil P. Vadhan},
editor = {Tim Roughgarden},
title = {When Simple Hash Functions Suffice},
booktitle = {Beyond the Worst-Case Analysis of Algorithms},
pages = {567--585},
publisher = {Cambridge University Press},
year = {2020},
url = {https://doi.org/10.1017/9781108637435.033},
doi = {10.1017/9781108637435.033},
timestamp = {Mon, 04 Jan 2021 16:41:48 +0100},
biburl = {https://dblp.org/rec/books/cu/20/ChungMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/cu/20/MitzenmacherV20,
author = {Michael Mitzenmacher and
Sergei Vassilvitskii},
editor = {Tim Roughgarden},
title = {Algorithms with Predictions},
booktitle = {Beyond the Worst-Case Analysis of Algorithms},
pages = {646--662},
publisher = {Cambridge University Press},
year = {2020},
url = {https://doi.org/10.1017/9781108637435.037},
doi = {10.1017/9781108637435.037},
timestamp = {Mon, 04 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/cu/20/MitzenmacherV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-06076,
author = {Michael Mitzenmacher and
Charalampos E. Tsourakakis},
title = {Joint Alignment From Pairwise Differences with a Noisy Oracle},
journal = {CoRR},
volume = {abs/2003.06076},
year = {2020},
url = {https://arxiv.org/abs/2003.06076},
eprinttype = {arXiv},
eprint = {2003.06076},
timestamp = {Tue, 17 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-06076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-10332,
author = {Ran Ben Basat and
Gil Einziger and
Michael Mitzenmacher and
Shay Vargaftik},
title = {Faster and More Accurate Measurement through Additive-Error Counters},
journal = {CoRR},
volume = {abs/2004.10332},
year = {2020},
url = {https://arxiv.org/abs/2004.10332},
eprinttype = {arXiv},
eprint = {2004.10332},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-10332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-03176,
author = {Kapil Vaidya and
Eric Knorr and
Tim Kraska and
Michael Mitzenmacher},
title = {Partitioned Learned Bloom Filter},
journal = {CoRR},
volume = {abs/2006.03176},
year = {2020},
url = {https://arxiv.org/abs/2006.03176},
eprinttype = {arXiv},
eprint = {2006.03176},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-03176.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-09123,
author = {Michael Mitzenmacher and
Sergei Vassilvitskii},
title = {Algorithms with Predictions},
journal = {CoRR},
volume = {abs/2006.09123},
year = {2020},
url = {https://arxiv.org/abs/2006.09123},
eprinttype = {arXiv},
eprint = {2006.09123},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-09123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-15463,
author = {Michael Mitzenmacher},
title = {Queues with Small Advice},
journal = {CoRR},
volume = {abs/2006.15463},
year = {2020},
url = {https://arxiv.org/abs/2006.15463},
eprinttype = {arXiv},
eprint = {2006.15463},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-15463.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-03731,
author = {Ran Ben Basat and
Sivaramakrishnan Ramanathan and
Yuliang Li and
Gianni Antichi and
Minlan Yu and
Michael Mitzenmacher},
title = {{PINT:} Probabilistic In-band Network Telemetry},
journal = {CoRR},
volume = {abs/2007.03731},
year = {2020},
url = {https://arxiv.org/abs/2007.03731},
eprinttype = {arXiv},
eprint = {2007.03731},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-03731.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-02331,
author = {Ran Ben{-}Basat and
Michael Mitzenmacher and
Shay Vargaftik},
title = {How to send a real number using a single bit (and some shared randomness)},
journal = {CoRR},
volume = {abs/2010.02331},
year = {2020},
url = {https://arxiv.org/abs/2010.02331},
eprinttype = {arXiv},
eprint = {2010.02331},
timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-02331.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-10870,
author = {Michael Mitzenmacher and
Saeed Seddighin},
title = {Erd{\"{o}}s-Szekeres Partitioning Problem},
journal = {CoRR},
volume = {abs/2011.10870},
year = {2020},
url = {https://arxiv.org/abs/2011.10870},
eprinttype = {arXiv},
eprint = {2011.10870},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-10870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccr/ByersLM19,
author = {John W. Byers and
Michael Luby and
Michael Mitzenmacher},
title = {A digital fountain retrospective},
journal = {Comput. Commun. Rev.},
volume = {49},
number = {5},
pages = {82--85},
year = {2019},
url = {https://doi.org/10.1145/3371934.3371960},
doi = {10.1145/3371934.3371960},
timestamp = {Sun, 06 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ccr/ByersLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EsfandiariHLM19,
author = {Hossein Esfandiari and
Mohammad Taghi Hajiaghayi and
Brendan Lucier and
Michael Mitzenmacher},
title = {Online Pandora's Boxes and Bandits},
booktitle = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, The Thirty-First Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},
pages = {1885--1892},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33011885},
doi = {10.1609/AAAI.V33I01.33011885},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EsfandiariHLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher19,
author = {Michael Mitzenmacher},
editor = {Marni Mishna and
J. Ian Munro},
title = {Arithmetic Progression Hypergraphs: Examining the Second Moment Method},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {127--134},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.14},
doi = {10.1137/1.9781611975505.14},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/MitzenmacherM19,
author = {Michael Mitzenmacher and
Tom Morgan},
editor = {Dan Suciu and
Sebastian Skritek and
Christoph Koch},
title = {Robust Set Reconciliation via Locality Sensitive Hashing},
booktitle = {Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2019, Amsterdam, The Netherlands, June
30 - July 5, 2019},
pages = {164--181},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3294052.3319690},
doi = {10.1145/3294052.3319690},
timestamp = {Sun, 16 Jun 2019 19:26:40 +0200},
biburl = {https://dblp.org/rec/conf/pods/MitzenmacherM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2019sosa,
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-099-6},
isbn = {978-3-95977-099-6},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2019sosa.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-00902,
author = {Michael Mitzenmacher},
title = {A Model for Learned Bloom Filters, and Optimizing by Sandwiching},
journal = {CoRR},
volume = {abs/1901.00902},
year = {2019},
url = {http://arxiv.org/abs/1901.00902},
eprinttype = {arXiv},
eprint = {1901.00902},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-00902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-10698,
author = {Hossein Esfandiari and
MohammadTaghi Hajiaghayi and
Brendan Lucier and
Michael Mitzenmacher},
title = {Online Pandora's Boxes and Bandits},
journal = {CoRR},
volume = {abs/1901.10698},
year = {2019},
url = {http://arxiv.org/abs/1901.10698},
eprinttype = {arXiv},
eprint = {1901.10698},
timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-10698.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-00732,
author = {Michael Mitzenmacher},
title = {Scheduling with Predictions and the Price of Misprediction},
journal = {CoRR},
volume = {abs/1902.00732},
year = {2019},
url = {http://arxiv.org/abs/1902.00732},
eprinttype = {arXiv},
eprint = {1902.00732},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-00732.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-12155,
author = {Michael Mitzenmacher},
title = {The Supermarket Model with Known and Predicted Service Times},
journal = {CoRR},
volume = {abs/1905.12155},
year = {2019},
url = {http://arxiv.org/abs/1905.12155},
eprinttype = {arXiv},
eprint = {1905.12155},
timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-12155.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-09912,
author = {Kasper Green Larsen and
Michael Mitzenmacher and
Charalampos E. Tsourakakis},
title = {Optimal Learning of Joint Alignments with a Faulty Oracle},
journal = {CoRR},
volume = {abs/1909.09912},
year = {2019},
url = {http://arxiv.org/abs/1909.09912},
eprinttype = {arXiv},
eprint = {1909.09912},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-09912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-03798,
author = {Hossein Esfandiari and
Mohammad Taghi Hajiaghayi and
Brendan Lucier and
Michael Mitzenmacher},
title = {Prophets, Secretaries, and Maximizing the Probability of Choosing
the Best},
journal = {CoRR},
volume = {abs/1910.03798},
year = {2019},
url = {http://arxiv.org/abs/1910.03798},
eprinttype = {arXiv},
eprint = {1910.03798},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-03798.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/MitzenmacherP18,
author = {Michael Mitzenmacher and
Rasmus Pagh},
title = {Simple multi-party set reconciliation},
journal = {Distributed Comput.},
volume = {31},
number = {6},
pages = {441--453},
year = {2018},
url = {https://doi.org/10.1007/s00446-017-0316-0},
doi = {10.1007/S00446-017-0316-0},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/MitzenmacherP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/PontarelliRM18,
author = {Salvatore Pontarelli and
Pedro Reviriego and
Michael Mitzenmacher},
title = {{EMOMA:} Exact Match in One Memory Access},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {30},
number = {11},
pages = {2120--2133},
year = {2018},
url = {https://doi.org/10.1109/TKDE.2018.2818716},
doi = {10.1109/TKDE.2018.2818716},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tkde/PontarelliRM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/MitzenmacherRR18,
author = {Michael Mitzenmacher and
Rajmohan Rajaraman and
Scott T. Roche},
title = {Better Bounds for Coalescing-Branching Random Walks},
journal = {{ACM} Trans. Parallel Comput.},
volume = {5},
number = {1},
pages = {2:1--2:23},
year = {2018},
url = {https://doi.org/10.1145/3209688},
doi = {10.1145/3209688},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/MitzenmacherRR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/MitzenmacherPR18,
author = {Michael Mitzenmacher and
Salvatore Pontarelli and
Pedro Reviriego},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Adaptive Cuckoo Filters},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {36--47},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.4},
doi = {10.1137/1.9781611975055.4},
timestamp = {Thu, 04 Jan 2018 14:01:44 +0100},
biburl = {https://dblp.org/rec/conf/alenex/MitzenmacherPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/HopkinsMW18,
author = {Max Hopkins and
Michael Mitzenmacher and
Sebastian Wagner{-}Carena},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Simulated Annealing for {JPEG} Quantization},
booktitle = {2018 Data Compression Conference, {DCC} 2018, Snowbird, UT, USA, March
27-30, 2018},
pages = {412},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/DCC.2018.00065},
doi = {10.1109/DCC.2018.00065},
timestamp = {Wed, 25 Jul 2018 12:08:56 +0200},
biburl = {https://dblp.org/rec/conf/dcc/HopkinsMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EsfandiariM18,
author = {Hossein Esfandiari and
Michael Mitzenmacher},
editor = {Mikkel Thorup},
title = {Metric Sublinear Algorithms via Linear Sampling},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {11--22},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00011},
doi = {10.1109/FOCS.2018.00011},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EsfandiariM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/ReagenGAMRW018,
author = {Brandon Reagen and
Udit Gupta and
Robert Adolf and
Michael Mitzenmacher and
Alexander M. Rush and
Gu{-}Yeon Wei and
David Brooks},
title = {Weightless: Lossy weight encoding for deep neural network compression},
booktitle = {6th International Conference on Learning Representations, {ICLR} 2018,
Vancouver, BC, Canada, April 30 - May 3, 2018, Workshop Track Proceedings},
publisher = {OpenReview.net},
year = {2018},
url = {https://openreview.net/forum?id=rJpXxgaIG},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iclr/ReagenGAMRW018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/ReagenGAMRWB18,
author = {Brandon Reagen and
Udit Gupta and
Bob Adolf and
Michael Mitzenmacher and
Alexander M. Rush and
Gu{-}Yeon Wei and
David Brooks},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Weightless: Lossy weight encoding for deep neural network compression},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {4321--4330},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/reagan18a.html},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/ReagenGAMRWB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Mitzenmacher18,
author = {Michael Mitzenmacher},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {A Model for Learned Bloom Filters and Optimizing by Sandwiching},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {462--471},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/0f49c89d1e7298bb9930789c8ed59d48-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/Mitzenmacher18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/CaiMA18,
author = {Diana Cai and
Michael Mitzenmacher and
Ryan P. Adams},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {A Bayesian Nonparametric View on Count-Min Sketch},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {8782--8791},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/0b9e57c46de934cee33b0e8d1839bfc2-Abstract.html},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/CaiMA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/MitzenmacherM18,
author = {Michael Mitzenmacher and
Tom Morgan},
editor = {Jan Van den Bussche and
Marcelo Arenas},
title = {Reconciling Graphs and Sets of Sets},
booktitle = {Proceedings of the 37th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, Houston, TX, USA, June 10-15, 2018},
pages = {33--47},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3196959.3196988},
doi = {10.1145/3196959.3196988},
timestamp = {Wed, 21 Nov 2018 12:44:18 +0100},
biburl = {https://dblp.org/rec/conf/pods/MitzenmacherM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MitzenmacherPW18,
author = {Michael Mitzenmacher and
Konstantinos Panagiotou and
Stefan Walzer},
editor = {David Eppstein},
title = {Load Thresholds for Cuckoo Hashing with Double Hashing},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {29:1--29:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.29},
doi = {10.4230/LIPICS.SWAT.2018.29},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/MitzenmacherPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/MitzenmacherT18,
author = {Michael Mitzenmacher and
Charalampos E. Tsourakakis},
editor = {Anthony Bonato and
Pawel Pralat and
Andrei M. Raigorodskii},
title = {Joint Alignment from Pairwise Differences with a Noisy Oracle},
booktitle = {Algorithms and Models for the Web Graph - 15th International Workshop,
{WAW} 2018, Moscow, Russia, May 17-18, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10836},
pages = {59--69},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-92871-5\_5},
doi = {10.1007/978-3-319-92871-5\_5},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/waw/MitzenmacherT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/db/Mitzenmacher18,
author = {Michael Mitzenmacher},
editor = {Ling Liu and
M. Tamer {\"{O}}zsu},
title = {Bloom Filters},
booktitle = {Encyclopedia of Database Systems, Second Edition},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-1-4614-8265-9\_751},
doi = {10.1007/978-1-4614-8265-9\_751},
timestamp = {Thu, 14 Feb 2019 09:43:36 +0100},
biburl = {https://dblp.org/rec/reference/db/Mitzenmacher18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-00884,
author = {Michael Mitzenmacher},
title = {A Model for Learned Bloom Filters and Related Structures},
journal = {CoRR},
volume = {abs/1802.00884},
year = {2018},
url = {http://arxiv.org/abs/1802.00884},
eprinttype = {arXiv},
eprint = {1802.00884},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-00884.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-01474,
author = {Michael Mitzenmacher},
title = {Optimizing Learned Bloom Filters by Sandwiching},
journal = {CoRR},
volume = {abs/1803.01474},
year = {2018},
url = {http://arxiv.org/abs/1803.01474},
eprinttype = {arXiv},
eprint = {1803.01474},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-01474.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-09302,
author = {Hossein Esfandiari and
Michael Mitzenmacher},
title = {Metric Sublinear Algorithms via Linear Sampling},
journal = {CoRR},
volume = {abs/1807.09302},
year = {2018},
url = {http://arxiv.org/abs/1807.09302},
eprinttype = {arXiv},
eprint = {1807.09302},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-09302.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-09686,
author = {Michael Mitzenmacher and
Tom Morgan},
title = {Directory Reconciliation},
journal = {CoRR},
volume = {abs/1807.09686},
year = {2018},
url = {http://arxiv.org/abs/1807.09686},
eprinttype = {arXiv},
eprint = {1807.09686},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-09686.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-09694,
author = {Michael Mitzenmacher and
Tom Morgan},
title = {Robust Set Reconciliation via Locality Sensitive Hashing},
journal = {CoRR},
volume = {abs/1807.09694},
year = {2018},
url = {http://arxiv.org/abs/1807.09694},
eprinttype = {arXiv},
eprint = {1807.09694},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-09694.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Mitzenmacher17,
author = {Michael Mitzenmacher},
title = {Technical Perspective: Building a better hash function},
journal = {Commun. {ACM}},
volume = {60},
number = {7},
pages = {93},
year = {2017},
url = {https://doi.org/10.1145/3068770},
doi = {10.1145/3068770},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/Mitzenmacher17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurosp/GoodrichKMT17,
author = {Michael T. Goodrich and
Evgenios M. Kornaropoulos and
Michael Mitzenmacher and
Roberto Tamassia},
title = {Auditable Data Structures},
booktitle = {2017 {IEEE} European Symposium on Security and Privacy, EuroS{\&}P
2017, Paris, France, April 26-28, 2017},
pages = {285--300},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/EuroSP.2017.46},
doi = {10.1109/EUROSP.2017.46},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eurosp/GoodrichKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/miccai/MatejekHLMP17,
author = {Brian Matejek and
Daniel Haehn and
Fritz Lekschas and
Michael Mitzenmacher and
Hanspeter Pfister},
editor = {Maxime Descoteaux and
Lena Maier{-}Hein and
Alfred M. Franz and
Pierre Jannin and
D. Louis Collins and
Simon Duchesne},
title = {Compresso: Efficient Compression of Segmentation Data for Connectomics},
booktitle = {Medical Image Computing and Computer Assisted Intervention - {MICCAI}
2017 - 20th International Conference, Quebec City, QC, Canada, September
11-13, 2017, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {10433},
pages = {781--788},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66182-7\_89},
doi = {10.1007/978-3-319-66182-7\_89},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/miccai/MatejekHLMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/EppsteinGMT17,
author = {David Eppstein and
Michael T. Goodrich and
Michael Mitzenmacher and
Manuel R. Torres},
editor = {Emanuel Sallinger and
Jan Van den Bussche and
Floris Geerts},
title = {2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection},
booktitle = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
pages = {247--260},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3034786.3056115},
doi = {10.1145/3034786.3056115},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/EppsteinGMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/TsourakakisPM17,
author = {Charalampos E. Tsourakakis and
Jakub Pachocki and
Michael Mitzenmacher},
editor = {Rick Barrett and
Rick Cummings and
Eugene Agichtein and
Evgeniy Gabrilovich},
title = {Scalable Motif-aware Graph Clustering},
booktitle = {Proceedings of the 26th International Conference on World Wide Web,
{WWW} 2017, Perth, Australia, April 3-7, 2017},
pages = {1451--1460},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3038912.3052653},
doi = {10.1145/3038912.3052653},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/TsourakakisPM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MitzenmacherPR17,
author = {Michael Mitzenmacher and
Salvatore Pontarelli and
Pedro Reviriego},
title = {Adaptive Cuckoo Filters},
journal = {CoRR},
volume = {abs/1704.06818},
year = {2017},
url = {http://arxiv.org/abs/1704.06818},
eprinttype = {arXiv},
eprint = {1704.06818},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MitzenmacherPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MitzenmacherM17,
author = {Michael Mitzenmacher and
Tom Morgan},
title = {Reconciling Graphs and Sets of Sets},
journal = {CoRR},
volume = {abs/1707.05867},
year = {2017},
url = {http://arxiv.org/abs/1707.05867},
eprinttype = {arXiv},
eprint = {1707.05867},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MitzenmacherM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-00649,
author = {Max Hopkins and
Michael Mitzenmacher and
Sebastian Wagner{-}Carena},
title = {Simulated Annealing for {JPEG} Quantization},
journal = {CoRR},
volume = {abs/1709.00649},
year = {2017},
url = {http://arxiv.org/abs/1709.00649},
eprinttype = {arXiv},
eprint = {1709.00649},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-00649.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-04711,
author = {Salvatore Pontarelli and
Pedro Reviriego and
Michael Mitzenmacher},
title = {{EMOMA:} Exact Match in One Memory Access},
journal = {CoRR},
volume = {abs/1709.04711},
year = {2017},
url = {http://arxiv.org/abs/1709.04711},
eprinttype = {arXiv},
eprint = {1709.04711},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-04711.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-07308,
author = {Charalampos E. Tsourakakis and
Michael Mitzenmacher and
Jaroslaw Blasiok and
Ben Lawson and
Preetum Nakkiran and
Vasileios Nakos},
title = {Predicting Positive and Negative Links with Noisy Queries: Theory
{\&} Practice},
journal = {CoRR},
volume = {abs/1709.07308},
year = {2017},
url = {http://arxiv.org/abs/1709.07308},
eprinttype = {arXiv},
eprint = {1709.07308},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-07308.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04686,
author = {Brandon Reagen and
Udit Gupta and
Robert Adolf and
Michael M. Mitzenmacher and
Alexander M. Rush and
Gu{-}Yeon Wei and
David M. Brooks},
title = {Weightless: Lossy Weight Encoding For Deep Neural Network Compression},
journal = {CoRR},
volume = {abs/1711.04686},
year = {2017},
url = {http://arxiv.org/abs/1711.04686},
eprinttype = {arXiv},
eprint = {1711.04686},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-04686.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-01781,
author = {Michael Mitzenmacher},
title = {Arithmetic Progression Hypergraphs: Examining the Second Moment Method},
journal = {CoRR},
volume = {abs/1712.01781},
year = {2017},
url = {http://arxiv.org/abs/1712.01781},
eprinttype = {arXiv},
eprint = {1712.01781},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-01781.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DietzfelbingerM17,
author = {Martin Dietzfelbinger and
Michael Mitzenmacher and
Rasmus Pagh and
David P. Woodruff and
Martin Aum{\"{u}}ller},
title = {Theory and Applications of Hashing (Dagstuhl Seminar 17181)},
journal = {Dagstuhl Reports},
volume = {7},
number = {5},
pages = {1--21},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.5.1},
doi = {10.4230/DAGREP.7.5.1},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DietzfelbingerM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/MitzenmacherT16,
author = {Michael Mitzenmacher and
Justin Thaler},
title = {Technical Perspective: Catching lies (and mistakes) in offloaded computation},
journal = {Commun. {ACM}},
volume = {59},
number = {2},
pages = {102},
year = {2016},
url = {https://doi.org/10.1145/2856453},
doi = {10.1145/2856453},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/MitzenmacherT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MitzenmacherN16,
author = {Michael Mitzenmacher and
Vikram Nathan},
title = {Hardness of peeling with stashes},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {682--688},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.05.006},
doi = {10.1016/J.IPL.2016.05.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MitzenmacherN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/ReshefRFSM16,
author = {Yakir A. Reshef and
David N. Reshef and
Hilary K. Finucane and
Pardis C. Sabeti and
Michael Mitzenmacher},
title = {Measuring Dependence Powerfully and Equitably},
journal = {J. Mach. Learn. Res.},
volume = {17},
pages = {212:1--212:63},
year = {2016},
url = {http://jmlr.org/papers/v17/15-308.html},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/ReshefRFSM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/MitzenmacherRP16,
author = {Michael Mitzenmacher and
Pedro Reviriego and
Salvatore Pontarelli},
title = {{OMASS:} One Memory Access Set Separation},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {28},
number = {7},
pages = {1940--1943},
year = {2016},
url = {https://doi.org/10.1109/TKDE.2016.2535286},
doi = {10.1109/TKDE.2016.2535286},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tkde/MitzenmacherRP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/JiangMT16,
author = {Jiayang Jiang and
Michael Mitzenmacher and
Justin Thaler},
title = {Parallel Peeling Algorithms},
journal = {{ACM} Trans. Parallel Comput.},
volume = {3},
number = {1},
pages = {7:1--7:27},
year = {2016},
url = {https://doi.org/10.1145/2938412},
doi = {10.1145/2938412},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/JiangMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/Mitzenmacher16,
author = {Michael Mitzenmacher},
title = {Analyzing distributed Join-Idle-Queue: {A} fluid limit approach},
booktitle = {54th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2016, Monticello, IL, USA, September 27-30, 2016},
pages = {312--318},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/ALLERTON.2016.7852246},
doi = {10.1109/ALLERTON.2016.7852246},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/allerton/Mitzenmacher16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher16,
author = {Michael Mitzenmacher},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {More Analysis of Double Hashing for Balanced Allocations},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {1--9},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.1},
doi = {10.1137/1.9781611974324.1},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher16a,
author = {Michael Mitzenmacher},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {A New Approach to Analyzing Robin Hood Hashing},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {10--24},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.2},
doi = {10.1137/1.9781611974324.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esorics/GoodrichKMT16,
author = {Michael T. Goodrich and
Evgenios M. Kornaropoulos and
Michael Mitzenmacher and
Roberto Tamassia},
editor = {Ioannis G. Askoxylakis and
Sotiris Ioannidis and
Sokratis K. Katsikas and
Catherine Meadows},
title = {More Practical and Secure History-Independent Hash Tables},
booktitle = {Computer Security - {ESORICS} 2016 - 21st European Symposium on Research
in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9879},
pages = {20--38},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45741-3\_2},
doi = {10.1007/978-3-319-45741-3\_2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esorics/GoodrichKMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BoppanaHMM16,
author = {Meena Boppana and
Rani Hod and
Michael Mitzenmacher and
Tom Morgan},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Voronoi Choice Games},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {23:1--23:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.23},
doi = {10.4230/LIPICS.ICALP.2016.23},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BoppanaHMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isw/EppsteinGLMMT16,
author = {David Eppstein and
Michael T. Goodrich and
Jenny Lam and
Nil Mamano and
Michael Mitzenmacher and
Manuel R. Torres},
editor = {Matt Bishop and
Anderson C. A. Nascimento},
title = {Models and Algorithms for Graph Watermarking},
booktitle = {Information Security - 19th International Conference, {ISC} 2016,
Honolulu, HI, USA, September 3-6, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9866},
pages = {283--301},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45871-7\_18},
doi = {10.1007/978-3-319-45871-7\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/isw/EppsteinGLMMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/0001MS16,
author = {Ping Li and
Michael Mitzenmacher and
Martin Slawski},
editor = {Daniel D. Lee and
Masashi Sugiyama and
Ulrike von Luxburg and
Isabelle Guyon and
Roman Garnett},
title = {Quantized Random Projections and Non-Linear Estimation of Cosine Similarity},
booktitle = {Advances in Neural Information Processing Systems 29: Annual Conference
on Neural Information Processing Systems 2016, December 5-10, 2016,
Barcelona, Spain},
pages = {2748--2756},
year = {2016},
url = {https://proceedings.neurips.cc/paper/2016/hash/186a157b2992e7daed3677ce8e9fe40f-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/0001MS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/LibertyMTU16,
author = {Edo Liberty and
Michael Mitzenmacher and
Justin Thaler and
Jonathan R. Ullman},
editor = {Tova Milo and
Wang{-}Chiew Tan},
title = {Space Lower Bounds for Itemset Frequency Sketches},
booktitle = {Proceedings of the 35th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2016, San Francisco, CA, USA, June 26
- July 01, 2016},
pages = {441--454},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2902251.2902278},
doi = {10.1145/2902251.2902278},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/LibertyMTU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/MitzenmacherRR16,
author = {Michael Mitzenmacher and
Rajmohan Rajaraman and
Scott T. Roche},
editor = {Christian Scheideler and
Seth Gilbert},
title = {Better Bounds for Coalescing-Branching Random Walks},
booktitle = {Proceedings of the 28th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2016, Asilomar State Beach/Pacific Grove,
CA, USA, July 11-13, 2016},
pages = {313--323},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2935764.2935791},
doi = {10.1145/2935764.2935791},
timestamp = {Tue, 06 Nov 2018 16:59:33 +0100},
biburl = {https://dblp.org/rec/conf/spaa/MitzenmacherRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2016,
editor = {Michael T. Goodrich and
Michael Mitzenmacher},
title = {Proceedings of the Eighteenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2016, Arlington, Virginia, USA, January 10,
2016},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974317},
doi = {10.1137/1.9781611974317},
isbn = {978-1-61197-431-7},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2016,
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-013-2},
isbn = {978-3-95977-013-2},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001MS16,
author = {Ping Li and
Michael Mitzenmacher and
Anshumali Shrivastava},
title = {2-Bit Random Projections, NonLinear Estimators, and Approximate Near
Neighbor Search},
journal = {CoRR},
volume = {abs/1602.06577},
year = {2016},
url = {http://arxiv.org/abs/1602.06577},
eprinttype = {arXiv},
eprint = {1602.06577},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001MS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MitzenmacherRR16,
author = {Michael Mitzenmacher and
Rajmohan Rajaraman and
Scott T. Roche},
title = {Better bounds for coalescing-branching random walks},
journal = {CoRR},
volume = {abs/1603.06109},
year = {2016},
url = {http://arxiv.org/abs/1603.06109},
eprinttype = {arXiv},
eprint = {1603.06109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MitzenmacherRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoppanaHMM16,
author = {Meena Boppana and
Rani Hod and
Michael Mitzenmacher and
Tom Morgan},
title = {Voronoi Choice Games},
journal = {CoRR},
volume = {abs/1604.07084},
year = {2016},
url = {http://arxiv.org/abs/1604.07084},
eprinttype = {arXiv},
eprint = {1604.07084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoppanaHMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGLMMT16,
author = {David Eppstein and
Michael T. Goodrich and
Jenny Lam and
Nil Mamano and
Michael Mitzenmacher and
Manuel R. Torres},
title = {Models and Algorithms for Graph Watermarking},
journal = {CoRR},
volume = {abs/1605.09425},
year = {2016},
url = {http://arxiv.org/abs/1605.09425},
eprinttype = {arXiv},
eprint = {1605.09425},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGLMMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Mitzenmacher16,
author = {Michael Mitzenmacher},
title = {Analyzing Distributed Join-Idle-Queue: {A} Fluid Limit Approach},
journal = {CoRR},
volume = {abs/1606.01833},
year = {2016},
url = {http://arxiv.org/abs/1606.01833},
eprinttype = {arXiv},
eprint = {1606.01833},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Mitzenmacher16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/TsourakakisPM16,
author = {Charalampos E. Tsourakakis and
Jakub Pachocki and
Michael Mitzenmacher},
title = {Scalable motif-aware graph clustering},
journal = {CoRR},
volume = {abs/1606.06235},
year = {2016},
url = {http://arxiv.org/abs/1606.06235},
eprinttype = {arXiv},
eprint = {1606.06235},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/TsourakakisPM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MitzenmacherT16,
author = {Michael Mitzenmacher and
Charalampos E. Tsourakakis},
title = {Predicting Signed Edges with O(n log n) Queries},
journal = {CoRR},
volume = {abs/1609.00750},
year = {2016},
url = {http://arxiv.org/abs/1609.00750},
eprinttype = {arXiv},
eprint = {1609.00750},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MitzenmacherT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GoodrichKMT16,
author = {Michael T. Goodrich and
Evgenios M. Kornaropoulos and
Michael Mitzenmacher and
Roberto Tamassia},
title = {More Practical and Secure History-Independent Hash Tables},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {134},
year = {2016},
url = {http://eprint.iacr.org/2016/134},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GoodrichKMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GoodrichKMT16a,
author = {Michael T. Goodrich and
Evgenios M. Kornaropoulos and
Michael Mitzenmacher and
Roberto Tamassia},
title = {Auditable Data Structures},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {755},
year = {2016},
url = {http://eprint.iacr.org/2016/755},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GoodrichKMT16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Mitzenmacher15,
author = {Michael Mitzenmacher},
title = {Theory without experiments: have we gone too far?},
journal = {Commun. {ACM}},
volume = {58},
number = {9},
pages = {40--42},
year = {2015},
url = {https://doi.org/10.1145/2699413},
doi = {10.1145/2699413},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/Mitzenmacher15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/MitzenmacherPPT15,
author = {Michael Mitzenmacher and
Jakub Pachocki and
Richard Peng and
Charalampos E. Tsourakakis and
Shen Chen Xu},
editor = {Longbing Cao and
Chengqi Zhang and
Thorsten Joachims and
Geoffrey I. Webb and
Dragos D. Margineantu and
Graham Williams},
title = {Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling},
booktitle = {Proceedings of the 21th {ACM} {SIGKDD} International Conference on
Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August
10-13, 2015},
pages = {815--824},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2783258.2783385},
doi = {10.1145/2783258.2783385},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/MitzenmacherPPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/ZhouFLAKMWS15,
author = {Dong Zhou and
Bin Fan and
Hyeontaek Lim and
David G. Andersen and
Michael Kaminsky and
Michael Mitzenmacher and
Ren Wang and
Ajaypal Singh},
editor = {Steve Uhlig and
Olaf Maennel and
Brad Karp and
Jitendra Padhye},
title = {Scaling Up Clustered Network Appliances with ScaleBricks},
booktitle = {Proceedings of the 2015 {ACM} Conference on Special Interest Group
on Data Communication, {SIGCOMM} 2015, London, United Kingdom, August
17-21, 2015},
pages = {241--254},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2785956.2787503},
doi = {10.1145/2785956.2787503},
timestamp = {Wed, 21 Jul 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/ZhouFLAKMWS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Mitzenmacher15,
author = {Michael Mitzenmacher},
title = {More Analysis of Double Hashing for Balanced Allocations},
journal = {CoRR},
volume = {abs/1503.00658},
year = {2015},
url = {http://arxiv.org/abs/1503.00658},
eprinttype = {arXiv},
eprint = {1503.00658},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Mitzenmacher15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ReshefRSM15,
author = {Yakir A. Reshef and
David N. Reshef and
Pardis C. Sabeti and
Michael M. Mitzenmacher},
title = {Equitability, interval estimation, and statistical power},
journal = {CoRR},
volume = {abs/1505.02212},
year = {2015},
url = {http://arxiv.org/abs/1505.02212},
eprinttype = {arXiv},
eprint = {1505.02212},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ReshefRSM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ReshefRFSM15,
author = {Yakir A. Reshef and
David N. Reshef and
Hilary K. Finucane and
Pardis C. Sabeti and
Michael M. Mitzenmacher},
title = {Measuring dependence powerfully and equitably},
journal = {CoRR},
volume = {abs/1505.02213},
year = {2015},
url = {http://arxiv.org/abs/1505.02213},
eprinttype = {arXiv},
eprint = {1505.02213},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ReshefRFSM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ReshefRSM15a,
author = {David N. Reshef and
Yakir A. Reshef and
Pardis C. Sabeti and
Michael M. Mitzenmacher},
title = {An Empirical Study of Leading Measures of Dependence},
journal = {CoRR},
volume = {abs/1505.02214},
year = {2015},
url = {http://arxiv.org/abs/1505.02214},
eprinttype = {arXiv},
eprint = {1505.02214},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ReshefRSM15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PontarelliRM14,
author = {Salvatore Pontarelli and
Pedro Reviriego and
Michael Mitzenmacher},
title = {Improving the performance of Invertible Bloom Lookup Tables},
journal = {Inf. Process. Lett.},
volume = {114},
number = {4},
pages = {185--191},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2013.11.015},
doi = {10.1016/J.IPL.2013.11.015},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PontarelliRM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/BoralM14,
author = {Anudhyan Boral and
Michael Mitzenmacher},
title = {Multi-party set reconciliation using characteristic polynomials},
booktitle = {52nd Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2014, Allerton Park {\&} Retreat Center, Monticello,
IL, USA, September 30 - October 3, 2014},
pages = {1182--1187},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ALLERTON.2014.7028589},
doi = {10.1109/ALLERTON.2014.7028589},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/allerton/BoralM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/conext/FanAKM14,
author = {Bin Fan and
David G. Andersen and
Michael Kaminsky and
Michael Mitzenmacher},
editor = {Aruna Seneviratne and
Christophe Diot and
Jim Kurose and
Augustin Chaintreau and
Luigi Rizzo},
title = {Cuckoo Filter: Practically Better Than Bloom},
booktitle = {Proceedings of the 10th {ACM} International on Conference on emerging
Networking Experiments and Technologies, CoNEXT 2014, Sydney, Australia,
December 2-5, 2014},
pages = {75--88},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2674005.2674994},
doi = {10.1145/2674005.2674994},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/conext/FanAKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/0001MS14,
author = {Ping Li and
Michael Mitzenmacher and
Anshumali Shrivastava},
title = {Coding for Random Projections},
booktitle = {Proceedings of the 31th International Conference on Machine Learning,
{ICML} 2014, Beijing, China, 21-26 June 2014},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {32},
pages = {676--684},
publisher = {JMLR.org},
year = {2014},
url = {http://proceedings.mlr.press/v32/lie14.html},
timestamp = {Wed, 29 May 2019 08:41:45 +0200},
biburl = {https://dblp.org/rec/conf/icml/0001MS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/HaeuplerM14,
author = {Bernhard Haeupler and
Michael Mitzenmacher},
title = {Repeated deletion channels},
booktitle = {2014 {IEEE} Information Theory Workshop, {ITW} 2014, Hobart, Tasmania,
Australia, November 2-5, 2014},
pages = {152--156},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ITW.2014.6970811},
doi = {10.1109/ITW.2014.6970811},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/itw/HaeuplerM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/JiangMT14,
author = {Jiayang Jiang and
Michael Mitzenmacher and
Justin Thaler},
editor = {Guy E. Blelloch and
Peter Sanders},
title = {Parallel peeling algorithms},
booktitle = {26th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '14, Prague, Czech Republic - June 23 - 25, 2014},
pages = {319--330},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2612669.2612674},
doi = {10.1145/2612669.2612674},
timestamp = {Wed, 21 Nov 2018 11:18:43 +0100},
biburl = {https://dblp.org/rec/conf/spaa/JiangMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Mitzenmacher14,
author = {Michael Mitzenmacher},
editor = {Guy E. Blelloch and
Peter Sanders},
title = {Balanced allocations and double hashing},
booktitle = {26th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '14, Prague, Czech Republic - June 23 - 25, 2014},
pages = {331--342},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2612669.2612684},
doi = {10.1145/2612669.2612684},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Mitzenmacher14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/EppsteinGMP14,
author = {David Eppstein and
Michael T. Goodrich and
Michael Mitzenmacher and
Pawel Pszona},
editor = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs
into One Basket},
booktitle = {Experimental Algorithms - 13th International Symposium, {SEA} 2014,
Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8504},
pages = {162--173},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07959-2\_14},
doi = {10.1007/978-3-319-07959-2\_14},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/EppsteinGMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/MitzenmacherPP14,
author = {Michael Mitzenmacher and
Rasmus Pagh and
Ninh Pham},
editor = {Chin{-}Wan Chung and
Andrei Z. Broder and
Kyuseok Shim and
Torsten Suel},
title = {Efficient estimation for high similarities using odd sketches},
booktitle = {23rd International World Wide Web Conference, {WWW} '14, Seoul, Republic
of Korea, April 7-11, 2014},
pages = {109--118},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2566486.2568017},
doi = {10.1145/2566486.2568017},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/MitzenmacherPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/chb/MitzenmacherU14,
author = {Michael Mitzenmacher and
Eli Upfal},
editor = {Teofilo F. Gonzalez and
Jorge Diaz{-}Herrera and
Allen Tucker},
title = {Some Practical Randomized Algorithms and Data Structures},
booktitle = {Computing Handbook, Third Edition: Computer Science and Software Engineering},
pages = {11: 1--23},
publisher = {{CRC} Press},
year = {2014},
timestamp = {Tue, 17 Jun 2014 14:00:46 +0200},
biburl = {https://dblp.org/rec/books/crc/chb/MitzenmacherU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Mitzenmacher14,
author = {Michael Mitzenmacher},
title = {A New Approach to Analyzing Robin Hood Hashing},
journal = {CoRR},
volume = {abs/1401.7616},
year = {2014},
url = {http://arxiv.org/abs/1401.7616},
eprinttype = {arXiv},
eprint = {1401.7616},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Mitzenmacher14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001MS14a,
author = {Ping Li and
Michael Mitzenmacher and
Anshumali Shrivastava},
title = {Coding for Random Projections and Approximate Near Neighbor Search},
journal = {CoRR},
volume = {abs/1403.8144},
year = {2014},
url = {http://arxiv.org/abs/1403.8144},
eprinttype = {arXiv},
eprint = {1403.8144},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001MS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EppsteinGMP14,
author = {David Eppstein and
Michael T. Goodrich and
Michael Mitzenmacher and
Pawel Pszona},
title = {Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs
into One Basket},
journal = {CoRR},
volume = {abs/1404.0286},
year = {2014},
url = {http://arxiv.org/abs/1404.0286},
eprinttype = {arXiv},
eprint = {1404.0286},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EppsteinGMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LibertyMT14,
author = {Edo Liberty and
Michael Mitzenmacher and
Justin Thaler},
title = {Space Lower Bounds for Itemset Frequency Sketches},
journal = {CoRR},
volume = {abs/1407.3740},
year = {2014},
url = {http://arxiv.org/abs/1407.3740},
eprinttype = {arXiv},
eprint = {1407.3740},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LibertyMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ReshefRSM14,
author = {Yakir A. Reshef and
David N. Reshef and
Pardis C. Sabeti and
Michael Mitzenmacher},
title = {Theoretical Foundations of Equitability and the Maximal Information
Coefficient},
journal = {CoRR},
volume = {abs/1408.4908},
year = {2014},
url = {http://arxiv.org/abs/1408.4908},
eprinttype = {arXiv},
eprint = {1408.4908},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ReshefRSM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoralM14,
author = {Anudhyan Boral and
Michael Mitzenmacher},
title = {Multi-Party Set Reconciliation Using Characteristic Polynomials},
journal = {CoRR},
volume = {abs/1410.2645},
year = {2014},
url = {http://arxiv.org/abs/1410.2645},
eprinttype = {arXiv},
eprint = {1410.2645},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoralM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MitzenmacherN14,
author = {Michael Mitzenmacher and
Vikram Nathan},
title = {Hardness of Peeling with Stashes},
journal = {CoRR},
volume = {abs/1410.5169},
year = {2014},
url = {http://arxiv.org/abs/1410.5169},
eprinttype = {arXiv},
eprint = {1410.5169},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MitzenmacherN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CormodeMT13,
author = {Graham Cormode and
Michael Mitzenmacher and
Justin Thaler},
title = {Streaming Graph Computations with a Helpful Advisor},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {409--442},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9598-y},
doi = {10.1007/S00453-011-9598-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CormodeMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngelinoGMT13,
author = {Elaine Angelino and
Michael T. Goodrich and
Michael Mitzenmacher and
Justin Thaler},
title = {External-Memory Multimaps},
journal = {Algorithmica},
volume = {67},
number = {1},
pages = {23--48},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9770-7},
doi = {10.1007/S00453-013-9770-7},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelinoGMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChungMV13,
author = {Kai{-}Min Chung and
Michael Mitzenmacher and
Salil P. Vadhan},
title = {Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream},
journal = {Theory Comput.},
volume = {9},
pages = {897--945},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a030},
doi = {10.4086/TOC.2013.V009A030},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChungMV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waw/2013,
editor = {Anthony Bonato and
Michael Mitzenmacher and
Pawel Pralat},
title = {Algorithms and Models for the Web Graph - 10th International Workshop,
{WAW} 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8305},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03536-9},
doi = {10.1007/978-3-319-03536-9},
isbn = {978-3-319-03535-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waw/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-6314,
author = {David N. Reshef and
Yakir Reshef and
Michael Mitzenmacher and
Pardis Sabeti},
title = {Equitability Analysis of the Maximal Information Coefficient, with
Comparisons},
journal = {CoRR},
volume = {abs/1301.6314},
year = {2013},
url = {http://arxiv.org/abs/1301.6314},
eprinttype = {arXiv},
eprint = {1301.6314},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-6314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-7014,
author = {Jiayang Jiang and
Michael Mitzenmacher and
Justin Thaler},
title = {Parallel Peeling Algorithms},
journal = {CoRR},
volume = {abs/1302.7014},
year = {2013},
url = {http://arxiv.org/abs/1302.7014},
eprinttype = {arXiv},
eprint = {1302.7014},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-7014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001MS13,
author = {Ping Li and
Michael Mitzenmacher and
Anshumali Shrivastava},
title = {Coding for Random Projections},
journal = {CoRR},
volume = {abs/1308.2218},
year = {2013},
url = {http://arxiv.org/abs/1308.2218},
eprinttype = {arXiv},
eprint = {1308.2218},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001MS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MitzenmacherP13,
author = {Michael Mitzenmacher and
Rasmus Pagh},
title = {Simple Multi-Party Set Reconciliation},
journal = {CoRR},
volume = {abs/1311.2037},
year = {2013},
url = {http://arxiv.org/abs/1311.2037},
eprinttype = {arXiv},
eprint = {1311.2037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MitzenmacherP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KirschMPPUV12,
author = {Adam Kirsch and
Michael Mitzenmacher and
Andrea Pietracaprina and
Geppino Pucci and
Eli Upfal and
Fabio Vandin},
title = {An Efficient Rigorous Approach for Identifying Statistically Significant
Frequent Itemsets},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {12:1--12:22},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220359},
doi = {10.1145/2220357.2220359},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KirschMPPUV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImmorlicaKMSU12,
author = {Nicole Immorlica and
Jonathan Katz and
Michael Mitzenmacher and
Rocco A. Servedio and
Chris Umans},
title = {Special Section on the Forty-First Annual {ACM} Symposium on Theory
of Computing {(STOC} 2009)},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {6},
pages = {1591--1592},
year = {2012},
url = {https://doi.org/10.1137/120973305},
doi = {10.1137/120973305},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImmorlicaKMSU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/ByersMZ12,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
title = {The daily deals marketplace: empirical observations and managerial
implications},
journal = {SIGecom Exch.},
volume = {11},
number = {2},
pages = {29--31},
year = {2012},
url = {https://doi.org/10.1145/2509002.2509009},
doi = {10.1145/2509002.2509009},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigecom/ByersMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/ThalerMS12,
author = {Justin Thaler and
Michael Mitzenmacher and
Thomas Steinke},
editor = {David A. Bader and
Petra Mutzel},
title = {Hierarchical Heavy Hitters with the Space Saving Algorithm},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {160--174},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.16},
doi = {10.1137/1.9781611972924.16},
timestamp = {Sun, 14 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/ThalerMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/MitzenmacherT12,
author = {Michael Mitzenmacher and
Justin Thaler},
title = {Peeling arguments and double hashing},
booktitle = {50th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2012, Allerton Park {\&} Retreat Center, Monticello,
IL, USA, October 1-5, 2012},
pages = {1118--1125},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/Allerton.2012.6483344},
doi = {10.1109/ALLERTON.2012.6483344},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/allerton/MitzenmacherT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/MitzenmacherV12,
author = {Michael Mitzenmacher and
George Varghese},
title = {The complexity of object reconciliation, and open problems related
to set difference and coding},
booktitle = {50th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2012, Allerton Park {\&} Retreat Center, Monticello,
IL, USA, October 1-5, 2012},
pages = {1126--1132},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/Allerton.2012.6483345},
doi = {10.1109/ALLERTON.2012.6483345},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/allerton/MitzenmacherV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/codaspy/GoodrichMOT12,
author = {Michael T. Goodrich and
Michael Mitzenmacher and
Olga Ohrimenko and
Roberto Tamassia},
editor = {Elisa Bertino and
Ravi S. Sandhu},
title = {Practical oblivious storage},
booktitle = {Second {ACM} Conference on Data and Application Security and Privacy,
{CODASPY} 2012, San Antonio, TX, USA, February 7-9, 2012},
pages = {13--24},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2133601.2133604},
doi = {10.1145/2133601.2133604},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/codaspy/GoodrichMOT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hotcloud/ThalerRMP12,
author = {Justin Thaler and
Mike Roberts and
Michael Mitzenmacher and
Hanspeter Pfister},
editor = {Rodrigo Fonseca and
David A. Maltz},
title = {Verifiable Computation with Massively Parallel Interactive Proofs},
booktitle = {4th {USENIX} Workshop on Hot Topics in Cloud Computing, HotCloud'12,
Boston, MA, USA, June 12-13, 2012},
publisher = {{USENIX} Association},
year = {2012},
url = {https://www.usenix.org/conference/hotcloud12/workshop-program/presentation/thaler},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hotcloud/ThalerRMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoodrichM12,
author = {Michael T. Goodrich and
Michael Mitzenmacher},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Anonymous Card Shuffling and Its Applications to Parallel Mixnets},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7392},
pages = {549--560},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31585-5\_49},
doi = {10.1007/978-3-642-31585-5\_49},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoodrichM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CormodeMT12,
author = {Graham Cormode and
Michael Mitzenmacher and
Justin Thaler},
editor = {Shafi Goldwasser},
title = {Practical verified computation with streaming interactive proofs},
booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
January 8-10, 2012},
pages = {90--112},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2090236.2090245},
doi = {10.1145/2090236.2090245},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/CormodeMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/MitzenmacherV12,
author = {Michael Mitzenmacher and
George Varghese},
title = {Biff (Bloom filter) codes: Fast error correction for large data sets},
booktitle = {Proceedings of the 2012 {IEEE} International Symposium on Information
Theory, {ISIT} 2012, Cambridge, MA, USA, July 1-6, 2012},
pages = {483--487},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/ISIT.2012.6284236},
doi = {10.1109/ISIT.2012.6284236},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/MitzenmacherV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/IvanMTY12,
author = {Ioana Ivan and
Michael Mitzenmacher and
Justin Thaler and
Henry S. Yuen},
title = {Continuous time channels with interference},
booktitle = {Proceedings of the 2012 {IEEE} International Symposium on Information
Theory, {ISIT} 2012, Cambridge, MA, USA, July 1-6, 2012},
pages = {860--864},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/ISIT.2012.6284683},
doi = {10.1109/ISIT.2012.6284683},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/IvanMTY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/medalg/GoodrichHMT12,
author = {Michael T. Goodrich and
Daniel S. Hirschberg and
Michael Mitzenmacher and
Justin Thaler},
editor = {Guy Even and
Dror Rawitz},
title = {Cache-Oblivious Dictionaries and Multimaps with Negligible Failure
Probability},
booktitle = {Design and Analysis of Algorithms - First Mediterranean Conference
on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5,
2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7659},
pages = {203--218},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34862-4\_15},
doi = {10.1007/978-3-642-34862-4\_15},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/medalg/GoodrichHMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/ByersMZ12,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
editor = {Boi Faltings and
Kevin Leyton{-}Brown and
Panos Ipeirotis},
title = {The groupon effect on yelp ratings: a root cause analysis},
booktitle = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC}
2012, Valencia, Spain, June 4-8, 2012},
pages = {248--265},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2229012.2229034},
doi = {10.1145/2229012.2229034},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/ByersMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoodrichMOT12,
author = {Michael T. Goodrich and
Michael Mitzenmacher and
Olga Ohrimenko and
Roberto Tamassia},
editor = {Yuval Rabani},
title = {Privacy-preserving group data access via stateless oblivious {RAM}
simulation},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {157--167},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.14},
doi = {10.1137/1.9781611973099.14},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GoodrichMOT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LamLMSW12,
author = {Henry Lam and
Zhenming Liu and
Michael Mitzenmacher and
Xiaorui Sun and
Yajun Wang},
editor = {Yuval Rabani},
title = {Information dissemination via random walks in \emph{d}-dimensional
space},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1612--1622},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.128},
doi = {10.1137/1.9781611973099.128},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/LamLMSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChungLLM12,
author = {Kai{-}Min Chung and
Henry Lam and
Zhenming Liu and
Michael Mitzenmacher},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {124--135},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.124},
doi = {10.4230/LIPICS.STACS.2012.124},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChungLLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/FeigenbaumMZ12,
author = {Joan Feigenbaum and
Michael Mitzenmacher and
Georgios Zervas},
editor = {Paul W. Goldberg},
title = {An Economic Analysis of User-Privacy Options in Ad-Supported Services},
booktitle = {Internet and Network Economics - 8th International Workshop, {WINE}
2012, Liverpool, UK, December 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7695},
pages = {30--43},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35311-6\_3},
doi = {10.1007/978-3-642-35311-6\_3},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/wine/FeigenbaumMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/ByersMZ12,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
editor = {Eytan Adar and
Jaime Teevan and
Eugene Agichtein and
Yoelle Maarek},
title = {Daily deals: prediction, social diffusion, and reputational ramifications},
booktitle = {Proceedings of the Fifth International Conference on Web Search and
Web Data Mining, {WSDM} 2012, Seattle, WA, USA, February 8-12, 2012},
pages = {543--552},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2124295.2124361},
doi = {10.1145/2124295.2124361},
timestamp = {Tue, 21 May 2019 11:38:33 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/ByersMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-6117,
author = {Ioana Ivan and
Michael Mitzenmacher and
Justin Thaler and
Henry S. Yuen},
title = {Continuous Time Channels with Interference},
journal = {CoRR},
volume = {abs/1201.6117},
year = {2012},
url = {http://arxiv.org/abs/1201.6117},
eprinttype = {arXiv},
eprint = {1201.6117},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-6117.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-1350,
author = {Justin Thaler and
Mike Roberts and
Michael Mitzenmacher and
Hanspeter Pfister},
title = {Verifiable Computation with Massively Parallel Interactive Proofs},
journal = {CoRR},
volume = {abs/1202.1350},
year = {2012},
url = {http://arxiv.org/abs/1202.1350},
eprinttype = {arXiv},
eprint = {1202.1350},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-1350.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2369,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
title = {The Groupon Effect on Yelp Ratings: {A} Root Cause Analysis},
journal = {CoRR},
volume = {abs/1202.2369},
year = {2012},
url = {http://arxiv.org/abs/1202.2369},
eprinttype = {arXiv},
eprint = {1202.2369},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2369.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-1579,
author = {Michael T. Goodrich and
Michael Mitzenmacher},
title = {Anonymous Card Shuffling and its Applications to Parallel Mixnets},
journal = {CoRR},
volume = {abs/1205.1579},
year = {2012},
url = {http://arxiv.org/abs/1205.1579},
eprinttype = {arXiv},
eprint = {1205.1579},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-1579.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-0383,
author = {Joan Feigenbaum and
Michael Mitzenmacher and
Georgios Zervas},
title = {An Economic Analysis of User-Privacy Options in Ad-Supported Services},
journal = {CoRR},
volume = {abs/1208.0383},
year = {2012},
url = {http://arxiv.org/abs/1208.0383},
eprinttype = {arXiv},
eprint = {1208.0383},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-0383.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-0798,
author = {Michael Mitzenmacher and
George Varghese},
title = {Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets},
journal = {CoRR},
volume = {abs/1208.0798},
year = {2012},
url = {http://arxiv.org/abs/1208.0798},
eprinttype = {arXiv},
eprint = {1208.0798},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-0798.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-5360,
author = {Michael Mitzenmacher},
title = {Balanced Allocations and Double Hashing},
journal = {CoRR},
volume = {abs/1209.5360},
year = {2012},
url = {http://arxiv.org/abs/1209.5360},
eprinttype = {arXiv},
eprint = {1209.5360},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-5360.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/IliofotouKFMPV11,
author = {Marios Iliofotou and
Hyunchul Kim and
Michalis Faloutsos and
Michael Mitzenmacher and
Prashanth Pappu and
George Varghese},
title = {Graption: {A} graph-based {P2P} traffic classification framework for
the internet backbone},
journal = {Comput. Networks},
volume = {55},
number = {8},
pages = {1909--1920},
year = {2011},
url = {https://doi.org/10.1016/j.comnet.2011.01.020},
doi = {10.1016/J.COMNET.2011.01.020},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/IliofotouKFMPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pieee/SundararajanSMJMB11,
author = {Jay Kumar Sundararajan and
Devavrat Shah and
Muriel M{\'{e}}dard and
Szymon Jakubczak and
Michael Mitzenmacher and
Jo{\~{a}}o Barros},
title = {Network Coding Meets {TCP:} Theory and Implementation},
journal = {Proc. {IEEE}},
volume = {99},
number = {3},
pages = {490--512},
year = {2011},
url = {https://doi.org/10.1109/JPROC.2010.2093850},
doi = {10.1109/JPROC.2010.2093850},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pieee/SundararajanSMJMB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeMM11,
author = {Alan M. Frieze and
P{\'{a}}ll Melsted and
Michael Mitzenmacher},
title = {An Analysis of Random-Walk Cuckoo Hashing},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {2},
pages = {291--308},
year = {2011},
url = {https://doi.org/10.1137/090770928},
doi = {10.1137/090770928},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FriezeMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/GoodrichM11,
author = {Michael T. Goodrich and
Michael Mitzenmacher},
title = {Invertible bloom lookup tables},
booktitle = {49th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2011, Allerton Park {\&} Retreat Center, Monticello,
IL, USA, 28-30 September, 2011},
pages = {792--799},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/Allerton.2011.6120248},
doi = {10.1109/ALLERTON.2011.6120248},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/allerton/GoodrichM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/ByersHMZ11,
author = {John W. Byers and
Brent Heeringa and
Michael Mitzenmacher and
Georgios Zervas},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Heapable Sequences and Subsequences},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {33--44},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.4},
doi = {10.1137/1.9781611973013.4},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/ByersHMZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/GoodrichMOT11,
author = {Michael T. Goodrich and
Michael Mitzenmacher and
Olga Ohrimenko and
Roberto Tamassia},
editor = {Christian Cachin and
Thomas Ristenpart},
title = {Oblivious {RAM} simulation with efficient worst-case access overhead},
booktitle = {Proceedings of the 3rd {ACM} Cloud Computing Security Workshop, {CCSW}
2011, Chicago, IL, USA, October 21, 2011},
pages = {95--100},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2046660.2046680},
doi = {10.1145/2046660.2046680},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ccs/GoodrichMOT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DietzfelbingerMR11,
author = {Martin Dietzfelbinger and
Michael Mitzenmacher and
Michael Rink},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Cuckoo Hashing with Pages},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {615--627},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_52},
doi = {10.1007/978-3-642-23719-5\_52},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DietzfelbingerMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoodrichM11,
author = {Michael T. Goodrich and
Michael Mitzenmacher},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Privacy-Preserving Access of Outsourced Data via Oblivious {RAM} Simulation},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
pages = {576--587},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8\_46},
doi = {10.1007/978-3-642-22012-8\_46},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoodrichM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AngelinoGMT11,
author = {Elaine Angelino and
Michael T. Goodrich and
Michael Mitzenmacher and
Justin Thaler},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {External-Memory Multimaps},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {384--394},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_40},
doi = {10.1007/978-3-642-25591-5\_40},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AngelinoGMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ita/KashMTU11,
author = {Ian A. Kash and
Michael Mitzenmacher and
Justin Thaler and
Jonathan R. Ullman},
title = {On the zero-error capacity threshold for deletion channels},
booktitle = {Information Theory and Applications Workshop, {ITA} 2011, San Diego,
California, USA, February 6-11, 2011},
pages = {285--289},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/ITA.2011.5743594},
doi = {10.1109/ITA.2011.5743594},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ita/KashMTU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GoodrichM11,
author = {Michael T. Goodrich and
Michael Mitzenmacher},
editor = {Rajmohan Rajaraman and
Friedhelm Meyer auf der Heide},
title = {Brief announcement: large-scale multimaps},
booktitle = {{SPAA} 2011: Proceedings of the 23rd Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-located with {FCRC} 2011)},
pages = {259--260},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1989493.1989532},
doi = {10.1145/1989493.1989532},
timestamp = {Wed, 21 Nov 2018 11:16:22 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GoodrichM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/voecking2011/Mitzenmacher11,
author = {Michael Mitzenmacher},
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Codes - Protecting Data Against Errors and Loss},
booktitle = {Algorithms Unplugged},
pages = {203--217},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-15328-0\_21},
doi = {10.1007/978-3-642-15328-0\_21},
timestamp = {Wed, 14 Jun 2017 20:29:01 +0200},
biburl = {https://dblp.org/rec/books/sp/voecking2011/Mitzenmacher11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-2245,
author = {Michael T. Goodrich and
Michael Mitzenmacher},
title = {Invertible Bloom Lookup Tables},
journal = {CoRR},
volume = {abs/1101.2245},
year = {2011},
url = {http://arxiv.org/abs/1101.2245},
eprinttype = {arXiv},
eprint = {1101.2245},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-2245.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-0040,
author = {Ian A. Kash and
Michael Mitzenmacher and
Justin Thaler and
Jonathan R. Ullman},
title = {On the Zero-Error Capacity Threshold for Deletion Channels},
journal = {CoRR},
volume = {abs/1102.0040},
year = {2011},
url = {http://arxiv.org/abs/1102.0040},
eprinttype = {arXiv},
eprint = {1102.0040},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-0040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5540,
author = {Michael Mitzenmacher and
Thomas Steinke and
Justin Thaler},
title = {Hierarchical Heavy Hitters with the Space Saving Algorithm},
journal = {CoRR},
volume = {abs/1102.5540},
year = {2011},
url = {http://arxiv.org/abs/1102.5540},
eprinttype = {arXiv},
eprint = {1102.5540},
timestamp = {Sun, 14 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-5540.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-5111,
author = {Martin Dietzfelbinger and
Michael Mitzenmacher and
Michael Rink},
title = {Cuckoo Hashing with Pages},
journal = {CoRR},
volume = {abs/1104.5111},
year = {2011},
url = {http://arxiv.org/abs/1104.5111},
eprinttype = {arXiv},
eprint = {1104.5111},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-5111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-5268,
author = {Henry Lam and
Zhenming Liu and
Michael Mitzenmacher and
Xiaorui Sun and
Yajun Wang},
title = {Information Dissemination via Random Walks in d-Dimensional Space},
journal = {CoRR},
volume = {abs/1104.5268},
year = {2011},
url = {http://arxiv.org/abs/1104.5268},
eprinttype = {arXiv},
eprint = {1104.5268},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-5268.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-5533,
author = {Elaine Angelino and
Michael T. Goodrich and
Michael Mitzenmacher and
Justin Thaler},
title = {External-Memory Multimaps},
journal = {CoRR},
volume = {abs/1104.5533},
year = {2011},
url = {http://arxiv.org/abs/1104.5533},
eprinttype = {arXiv},
eprint = {1104.5533},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-5533.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-0903,
author = {John W. Byers and
Michael Mitzenmacher and
Michalis Potamias and
Georgios Zervas},
title = {A Month in the Life of Groupon},
journal = {CoRR},
volume = {abs/1105.0903},
year = {2011},
url = {http://arxiv.org/abs/1105.0903},
eprinttype = {arXiv},
eprint = {1105.0903},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-0903.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2003,
author = {Graham Cormode and
Michael Mitzenmacher and
Justin Thaler},
title = {Practical Verified Computation with Streaming Interactive Proofs},
journal = {CoRR},
volume = {abs/1105.2003},
year = {2011},
url = {http://arxiv.org/abs/1105.2003},
eprinttype = {arXiv},
eprint = {1105.2003},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-4125,
author = {Michael T. Goodrich and
Michael Mitzenmacher and
Olga Ohrimenko and
Roberto Tamassia},
title = {Privacy-Preserving Group Data Access via Stateless Oblivious {RAM}
Simulation},
journal = {CoRR},
volume = {abs/1105.4125},
year = {2011},
url = {http://arxiv.org/abs/1105.4125},
eprinttype = {arXiv},
eprint = {1105.4125},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-4125.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-4378,
author = {Michael T. Goodrich and
Daniel S. Hirschberg and
Michael Mitzenmacher and
Justin Thaler},
title = {Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries
and Multimaps},
journal = {CoRR},
volume = {abs/1107.4378},
year = {2011},
url = {http://arxiv.org/abs/1107.4378},
eprinttype = {arXiv},
eprint = {1107.4378},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-4378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-5093,
author = {Michael T. Goodrich and
Michael Mitzenmacher and
Olga Ohrimenko and
Roberto Tamassia},
title = {Oblivious {RAM} Simulation with Efficient Worst-Case Access Overhead},
journal = {CoRR},
volume = {abs/1107.5093},
year = {2011},
url = {http://arxiv.org/abs/1107.5093},
eprinttype = {arXiv},
eprint = {1107.5093},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-5093.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1530,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
title = {Daily Deals: Prediction, Social Diffusion, and Reputational Ramifications},
journal = {CoRR},
volume = {abs/1109.1530},
year = {2011},
url = {http://arxiv.org/abs/1109.1530},
eprinttype = {arXiv},
eprint = {1109.1530},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-1530.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1851,
author = {Michael T. Goodrich and
Michael Mitzenmacher and
Olga Ohrimenko and
Roberto Tamassia},
title = {Oblivious Storage with Low {I/O} Overhead},
journal = {CoRR},
volume = {abs/1110.1851},
year = {2011},
url = {http://arxiv.org/abs/1110.1851},
eprinttype = {arXiv},
eprint = {1110.1851},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-1851.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CormodeMT11,
author = {Graham Cormode and
Michael Mitzenmacher and
Justin Thaler},
title = {Streaming Graph Computations with a Helpful Advisor},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-105}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/105},
eprinttype = {ECCC},
eprint = {TR11-105},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CormodeMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccr/FinucaneM10,
author = {Hilary K. Finucane and
Michael Mitzenmacher},
title = {An improved analysis of the lossy difference aggregator},
journal = {Comput. Commun. Rev.},
volume = {40},
number = {2},
pages = {4--11},
year = {2010},
url = {https://doi.org/10.1145/1764873.1764875},
doi = {10.1145/1764873.1764875},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ccr/FinucaneM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/crossroads/Mitzenmacher10,
author = {Michael Mitzenmacher},
title = {An introduction to human-guided search},
journal = {{XRDS}},
volume = {17},
number = {2},
pages = {34--35},
year = {2010},
url = {https://doi.org/10.1145/1869086.1869098},
doi = {10.1145/1869086.1869098},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/crossroads/Mitzenmacher10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/KlauLMM10,
author = {Gunnar W. Klau and
Neal Lesh and
Joe Marks and
Michael Mitzenmacher},
title = {Human-guided search},
journal = {J. Heuristics},
volume = {16},
number = {3},
pages = {289--310},
year = {2010},
url = {https://doi.org/10.1007/s10732-009-9107-5},
doi = {10.1007/S10732-009-9107-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/KlauLMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/LiuM10,
author = {Zhenming Liu and
Michael Mitzenmacher},
title = {Codes for deletion and insertion channels with segmented errors},
journal = {{IEEE} Trans. Inf. Theory},
volume = {56},
number = {1},
pages = {224--232},
year = {2010},
url = {https://doi.org/10.1109/TIT.2009.2034886},
doi = {10.1109/TIT.2009.2034886},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/LiuM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChierichettiFLM10,
author = {Flavio Chierichetti and
Hilary K. Finucane and
Zhenming Liu and
Michael Mitzenmacher},
title = {Designing floating codes for expected performance},
journal = {{IEEE} Trans. Inf. Theory},
volume = {56},
number = {3},
pages = {968--978},
year = {2010},
url = {https://doi.org/10.1109/TIT.2009.2039040},
doi = {10.1109/TIT.2009.2039040},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/ChierichettiFLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/KirschM10,
author = {Adam Kirsch and
Michael Mitzenmacher},
title = {The Power of One Move: Hashing Schemes for Hardware},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {18},
number = {6},
pages = {1752--1765},
year = {2010},
url = {https://doi.org/10.1109/TNET.2010.2047868},
doi = {10.1109/TNET.2010.2047868},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/KirschM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CormodeMT10,
author = {Graham Cormode and
Michael Mitzenmacher and
Justin Thaler},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Streaming Graph Computations with a Helpful Advisor},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {231--242},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_20},
doi = {10.1007/978-3-642-15775-2\_20},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/CormodeMT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DietzfelbingerGMMPR10,
author = {Martin Dietzfelbinger and
Andreas Goerdt and
Michael Mitzenmacher and
Andrea Montanari and
Rasmus Pagh and
Michael Rink},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Tight Thresholds for Cuckoo Hashing via {XORSAT}},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {213--225},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_19},
doi = {10.1007/978-3-642-14165-2\_19},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerGMMPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KalaiMS10,
author = {Adam Kalai and
Michael Mitzenmacher and
Madhu Sudan},
title = {Tight asymptotic bounds for the deletion channel with small deletion
probabilities},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2010,
June 13-18, 2010, Austin, Texas, USA, Proceedings},
pages = {997--1001},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/ISIT.2010.5513746},
doi = {10.1109/ISIT.2010.5513746},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/KalaiMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nsdi/LamMV10,
author = {Vinh The Lam and
Michael Mitzenmacher and
George Varghese},
title = {Carousel: Scalable Logging for Intrusion Prevention Systems},
booktitle = {Proceedings of the 7th {USENIX} Symposium on Networked Systems Design
and Implementation, {NSDI} 2010, April 28-30, 2010, San Jose, CA,
{USA}},
pages = {361--376},
publisher = {{USENIX} Association},
year = {2010},
url = {http://www.usenix.org/events/nsdi10/tech/full\_papers/lam.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nsdi/LamMV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/ByersMZ10,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
editor = {David C. Parkes and
Chrysanthos Dellarocas and
Moshe Tennenholtz},
title = {Information asymmetries in pay-per-bid auctions},
booktitle = {Proceedings 11th {ACM} Conference on Electronic Commerce (EC-2010),
Cambridge, Massachusetts, USA, June 7-11, 2010},
pages = {1--12},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1807342.1807344},
doi = {10.1145/1807342.1807344},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/ByersMZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BravermanCLMO10,
author = {Vladimir Braverman and
Kai{-}Min Chung and
Zhenming Liu and
Michael Mitzenmacher and
Rafail Ostrovsky},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {{AMS} Without 4-Wise Independence on Product Domains},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {119--130},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2449},
doi = {10.4230/LIPICS.STACS.2010.2449},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BravermanCLMO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uss/SchechterHM10,
author = {Stuart E. Schechter and
Cormac Herley and
Michael Mitzenmacher},
editor = {Wietse Z. Venema},
title = {Popularity Is Everything: {A} New Approach to Protecting Passwords
from Statistical-Guessing Attacks},
booktitle = {5th {USENIX} Workshop on Hot Topics in Security, HotSec'10, Washington,
D.C., USA, August 10, 2010},
publisher = {{USENIX} Association},
year = {2010},
url = {https://www.usenix.org/conference/hotsec10/popularity-everything-new-approach-protecting-passwords-statistical-guessing},
timestamp = {Mon, 01 Feb 2021 08:43:16 +0100},
biburl = {https://dblp.org/rec/conf/uss/SchechterHM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/ByersMZ10,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
editor = {Brian D. Davison and
Torsten Suel and
Nick Craswell and
Bing Liu},
title = {Adaptive weighing designs for keyword value computation},
booktitle = {Proceedings of the Third International Conference on Web Search and
Web Data Mining, {WSDM} 2010, New York, NY, USA, February 4-6, 2010},
pages = {331--340},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1718487.1718529},
doi = {10.1145/1718487.1718529},
timestamp = {Tue, 21 May 2019 11:38:33 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/ByersMZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/ccn/KirschMV10,
author = {Adam Kirsch and
Michael Mitzenmacher and
George Varghese},
editor = {Graham Cormode and
Marina Thottan},
title = {Hash-Based Techniques for High-Speed Packet Processing},
booktitle = {Algorithms for Next Generation Networks},
series = {Computer Communications and Networks},
pages = {181--218},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-1-84882-765-3\_9},
doi = {10.1007/978-1-84882-765-3\_9},
timestamp = {Wed, 29 May 2019 09:31:41 +0200},
biburl = {https://dblp.org/rec/series/ccn/KirschMV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0592,
author = {John W. Byers and
Michael Mitzenmacher and
Georgios Zervas},
title = {Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes
Bank},
journal = {CoRR},
volume = {abs/1001.0592},
year = {2010},
url = {http://arxiv.org/abs/1001.0592},
eprinttype = {arXiv},
eprint = {1001.0592},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-1104,
author = {Adam Kirsch and
Michael Mitzenmacher and
Andrea Pietracaprina and
Geppino Pucci and
Eli Upfal and
Fabio Vandin},
title = {An Efficient Rigorous Approach for Identifying Statistically Significant
Frequent Itemsets},
journal = {CoRR},
volume = {abs/1002.1104},
year = {2010},
url = {http://arxiv.org/abs/1002.1104},
eprinttype = {arXiv},
eprint = {1002.1104},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-1104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-2899,
author = {Graham Cormode and
Michael Mitzenmacher and
Justin Thaler},
title = {Streaming Graph Computations with a Helpful Advisor},
journal = {CoRR},
volume = {abs/1004.2899},
year = {2010},
url = {http://arxiv.org/abs/1004.2899},
eprinttype = {arXiv},
eprint = {1004.2899},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-2899.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1259,
author = {Michael T. Goodrich and
Michael Mitzenmacher},
title = {MapReduce Parallel Cuckoo Hashing and Oblivious {RAM} Simulations},
journal = {CoRR},
volume = {abs/1007.1259},
year = {2010},
url = {http://arxiv.org/abs/1007.1259},
eprinttype = {arXiv},
eprint = {1007.1259},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-2365,
author = {John W. Byers and
Brent Heeringa and
Michael Mitzenmacher and
Georgios Zervas},
title = {Heapable Sequences and Subsequences},
journal = {CoRR},
volume = {abs/1007.2365},
year = {2010},
url = {http://arxiv.org/abs/1007.2365},
eprinttype = {arXiv},
eprint = {1007.2365},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-2365.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BroderKKMUV09,
author = {Andrei Z. Broder and
Adam Kirsch and
Ravi Kumar and
Michael Mitzenmacher and
Eli Upfal and
Sergei Vassilvitskii},
title = {The Hiring Problem and Lake Wobegon Strategies},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {4},
pages = {1233--1255},
year = {2009},
url = {https://doi.org/10.1137/07070629X},
doi = {10.1137/07070629X},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BroderKKMUV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirschMW09,
author = {Adam Kirsch and
Michael Mitzenmacher and
Udi Wieder},
title = {More Robust Hashing: Cuckoo Hashing with a Stash},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {4},
pages = {1543--1561},
year = {2009},
url = {https://doi.org/10.1137/080728743},
doi = {10.1137/080728743},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KirschMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tog/AlcantaraSASMOA09,
author = {Dan A. Alcantara and
Andrei Sharf and
Fatemeh Abbasinejad and
Shubhabrata Sengupta and
Michael Mitzenmacher and
John D. Owens and
Nina Amenta},
title = {Real-time parallel hashing on the {GPU}},
journal = {{ACM} Trans. Graph.},
volume = {28},
number = {5},
pages = {154},
year = {2009},
url = {https://doi.org/10.1145/1618452.1618500},
doi = {10.1145/1618452.1618500},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tog/AlcantaraSASMOA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FriezeMM09,
author = {Alan M. Frieze and
P{\'{a}}ll Melsted and
Michael Mitzenmacher},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {An Analysis of Random-Walk Cuckoo Hashing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {490--503},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_37},
doi = {10.1007/978-3-642-03685-9\_37},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/FriezeMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/conext/IliofotouFM09,
author = {Marios Iliofotou and
Michalis Faloutsos and
Michael Mitzenmacher},
editor = {J{\"{o}}rg Liebeherr and
Giorgio Ventre and
Ernst W. Biersack and
Srinivasan Keshav},
title = {Exploiting dynamicity in graph-based traffic analysis: techniques
and applications},
booktitle = {Proceedings of the 2009 {ACM} Conference on Emerging Networking Experiments
and Technology, CoNEXT 2009, Rome, Italy, December 1-4, 2009},
pages = {241--252},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1658939.1658967},
doi = {10.1145/1658939.1658967},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/conext/IliofotouFM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Mitzenmacher09,
author = {Michael Mitzenmacher},
editor = {Amos Fiat and
Peter Sanders},
title = {Some Open Questions Related to Cuckoo Hashing},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {1--10},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_1},
doi = {10.1007/978-3-642-04128-0\_1},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Mitzenmacher09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/SundararajanSMMB09,
author = {Jay Kumar Sundararajan and
Devavrat Shah and
Muriel M{\'{e}}dard and
Michael Mitzenmacher and
Jo{\~{a}}o Barros},
title = {Network Coding Meets {TCP}},
booktitle = {{INFOCOM} 2009. 28th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
19-25 April 2009, Rio de Janeiro, Brazil},
pages = {280--288},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/INFCOM.2009.5061931},
doi = {10.1109/INFCOM.2009.5061931},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/SundararajanSMMB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/CorboJMP09,
author = {Jacomo Corbo and
Shaili Jain and
Michael Mitzenmacher and
David C. Parkes},
title = {An Economically-Principled Generative Model of {AS} Graph Connectivity},
booktitle = {{INFOCOM} 2009. 28th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
19-25 April 2009, Rio de Janeiro, Brazil},
pages = {2941--2945},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/INFCOM.2009.5062263},
doi = {10.1109/INFCOM.2009.5062263},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/CorboJMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/ChierichettiKLMPR09,
author = {Flavio Chierichetti and
Ravi Kumar and
Silvio Lattanzi and
Michael Mitzenmacher and
Alessandro Panconesi and
Prabhakar Raghavan},
editor = {John F. Elder IV and
Fran{\c{c}}oise Fogelman{-}Souli{\'{e}} and
Peter A. Flach and
Mohammed Javeed Zaki},
title = {On compressing social networks},
booktitle = {Proceedings of the 15th {ACM} {SIGKDD} International Conference on
Knowledge Discovery and Data Mining, Paris, France, June 28 - July
1, 2009},
pages = {219--228},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1557019.1557049},
doi = {10.1145/1557019.1557049},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kdd/ChierichettiKLMPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/KirschMPPUV09,
author = {Adam Kirsch and
Michael Mitzenmacher and
Andrea Pietracaprina and
Geppino Pucci and
Eli Upfal and
Fabio Vandin},
editor = {Jan Paredaens and
Jianwen Su},
title = {An efficient rigorous approach for identifying statistically significant
frequent itemsets},
booktitle = {Proceedings of the Twenty-Eigth {ACM} {SIGMOD-SIGACT-SIGART} Symposium
on Principles of Database Systems, {PODS} 2009, June 19 - July 1,
2009, Providence, Rhode Island, {USA}},
pages = {117--126},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1559795.1559814},
doi = {10.1145/1559795.1559814},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/KirschMPPUV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2009,
editor = {Michael Mitzenmacher},
title = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
publisher = {{ACM}},
year = {2009},
isbn = {978-1-60558-506-2},
timestamp = {Fri, 05 Jun 2009 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/db/Mitzenmacher09,
author = {Michael Mitzenmacher},
editor = {Ling Liu and
M. Tamer {\"{O}}zsu},
title = {Bloom Filters},
booktitle = {Encyclopedia of Database Systems},
pages = {252--255},
publisher = {Springer {US}},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-39940-9\_751},
doi = {10.1007/978-0-387-39940-9\_751},
timestamp = {Sun, 02 Jun 2019 21:10:27 +0200},
biburl = {https://dblp.org/rec/reference/db/Mitzenmacher09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-1564,
author = {Jay Kumar Sundararajan and
Szymon Jakubczak and
Muriel M{\'{e}}dard and
Michael Mitzenmacher and
Jo{\~{a}}o Barros},
title = {Interfacing network coding with {TCP:} an implementation},
journal = {CoRR},
volume = {abs/0908.1564},
year = {2009},
url = {http://arxiv.org/abs/0908.1564},
eprinttype = {arXiv},
eprint = {0908.1564},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-1564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-0287,
author = {Martin Dietzfelbinger and
Andreas Goerdt and
Michael Mitzenmacher and
Andrea Montanari and
Rasmus Pagh and
Michael Rink},
title = {Tight Thresholds for Cuckoo Hashing via {XORSAT}},
journal = {CoRR},
volume = {abs/0912.0287},
year = {2009},
url = {http://arxiv.org/abs/0912.0287},
eprinttype = {arXiv},
eprint = {0912.0287},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-0287.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KirschM08,
author = {Adam Kirsch and
Michael Mitzenmacher},
title = {Less hashing, same performance: Building a better Bloom filter},
journal = {Random Struct. Algorithms},
volume = {33},
number = {2},
pages = {187--218},
year = {2008},
url = {https://doi.org/10.1002/rsa.20208},
doi = {10.1002/RSA.20208},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KirschM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Mitzenmacher08,
author = {Michael Mitzenmacher},
title = {Capacity Bounds for Sticky Channels},
journal = {{IEEE} Trans. Inf. Theory},
volume = {54},
number = {1},
pages = {72--77},
year = {2008},
url = {https://doi.org/10.1109/TIT.2007.911291},
doi = {10.1109/TIT.2007.911291},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Mitzenmacher08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/KirschM08,
author = {Adam Kirsch and
Michael Mitzenmacher},
title = {Simple summaries for hashing with choices},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {16},
number = {1},
pages = {218--231},
year = {2008},
url = {http://doi.acm.org/10.1145/1373452.1373470},
doi = {10.1145/1373452.1373470},
timestamp = {Mon, 26 May 2008 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/KirschM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/KirschM08,
author = {Adam Kirsch and
Michael Mitzenmacher},
title = {On the performance of multiple choice hash tables with moves on deletes
and inserts},
booktitle = {46th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2008, Monticello, IL, USA, September 24-26, 2008},
pages = {1284--1290},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ALLERTON.2008.4797708},
doi = {10.1109/ALLERTON.2008.4797708},
timestamp = {Wed, 22 Nov 2023 08:29:09 +0100},
biburl = {https://dblp.org/rec/conf/allerton/KirschM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/FinucaneLM08,
author = {Hilary K. Finucane and
Zhenming Liu and
Michael Mitzenmacher},
title = {Designing floating codes for expected performance},
booktitle = {46th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2008, Monticello, IL, USA, September 24-26, 2008},
pages = {1389--1396},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ALLERTON.2008.4797723},
doi = {10.1109/ALLERTON.2008.4797723},
timestamp = {Wed, 22 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/allerton/FinucaneLM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KirschMW08,
author = {Adam Kirsch and
Michael Mitzenmacher and
Udi Wieder},
editor = {Dan Halperin and
Kurt Mehlhorn},
title = {More Robust Hashing: Cuckoo Hashing with a Stash},
booktitle = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
Germany, September 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5193},
pages = {611--622},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87744-8\_51},
doi = {10.1007/978-3-540-87744-8\_51},
timestamp = {Sun, 02 Jun 2019 21:14:36 +0200},
biburl = {https://dblp.org/rec/conf/esa/KirschMW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/KirschM08,
author = {Adam Kirsch and
Michael Mitzenmacher},
title = {The Power of One Move: Hashing Schemes for Hardware},
booktitle = {{INFOCOM} 2008. 27th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
13-18 April 2008, Phoenix, AZ, {USA}},
pages = {106--110},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/INFOCOM.2008.30},
doi = {10.1109/INFOCOM.2008.30},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/KirschM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/JohnsonMR08,
author = {Mark Johnson and
Michael Mitzenmacher and
Kannan Ramchandran},
editor = {Frank R. Kschischang and
En{-}Hui Yang},
title = {Distributed beamforming with binary signaling},
booktitle = {2008 {IEEE} International Symposium on Information Theory, {ISIT}
2008, Toronto, ON, Canada, July 6-11, 2008},
pages = {890--894},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ISIT.2008.4595115},
doi = {10.1109/ISIT.2008.4595115},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/JohnsonMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HolensteinMPW08,
author = {Thomas Holenstein and
Michael Mitzenmacher and
Rina Panigrahy and
Udi Wieder},
editor = {Shang{-}Hua Teng},
title = {Trace reconstruction with constant deletion probability and related
results},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {389--398},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347125},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/HolensteinMPW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MitzenmacherV08,
author = {Michael Mitzenmacher and
Salil P. Vadhan},
editor = {Shang{-}Hua Teng},
title = {Why simple hash functions work: exploiting the entropy in a data stream},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {746--755},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347164},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/MitzenmacherV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BroderKKMUV08,
author = {Andrei Z. Broder and
Adam Kirsch and
Ravi Kumar and
Michael Mitzenmacher and
Eli Upfal and
Sergei Vassilvitskii},
editor = {Shang{-}Hua Teng},
title = {The hiring problem and Lake Wobegon strategies},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1184--1193},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347211},
timestamp = {Mon, 12 Sep 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BroderKKMUV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Mitzenmacher08,
author = {Michael Mitzenmacher},
editor = {Joachim Gudmundsson},
title = {A Survey of Results for Deletion Channels and Related Synchronization
Channels},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {1--3},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_1},
doi = {10.1007/978-3-540-69903-3\_1},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Mitzenmacher08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-5022,
author = {Jay Kumar Sundararajan and
Devavrat Shah and
Muriel M{\'{e}}dard and
Michael Mitzenmacher and
Jo{\~{a}}o Barros},
title = {Network coding meets {TCP}},
journal = {CoRR},
volume = {abs/0809.5022},
year = {2008},
url = {http://arxiv.org/abs/0809.5022},
eprinttype = {arXiv},
eprint = {0809.5022},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-5022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/LumettaM07,
author = {Steven S. Lumetta and
Michael Mitzenmacher},
title = {Using the Power of Two Choices to Improve Bloom Filters},
journal = {Internet Math.},
volume = {4},
number = {1},
pages = {17--33},
year = {2007},
url = {https://doi.org/10.1080/15427951.2007.10129136},
doi = {10.1080/15427951.2007.10129136},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/LumettaM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/DrineaM07,
author = {Eleni Drinea and
Michael Mitzenmacher},
title = {Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication
Channels},
journal = {{IEEE} Trans. Inf. Theory},
volume = {53},
number = {8},
pages = {2693--2714},
year = {2007},
url = {https://doi.org/10.1109/TIT.2007.901221},
doi = {10.1109/TIT.2007.901221},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/DrineaM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icnp/KumarTCM07,
author = {Sailesh Kumar and
Jonathan S. Turner and
Patrick Crowley and
Michael Mitzenmacher},
title = {{HEXA:} Compact Data Structures for Faster Packet Processing},
booktitle = {Proceedings of the {IEEE} International Conference on Network Protocols,
{ICNP} 2007, October 16-19, 2007, Beijing, China},
pages = {246--255},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/ICNP.2007.4375855},
doi = {10.1109/ICNP.2007.4375855},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icnp/KumarTCM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imc/IliofotouPFMSV07,
author = {Marios Iliofotou and
Prashanth Pappu and
Michalis Faloutsos and
Michael Mitzenmacher and
Sumeet Singh and
George Varghese},
editor = {Constantine Dovrolis and
Matthew Roughan},
title = {Network monitoring using traffic dispersion graphs (tdgs)},
booktitle = {Proceedings of the 7th {ACM} {SIGCOMM} Internet Measurement Conference,
{IMC} 2007, San Diego, California, USA, October 24-26, 2007},
pages = {315--320},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1298306.1298349},
doi = {10.1145/1298306.1298349},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/imc/IliofotouPFMSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iptps/LedlieMSP07,
author = {Jonathan Ledlie and
Michael Mitzenmacher and
Margo I. Seltzer and
Peter R. Pietzuch},
editor = {John R. Douceur and
Roger Wattenhofer},
title = {Wired Geometric Routing},
booktitle = {6th International workshop on Peer-To-Peer Systems, {IPTPS} 2007,
Bellevue, WA, USA, February 26-27, 2007},
year = {2007},
url = {http://www.iptps.org/papers-2007/LedliePietzuch.pdf},
timestamp = {Thu, 14 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iptps/LedlieMSP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/LiuM07,
author = {Zhenming Liu and
Michael Mitzenmacher},
title = {Codes for Deletion and Insertion Channels with Segmented Errors},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007,
Nice, France, June 24-29, 2007},
pages = {846--850},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/ISIT.2007.4557330},
doi = {10.1109/ISIT.2007.4557330},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/LiuM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/DiggaviMP07,
author = {Suhas N. Diggavi and
Michael Mitzenmacher and
Henry D. Pfister},
title = {Capacity Upper Bounds for the Deletion Channel},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007,
Nice, France, June 24-29, 2007},
pages = {1716--1720},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/ISIT.2007.4557469},
doi = {10.1109/ISIT.2007.4557469},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/DiggaviMP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeshM06,
author = {Neal Lesh and
Michael Mitzenmacher},
title = {BubbleSearch: {A} simple heuristic for improving priority-based greedy
algorithms},
journal = {Inf. Process. Lett.},
volume = {97},
number = {4},
pages = {161--169},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.08.013},
doi = {10.1016/J.IPL.2005.08.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeshM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/FeigenbaumM06,
author = {Joan Feigenbaum and
Michael Mitzenmacher},
title = {Towards a theory of networked computation},
journal = {{SIGACT} News},
volume = {37},
number = {4},
pages = {22--26},
year = {2006},
url = {https://doi.org/10.1145/1189056.1189059},
doi = {10.1145/1189056.1189059},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/FeigenbaumM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/DrineaM06,
author = {Eleni Drinea and
Michael Mitzenmacher},
title = {On Lower Bounds for the Capacity of Deletion Channels},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {10},
pages = {4648--4657},
year = {2006},
url = {https://doi.org/10.1109/TIT.2006.881832},
doi = {10.1109/TIT.2006.881832},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/DrineaM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/MitzenmacherD06,
author = {Michael Mitzenmacher and
Eleni Drinea},
title = {A Simple Lower Bound for the Capacity of the Deletion Channel},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {10},
pages = {4657--4660},
year = {2006},
url = {https://doi.org/10.1109/TIT.2006.881844},
doi = {10.1109/TIT.2006.881844},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/MitzenmacherD06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Mitzenmacher06,
author = {Michael Mitzenmacher},
title = {Polynomial Time Low-Density Parity-Check Codes With Rates Very Close
to the Capacity of the q-ary Random Deletion Channel for Large q},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {12},
pages = {5496--5501},
year = {2006},
url = {https://doi.org/10.1109/TIT.2006.885443},
doi = {10.1109/TIT.2006.885443},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Mitzenmacher06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/ByersKLM06,
author = {John W. Byers and
Gu{-}In Kwon and
Michael Luby and
Michael Mitzenmacher},
title = {Fine-grained layered multicast with {STAIR}},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {14},
number = {1},
pages = {81--93},
year = {2006},
url = {http://doi.acm.org/10.1145/1133553.1133560},
doi = {10.1145/1133553.1133560},
timestamp = {Tue, 22 Aug 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/ByersKLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/KirschM06,
author = {Adam Kirsch and
Michael Mitzenmacher},
editor = {Rajeev Raman and
Matthias F. Stallmann},
title = {Distance-Sensitive Bloom Filters},
booktitle = {Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments,
{ALENEX} 2006, Miami, Florida, USA, January 21, 2006},
pages = {41--50},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972863.4},
doi = {10.1137/1.9781611972863.4},
timestamp = {Fri, 19 May 2017 01:26:03 +0200},
biburl = {https://dblp.org/rec/conf/alenex/KirschM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher06,
author = {Michael Mitzenmacher},
editor = {Daniel Panario and
Robert Sedgewick},
title = {New Results and Open Problems for Deletion Channels},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {222},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.5},
doi = {10.1137/1.9781611972962.5},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KirschM06,
author = {Adam Kirsch and
Michael Mitzenmacher},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Less Hashing, Same Performance: Building a Better Bloom Filter},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {456--467},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_42},
doi = {10.1007/11841036\_42},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KirschM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/NikolovaKBM06,
author = {Evdokia Nikolova and
Jonathan A. Kelner and
Matthew Brand and
Michael Mitzenmacher},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Stochastic Shortest Paths Via Quasi-convex Maximization},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {552--563},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_50},
doi = {10.1007/11841036\_50},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/NikolovaKBM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BonomiMPSV06,
author = {Flavio Bonomi and
Michael Mitzenmacher and
Rina Panigrahy and
Sushil Singh and
George Varghese},
editor = {Yossi Azar and
Thomas Erlebach},
title = {An Improved Construction for Counting Bloom Filters},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {684--695},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_61},
doi = {10.1007/11841036\_61},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/BonomiMPSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcsw/PietzuchLMS06,
author = {Peter R. Pietzuch and
Jonathan Ledlie and
Michael Mitzenmacher and
Margo I. Seltzer},
title = {Network-Aware Overlays with Network Coordinates},
booktitle = {26th International Conference on Distributed Computing Systems Workshops
{(ICDCS} 2006 Workshops), 4-7 July 2006, Lisboa, Portugal},
pages = {12},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/ICDCSW.2006.76},
doi = {10.1109/ICDCSW.2006.76},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcsw/PietzuchLMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/Mitzenmacher06,
author = {Michael Mitzenmacher},
title = {On the Theory and Practice of Data Recovery with Multiple Versions},
booktitle = {Proceedings 2006 {IEEE} International Symposium on Information Theory,
{ISIT} 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14,
2006},
pages = {982--986},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/ISIT.2006.261874},
doi = {10.1109/ISIT.2006.261874},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/Mitzenmacher06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/BonomiMPSV06,
author = {Flavio Bonomi and
Michael Mitzenmacher and
Rina Panigrahy and
Sushil Singh and
George Varghese},
editor = {Luigi Rizzo and
Thomas E. Anderson and
Nick McKeown},
title = {Beyond bloom filters: from approximate membership checks to approximate
state machines},
booktitle = {Proceedings of the {ACM} {SIGCOMM} 2006 Conference on Applications,
Technologies, Architectures, and Protocols for Computer Communications,
Pisa, Italy, September 11-15, 2006},
pages = {315--326},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1159913.1159950},
doi = {10.1145/1159913.1159950},
timestamp = {Wed, 21 Jul 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/BonomiMPSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0012859,
author = {Michael Mitzenmacher and
Eli Upfal},
title = {Probability and Computing: Randomized Algorithms and Probabilistic
Analysis},
publisher = {Cambridge University Press},
year = {2005},
url = {https://doi.org/10.1017/CBO9780511813603},
doi = {10.1017/CBO9780511813603},
isbn = {978-0-521-83540-4},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0012859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dt/MitraLMP05,
author = {Subhasish Mitra and
Steven S. Lumetta and
Michael Mitzenmacher and
Nishant Patil},
title = {X-Tolerant Test Response Compaction},
journal = {{IEEE} Des. Test Comput.},
volume = {22},
number = {6},
pages = {566--574},
year = {2005},
url = {https://doi.org/10.1109/MDT.2005.154},
doi = {10.1109/MDT.2005.154},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dt/MitraLMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/Mitzenmacher05,
author = {Michael Mitzenmacher},
title = {Editorial: The Future of Power Law Research},
journal = {Internet Math.},
volume = {2},
number = {4},
pages = {525--534},
year = {2005},
url = {https://doi.org/10.1080/15427951.2005.10129112},
doi = {10.1080/15427951.2005.10129112},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/Mitzenmacher05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LeshMMM05,
author = {Neal Lesh and
Joe Marks and
A. McMahon and
Michael Mitzenmacher},
title = {New heuristic and interactive approaches to 2D rectangular strip packing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1083322},
doi = {10.1145/1064546.1083322},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LeshMMM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/LubyM05,
author = {Michael Luby and
Michael Mitzenmacher},
title = {Verification-based decoding for packet-based low-density parity-check
codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {51},
number = {1},
pages = {120--127},
year = {2005},
url = {https://doi.org/10.1109/TIT.2004.839499},
doi = {10.1109/TIT.2004.839499},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/LubyM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acns/ChangM05,
author = {Yan{-}Cheng Chang and
Michael Mitzenmacher},
editor = {John Ioannidis and
Angelos D. Keromytis and
Moti Yung},
title = {Privacy Preserving Keyword Searches on Remote Encrypted Data},
booktitle = {Applied Cryptography and Network Security, Third International Conference,
{ACNS} 2005, New York, NY, USA, June 7-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3531},
pages = {442--455},
year = {2005},
url = {https://doi.org/10.1007/11496137\_30},
doi = {10.1007/11496137\_30},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acns/ChangM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aia/ChimaniLMST05,
author = {Markus Chimani and
Neal Lesh and
Michael Mitzenmacher and
Candy L. Sidner and
Hidetoshi Tanaka},
editor = {M. H. Hamza},
title = {A Case Study in Large-Scale Interactive Optimization},
booktitle = {{IASTED} International Conference on Artificial Intelligence and Applications,
part of the 23rd Multi-Conference on Applied Informatics, Innsbruck,
Austria, February 14-16, 2005},
pages = {24--29},
publisher = {{IASTED/ACTA} Press},
year = {2005},
timestamp = {Mon, 28 May 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aia/ChimaniLMST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/ChengM05,
author = {Jimming Cheng and
Michael Mitzenmacher},
title = {The Markov Expert for Finding Episodes in Time Series},
booktitle = {2005 Data Compression Conference {(DCC} 2005), 29-31 March 2005, Snowbird,
UT, {USA}},
pages = {454},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/DCC.2005.86},
doi = {10.1109/DCC.2005.86},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/ChengM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BroderM05,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
title = {Multidimensional balanced allocations},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {195--196},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070460},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BroderM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Mitzenmacher05,
author = {Michael Mitzenmacher},
editor = {Pierre Fraigniaud},
title = {Digital Fountains and Their Application to Informed Content Delivery
over Adaptive Overlay Networks},
booktitle = {Distributed Computing, 19th International Conference, {DISC} 2005,
Cracow, Poland, September 26-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3724},
pages = {1},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561927\_1},
doi = {10.1007/11561927\_1},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/Mitzenmacher05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/MitzenmacherOS04,
author = {Michael Mitzenmacher and
Roberto Imbuzeiro Oliveira and
Joel H. Spencer},
title = {A Scaling Result for Explosive Processes},
journal = {Electron. J. Comb.},
volume = {11},
number = {1},
year = {2004},
url = {https://doi.org/10.37236/1784},
doi = {10.37236/1784},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/MitzenmacherOS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeshMMM04,
author = {Neal Lesh and
Joe Marks and
A. McMahon and
Michael Mitzenmacher},
title = {Exhaustive approaches to 2D rectangular perfect packings},
journal = {Inf. Process. Lett.},
volume = {90},
number = {1},
pages = {7--14},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.01.006},
doi = {10.1016/J.IPL.2004.01.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeshMMM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TorreMRV04,
author = {Pilar de la Torre and
Michael Mitzenmacher and
Rajmohan Rajaraman and
Berthold V{\"{o}}cking},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {321},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-3500-0},
doi = {10.1007/S00224-004-3500-0},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/TorreMRV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ConradM04,
author = {Brian Conrad and
Michael Mitzenmacher},
title = {Power laws for monkeys typing randomly: the case of unequal probabilities},
journal = {{IEEE} Trans. Inf. Theory},
volume = {50},
number = {7},
pages = {1403--1414},
year = {2004},
url = {https://doi.org/10.1109/TIT.2004.830752},
doi = {10.1109/TIT.2004.830752},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ConradM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Mitzenmacher04,
author = {Michael Mitzenmacher},
title = {On the hardness of finding optimal multiple preset dictionaries},
journal = {{IEEE} Trans. Inf. Theory},
volume = {50},
number = {7},
pages = {1536--1539},
year = {2004},
url = {https://doi.org/10.1109/TIT.2004.830778},
doi = {10.1109/TIT.2004.830778},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Mitzenmacher04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/ByersCMR04,
author = {John W. Byers and
Jeffrey Considine and
Michael Mitzenmacher and
Stanislav Rost},
title = {Informed content delivery across adaptive overlay networks},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {12},
number = {5},
pages = {767--780},
year = {2004},
url = {https://doi.org/10.1109/TNET.2004.836103},
doi = {10.1109/TNET.2004.836103},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/ByersCMR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/avi/LeshM04,
author = {Neal Lesh and
Michael Mitzenmacher},
editor = {Maria Francesca Costabile},
title = {Interactive data summarization: an example application},
booktitle = {Proceedings of the working conference on Advanced visual interfaces,
{AVI} 2004, Gallipoli, Italy, May 25-28, 2004},
pages = {183--187},
publisher = {{ACM} Press},
year = {2004},
url = {https://doi.org/10.1145/989863.989892},
doi = {10.1145/989863.989892},
timestamp = {Tue, 06 Nov 2018 16:58:13 +0100},
biburl = {https://dblp.org/rec/conf/avi/LeshM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/DrineaM04,
author = {Eleni Drinea and
Michael Mitzenmacher},
title = {On lower bounds for the capacity of deletion channels},
booktitle = {Proceedings of the 2004 {IEEE} International Symposium on Information
Theory, {ISIT} 2004, Chicago Downtown Marriott, Chicago, Illinois,
USA, June 27 - July 2, 2004},
pages = {227},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ISIT.2004.1365265},
doi = {10.1109/ISIT.2004.1365265},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/DrineaM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itc/MitraLM04,
author = {Subhasish Mitra and
Steven S. Lumetta and
Michael Mitzenmacher},
title = {X-Tolerant Signature Analysis},
booktitle = {Proceedings 2004 International Test Conference {(ITC} 2004), October
26-28, 2004, Charlotte, NC, {USA}},
pages = {432--441},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/TEST.2004.1386979},
doi = {10.1109/TEST.2004.1386979},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/itc/MitraLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/Mitzenmacher04,
author = {Michael Mitzenmacher},
title = {Digital fountains: a survey and look forward},
booktitle = {2004 {IEEE} Information Theory Workshop, San Antonio, TX, USA, 24-29
October, 2004},
pages = {271--276},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ITW.2004.1405313},
doi = {10.1109/ITW.2004.1405313},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/itw/Mitzenmacher04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ByersCM04,
author = {John W. Byers and
Jeffrey Considine and
Michael Mitzenmacher},
editor = {Phillip B. Gibbons and
Micah Adler},
title = {Geometric generalizations of the power of two choices},
booktitle = {{SPAA} 2004: Proceedings of the Sixteenth Annual {ACM} Symposium on
Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona,
Spain},
pages = {54--63},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007912.1007921},
doi = {10.1145/1007912.1007921},
timestamp = {Wed, 21 Nov 2018 11:11:51 +0100},
biburl = {https://dblp.org/rec/conf/spaa/ByersCM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ChangM04,
author = {Yan{-}Cheng Chang and
Michael Mitzenmacher},
title = {Privacy Preserving Keyword Searches on Remote Encrypted Data},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {51},
year = {2004},
url = {http://eprint.iacr.org/2004/051},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ChangM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/Mitzenmacher03,
author = {Michael Mitzenmacher},
title = {A Brief History of Generative Models for Power Law and Lognormal Distributions},
journal = {Internet Math.},
volume = {1},
number = {2},
pages = {226--251},
year = {2003},
url = {https://doi.org/10.1080/15427951.2004.10129088},
doi = {10.1080/15427951.2004.10129088},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/Mitzenmacher03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/Mitzenmacher03a,
author = {Michael Mitzenmacher},
title = {Dynamic Models for File Sizes and Double Pareto Distributions},
journal = {Internet Math.},
volume = {1},
number = {3},
pages = {305--333},
year = {2003},
url = {https://doi.org/10.1080/15427951.2004.10129092},
doi = {10.1080/15427951.2004.10129092},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/Mitzenmacher03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/BroderM03,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
title = {Survey: Network Applications of Bloom Filters: {A} Survey},
journal = {Internet Math.},
volume = {1},
number = {4},
pages = {485--509},
year = {2003},
url = {https://doi.org/10.1080/15427951.2004.10129096},
doi = {10.1080/15427951.2004.10129096},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/BroderM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroderCM03,
author = {Andrei Z. Broder and
Moses Charikar and
Michael Mitzenmacher},
title = {A derandomization using min-wise independent permutations},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {11--20},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00003-0},
doi = {10.1016/S1570-8667(03)00003-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BroderCM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KavcicMM03,
author = {Aleksandar Kavcic and
Xiao Ma and
Michael Mitzenmacher},
title = {Binary intersymbol interference channels: Gallager codes, density
evolution, and code performance bounds},
journal = {{IEEE} Trans. Inf. Theory},
volume = {49},
number = {7},
pages = {1636--1652},
year = {2003},
url = {https://doi.org/10.1109/TIT.2003.813563},
doi = {10.1109/TIT.2003.813563},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/KavcicMM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/BehrFMX03,
author = {Frederic H. Behr and
Victoria Fossum and
Michael Mitzenmacher and
David Xiao},
title = {Estimating and Comparing Entropies Across Written Natural Languages
Using {PPM} Compression},
booktitle = {2003 Data Compression Conference {(DCC} 2003), 25-27 March 2003, Snowbird,
UT, {USA}},
pages = {416},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/DCC.2003.1194035},
doi = {10.1109/DCC.2003.1194035},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/BehrFMX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iptps/ByersCM03,
author = {John W. Byers and
Jeffrey Considine and
Michael Mitzenmacher},
editor = {M. Frans Kaashoek and
Ion Stoica},
title = {Simple Load Balancing for Distributed Hash Tables},
booktitle = {Peer-to-Peer Systems II, Second International Workshop, {IPTPS} 2003,
Berkeley, CA, USA, February 21-22,2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2735},
pages = {80--87},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45172-3\_7},
doi = {10.1007/978-3-540-45172-3\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iptps/ByersCM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/LeshMW03,
author = {Neal Lesh and
Michael Mitzenmacher and
Sue Whitesides},
editor = {Martin Vingron and
Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman and
Webb Miller},
title = {A complete and effective move set for simplified protein folding},
booktitle = {Proceedings of the Sventh Annual International Conference on Computational
Biology, {RECOMB} 2003, Berlin, Germany, April 10-13, 2003},
pages = {188--195},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/640075.640099},
doi = {10.1145/640075.640099},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/LeshMW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/ByersLM02,
author = {John W. Byers and
Michael Luby and
Michael Mitzenmacher},
title = {A digital fountain approach to asynchronous reliable multicast},
journal = {{IEEE} J. Sel. Areas Commun.},
volume = {20},
number = {8},
pages = {1528--1540},
year = {2002},
url = {https://doi.org/10.1109/JSAC.2002.803996},
doi = {10.1109/JSAC.2002.803996},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsac/ByersLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/ByersHLMS02,
author = {John W. Byers and
Gavin B. Horn and
Michael Luby and
Michael Mitzenmacher and
William Shaver},
title = {{FLID-DL:} congestion control for layered multicast},
journal = {{IEEE} J. Sel. Areas Commun.},
volume = {20},
number = {8},
pages = {1558--1570},
year = {2002},
url = {https://doi.org/10.1109/JSAC.2002.803998},
doi = {10.1109/JSAC.2002.803998},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsac/ByersHLMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KenyonM02,
author = {Claire Kenyon and
Michael Mitzenmacher},
title = {Linear waste of best fit bin packing on skewed distributions},
journal = {Random Struct. Algorithms},
volume = {20},
number = {3},
pages = {441--464},
year = {2002},
url = {https://doi.org/10.1002/rsa.10037},
doi = {10.1002/RSA.10037},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KenyonM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/Mitzenmacher02,
author = {Michael Mitzenmacher},
title = {Compressed bloom filters},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {10},
number = {5},
pages = {604--612},
year = {2002},
url = {https://doi.org/10.1109/TNET.2002.803864},
doi = {10.1109/TNET.2002.803864},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/Mitzenmacher02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/KlauLMM02,
author = {Gunnar W. Klau and
Neal Lesh and
Joe Marks and
Michael Mitzenmacher},
editor = {Rina Dechter and
Michael J. Kearns and
Richard S. Sutton},
title = {Human-Guided Tabu Search},
booktitle = {Proceedings of the Eighteenth National Conference on Artificial Intelligence
and Fourteenth Conference on Innovative Applications of Artificial
Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada},
pages = {41--47},
publisher = {{AAAI} Press / The {MIT} Press},
year = {2002},
url = {http://www.aaai.org/Library/AAAI/2002/aaai02-007.php},
timestamp = {Tue, 05 Sep 2023 09:10:47 +0200},
biburl = {https://dblp.org/rec/conf/aaai/KlauLMM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/avi/KlauLMMS02,
author = {Gunnar W. Klau and
Neal Lesh and
Joe Marks and
Michael Mitzenmacher and
Guy T. Schafer},
editor = {Maria De Marsico and
Stefano Levialdi and
Emanuele Panizzi},
title = {The HuGS platform: a toolkit for interactive optimization},
booktitle = {Proceedings of the Working Conference on Advanced Visual Interfaces,
{AVI} 2002, Trento, Italy, May 22-24, 2002},
pages = {324--330},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/1556262.1556314},
doi = {10.1145/1556262.1556314},
timestamp = {Tue, 06 Nov 2018 16:58:13 +0100},
biburl = {https://dblp.org/rec/conf/avi/KlauLMMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MitzenmacherPS02,
author = {Michael Mitzenmacher and
Balaji Prabhakar and
Devavrat Shah},
title = {Load Balancing with Memory},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {799--808},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1182005},
doi = {10.1109/SFCS.2002.1182005},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MitzenmacherPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/GoelM02,
author = {Ashish Goel and
Michael Mitzenmacher},
title = {Exact sampling of {TCP} Window States},
booktitle = {Proceedings {IEEE} {INFOCOM} 2002, The 21st Annual Joint Conference
of the {IEEE} Computer and Communications Societies, New York, USA,
June 23-27, 2002},
pages = {259--265},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/INFCOM.2002.1019267},
doi = {10.1109/INFCOM.2002.1019267},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/GoelM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BroderM02,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
editor = {Aleta Ricciardi},
title = {Optmial plans for aggregation},
booktitle = {Proceedings of the Twenty-First Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2002, Monterey, California, USA,
July 21-24, 2002},
pages = {144--152},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/571825.571852},
doi = {10.1145/571825.571852},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BroderM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/ByersCMR02,
author = {John W. Byers and
Jeffrey Considine and
Michael Mitzenmacher and
Stanislav Rost},
editor = {Matthew Mathis and
Peter Steenkiste and
Hari Balakrishnan and
Vern Paxson},
title = {Informed content delivery across adaptive overlay networks},
booktitle = {Proceedings of the {ACM} {SIGCOMM} 2002 Conference on Applications,
Technologies, Architectures, and Protocols for Computer Communication,
August 19-23, 2002, Pittsburgh, PA, {USA}},
pages = {47--60},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/633025.633031},
doi = {10.1145/633025.633031},
timestamp = {Wed, 21 Jul 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/ByersCMR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DrineaFM02,
author = {Eleni Drinea and
Alan M. Frieze and
Michael Mitzenmacher},
editor = {David Eppstein},
title = {Balls and bins models with feedback},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {308--315},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545422},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DrineaFM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AlbersCM01,
author = {Susanne Albers and
Moses Charikar and
Michael Mitzenmacher},
title = {Delayed Information and Action in On-Line Algorithms},
journal = {Inf. Comput.},
volume = {170},
number = {2},
pages = {135--152},
year = {2001},
url = {https://doi.org/10.1006/inco.2001.3057},
doi = {10.1006/INCO.2001.3057},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/AlbersCM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mitzenmacher01,
author = {Michael Mitzenmacher},
title = {Analyses of Load Stealing Models Based on Families of Differential
Equations},
journal = {Theory Comput. Syst.},
volume = {34},
number = {1},
pages = {77--98},
year = {2001},
url = {https://doi.org/10.1007/s002240010010},
doi = {10.1007/S002240010010},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Mitzenmacher01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroderM01,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
title = {Completeness and robustness properties of min-wise independent permutations},
journal = {Random Struct. Algorithms},
volume = {18},
number = {1},
pages = {18--30},
year = {2001},
url = {https://doi.org/10.1002/1098-2418(200101)18:1\&\#60;18::AID-RSA2\&\#62;3.0.CO;2-M},
doi = {10.1002/1098-2418(200101)18:1\&\#60;18::AID-RSA2\&\#62;3.0.CO;2-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroderM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GafniM01,
author = {Eli Gafni and
Michael Mitzenmacher},
title = {Analysis of Timing-Based Mutual Exclusion with Random Times},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {816--837},
year = {2001},
url = {https://doi.org/10.1137/S0097539799364912},
doi = {10.1137/S0097539799364912},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GafniM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Mitzenmacher01,
author = {Michael Mitzenmacher},
title = {Challenging students with creative assignments},
journal = {{SIGACT} News},
volume = {32},
number = {1},
pages = {70--73},
year = {2001},
url = {https://doi.org/10.1145/568438.568457},
doi = {10.1145/568438.568457},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Mitzenmacher01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Mitzenmacher01a,
author = {Michael Mitzenmacher},
title = {An experimental assignment on random processes},
journal = {{SIGACT} News},
volume = {32},
number = {1},
pages = {74--78},
year = {2001},
url = {https://doi.org/10.1145/568438.568458},
doi = {10.1145/568438.568458},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Mitzenmacher01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/LubyMSS01,
author = {Michael Luby and
Michael Mitzenmacher and
Mohammad Amin Shokrollahi and
Daniel A. Spielman},
title = {Efficient erasure correcting codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {47},
number = {2},
pages = {569--584},
year = {2001},
url = {https://doi.org/10.1109/18.910575},
doi = {10.1109/18.910575},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/LubyMSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/LubyMSS01a,
author = {Michael Luby and
Michael Mitzenmacher and
Mohammad Amin Shokrollahi and
Daniel A. Spielman},
title = {Improved low-density parity-check codes using irregular graphs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {47},
number = {2},
pages = {585--598},
year = {2001},
url = {https://doi.org/10.1109/18.910576},
doi = {10.1109/18.910576},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/LubyMSS01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tjs/MitzenmacherR01,
author = {Michael Mitzenmacher and
Rajmohan Rajaraman},
title = {Towards More Complete Models of {TCP} Latency and Throughput},
journal = {J. Supercomput.},
volume = {20},
number = {2},
pages = {137--160},
year = {2001},
url = {https://doi.org/10.1023/A:1011126701791},
doi = {10.1023/A:1011126701791},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tjs/MitzenmacherR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/Mitzenmacher01,
author = {Michael Mitzenmacher},
title = {The Power of Two Choices in Randomized Load Balancing},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {12},
number = {10},
pages = {1094--1104},
year = {2001},
url = {https://doi.org/10.1109/71.963420},
doi = {10.1109/71.963420},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/Mitzenmacher01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/MitzenmacherO01,
author = {Michael Mitzenmacher and
Sean Owen},
editor = {Adam L. Buchsbaum and
Jack Snoeyink},
title = {Estimating Resemblance of {MIDI} Documents},
booktitle = {Algorithm Engineering and Experimentation, Third International Workshop,
{ALENEX} 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2153},
pages = {78--90},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44808-X\_6},
doi = {10.1007/3-540-44808-X\_6},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/alenex/MitzenmacherO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/AdlerM01,
author = {Micah Adler and
Michael Mitzenmacher},
title = {Towards Compressing Web Graphs},
booktitle = {Data Compression Conference, {DCC} 2001, Snowbird, Utah, USA, March
27-29, 2001},
pages = {203--212},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/DCC.2001.917151},
doi = {10.1109/DCC.2001.917151},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/AdlerM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/Mitzenmacher01,
author = {Michael Mitzenmacher},
title = {On the Hardness of Finding Optimal Multiple Preset Dictionaries},
booktitle = {Data Compression Conference, {DCC} 2001, Snowbird, Utah, USA, March
27-29, 2001},
pages = {411},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/DCC.2001.917172},
doi = {10.1109/DCC.2001.917172},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/Mitzenmacher01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/ByersLM01,
author = {John W. Byers and
Michael Luby and
Michael Mitzenmacher},
title = {Fine-Grained Layered Multicast},
booktitle = {Proceedings {IEEE} {INFOCOM} 2001, The Conference on Computer Communications,
Twentieth Annual Joint Conference of the {IEEE} Computer and Communications
Societies, Twenty years into the communications odyssey, Anchorage,
Alaska, USA, April 22-26, 2001},
pages = {1143--1151},
publisher = {{IEEE} Comptuer Society},
year = {2001},
url = {https://doi.org/10.1109/INFCOM.2001.916308},
doi = {10.1109/INFCOM.2001.916308},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/ByersLM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/BroderM01,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
title = {Using Multiple Hash Functions to Improve {IP} Lookups},
booktitle = {Proceedings {IEEE} {INFOCOM} 2001, The Conference on Computer Communications,
Twentieth Annual Joint Conference of the {IEEE} Computer and Communications
Societies, Twenty years into the communications odyssey, Anchorage,
Alaska, USA, April 22-26, 2001},
pages = {1454--1463},
publisher = {{IEEE} Comptuer Society},
year = {2001},
url = {https://doi.org/10.1109/INFCOM.2001.916641},
doi = {10.1109/INFCOM.2001.916641},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/BroderM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Mitzenmacher01,
author = {Michael Mitzenmacher},
editor = {Ajay D. Kshemkalyani and
Nir Shavit},
title = {Compressed bloom filters},
booktitle = {Proceedings of the Twentieth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2001, Newport, Rhode Island, USA,
August 26-29, 2001},
pages = {144--150},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/383962.384004},
doi = {10.1145/383962.384004},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/Mitzenmacher01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BoyanM01,
author = {Justin A. Boyan and
Michael Mitzenmacher},
editor = {S. Rao Kosaraju},
title = {IMproved results for route planning in stochastic transportation},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {895--902},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365803},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BoyanM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/HenzingerHMN00,
author = {Monika Rauch Henzinger and
Allan Heydon and
Michael Mitzenmacher and
Marc Najork},
title = {On near-uniform {URL} sampling},
journal = {Comput. Networks},
volume = {33},
number = {1-6},
pages = {295--308},
year = {2000},
url = {https://doi.org/10.1016/S1389-1286(00)00055-4},
doi = {10.1016/S1389-1286(00)00055-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/HenzingerHMN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BroderCFM00,
author = {Andrei Z. Broder and
Moses Charikar and
Alan M. Frieze and
Michael Mitzenmacher},
title = {Min-Wise Independent Permutations},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {3},
pages = {630--659},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1690},
doi = {10.1006/JCSS.1999.1690},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BroderCFM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlbersM00,
author = {Susanne Albers and
Michael Mitzenmacher},
title = {Average-case analyses of first fit and random fit bin packing},
journal = {Random Struct. Algorithms},
volume = {16},
number = {3},
pages = {240--259},
year = {2000},
url = {https://doi.org/10.1002/(SICI)1098-2418(200005)16:3\&\#60;240::AID-RSA2\&\#62;3.0.CO;2-V},
doi = {10.1002/(SICI)1098-2418(200005)16:3\&\#60;240::AID-RSA2\&\#62;3.0.CO;2-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlbersM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerGGJM00,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Mark Jerrum and
Michael Mitzenmacher},
title = {An Extension of Path Coupling and Its Application to the Glauber Dynamics
for Graph Colorings},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1962--1975},
year = {2000},
url = {https://doi.org/10.1137/S0097539700372708},
doi = {10.1137/S0097539700372708},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerGGJM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/Mitzenmacher00,
author = {Michael Mitzenmacher},
title = {How Useful Is Old Information?},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {11},
number = {1},
pages = {6--20},
year = {2000},
url = {https://doi.org/10.1109/71.824633},
doi = {10.1109/71.824633},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/Mitzenmacher00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KenyonM00,
author = {Claire Kenyon and
Michael Mitzenmacher},
title = {Linear Waste of Best Fit Bin Packing on Skewed Distributions},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {582--589},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892326},
doi = {10.1109/SFCS.2000.892326},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KenyonM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ngc/ByersFHLMRS00,
author = {John W. Byers and
Michael Frumin and
Gavin B. Horn and
Michael Luby and
Michael Mitzenmacher and
Alex Roetter and
William Shaver},
editor = {Christophe Diot and
Kevin C. Almeroth},
title = {{FLID-DL:} congestion control for layered multicast},
booktitle = {Networked Group Communication, Second International {COST264} Workshop,
{NGC} 2000, Stanford, CA, USA, November 8-10, 2000, Proceedings},
pages = {71--81},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/354644.354654},
doi = {10.1145/354644.354654},
timestamp = {Fri, 17 Dec 2021 17:08:11 +0100},
biburl = {https://dblp.org/rec/conf/ngc/ByersFHLMRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BroderKM00,
author = {Andrei Z. Broder and
Robert Krauthgamer and
Michael Mitzenmacher},
editor = {David B. Shmoys},
title = {Improved classification via connectivity information},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {576--585},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338610},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BroderKM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DyerGGJM00,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Mark Jerrum and
Michael Mitzenmacher},
editor = {David B. Shmoys},
title = {An extension of path coupling and its application to the Glauber dynamics
for graph colourings (extended abstract)},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {616--624},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338614},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DyerGGJM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/HenzingerHMN99,
author = {Monika Rauch Henzinger and
Allan Heydon and
Michael Mitzenmacher and
Marc Najork},
title = {Measuring Index Quality Using Random Walks on the Web},
journal = {Comput. Networks},
volume = {31},
number = {11-16},
pages = {1291--1303},
year = {1999},
url = {https://doi.org/10.1016/S1389-1286(99)00016-X},
doi = {10.1016/S1389-1286(99)00016-X},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/HenzingerHMN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Mitzenmacher99,
author = {Michael Mitzenmacher},
title = {Studying Balanced Allocations With Differential Equations},
journal = {Comb. Probab. Comput.},
volume = {8},
number = {5},
pages = {473--482},
year = {1999},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46729},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Mitzenmacher99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mitzenmacher99,
author = {Michael Mitzenmacher},
title = {On the Analysis of Randomized Load Balancing Schemes},
journal = {Theory Comput. Syst.},
volume = {32},
number = {3},
pages = {361--386},
year = {1999},
url = {https://doi.org/10.1007/s002240000122},
doi = {10.1007/S002240000122},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Mitzenmacher99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/ByersLM99,
author = {John W. Byers and
Michael Luby and
Michael Mitzenmacher},
title = {Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to
Speed Up Downloads},
booktitle = {Proceedings {IEEE} {INFOCOM} '99, The Conference on Computer Communications,
Eighteenth Annual Joint Conference of the {IEEE} Computer and Communications
Societies, The Future Is Now, New York, NY, USA, March 21-25, 1999},
pages = {275--283},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/INFCOM.1999.749293},
doi = {10.1109/INFCOM.1999.749293},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/ByersLM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GafniM99,
author = {Eli Gafni and
Michael Mitzenmacher},
editor = {Brian A. Coan and
Jennifer L. Welch},
title = {Analysis of Timing-Based Mutual Exclusion with Random Times},
booktitle = {Proceedings of the Eighteenth Annual {ACM} Symposium on Principles
of Distributed Computing, PODC, '99Atlanta, Georgia, USA, May 3-6,
1999},
pages = {13--21},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301308.301318},
doi = {10.1145/301308.301318},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GafniM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/BroderM99,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Completeness and Robustness Properties of Min-Wise Independent Permutations},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {1--10},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_1},
doi = {10.1007/978-3-540-48413-4\_1},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/BroderM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BroderMM99,
author = {Andrei Z. Broder and
Michael Mitzenmacher and
Laurent Moll},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Unscrambling Address Lines},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {870--871},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.315057},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/BroderMM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersM98,
author = {Susanne Albers and
Michael Mitzenmacher},
title = {Average Case Analyses of List Update Algorithms, with Applications
to Data Compression},
journal = {Algorithmica},
volume = {21},
number = {3},
pages = {312--329},
year = {1998},
url = {https://doi.org/10.1007/PL00009217},
doi = {10.1007/PL00009217},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AdlerCMR98,
author = {Micah Adler and
Soumen Chakrabarti and
Michael Mitzenmacher and
Lars Eilstrup Rasmussen},
title = {Parallel randomized load balancing},
journal = {Random Struct. Algorithms},
volume = {13},
number = {2},
pages = {159--188},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1098-2418(199809)13:2\&\#60;159::AID-RSA3\&\#62;3.0.CO;2-Q},
doi = {10.1002/(SICI)1098-2418(199809)13:2\&\#60;159::AID-RSA3\&\#62;3.0.CO;2-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AdlerCMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlbersCM98,
author = {Susanne Albers and
Moses Charikar and
Michael Mitzenmacher},
title = {Delayed Information and Action in On-line Algorithms},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {71--81},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743430},
doi = {10.1109/SFCS.1998.743430},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AlbersCM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/BroderCM98,
author = {Andrei Z. Broder and
Moses Charikar and
Michael Mitzenmacher},
editor = {Michael Luby and
Jos{\'{e}} D. P. Rolim and
Maria J. Serna},
title = {A Derandomization Using Min-Wise Independent Permutations},
booktitle = {Randomization and Approximation Techniques in Computer Science, Second
International Workshop, RANDOM'98, Barcelona, Spain, October 8-10,
1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1518},
pages = {15--24},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49543-6\_2},
doi = {10.1007/3-540-49543-6\_2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/BroderCM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/ColeFMMRSU98,
author = {Richard Cole and
Alan M. Frieze and
Bruce M. Maggs and
Michael Mitzenmacher and
Andr{\'{e}}a W. Richa and
Ramesh K. Sitaraman and
Eli Upfal},
editor = {Michael Luby and
Jos{\'{e}} D. P. Rolim and
Maria J. Serna},
title = {On Balls and Bins with Deletions},
booktitle = {Randomization and Approximation Techniques in Computer Science, Second
International Workshop, RANDOM'98, Barcelona, Spain, October 8-10,
1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1518},
pages = {145--158},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49543-6\_12},
doi = {10.1007/3-540-49543-6\_12},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/ColeFMMRSU98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/ByersLMR98,
author = {John W. Byers and
Michael Luby and
Michael Mitzenmacher and
Ashutosh Rege},
editor = {Gerald Neufeld and
Gary S. Delp and
Jonathan Smith and
Martha Steenstrup},
title = {A Digital Fountain Approach to Reliable Distribution of Bulk Data},
booktitle = {Proceedings of the {ACM} {SIGCOMM} 1998 Conference on Applications,
Technologies, Architectures, and Protocols for Computer Communication,
August 31 - September 4, 1998, Vancouver, B.C., Canada},
pages = {56--67},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/285237.285258},
doi = {10.1145/285237.285258},
timestamp = {Wed, 21 Jul 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/ByersLMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlbersM98,
author = {Susanne Albers and
Michael Mitzenmacher},
editor = {Howard J. Karloff},
title = {Average-Case Analyses of First Fit and Random Fit Bin Packing},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {290--299},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314718},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlbersM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LubyMS98,
author = {Michael Luby and
Michael Mitzenmacher and
Mohammad Amin Shokrollahi},
editor = {Howard J. Karloff},
title = {Analysis of Random Processes via And-Or Tree Evaluation},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {364--373},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314722},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/LubyMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Mitzenmacher98,
author = {Michael Mitzenmacher},
editor = {Gary L. Miller and
Phillip B. Gibbons},
title = {Analyses of Load Stealing Models Based on Differential Equations},
booktitle = {Proceedings of the Tenth Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '98, Puerto Vallarta, Mexico, June 28 -
July 2, 1998},
pages = {212--221},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/277651.277687},
doi = {10.1145/277651.277687},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Mitzenmacher98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LubyMSS98,
author = {Michael Luby and
Michael Mitzenmacher and
Mohammad Amin Shokrollahi and
Daniel A. Spielman},
editor = {Jeffrey Scott Vitter},
title = {Analysis of Low Density Codes and Improved Designs Using Irregular
Graphs},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {249--258},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276756},
doi = {10.1145/276698.276756},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LubyMSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BroderCFM98,
author = {Andrei Z. Broder and
Moses Charikar and
Alan M. Frieze and
Michael Mitzenmacher},
editor = {Jeffrey Scott Vitter},
title = {Min-Wise Independent Permutations (Extended Abstract)},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {327--336},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276781},
doi = {10.1145/276698.276781},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BroderCFM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeMHMRSSV98,
author = {Richard Cole and
Bruce M. Maggs and
Friedhelm Meyer auf der Heide and
Michael Mitzenmacher and
Andr{\'{e}}a W. Richa and
Klaus Schr{\"{o}}der and
Ramesh K. Sitaraman and
Berthold V{\"{o}}cking},
editor = {Jeffrey Scott Vitter},
title = {Randomized Protocols for Low Congestion Circuit Routing in Multistage
Interconnection Networks},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {378--388},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276790},
doi = {10.1145/276698.276790},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeMHMRSSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/Mitzenmacher97,
author = {Michael Mitzenmacher},
title = {Constant Time per Edge is Optimal on Rooted Tree Networks},
journal = {Distributed Comput.},
volume = {10},
number = {4},
pages = {189--197},
year = {1997},
url = {https://doi.org/10.1007/s004460050036},
doi = {10.1007/S004460050036},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/Mitzenmacher97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlbersM97,
author = {Susanne Albers and
Michael Mitzenmacher},
title = {Revisiting the Counter Algorithms for List Update},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {155--160},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00160-9},
doi = {10.1016/S0020-0190(97)00160-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlbersM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Mitzenmacher97,
author = {Michael Mitzenmacher},
editor = {James E. Burns and
Hagit Attiya},
title = {How Useful Is Old Information? (Extended Abstract)},
booktitle = {Proceedings of the Sixteenth Annual {ACM} Symposium on Principles
of Distributed Computing, Santa Barbara, California, USA, August 21-24,
1997},
pages = {83--91},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/259380.259426},
doi = {10.1145/259380.259426},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/Mitzenmacher97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Mitzenmacher97,
author = {Michael Mitzenmacher},
editor = {Charles E. Leiserson and
David E. Culler},
title = {On the Analysis of Randomized Load Balancing Schemes},
booktitle = {Proceedings of the 9th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '97, Newport, RI, USA, June 23-25, 1997},
pages = {292--301},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258492.258521},
doi = {10.1145/258492.258521},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Mitzenmacher97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LubyMSSS97,
author = {Michael Luby and
Michael Mitzenmacher and
Mohammad Amin Shokrollahi and
Daniel A. Spielman and
Volker Stemann},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Practical Loss-Resilient Codes},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {150--159},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258573},
doi = {10.1145/258533.258573},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LubyMSSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Mitzenmacher96,
author = {Michael Mitzenmacher},
title = {Bounds on the Greedy Routing Algorithm for Array Networks},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {3},
pages = {317--327},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0072},
doi = {10.1006/JCSS.1996.0072},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Mitzenmacher96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigcse/Mitzenmacher96,
author = {Michael Mitzenmacher},
title = {Designing stimulating programming assignments for an algorithms course:
a collection of exercises based on random graphs},
journal = {{ACM} {SIGCSE} Bull.},
volume = {28},
number = {3},
pages = {29--36},
year = {1996},
url = {https://doi.org/10.1145/234867.234875},
doi = {10.1145/234867.234875},
timestamp = {Thu, 11 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigcse/Mitzenmacher96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/BroderM96,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
editor = {James A. Storer and
Martin Cohn},
title = {Pattern-based Compression of Text Images},
booktitle = {Proceedings of the 6th Data Compression Conference {(DCC} '96), Snowbird,
Utah, USA, March 31 - April 3, 1996},
pages = {300--309},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/DCC.1996.488335},
doi = {10.1109/DCC.1996.488335},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/BroderM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mitzenmacher96,
author = {Michael Mitzenmacher},
title = {Load Balancing and Density Dependent Jump Markov Processes (extended
abstract)},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {213--222},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548480},
doi = {10.1109/SFCS.1996.548480},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mitzenmacher96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlbersM96,
author = {Susanne Albers and
Michael Mitzenmacher},
editor = {Friedhelm Meyer auf der Heide and
Burkhard Monien},
title = {Average Case Analyses of List Update Algorithms, with Applications
to Data Compression},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium,
ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1099},
pages = {514--525},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61440-0\_155},
doi = {10.1007/3-540-61440-0\_155},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlbersM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Mitzenmacher96,
author = {Michael Mitzenmacher},
editor = {Guy E. Blelloch},
title = {Constant Time per Edge is Optimal on Rooted Tree Networks},
booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '96, Padua, Italy, June 24-26, 1996},
pages = {162--169},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237502.237524},
doi = {10.1145/237502.237524},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Mitzenmacher96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AdlerCMR95,
author = {Micah Adler and
Soumen Chakrabarti and
Michael Mitzenmacher and
Lars Eilstrup Rasmussen},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Parallel randomized load balancing (Preliminary Version)},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {238--247},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225131},
doi = {10.1145/225058.225131},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AdlerCMR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LouthMK94,
author = {Graham Louth and
Michael Mitzenmacher and
Frank Kelly},
title = {Computational Complexity of Loss Networks},
journal = {Theor. Comput. Sci.},
volume = {125},
number = {1},
pages = {45--59},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90293-3},
doi = {10.1016/0304-3975(94)90293-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LouthMK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Mitzenmacher94,
author = {Michael Mitzenmacher},
editor = {Lawrence Snyder and
Charles E. Leiserson},
title = {Bounds on the Greedy Routing Algorithm for Array Networks},
booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '94, Cape May, New Jersey, USA, June 27-29,
1994},
pages = {346--353},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/181014.181446},
doi = {10.1145/181014.181446},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Mitzenmacher94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
