Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Rotem Oshman
@article{DBLP:journals/corr/abs-2403-14445, author = {Hagit Attiya and Michael A. Bender and Martin Farach{-}Colton and Rotem Oshman and Noa Schiller}, title = {History-Independent Concurrent Objects}, journal = {CoRR}, volume = {abs/2403.14445}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.14445}, doi = {10.48550/ARXIV.2403.14445}, eprinttype = {arXiv}, eprint = {2403.14445}, timestamp = {Tue, 09 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-14445.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dc/FischerO23, author = {Orr Fischer and Rotem Oshman}, title = {A distributed algorithm for directed minimum-weight spanning tree}, journal = {Distributed Comput.}, volume = {36}, number = {1}, pages = {57--87}, year = {2023}, url = {https://doi.org/10.1007/s00446-021-00398-3}, doi = {10.1007/S00446-021-00398-3}, timestamp = {Wed, 08 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dc/FischerO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/OshmanR23, author = {Rotem Oshman and Tal Roth}, editor = {Kousha Etessami and Uriel Feige and Gabriele Puppis}, title = {The Communication Complexity of Set Intersection Under Product Distributions}, booktitle = {50th International Colloquium on Automata, Languages, and Programming, {ICALP} 2023, July 10-14, 2023, Paderborn, Germany}, series = {LIPIcs}, volume = {261}, pages = {95:1--95:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.95}, doi = {10.4230/LIPICS.ICALP.2023.95}, timestamp = {Wed, 05 Jul 2023 16:19:52 +0200}, biburl = {https://dblp.org/rec/conf/icalp/OshmanR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/MeirOSV23, author = {Uri Meir and Rotem Oshman and Ofer Shayevitz and Yuval Volkov}, editor = {Yael Tauman Kalai}, title = {Resilience of 3-Majority Dynamics to Non-Uniform Schedulers}, booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS} 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}}, series = {LIPIcs}, volume = {251}, pages = {86:1--86:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.86}, doi = {10.4230/LIPICS.ITCS.2023.86}, timestamp = {Thu, 02 Feb 2023 12:50:42 +0100}, biburl = {https://dblp.org/rec/conf/innovations/MeirOSV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/opodis/TshuvaO23, author = {Eden Aldema Tshuva and Rotem Oshman}, editor = {Alysson Bessani and Xavier D{\'{e}}fago and Junya Nakamura and Koichi Wada and Yukiko Yamauchi}, title = {On Polynomial Time Local Decision}, booktitle = {27th International Conference on Principles of Distributed Systems, {OPODIS} 2023, December 6-8, 2023, Tokyo, Japan}, series = {LIPIcs}, volume = {286}, pages = {27:1--27:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.OPODIS.2023.27}, doi = {10.4230/LIPICS.OPODIS.2023.27}, timestamp = {Fri, 19 Jan 2024 14:57:09 +0100}, biburl = {https://dblp.org/rec/conf/opodis/TshuvaO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/TshuvaBCMO23, author = {Eden Aldema Tshuva and Elette Boyle and Ran Cohen and Tal Moran and Rotem Oshman}, editor = {Guy N. Rothblum and Hoeteck Wee}, title = {Locally Verifiable Distributed SNARGs}, booktitle = {Theory of Cryptography - 21st International Conference, {TCC} 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {14369}, pages = {65--90}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-48615-9\_3}, doi = {10.1007/978-3-031-48615-9\_3}, timestamp = {Wed, 06 Dec 2023 13:56:14 +0100}, biburl = {https://dblp.org/rec/conf/tcc/TshuvaBCMO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/podc/2023, editor = {Rotem Oshman and Alexandre Nolin and Magn{\'{u}}s M. Halld{\'{o}}rsson and Alkida Balliu}, title = {Proceedings of the 2023 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2023, Orlando, FL, USA, June 19-23, 2023}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3583668}, doi = {10.1145/3583668}, timestamp = {Mon, 19 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/2023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wdag/2023, editor = {Rotem Oshman}, title = {37th International Symposium on Distributed Computing, {DISC} 2023, October 10-12, 2023, L'Aquila, Italy}, series = {LIPIcs}, volume = {281}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-301-0}, isbn = {978-3-95977-301-0}, timestamp = {Thu, 05 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/2023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-14692, author = {Orr Fischer and Adi Horowitz and Rotem Oshman}, title = {Massively Parallel Computation in a Heterogeneous Regime}, journal = {CoRR}, volume = {abs/2302.14692}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.14692}, doi = {10.48550/ARXIV.2302.14692}, eprinttype = {arXiv}, eprint = {2302.14692}, timestamp = {Thu, 02 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-14692.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dc/EdenFFKO22, author = {Talya Eden and Nimrod Fiat and Orr Fischer and Fabian Kuhn and Rotem Oshman}, title = {Sublinear-time distributed algorithms for detecting small cliques and even cycles}, journal = {Distributed Comput.}, volume = {35}, number = {3}, pages = {207--234}, year = {2022}, url = {https://doi.org/10.1007/s00446-021-00409-3}, doi = {10.1007/S00446-021-00409-3}, timestamp = {Wed, 25 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dc/EdenFFKO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Censor-HillelFG22, author = {Keren Censor{-}Hillel and Orr Fischer and Fran{\c{c}}ois Le Gall and Dean Leitersdorf and Rotem Oshman}, editor = {Mark Braverman}, title = {Quantum Distributed Algorithms for Detection of Cliques}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {35:1--35:25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.35}, doi = {10.4230/LIPICS.ITCS.2022.35}, timestamp = {Wed, 26 Jan 2022 14:33:51 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Censor-HillelFG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/TshuvaO22, author = {Eden Aldema Tshuva and Rotem Oshman}, editor = {Alessia Milani and Philipp Woelfel}, title = {Brief Announcement: On Polynomial-Time Local Decision}, booktitle = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}, pages = {48--50}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519270.3538463}, doi = {10.1145/3519270.3538463}, timestamp = {Mon, 25 Jul 2022 15:01:51 +0200}, biburl = {https://dblp.org/rec/conf/podc/TshuvaO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/FischerHO22, author = {Orr Fischer and Adi Horowitz and Rotem Oshman}, editor = {Alessia Milani and Philipp Woelfel}, title = {Massively Parallel Computation in a Heterogeneous Regime}, booktitle = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}, pages = {345--355}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519270.3538450}, doi = {10.1145/3519270.3538450}, timestamp = {Mon, 25 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/FischerHO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/ShimonFO22, author = {Yoav Ben Shimon and Orr Fischer and Rotem Oshman}, editor = {Merav Parter}, title = {Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs}, booktitle = {Structural Information and Communication Complexity - 29th International Colloquium, {SIROCCO} 2022, Paderborn, Germany, June 27-29, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13298}, pages = {21--41}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-09993-9\_2}, doi = {10.1007/978-3-031-09993-9\_2}, timestamp = {Tue, 28 Jun 2022 16:23:40 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/ShimonFO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BickKO22, author = {Aviv Bick and Gillat Kol and Rotem Oshman}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {Distributed Zero-Knowledge Proofs Over Networks}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {2426--2458}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.97}, doi = {10.1137/1.9781611977073.97}, timestamp = {Tue, 12 Apr 2022 11:24:56 +0200}, biburl = {https://dblp.org/rec/conf/soda/BickKO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2201-03000, author = {Keren Censor{-}Hillel and Orr Fischer and Fran{\c{c}}ois Le Gall and Dean Leitersdorf and Rotem Oshman}, title = {Quantum Distributed Algorithms for Detection of Cliques}, journal = {CoRR}, volume = {abs/2201.03000}, year = {2022}, url = {https://arxiv.org/abs/2201.03000}, eprinttype = {arXiv}, eprint = {2201.03000}, timestamp = {Thu, 20 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2201-03000.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/entropy/Ben-YishaiKOS21, author = {Assaf Ben{-}Yishai and Young{-}Han Kim and Rotem Oshman and Ofer Shayevitz}, title = {On the Interactive Capacity of Finite-State Protocols}, journal = {Entropy}, volume = {23}, number = {1}, pages = {17}, year = {2021}, url = {https://doi.org/10.3390/e23010017}, doi = {10.3390/E23010017}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/entropy/Ben-YishaiKOS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/opodis/FischerOS21, author = {Orr Fischer and Rotem Oshman and Dana Shamir}, editor = {Quentin Bramas and Vincent Gramoli and Alessia Milani}, title = {Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators}, booktitle = {25th International Conference on Principles of Distributed Systems, {OPODIS} 2021, December 13-15, 2021, Strasbourg, France}, series = {LIPIcs}, volume = {217}, pages = {21:1--21:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.OPODIS.2021.21}, doi = {10.4230/LIPICS.OPODIS.2021.21}, timestamp = {Mon, 28 Feb 2022 16:25:59 +0100}, biburl = {https://dblp.org/rec/conf/opodis/FischerOS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DershowitzOR21, author = {Nachum Dershowitz and Rotem Oshman and Tal Roth}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {The communication complexity of multiparty set disjointness under product distributions}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {1194--1207}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3451106}, doi = {10.1145/3406325.3451106}, timestamp = {Tue, 22 Jun 2021 19:47:11 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DershowitzOR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/SolodkinO21, author = {Lior Solodkin and Rotem Oshman}, editor = {Seth Gilbert}, title = {Truthful Information Dissemination in General Asynchronous Networks}, booktitle = {35th International Symposium on Distributed Computing, {DISC} 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {209}, pages = {37:1--37:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.DISC.2021.37}, doi = {10.4230/LIPICS.DISC.2021.37}, timestamp = {Mon, 25 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/SolodkinO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/opodis/2020, editor = {Quentin Bramas and Rotem Oshman and Paolo Romano}, title = {24th International Conference on Principles of Distributed Systems, {OPODIS} 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference)}, series = {LIPIcs}, volume = {184}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-176-4}, isbn = {978-3-95977-176-4}, timestamp = {Mon, 25 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/opodis/2020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-07590, author = {Keren Censor{-}Hillel and Orr Fischer and Tzlil Gonen and Fran{\c{c}}ois Le Gall and Dean Leitersdorf and Rotem Oshman}, title = {Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs}, journal = {CoRR}, volume = {abs/2101.07590}, year = {2021}, url = {https://arxiv.org/abs/2101.07590}, eprinttype = {arXiv}, eprint = {2101.07590}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-07590.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2105-01958, author = {Iftach Haitner and Noam Mazor and Rotem Oshman and Omer Reingold and Amir Yehudayoff}, title = {On the Communication Complexity of Key-Agreement Protocols}, journal = {CoRR}, volume = {abs/2105.01958}, year = {2021}, url = {https://arxiv.org/abs/2105.01958}, eprinttype = {arXiv}, eprint = {2105.01958}, timestamp = {Wed, 12 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-01958.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FischerOZ20, author = {Orr Fischer and Rotem Oshman and Uri Zwick}, title = {Public vs. private randomness in simultaneous multi-party communication complexity}, journal = {Theor. Comput. Sci.}, volume = {810}, pages = {72--81}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2018.04.032}, doi = {10.1016/J.TCS.2018.04.032}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FischerOZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/AssadiKO20, author = {Sepehr Assadi and Gillat Kol and Rotem Oshman}, editor = {Yuval Emek and Christian Cachin}, title = {Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {79--88}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405732}, doi = {10.1145/3382734.3405732}, timestamp = {Tue, 04 Aug 2020 16:04:51 +0200}, biburl = {https://dblp.org/rec/conf/podc/AssadiKO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/Censor-HillelFG20, author = {Keren Censor{-}Hillel and Orr Fischer and Tzlil Gonen and Fran{\c{c}}ois Le Gall and Dean Leitersdorf and Rotem Oshman}, editor = {Hagit Attiya}, title = {Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs}, booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020, October 12-16, 2020, Virtual Conference}, series = {LIPIcs}, volume = {179}, pages = {33:1--33:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.DISC.2020.33}, doi = {10.4230/LIPICS.DISC.2020.33}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/Censor-HillelFG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-00499, author = {Assaf Ben{-}Yishai and Young{-}Han Kim and Rotem Oshman and Ofer Shayevitz}, title = {On the Interactive Capacity of Finite-State Protocols}, journal = {CoRR}, volume = {abs/2001.00499}, year = {2020}, url = {http://arxiv.org/abs/2001.00499}, eprinttype = {arXiv}, eprint = {2001.00499}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-00499.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/HaitnerMORY19, author = {Iftach Haitner and Noam Mazor and Rotem Oshman and Omer Reingold and Amir Yehudayoff}, editor = {Avrim Blum}, title = {On the Communication Complexity of Key-Agreement Protocols}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {40:1--40:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.40}, doi = {10.4230/LIPICS.ITCS.2019.40}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/HaitnerMORY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/MeirMO19, author = {Uri Meir and Dor Minzer and Rotem Oshman}, editor = {Peter Robinson and Faith Ellen}, title = {Can Distributed Uniformity Testing Be Local?}, booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019}, pages = {228--237}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3293611.3331613}, doi = {10.1145/3293611.3331613}, timestamp = {Fri, 19 Jul 2019 08:02:49 +0200}, biburl = {https://dblp.org/rec/conf/podc/MeirMO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/FraigniaudMORT19, author = {Pierre Fraigniaud and Pedro Montealegre and Rotem Oshman and Ivan Rapaport and Ioan Todinca}, editor = {Keren Censor{-}Hillel and Michele Flammini}, title = {On Distributed Merlin-Arthur Decision Protocols}, booktitle = {Structural Information and Communication Complexity - 26th International Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11639}, pages = {230--245}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-24922-9\_16}, doi = {10.1007/978-3-030-24922-9\_16}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/FraigniaudMORT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/BravermanKOT19, author = {Mark Braverman and Gillat Kol and Rotem Oshman and Avishay Tal}, editor = {Jukka Suomela}, title = {On the Computational Power of Radio Channels}, booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019, October 14-18, 2019, Budapest, Hungary}, series = {LIPIcs}, volume = {146}, pages = {8:1--8:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.DISC.2019.8}, doi = {10.4230/LIPICS.DISC.2019.8}, timestamp = {Wed, 09 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/BravermanKOT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/EdenFFKO19, author = {Talya Eden and Nimrod Fiat and Orr Fischer and Fabian Kuhn and Rotem Oshman}, editor = {Jukka Suomela}, title = {Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles}, booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019, October 14-18, 2019, Budapest, Hungary}, series = {LIPIcs}, volume = {146}, pages = {15:1--15:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.DISC.2019.15}, doi = {10.4230/LIPICS.DISC.2019.15}, timestamp = {Wed, 09 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/EdenFFKO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/FischerO19, author = {Orr Fischer and Rotem Oshman}, editor = {Jukka Suomela}, title = {A Distributed Algorithm for Directed Minimum-Weight Spanning Tree}, booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019, October 14-18, 2019, Budapest, Hungary}, series = {LIPIcs}, volume = {146}, pages = {16:1--16:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.DISC.2019.16}, doi = {10.4230/LIPICS.DISC.2019.16}, timestamp = {Wed, 09 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/FischerO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/KolOS18, author = {Gillat Kol and Rotem Oshman and Raghuvansh R. Saxena}, editor = {Calvin Newport and Idit Keidar}, title = {Interactive Distributed Proofs}, booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018}, pages = {255--264}, publisher = {{ACM}}, year = {2018}, url = {https://dl.acm.org/citation.cfm?id=3212771}, timestamp = {Mon, 26 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/KolOS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/FischerMO18, author = {Orr Fischer and Uri Meir and Rotem Oshman}, editor = {Calvin Newport and Idit Keidar}, title = {Distributed Uniformity Testing}, booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018}, pages = {455--464}, publisher = {{ACM}}, year = {2018}, url = {https://dl.acm.org/citation.cfm?id=3212772}, timestamp = {Mon, 26 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/FischerMO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/FischerGKO18, author = {Orr Fischer and Tzlil Gonen and Fabian Kuhn and Rotem Oshman}, editor = {Christian Scheideler and Jeremy T. Fineman}, title = {Possibilities and Impossibilities for Distributed Subgraph Detection}, booktitle = {Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, {SPAA} 2018, Vienna, Austria, July 16-18, 2018}, pages = {153--162}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3210377.3210401}, doi = {10.1145/3210377.3210401}, timestamp = {Wed, 21 Nov 2018 12:44:27 +0100}, biburl = {https://dblp.org/rec/conf/spaa/FischerGKO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/AhmadiKO18, author = {Mohamad Ahmadi and Fabian Kuhn and Rotem Oshman}, editor = {Ulrich Schmid and Josef Widder}, title = {Distributed Approximate Maximum Matching in the {CONGEST} Model}, booktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}, series = {LIPIcs}, volume = {121}, pages = {6:1--6:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.DISC.2018.6}, doi = {10.4230/LIPICS.DISC.2018.6}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/wdag/AhmadiKO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HaitnerMORY18, author = {Iftach Haitner and Noam Mazor and Rotem Oshman and Omer Reingold and Amir Yehudayoff}, title = {On the Communication Complexity of Key-Agreement Protocols}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-031}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/031}, eprinttype = {ECCC}, eprint = {TR18-031}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HaitnerMORY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BravermanO17, author = {Mark Braverman and Rotem Oshman}, editor = {Chris Umans}, title = {A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness}, booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2017, Berkeley, CA, USA, October 15-17, 2017}, pages = {144--155}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/FOCS.2017.22}, doi = {10.1109/FOCS.2017.22}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BravermanO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/opodis/GonenO17, author = {Tzlil Gonen and Rotem Oshman}, editor = {James Aspnes and Alysson Bessani and Pascal Felber and Jo{\~{a}}o Leit{\~{a}}o}, title = {Lower Bounds for Subgraph Detection in the {CONGEST} Model}, booktitle = {21st International Conference on Principles of Distributed Systems, {OPODIS} 2017, Lisbon, Portugal, December 18-20, 2017}, series = {LIPIcs}, volume = {95}, pages = {6:1--6:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.OPODIS.2017.6}, doi = {10.4230/LIPICS.OPODIS.2017.6}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/opodis/GonenO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/FischerGO17, author = {Orr Fischer and Shay Gershtein and Rotem Oshman}, editor = {Elad Michael Schiller and Alexander A. Schwarzmann}, title = {On the Multiparty Communication Complexity of Testing Triangle-Freeness}, booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing, {PODC} 2017, Washington, DC, USA, July 25-27, 2017}, pages = {111--120}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3087801.3087821}, doi = {10.1145/3087801.3087821}, timestamp = {Tue, 06 Nov 2018 11:07:18 +0100}, biburl = {https://dblp.org/rec/conf/podc/FischerGO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/EvenFFGLMMOORT17, author = {Guy Even and Orr Fischer and Pierre Fraigniaud and Tzlil Gonen and Reut Levi and Moti Medina and Pedro Montealegre and Dennis Olivetti and Rotem Oshman and Ivan Rapaport and Ioan Todinca}, editor = {Andr{\'{e}}a W. Richa}, title = {Three Notes on Distributed Property Testing}, booktitle = {31st International Symposium on Distributed Computing, {DISC} 2017, October 16-20, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {91}, pages = {15:1--15:30}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.DISC.2017.15}, doi = {10.4230/LIPICS.DISC.2017.15}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wdag/EvenFFGLMMOORT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/KolOS17, author = {Gillat Kol and Rotem Oshman and Dafna Sadeh}, editor = {Andr{\'{e}}a W. Richa}, title = {Interactive Compression for Multi-Party Protocol}, booktitle = {31st International Symposium on Distributed Computing, {DISC} 2017, October 16-20, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {91}, pages = {31:1--31:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.DISC.2017.31}, doi = {10.4230/LIPICS.DISC.2017.31}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/KolOS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FischerGO17, author = {Orr Fischer and Tzlil Gonen and Rotem Oshman}, title = {Distributed Property Testing for Subgraph-Freeness Revisited}, journal = {CoRR}, volume = {abs/1705.04033}, year = {2017}, url = {http://arxiv.org/abs/1705.04033}, eprinttype = {arXiv}, eprint = {1705.04033}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FischerGO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FischerGO17a, author = {Orr Fischer and Shay Gershtein and Rotem Oshman}, title = {On The Multiparty Communication Complexity of Testing Triangle-Freeness}, journal = {CoRR}, volume = {abs/1705.08438}, year = {2017}, url = {http://arxiv.org/abs/1705.08438}, eprinttype = {arXiv}, eprint = {1705.08438}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FischerGO17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-06920, author = {Orr Fischer and Tzlil Gonen and Rotem Oshman}, title = {Superlinear Lower Bounds for Distributed Subgraph Detection}, journal = {CoRR}, volume = {abs/1711.06920}, year = {2017}, url = {http://arxiv.org/abs/1711.06920}, eprinttype = {arXiv}, eprint = {1711.06920}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-06920.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/FischerOZ16, author = {Orr Fischer and Rotem Oshman and Uri Zwick}, editor = {Jukka Suomela}, title = {Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity}, booktitle = {Structural Information and Communication Complexity - 23rd International Colloquium, {SIROCCO} 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9988}, pages = {60--74}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-48314-6\_5}, doi = {10.1007/978-3-319-48314-6\_5}, timestamp = {Tue, 29 Dec 2020 18:39:44 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/FischerOZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/BravermanO15, author = {Mark Braverman and Rotem Oshman}, editor = {Chryssis Georgiou and Paul G. Spirakis}, title = {On Information Complexity in the Broadcast Model}, 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 = {355--364}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2767386.2767425}, doi = {10.1145/2767386.2767425}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/BravermanO15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BravermanO15, author = {Mark Braverman and Rotem Oshman}, title = {The Communication Complexity of Number-In-Hand Set Disjointness with No Promise}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-002}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/002}, eprinttype = {ECCC}, eprint = {TR15-002}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BravermanO15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/DruckerKO13, author = {Andrew Drucker and Fabian Kuhn and Rotem Oshman}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Shlomi Dolev}, title = {On the power of the congested clique model}, booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '14, Paris, France, July 15-18, 2014}, pages = {367--376}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2611462.2611493}, doi = {10.1145/2611462.2611493}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/DruckerKO13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/Oshman14, author = {Rotem Oshman}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson}, title = {Communication Complexity Lower Bounds in Distributed Message-Passing}, booktitle = {Structural Information and Communication Complexity - 21st International Colloquium, {SIROCCO} 2014, Takayama, Japan, July 23-25, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8576}, pages = {14--17}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-09620-9\_2}, doi = {10.1007/978-3-319-09620-9\_2}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/Oshman14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BravermanEOPV13, author = {Mark Braverman and Faith Ellen and Rotem Oshman and Toniann Pitassi and Vinod Vaikuntanathan}, title = {A Tight Bound for Set Disjointness in the Message-Passing Model}, booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2013, 26-29 October, 2013, Berkeley, CA, {USA}}, pages = {668--677}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/FOCS.2013.77}, doi = {10.1109/FOCS.2013.77}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BravermanEOPV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/OshmanS13, author = {Rotem Oshman and Nir Shavit}, editor = {Panagiota Fatourou and Gadi Taubenfeld}, title = {The SkipTrie: low-depth concurrent search without rebalancing}, booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '13, Montreal, QC, Canada, July 22-24, 2013}, pages = {23--32}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2484239.2484270}, doi = {10.1145/2484239.2484270}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/OshmanS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-4696, author = {Mark Braverman and Faith Ellen and Rotem Oshman and Toniann Pitassi and Vinod Vaikuntanathan}, title = {Tight Bounds for Set Disjointness in the Message Passing Model}, journal = {CoRR}, volume = {abs/1305.4696}, year = {2013}, url = {http://arxiv.org/abs/1305.4696}, eprinttype = {arXiv}, eprint = {1305.4696}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-4696.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/DruckerKO12, author = {Andrew Drucker and Fabian Kuhn and Rotem Oshman}, editor = {Darek Kowalski and Alessandro Panconesi}, title = {The communication complexity of distributed task allocation}, booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '12, Funchal, Madeira, Portugal, July 16-18, 2012}, pages = {67--76}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2332432.2332443}, doi = {10.1145/2332432.2332443}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/DruckerKO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/KuhnLO11, author = {Fabian Kuhn and Thomas Locher and Rotem Oshman}, title = {Gradient Clock Synchronization in Dynamic Networks}, journal = {Theory Comput. Syst.}, volume = {49}, number = {4}, pages = {781--816}, year = {2011}, url = {https://doi.org/10.1007/s00224-011-9348-1}, doi = {10.1007/S00224-011-9348-1}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/KuhnLO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/KuhnO11, author = {Fabian Kuhn and Rotem Oshman}, title = {Dynamic networks: models and algorithms}, journal = {{SIGACT} News}, volume = {42}, number = {1}, pages = {82--96}, year = {2011}, url = {https://doi.org/10.1145/1959045.1959064}, doi = {10.1145/1959045.1959064}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/KuhnO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/KuhnOM11, author = {Fabian Kuhn and Yoram Moses and Rotem Oshman}, editor = {Cyril Gavoille and Pierre Fraigniaud}, title = {Coordinated consensus in dynamic networks}, booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2011, San Jose, CA, USA, June 6-8, 2011}, pages = {1--10}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993806.1993808}, doi = {10.1145/1993806.1993808}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/KuhnOM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/MoscibrodaO11, author = {Thomas Moscibroda and Rotem Oshman}, editor = {Cyril Gavoille and Pierre Fraigniaud}, title = {Resilience of mutual exclusion algorithms to transient memory faults}, booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2011, San Jose, CA, USA, June 6-8, 2011}, pages = {69--78}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993806.1993817}, doi = {10.1145/1993806.1993817}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/MoscibrodaO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/KuhnO11, author = {Fabian Kuhn and Rotem Oshman}, editor = {David Peleg}, title = {The Complexity of Data Aggregation in Directed Networks}, booktitle = {Distributed Computing - 25th International Symposium, {DISC} 2011, Rome, Italy, September 20-22, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6950}, pages = {416--431}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-24100-0\_40}, doi = {10.1007/978-3-642-24100-0\_40}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/wdag/KuhnO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/KuhnLNOR10, author = {Fabian Kuhn and Nancy A. Lynch and Calvin C. Newport and Rotem Oshman and Andr{\'{e}}a W. Richa}, editor = {Andr{\'{e}}a W. Richa and Rachid Guerraoui}, title = {Broadcasting in unreliable radio networks}, booktitle = {Proceedings of the 29th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2010, Zurich, Switzerland, July 25-28, 2010}, pages = {336--345}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1835698.1835779}, doi = {10.1145/1835698.1835779}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/KuhnLNOR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/KuhnLLO10, author = {Fabian Kuhn and Christoph Lenzen and Thomas Locher and Rotem Oshman}, editor = {Andr{\'{e}}a W. Richa and Rachid Guerraoui}, title = {Optimal gradient clock synchronization in dynamic networks}, booktitle = {Proceedings of the 29th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2010, Zurich, Switzerland, July 25-28, 2010}, pages = {430--439}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1835698.1835799}, doi = {10.1145/1835698.1835799}, timestamp = {Thu, 24 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/KuhnLLO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KuhnLO10, author = {Fabian Kuhn and Nancy A. Lynch and Rotem Oshman}, editor = {Leonard J. Schulman}, title = {Distributed computation in dynamic networks}, booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC} 2010, Cambridge, Massachusetts, USA, 5-8 June 2010}, pages = {513--522}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1806689.1806760}, doi = {10.1145/1806689.1806760}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KuhnLO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1005-2894, author = {Fabian Kuhn and Christoph Lenzen and Thomas Locher and Rotem Oshman}, title = {Optimal Gradient Clock Synchronization in Dynamic Networks}, journal = {CoRR}, volume = {abs/1005.2894}, year = {2010}, url = {http://arxiv.org/abs/1005.2894}, eprinttype = {arXiv}, eprint = {1005.2894}, timestamp = {Thu, 24 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1005-2894.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/opodis/KuhnO09, author = {Fabian Kuhn and Rotem Oshman}, editor = {Tarek F. Abdelzaher and Michel Raynal and Nicola Santoro}, title = {Gradient Clock Synchronization Using Reference Broadcasts}, booktitle = {Principles of Distributed Systems, 13th International Conference, {OPODIS} 2009, N{\^{\i}}mes, France, December 15-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5923}, pages = {204--218}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10877-8\_17}, doi = {10.1007/978-3-642-10877-8\_17}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/opodis/KuhnO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/KuhnLO09, author = {Fabian Kuhn and Thomas Locher and Rotem Oshman}, editor = {Friedhelm Meyer auf der Heide and Michael A. Bender}, title = {Gradient clock synchronization in dynamic networks}, booktitle = {{SPAA} 2009: Proceedings of the 21st Annual {ACM} Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}, pages = {270--279}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1583991.1584059}, doi = {10.1145/1583991.1584059}, timestamp = {Wed, 21 Nov 2018 11:15:22 +0100}, biburl = {https://dblp.org/rec/conf/spaa/KuhnLO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/vmcai/Oshman09, author = {Rotem Oshman}, editor = {Neil D. Jones and Markus M{\"{u}}ller{-}Olm}, title = {An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking}, booktitle = {Verification, Model Checking, and Abstract Interpretation, 10th International Conference, {VMCAI} 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5403}, pages = {275--289}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-540-93900-9\_23}, doi = {10.1007/978-3-540-93900-9\_23}, timestamp = {Tue, 14 May 2019 10:00:43 +0200}, biburl = {https://dblp.org/rec/conf/vmcai/Oshman09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0905-3454, author = {Fabian Kuhn and Rotem Oshman}, title = {Gradient Clock Synchronization using Reference Broadcasts}, journal = {CoRR}, volume = {abs/0905.3454}, year = {2009}, url = {http://arxiv.org/abs/0905.3454}, eprinttype = {arXiv}, eprint = {0905.3454}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0905-3454.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/atva/OshmanG07, author = {Rotem Oshman and Orna Grumberg}, editor = {Kedar S. Namjoshi and Tomohiro Yoneda and Teruo Higashino and Yoshio Okamura}, title = {A New Approach to Bounded Model Checking for Branching Time Logics}, booktitle = {Automated Technology for Verification and Analysis, 5th International Symposium, {ATVA} 2007, Tokyo, Japan, October 22-25, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4762}, pages = {410--424}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-75596-8\_29}, doi = {10.1007/978-3-540-75596-8\_29}, timestamp = {Tue, 14 May 2019 10:00:49 +0200}, biburl = {https://dblp.org/rec/conf/atva/OshmanG07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.