Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Will Rosenbaum
@inproceedings{DBLP:conf/aaai/VartanianRA23,
author = {Ara Vartanian and
Will Rosenbaum and
Scott Alfeld},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {Training-Time Attacks against K-nearest Neighbors},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {10053--10060},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i8.26198},
doi = {10.1609/AAAI.V37I8.26198},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/VartanianRA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EdenHNRT23,
author = {Talya Eden and
Jakob B{\ae}k Tejs Houen and
Shyam Narayanan and
Will Rosenbaum and
Jakub Tetek},
editor = {Nicole Megow and
Adam D. Smith},
title = {Bias Reduction for Sum Estimation},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {62:1--62:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.62},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.62},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/EdenHNRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/MatsuiR23,
author = {Cameron Matsui and
Will Rosenbaum},
editor = {Sergio Rajsbaum and
Alkida Balliu and
Joshua J. Daymude and
Dennis Olivetti},
title = {Packet Forwarding with Swaps},
booktitle = {Structural Information and Communication Complexity - 30th International
Colloquium, {SIROCCO} 2023, Alcal{\'{a}} de Henares, Spain, June
6-9, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13892},
pages = {536--557},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32733-9\_24},
doi = {10.1007/978-3-031-32733-9\_24},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/MatsuiR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/ChengR22,
author = {Christine T. Cheng and
Will Rosenbaum},
title = {Stable Matchings with Restricted Preferences: Structure and Complexity},
journal = {{ACM} Trans. Economics and Comput.},
volume = {10},
number = {3},
pages = {13:1--13:45},
year = {2022},
url = {https://doi.org/10.1145/3565558},
doi = {10.1145/3565558},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/ChengR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EdenRR22,
author = {Talya Eden and
Dana Ron and
Will Rosenbaum},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in
Bounded Arboricity Graphs},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {56:1--56:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.56},
doi = {10.4230/LIPICS.ICALP.2022.56},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EdenRR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Rosenbaum22,
author = {Will Rosenbaum},
editor = {Christian Scheideler},
title = {Packet Forwarding with a Locally Bursty Adversary},
booktitle = {36th International Symposium on Distributed Computing, {DISC} 2022,
October 25-27, 2022, Augusta, Georgia, {USA}},
series = {LIPIcs},
volume = {246},
pages = {34:1--34:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.DISC.2022.34},
doi = {10.4230/LIPICS.DISC.2022.34},
timestamp = {Mon, 17 Oct 2022 16:44:53 +0200},
biburl = {https://dblp.org/rec/conf/wdag/Rosenbaum22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-04104,
author = {Will Rosenbaum},
title = {Finding a Winning Strategy for Wordle is NP-complete},
journal = {CoRR},
volume = {abs/2204.04104},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.04104},
doi = {10.48550/ARXIV.2204.04104},
eprinttype = {arXiv},
eprint = {2204.04104},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-04104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-01197,
author = {Talya Eden and
Jakob B{\ae}k Tejs Houen and
Shyam Narayanan and
Will Rosenbaum and
Jakub Tetek},
title = {Bias Reduction for Sum Estimation},
journal = {CoRR},
volume = {abs/2208.01197},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.01197},
doi = {10.48550/ARXIV.2208.01197},
eprinttype = {arXiv},
eprint = {2208.01197},
timestamp = {Tue, 09 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-01197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-07272,
author = {Ara Vartanian and
Will Rosenbaum and
Scott Alfeld},
title = {Training-Time Attacks against k-Nearest Neighbors},
journal = {CoRR},
volume = {abs/2208.07272},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.07272},
doi = {10.48550/ARXIV.2208.07272},
eprinttype = {arXiv},
eprint = {2208.07272},
timestamp = {Wed, 17 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-07272.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-09522,
author = {Will Rosenbaum},
title = {Packet Forwarding with a Locally Bursty Adversary},
journal = {CoRR},
volume = {abs/2208.09522},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.09522},
doi = {10.48550/ARXIV.2208.09522},
eprinttype = {arXiv},
eprint = {2208.09522},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-09522.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/ChengR21,
author = {Christine T. Cheng and
Will Rosenbaum},
editor = {P{\'{e}}ter Bir{\'{o}} and
Shuchi Chawla and
Federico Echenique},
title = {Stable Matchings with Restricted Preferences: Structure and Complexity},
booktitle = {{EC} '21: The 22nd {ACM} Conference on Economics and Computation,
Budapest, Hungary, July 18-23, 2021},
pages = {319--339},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3465456.3467618},
doi = {10.1145/3465456.3467618},
timestamp = {Fri, 09 Feb 2024 20:36:00 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/ChengR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/async/BundFLMR20,
author = {Johannes Bund and
Matthias F{\"{u}}gger and
Christoph Lenzen and
Moti Medina and
Will Rosenbaum},
title = {{PALS:} Plesiochronous and Locally Synchronous Systems},
booktitle = {26th {IEEE} International Symposium on Asynchronous Circuits and Systems,
{ASYNC} 2020, Salt Lake City, UT, USA, May 17-20, 2020},
pages = {36--43},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ASYNC49171.2020.00013},
doi = {10.1109/ASYNC49171.2020.00013},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/async/BundFLMR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/RosenbaumS20,
author = {Will Rosenbaum and
Jukka Suomela},
editor = {Yuval Emek and
Christian Cachin},
title = {Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {89--98},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405721},
doi = {10.1145/3382734.3405721},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/RosenbaumS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-05542,
author = {Johannes Bund and
Matthias F{\"{u}}gger and
Christoph Lenzen and
Moti Medina and
Will Rosenbaum},
title = {{PALS:} Plesiochronous and Locally Synchronous Systems},
journal = {CoRR},
volume = {abs/2003.05542},
year = {2020},
url = {https://arxiv.org/abs/2003.05542},
eprinttype = {arXiv},
eprint = {2003.05542},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-05542.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-08479,
author = {Christine T. Cheng and
Will Rosenbaum},
title = {Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth},
journal = {CoRR},
volume = {abs/2008.08479},
year = {2020},
url = {https://arxiv.org/abs/2008.08479},
eprinttype = {arXiv},
eprint = {2008.08479},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-08479.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-08480,
author = {Christine T. Cheng and
Will Rosenbaum},
title = {Stable Matchings with Restricted Preferences: Structure and Complexity},
journal = {CoRR},
volume = {abs/2008.08480},
year = {2020},
url = {https://arxiv.org/abs/2008.08480},
eprinttype = {arXiv},
eprint = {2008.08480},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-08480.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-04090,
author = {Talya Eden and
Dana Ron and
Will Rosenbaum},
title = {Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling
Cliques is Harder Than Counting},
journal = {CoRR},
volume = {abs/2012.04090},
year = {2020},
url = {https://arxiv.org/abs/2012.04090},
eprinttype = {arXiv},
eprint = {2012.04090},
timestamp = {Wed, 09 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-04090.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/GonczarowskiNOR19,
author = {Yannai A. Gonczarowski and
Noam Nisan and
Rafail Ostrovsky and
Will Rosenbaum},
title = {A stable marriage requires communication},
journal = {Games Econ. Behav.},
volume = {118},
pages = {626--647},
year = {2019},
url = {https://doi.org/10.1016/j.geb.2018.10.013},
doi = {10.1016/J.GEB.2018.10.013},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/geb/GonczarowskiNOR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EdenRR19,
author = {Talya Eden and
Dana Ron and
Will Rosenbaum},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {The Arboricity Captures the Complexity of Sampling Edges},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {52:1--52:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.52},
doi = {10.4230/LIPICS.ICALP.2019.52},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/EdenRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/Patt-ShamirR19,
author = {Boaz Patt{-}Shamir and
Will Rosenbaum},
title = {Space-Optimal Packet Routing on Trees},
booktitle = {2019 {IEEE} Conference on Computer Communications, {INFOCOM} 2019,
Paris, France, April 29 - May 2, 2019},
pages = {1036--1044},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/INFOCOM.2019.8737596},
doi = {10.1109/INFOCOM.2019.8737596},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/Patt-ShamirR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/MillerPR19,
author = {Avery Miller and
Boaz Patt{-}Shamir and
Will Rosenbaum},
editor = {Peter Robinson and
Faith Ellen},
title = {With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for
Routing},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {117--126},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3331614},
doi = {10.1145/3293611.3331614},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/MillerPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BundLR19,
author = {Johannes Bund and
Christoph Lenzen and
Will Rosenbaum},
editor = {Peter Robinson and
Faith Ellen},
title = {Fault Tolerant Gradient Clock Synchronization},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {357--365},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3331637},
doi = {10.1145/3293611.3331637},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BundLR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08042,
author = {Johannes Bund and
Christoph Lenzen and
Will Rosenbaum},
title = {Fault Tolerant Gradient Clock Synchronization},
journal = {CoRR},
volume = {abs/1902.08042},
year = {2019},
url = {http://arxiv.org/abs/1902.08042},
eprinttype = {arXiv},
eprint = {1902.08042},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08069,
author = {Avery Miller and
Boaz Patt{-}Shamir and
Will Rosenbaum},
title = {With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for
Routing},
journal = {CoRR},
volume = {abs/1902.08069},
year = {2019},
url = {http://arxiv.org/abs/1902.08069},
eprinttype = {arXiv},
eprint = {1902.08069},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08086,
author = {Talya Eden and
Dana Ron and
Will Rosenbaum},
title = {The Arboricity Captures the Complexity of Sampling Edges},
journal = {CoRR},
volume = {abs/1902.08086},
year = {2019},
url = {http://arxiv.org/abs/1902.08086},
eprinttype = {arXiv},
eprint = {1902.08086},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08086.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-08160,
author = {Will Rosenbaum and
Jukka Suomela},
title = {Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems},
journal = {CoRR},
volume = {abs/1907.08160},
year = {2019},
url = {http://arxiv.org/abs/1907.08160},
eprinttype = {arXiv},
eprint = {1907.08160},
timestamp = {Tue, 23 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-08160.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EdenR18,
author = {Talya Eden and
Will Rosenbaum},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Lower Bounds for Approximating Graph Parameters via Communication
Complexity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {11:1--11:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.11},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.11},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/EdenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EdenR18,
author = {Talya Eden and
Will Rosenbaum},
editor = {Raimund Seidel},
title = {On Sampling Edges Almost Uniformly},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {7:1--7:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.7},
doi = {10.4230/OASICS.SOSA.2018.7},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/EdenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Patt-ShamirR17,
author = {Boaz Patt{-}Shamir and
Will Rosenbaum},
editor = {Elad Michael Schiller and
Alexander A. Schwarzmann},
title = {The Space Requirement of Local Forwarding on Acyclic Networks},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,
{PODC} 2017, Washington, DC, USA, July 25-27, 2017},
pages = {13--22},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087801.3087803},
doi = {10.1145/3087801.3087803},
timestamp = {Tue, 06 Nov 2018 11:07:18 +0100},
biburl = {https://dblp.org/rec/conf/podc/Patt-ShamirR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/OstrovskyPR17,
author = {Rafail Ostrovsky and
Mor Perry and
Will Rosenbaum},
editor = {Shantanu Das and
S{\'{e}}bastien Tixeuil},
title = {Space-Time Tradeoffs for Distributed Verification},
booktitle = {Structural Information and Communication Complexity - 24th International
Colloquium, {SIROCCO} 2017, Porquerolles, France, June 19-22, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10641},
pages = {53--70},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-72050-0\_4},
doi = {10.1007/978-3-319-72050-0\_4},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/OstrovskyPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EdenR17,
author = {Talya Eden and
Will Rosenbaum},
title = {On Sampling Edges Almost Uniformly},
journal = {CoRR},
volume = {abs/1706.09748},
year = {2017},
url = {http://arxiv.org/abs/1706.09748},
eprinttype = {arXiv},
eprint = {1706.09748},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EdenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-04262,
author = {Talya Eden and
Will Rosenbaum},
title = {Lower Bounds for Approximating Graph Parameters via Communication
Complexity},
journal = {CoRR},
volume = {abs/1709.04262},
year = {2017},
url = {http://arxiv.org/abs/1709.04262},
eprinttype = {arXiv},
eprint = {1709.04262},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-04262.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Rosenbaum16,
author = {Will Rosenbaum},
title = {Distributed Almost Stable Matchings},
school = {University of California, Los Angeles, {USA}},
year = {2016},
url = {https://www.escholarship.org/uc/item/6pr8d66m},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Rosenbaum16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BaruchOR16,
author = {Mor Baruch and
Rafail Ostrovsky and
Will Rosenbaum},
editor = {George Giakkoupis},
title = {Brief Announcement: Space-Time Tradeoffs for Distributed Verification},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {357--359},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933071},
doi = {10.1145/2933057.2933071},
timestamp = {Tue, 06 Nov 2018 11:07:19 +0100},
biburl = {https://dblp.org/rec/conf/podc/BaruchOR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaruchOR16,
author = {Mor Baruch and
Rafail Ostrovsky and
Will Rosenbaum},
title = {Space-Time Tradeoffs for Distributed Verification},
journal = {CoRR},
volume = {abs/1605.06814},
year = {2016},
url = {http://arxiv.org/abs/1605.06814},
eprinttype = {arXiv},
eprint = {1605.06814},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaruchOR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/OstrovskyR15,
author = {Rafail Ostrovsky and
Will Rosenbaum},
editor = {Chryssis Georgiou and
Paul G. Spirakis},
title = {Fast Distributed Almost Stable Matchings},
booktitle = {Proceedings of the 2015 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2015, Donostia-San Sebasti{\'{a}}n, Spain,
July 21 - 23, 2015},
pages = {101--108},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2767386.2767424},
doi = {10.1145/2767386.2767424},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/OstrovskyR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GonczarowskiNOR15,
author = {Yannai A. Gonczarowski and
Noam Nisan and
Rafail Ostrovsky and
Will Rosenbaum},
editor = {Piotr Indyk},
title = {A Stable Marriage Requires Communication},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1003--1017},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.68},
doi = {10.1137/1.9781611973730.68},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/GonczarowskiNOR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GonczarowskiNOR14,
author = {Yannai A. Gonczarowski and
Noam Nisan and
Rafail Ostrovsky and
Will Rosenbaum},
title = {A Stable Marriage Requires Communication},
journal = {CoRR},
volume = {abs/1405.7709},
year = {2014},
url = {http://arxiv.org/abs/1405.7709},
eprinttype = {arXiv},
eprint = {1405.7709},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GonczarowskiNOR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/OstrovskyR14a,
author = {Rafail Ostrovsky and
Will Rosenbaum},
title = {Fast distributed almost stable marriages},
journal = {CoRR},
volume = {abs/1408.2782},
year = {2014},
url = {http://arxiv.org/abs/1408.2782},
eprinttype = {arXiv},
eprint = {1408.2782},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/OstrovskyR14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/OstrovskyR14b,
author = {Rafail Ostrovsky and
Will Rosenbaum},
title = {It's Not Easy Being Three: The Approximability of Three-Dimensional
Stable Matching Problems},
journal = {CoRR},
volume = {abs/1412.1130},
year = {2014},
url = {http://arxiv.org/abs/1412.1130},
eprinttype = {arXiv},
eprint = {1412.1130},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/OstrovskyR14b.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 02:06 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:
