Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Udi Wieder
@inproceedings{DBLP:conf/innovations/GopalanHKRW23,
author = {Parikshit Gopalan and
Lunjia Hu and
Michael P. Kim and
Omer Reingold and
Udi Wieder},
editor = {Yael Tauman Kalai},
title = {Loss Minimization Through the Lens Of Outcome Indistinguishability},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {60:1--60:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.60},
doi = {10.4230/LIPICS.ITCS.2023.60},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GopalanHKRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpc/BudiuTGWZ22,
author = {Mihai Budiu and
Pratiksha Thaker and
Parikshit Gopalan and
Udi Wieder and
Matei Zaharia},
title = {Overlook: Differentially Private Exploratory Visualization for Big
Data},
journal = {J. Priv. Confidentiality},
volume = {12},
number = {1},
year = {2022},
url = {https://doi.org/10.29012/jpc.779},
doi = {10.29012/JPC.779},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpc/BudiuTGWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/GopalanRSW22,
author = {Parikshit Gopalan and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
editor = {Sanjoy Dasgupta and
Nika Haghtalab},
title = {Multicalibrated Partitions for Importance Weights},
booktitle = {International Conference on Algorithmic Learning Theory, 29 March
- 1 April 2022, Paris, France},
series = {Proceedings of Machine Learning Research},
volume = {167},
pages = {408--435},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v167/gopalan22a.html},
timestamp = {Fri, 10 Mar 2023 11:41:45 +0100},
biburl = {https://dblp.org/rec/conf/alt/GopalanRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GopalanKRSW22,
author = {Parikshit Gopalan and
Adam Tauman Kalai and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
editor = {Mark Braverman},
title = {Omnipredictors},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {79:1--79:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.79},
doi = {10.4230/LIPICS.ITCS.2022.79},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GopalanKRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-13576,
author = {Parikshit Gopalan and
Nina Narodytska and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
title = {{KL} Divergence Estimation with Multi-group Attribution},
journal = {CoRR},
volume = {abs/2202.13576},
year = {2022},
url = {https://arxiv.org/abs/2202.13576},
eprinttype = {arXiv},
eprint = {2202.13576},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-13576.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-08649,
author = {Parikshit Gopalan and
Lunjia Hu and
Michael P. Kim and
Omer Reingold and
Udi Wieder},
title = {Loss Minimization through the Lens of Outcome Indistinguishability},
journal = {CoRR},
volume = {abs/2210.08649},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.08649},
doi = {10.48550/ARXIV.2210.08649},
eprinttype = {arXiv},
eprint = {2210.08649},
timestamp = {Wed, 19 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-08649.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-05853,
author = {Parikshit Gopalan and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
title = {Multicalibrated Partitions for Importance Weights},
journal = {CoRR},
volume = {abs/2103.05853},
year = {2021},
url = {https://arxiv.org/abs/2103.05853},
eprinttype = {arXiv},
eprint = {2103.05853},
timestamp = {Tue, 16 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-05853.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-05389,
author = {Parikshit Gopalan and
Adam Tauman Kalai and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
title = {Omnipredictors},
journal = {CoRR},
volume = {abs/2109.05389},
year = {2021},
url = {https://arxiv.org/abs/2109.05389},
eprinttype = {arXiv},
eprint = {2109.05389},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-05389.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GopalanLW20,
author = {Parikshit Gopalan and
Roie Levin and
Udi Wieder},
editor = {Thomas Vidick},
title = {Finding Skewed Subcubes Under a Distribution},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {84:1--84:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.84},
doi = {10.4230/LIPICS.ITCS.2020.84},
timestamp = {Mon, 06 Jan 2020 16:50:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GopalanLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-12018,
author = {Pratiksha Thaker and
Mihai Budiu and
Parikshit Gopalan and
Udi Wieder and
Matei Zaharia},
title = {Overlook: Differentially Private Exploratory Visualization for Big
Data},
journal = {CoRR},
volume = {abs/2006.12018},
year = {2020},
url = {https://arxiv.org/abs/2006.12018},
eprinttype = {arXiv},
eprint = {2006.12018},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-12018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/BudiuGSWKA19,
author = {Mihai Budiu and
Parikshit Gopalan and
Lalith Suresh and
Udi Wieder and
Han Kruiger and
Marcos K. Aguilera},
title = {Hillview: {A} trillion-cell spreadsheet for big data},
journal = {Proc. {VLDB} Endow.},
volume = {12},
number = {11},
pages = {1442--1457},
year = {2019},
url = {http://www.vldb.org/pvldb/vol12/p1442-budiu.pdf},
doi = {10.14778/3342263.3342279},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/BudiuGSWKA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GopalanSW19,
author = {Parikshit Gopalan and
Vatsal Sharan and
Udi Wieder},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {PIDForest: Anomaly Detection via Partial Identification},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {15783--15793},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/eb6dc8aba23375061b6f07b137617096-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/GopalanSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04827,
author = {Mihai Budiu and
Parikshit Gopalan and
Lalith Suresh and
Udi Wieder and
Han Kruiger and
Marcos K. Aguilera},
title = {Hillview: {A} trillion-cell spreadsheet for big data},
journal = {CoRR},
volume = {abs/1907.04827},
year = {2019},
url = {http://arxiv.org/abs/1907.04827},
eprinttype = {arXiv},
eprint = {1907.04827},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-07378,
author = {Parikshit Gopalan and
Roie Levin and
Udi Wieder},
title = {Finding Skewed Subcubes Under a Distribution},
journal = {CoRR},
volume = {abs/1911.07378},
year = {2019},
url = {http://arxiv.org/abs/1911.07378},
eprinttype = {arXiv},
eprint = {1911.07378},
timestamp = {Mon, 02 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-07378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-03582,
author = {Parikshit Gopalan and
Vatsal Sharan and
Udi Wieder},
title = {PIDForest: Anomaly Detection via Partial Identification},
journal = {CoRR},
volume = {abs/1912.03582},
year = {2019},
url = {http://arxiv.org/abs/1912.03582},
eprinttype = {arXiv},
eprint = {1912.03582},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-03582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/Pinkas0WW18,
author = {Benny Pinkas and
Thomas Schneider and
Christian Weinert and
Udi Wieder},
editor = {Jesper Buus Nielsen and
Vincent Rijmen},
title = {Efficient Circuit-Based {PSI} via Cuckoo Hashing},
booktitle = {Advances in Cryptology - {EUROCRYPT} 2018 - 37th Annual International
Conference on the Theory and Applications of Cryptographic Techniques,
Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {10822},
pages = {125--157},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-78372-7\_5},
doi = {10.1007/978-3-319-78372-7\_5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/Pinkas0WW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/SharanGW18,
author = {Vatsal Sharan and
Parikshit Gopalan and
Udi Wieder},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {Efficient Anomaly Detection via Matrix Sketching},
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 = {8080--8091},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/34adeb8e3242824038aa65460a47c29e-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/SharanGW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03065,
author = {Parikshit Gopalan and
Vatsal Sharan and
Udi Wieder},
title = {Faster Anomaly Detection via Matrix Sketching},
journal = {CoRR},
volume = {abs/1804.03065},
year = {2018},
url = {http://arxiv.org/abs/1804.03065},
eprinttype = {arXiv},
eprint = {1804.03065},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-02004,
author = {Udi Wieder},
title = {Another Proof of Cuckoo hashing with New Variants},
journal = {CoRR},
volume = {abs/1806.02004},
year = {2018},
url = {http://arxiv.org/abs/1806.02004},
eprinttype = {arXiv},
eprint = {1806.02004},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-02004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Pinkas0WW18,
author = {Benny Pinkas and
Thomas Schneider and
Christian Weinert and
Udi Wieder},
title = {Efficient Circuit-based {PSI} via Cuckoo Hashing},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {120},
year = {2018},
url = {http://eprint.iacr.org/2018/120},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/Pinkas0WW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/Wieder17,
author = {Udi Wieder},
title = {Hashing, Load Balancing and Multiple Choice},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {12},
number = {3-4},
pages = {275--379},
year = {2017},
url = {https://doi.org/10.1561/0400000070},
doi = {10.1561/0400000070},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/Wieder17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nsdi/WeiTRAMDSWFSFM17,
author = {Michael Wei and
Amy Tai and
Christopher J. Rossbach and
Ittai Abraham and
Maithem Munshed and
Medhavi Dhawan and
Jim Stabile and
Udi Wieder and
Scott Fritchie and
Steven Swanson and
Michael J. Freedman and
Dahlia Malkhi},
editor = {Aditya Akella and
Jon Howell},
title = {vCorfu: {A} Cloud-Scale Object Store on a Shared Log},
booktitle = {14th {USENIX} Symposium on Networked Systems Design and Implementation,
{NSDI} 2017, Boston, MA, USA, March 27-29, 2017},
pages = {35--49},
publisher = {{USENIX} Association},
year = {2017},
url = {https://www.usenix.org/conference/nsdi17/technical-sessions/presentation/wei-michael},
timestamp = {Tue, 02 Feb 2021 08:05:04 +0100},
biburl = {https://dblp.org/rec/conf/nsdi/WeiTRAMDSWFSFM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hotstorage/WeiRAWSMT16,
author = {Michael Wei and
Christopher J. Rossbach and
Ittai Abraham and
Udi Wieder and
Steven Swanson and
Dahlia Malkhi and
Amy Tai},
editor = {Nitin Agrawal and
Sam H. Noh},
title = {Silver: {A} Scalable, Distributed, Multi-versioning, Always Growing
(Ag) File System},
booktitle = {8th {USENIX} Workshop on Hot Topics in Storage and File Systems, HotStorage
2016, Denver, CO, USA, June 20-21, 2016},
publisher = {{USENIX} Association},
year = {2016},
url = {https://www.usenix.org/conference/hotstorage16/workshop-program/presentation/wei},
timestamp = {Tue, 02 Feb 2021 07:59:34 +0100},
biburl = {https://dblp.org/rec/conf/hotstorage/WeiRAWSMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oopsla/WagnerSW16,
author = {Tal Wagner and
Eric Schkufza and
Udi Wieder},
editor = {Eelco Visser},
title = {A sampling-based approach to accelerating queries in log management
systems},
booktitle = {Companion Proceedings of the 2016 {ACM} {SIGPLAN} International Conference
on Systems, Programming, Languages and Applications: Software for
Humanity, {SPLASH} 2016, Amsterdam, Netherlands, October 30 - November
4, 2016},
pages = {37--38},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2984043.2989221},
doi = {10.1145/2984043.2989221},
timestamp = {Tue, 06 Nov 2018 16:57:15 +0100},
biburl = {https://dblp.org/rec/conf/oopsla/WagnerSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PeresTW15,
author = {Yuval Peres and
Kunal Talwar and
Udi Wieder},
title = {Graphical balanced allocations and the {(1} + {\(\beta\)})-choice
process},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {760--775},
year = {2015},
url = {https://doi.org/10.1002/rsa.20558},
doi = {10.1002/RSA.20558},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PeresTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AbrahamCKW15,
author = {Ittai Abraham and
Shiri Chechik and
Robert Krauthgamer and
Udi Wieder},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Approximate Nearest Neighbor Search in Metrics of Planar Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {20--42},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.20},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.20},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AbrahamCKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GuptaTW14,
author = {Anupam Gupta and
Kunal Talwar and
Udi Wieder},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Changing Bases: Multistage Optimization for Matroids and Matchings},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {563--575},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_47},
doi = {10.1007/978-3-662-43948-7\_47},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GuptaTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ReingoldRW14,
author = {Omer Reingold and
Ron D. Rothblum and
Udi Wieder},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Pseudorandom Graphs in Data Structures},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {943--954},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_78},
doi = {10.1007/978-3-662-43948-7\_78},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ReingoldRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/TalwarW14,
author = {Kunal Talwar and
Udi Wieder},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Balanced Allocations: {A} Simple Proof for the Heavily Loaded Case},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {979--990},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_81},
doi = {10.1007/978-3-662-43948-7\_81},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/TalwarW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuptaTW14,
author = {Anupam Gupta and
Kunal Talwar and
Udi Wieder},
title = {Changing Bases: Multistage Optimization for Matroids and Matchings},
journal = {CoRR},
volume = {abs/1404.3768},
year = {2014},
url = {http://arxiv.org/abs/1404.3768},
eprinttype = {arXiv},
eprint = {1404.3768},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuptaTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CelisRSW13,
author = {L. Elisa Celis and
Omer Reingold and
Gil Segev and
Udi Wieder},
title = {Balls and Bins: Smaller Hash Families and Faster Evaluation},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {3},
pages = {1030--1050},
year = {2013},
url = {https://doi.org/10.1137/120871626},
doi = {10.1137/120871626},
timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CelisRSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PaghSW13,
author = {Rasmus Pagh and
Gil Segev and
Udi Wieder},
title = {How to Approximate a Set without Knowing Its Size in Advance},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {80--89},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.17},
doi = {10.1109/FOCS.2013.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PaghSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhaskaraKTW13,
author = {Aditya Bhaskara and
Ravishankar Krishnaswamy and
Kunal Talwar and
Udi Wieder},
editor = {Sanjeev Khanna},
title = {Minimum Makespan Scheduling with Low Rank Processing Times},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {937--947},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.67},
doi = {10.1137/1.9781611973105.67},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhaskaraKTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-1188,
author = {Rasmus Pagh and
Gil Segev and
Udi Wieder},
title = {How to Approximate {A} Set Without Knowing Its Size In Advance},
journal = {CoRR},
volume = {abs/1304.1188},
year = {2013},
url = {http://arxiv.org/abs/1304.1188},
eprinttype = {arXiv},
eprint = {1304.1188},
timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1188.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/TalwarW13,
author = {Kunal Talwar and
Udi Wieder},
title = {Balanced Allocations: {A} Simple Proof for the Heavily Loaded Case},
journal = {CoRR},
volume = {abs/1310.5367},
year = {2013},
url = {http://arxiv.org/abs/1310.5367},
eprinttype = {arXiv},
eprint = {1310.5367},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/TalwarW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CelisRSW11,
author = {L. Elisa Celis and
Omer Reingold and
Gil Segev and
Udi Wieder},
editor = {Rafail Ostrovsky},
title = {Balls and Bins: Smaller Hash Families and Faster Evaluation},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {599--608},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.49},
doi = {10.1109/FOCS.2011.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CelisRSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CelisRSW11,
author = {L. Elisa Celis and
Omer Reingold and
Gil Segev and
Udi Wieder},
title = {Balls and Bins: Smaller Hash Families and Faster Evaluation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-068}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/068},
eprinttype = {ECCC},
eprint = {TR11-068},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CelisRSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AbrahamGMW10,
author = {Ittai Abraham and
Cyril Gavoille and
Dahlia Malkhi and
Udi Wieder},
title = {Strong-Diameter Decompositions of Minor Free Graphs},
journal = {Theory Comput. Syst.},
volume = {47},
number = {4},
pages = {837--855},
year = {2010},
url = {https://doi.org/10.1007/s00224-010-9283-6},
doi = {10.1007/S00224-010-9283-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AbrahamGMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PanigrahyTW10,
author = {Rina Panigrahy and
Kunal Talwar and
Udi Wieder},
title = {Lower Bounds on Near Neighbor Search via Metric Expansion},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {805--814},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.82},
doi = {10.1109/FOCS.2010.82},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PanigrahyTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PeresTW10,
author = {Yuval Peres and
Kunal Talwar and
Udi Wieder},
editor = {Moses Charikar},
title = {The {(1} + beta)-Choice Process and Weighted Balls-into-Bins},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1613--1619},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.131},
doi = {10.1137/1.9781611973075.131},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/PeresTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-0418,
author = {Rina Panigrahy and
Kunal Talwar and
Udi Wieder},
title = {Lower Bounds on Near Neighbor Search via Metric Expansion},
journal = {CoRR},
volume = {abs/1005.0418},
year = {2010},
url = {http://arxiv.org/abs/1005.0418},
eprinttype = {arXiv},
eprint = {1005.0418},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-0418.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/AspnesW09,
author = {James Aspnes and
Udi Wieder},
title = {The expansion and mixing time of skip graphs with applications},
journal = {Distributed Comput.},
volume = {21},
number = {6},
pages = {385--393},
year = {2009},
url = {https://doi.org/10.1007/s00446-008-0071-3},
doi = {10.1007/S00446-008-0071-3},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/AspnesW09.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/tos/MacCormickMRWYZ09,
author = {John MacCormick and
Nicholas Murphy and
Venugopalan Ramasubramanian and
Udi Wieder and
Junfeng Yang and
Lidong Zhou},
title = {Kinesis: {A} new approach to replica placement in distributed storage
systems},
journal = {{ACM} Trans. Storage},
volume = {4},
number = {4},
pages = {11:1--11:28},
year = {2009},
url = {https://doi.org/10.1145/1480439.1480440},
doi = {10.1145/1480439.1480440},
timestamp = {Thu, 30 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tos/MacCormickMRWYZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosp/IsardPCWTG09,
author = {Michael Isard and
Vijayan Prabhakaran and
Jon Currey and
Udi Wieder and
Kunal Talwar and
Andrew V. Goldberg},
editor = {Jeanna Neefe Matthews and
Thomas E. Anderson},
title = {Quincy: fair scheduling for distributed computing clusters},
booktitle = {Proceedings of the 22nd {ACM} Symposium on Operating Systems Principles
2009, {SOSP} 2009, Big Sky, Montana, USA, October 11-14, 2009},
pages = {261--276},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1629575.1629601},
doi = {10.1145/1629575.1629601},
timestamp = {Tue, 06 Nov 2018 16:59:32 +0100},
biburl = {https://dblp.org/rec/conf/sosp/IsardPCWTG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/MalkhiSTWW09,
author = {Dahlia Malkhi and
Siddhartha Sen and
Kunal Talwar and
Renato Fonseca F. Werneck and
Udi Wieder},
editor = {Idit Keidar},
title = {Virtual Ring Routing Trends},
booktitle = {Distributed Computing, 23rd International Symposium, {DISC} 2009,
Elche, Spain, September 23-25, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5805},
pages = {392--406},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04355-0\_42},
doi = {10.1007/978-3-642-04355-0\_42},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/MalkhiSTWW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AngelBOW08,
author = {Omer Angel and
Itai Benjamini and
Eran Ofek and
Udi Wieder},
title = {Routing complexity of faulty networks},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {71--87},
year = {2008},
url = {https://doi.org/10.1002/rsa.20163},
doi = {10.1002/RSA.20163},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AngelBOW08.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/focs/PanigrahyTW08,
author = {Rina Panigrahy and
Kunal Talwar and
Udi Wieder},
title = {A Geometric Approach to Lower Bounds for Approximate Near-Neighbor
Search and Partial Match},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {414--423},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.68},
doi = {10.1109/FOCS.2008.68},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PanigrahyTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/NaorSW08,
author = {Moni Naor and
Gil Segev and
Udi Wieder},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {History-Independent Cuckoo Hashing},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{II} - Track {B:} Logic, Semantics, and Theory of Programming {\&}
Track {C:} Security and Cryptography Foundations},
series = {Lecture Notes in Computer Science},
volume = {5126},
pages = {631--642},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70583-3\_51},
doi = {10.1007/978-3-540-70583-3\_51},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/NaorSW08.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}
}
@article{DBLP:journals/iacr/NaorSW08,
author = {Moni Naor and
Gil Segev and
Udi Wieder},
title = {History-Independent Cuckoo Hashing},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {358},
year = {2008},
url = {http://eprint.iacr.org/2008/358},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/NaorSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NaorW07,
author = {Moni Naor and
Udi Wieder},
title = {Novel architectures for {P2P} applications: The continuous-discrete
approach},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {3},
pages = {34},
year = {2007},
url = {https://doi.org/10.1145/1273340.1273350},
doi = {10.1145/1273340.1273350},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/NaorW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AbrahamGMW07,
author = {Ittai Abraham and
Cyril Gavoille and
Dahlia Malkhi and
Udi Wieder},
editor = {Phillip B. Gibbons and
Christian Scheideler},
title = {Strong-diameter decompositions of minor free graphs},
booktitle = {{SPAA} 2007: Proceedings of the 19th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Diego, California, USA, June
9-11, 2007},
pages = {16--24},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1248377.1248381},
doi = {10.1145/1248377.1248381},
timestamp = {Wed, 21 Nov 2018 11:13:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AbrahamGMW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Wieder07,
author = {Udi Wieder},
editor = {Phillip B. Gibbons and
Christian Scheideler},
title = {Balanced allocations with heterogenous bins},
booktitle = {{SPAA} 2007: Proceedings of the 19th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Diego, California, USA, June
9-11, 2007},
pages = {188--193},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1248377.1248407},
doi = {10.1145/1248377.1248407},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Wieder07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TalwarW07,
author = {Kunal Talwar and
Udi Wieder},
editor = {David S. Johnson and
Uriel Feige},
title = {Balanced allocations: the weighted case},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {256--265},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250829},
doi = {10.1145/1250790.1250829},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/TalwarW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/NaorW05,
author = {Moni Naor and
Udi Wieder},
title = {Scalable and dynamic quorum systems},
journal = {Distributed Comput.},
volume = {17},
number = {4},
pages = {311--322},
year = {2005},
url = {https://doi.org/10.1007/s00446-004-0114-3},
doi = {10.1007/S00446-004-0114-3},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/NaorW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AngelB05,
author = {Omer Angel and
Itai Benjamini and
Eran Ofek and
Udi Wieder},
editor = {Marcos Kawazoe Aguilera and
James Aspnes},
title = {Routing complexity of faulty networks},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2005, Las Vegas, NV, USA, July 17-20,
2005},
pages = {209--217},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073814.1073854},
doi = {10.1145/1073814.1073854},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AngelB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AspnesW05,
author = {James Aspnes and
Udi Wieder},
editor = {Phillip B. Gibbons and
Paul G. Spirakis},
title = {The expansion and mixing time of skip graphs with applications},
booktitle = {{SPAA} 2005: Proceedings of the 17th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada,
{USA}},
pages = {126--134},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073970.1073989},
doi = {10.1145/1073970.1073989},
timestamp = {Wed, 21 Nov 2018 11:12:26 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AspnesW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iptps/NaorW04,
author = {Moni Naor and
Udi Wieder},
editor = {Geoffrey M. Voelker and
Scott Shenker},
title = {Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small
Worlds},
booktitle = {Peer-to-Peer Systems III, Third International Workshop, {IPTPS} 2004,
La Jolla, CA, USA, February 26-27, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3279},
pages = {269--277},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30183-7\_26},
doi = {10.1007/978-3-540-30183-7\_26},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iptps/NaorW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MankuNW04,
author = {Gurmeet Singh Manku and
Moni Naor and
Udi Wieder},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Know thy neighbor's neighbor: the power of lookahead in randomized
{P2P} networks},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {54--63},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007368},
doi = {10.1145/1007352.1007368},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MankuNW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iptps/NaorW03,
author = {Moni Naor and
Udi Wieder},
editor = {M. Frans Kaashoek and
Ion Stoica},
title = {A Simple Fault Tolerant Distributed Hash Table},
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 = {88--97},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45172-3\_8},
doi = {10.1007/978-3-540-45172-3\_8},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iptps/NaorW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/NaorW03,
author = {Moni Naor and
Udi Wieder},
editor = {Elizabeth Borowsky and
Sergio Rajsbaum},
title = {Scalable and dynamic quorum systems},
booktitle = {Proceedings of the Twenty-Second {ACM} Symposium on Principles of
Distributed Computing, {PODC} 2003, Boston, Massachusetts, USA, July
13-16, 2003},
pages = {114--122},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/872035.872052},
doi = {10.1145/872035.872052},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/NaorW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/NaorW03,
author = {Moni Naor and
Udi Wieder},
editor = {Arnold L. Rosenberg and
Friedhelm Meyer auf der Heide},
title = {Novel architectures for {P2P} applications: the continuous-discrete
approach},
booktitle = {{SPAA} 2003: Proceedings of the Fifteenth Annual {ACM} Symposium on
Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego,
California, {USA} (part of {FCRC} 2003)},
pages = {50--59},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777412.777421},
doi = {10.1145/777412.777421},
timestamp = {Wed, 21 Nov 2018 11:11:22 +0100},
biburl = {https://dblp.org/rec/conf/spaa/NaorW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeOW02,
author = {Uriel Feige and
Eran Ofek and
Udi Wieder},
editor = {Klaus Jansen and
Stefano Leonardi and
Vijay V. Vazirani},
title = {Approximating Maximum Edge Coloring in Multigraphs},
booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International
Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2462},
pages = {108--121},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45753-4\_11},
doi = {10.1007/3-540-45753-4\_11},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/approx/FeigeOW02.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:
