Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Peter Robinson 0002
@inproceedings{DBLP:conf/innovations/DufoulonPPP024,
author = {Fabien Dufoulon and
Shreyas Pai and
Gopal Pandurangan and
Sriram V. Pemmaraju and
Peter Robinson},
editor = {Venkatesan Guruswami},
title = {The Message Complexity of Distributed Graph Optimization},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {41:1--41:26},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.41},
doi = {10.4230/LIPICS.ITCS.2024.41},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DufoulonPPP024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Li0024,
author = {Minming Li and
Peter Robinson and
Xianbin Zhu},
editor = {Venkatesan Guruswami},
title = {Dynamic Maximal Matching in Clique Networks},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {73:1--73:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.73},
doi = {10.4230/LIPICS.ITCS.2024.73},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Li0024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-11991,
author = {Shay Kutten and
Peter Robinson and
Ming Ming Tan},
title = {Tight Bounds on the Message Complexity of Distributed Tree Verification},
journal = {CoRR},
volume = {abs/2401.11991},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.11991},
doi = {10.48550/ARXIV.2401.11991},
eprinttype = {arXiv},
eprint = {2401.11991},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-11991.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-15550,
author = {Minming Li and
Peter Robinson and
Xianbin Zhu},
title = {Dynamic Maximal Matching in Clique Networks},
journal = {CoRR},
volume = {abs/2401.15550},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.15550},
doi = {10.48550/ARXIV.2401.15550},
eprinttype = {arXiv},
eprint = {2401.15550},
timestamp = {Tue, 06 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-15550.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GilbertRS23,
author = {Seth Gilbert and
Peter Robinson and
Suman Sourav},
title = {Leader Election in Well-Connected Graphs},
journal = {Algorithmica},
volume = {85},
number = {4},
pages = {1029--1066},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01068-x},
doi = {10.1007/S00453-022-01068-X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GilbertRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/Kutten0T23,
author = {Shay Kutten and
Peter Robinson and
Ming Ming Tan},
editor = {Alysson Bessani and
Xavier D{\'{e}}fago and
Junya Nakamura and
Koichi Wada and
Yukiko Yamauchi},
title = {Tight Bounds on the Message Complexity of Distributed Tree Verification},
booktitle = {27th International Conference on Principles of Distributed Systems,
{OPODIS} 2023, December 6-8, 2023, Tokyo, Japan},
series = {LIPIcs},
volume = {286},
pages = {26:1--26:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2023.26},
doi = {10.4230/LIPICS.OPODIS.2023.26},
timestamp = {Fri, 19 Jan 2024 14:57:09 +0100},
biburl = {https://dblp.org/rec/conf/opodis/Kutten0T23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Robinson23,
author = {Peter Robinson},
editor = {Rotem Oshman and
Alexandre Nolin and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Alkida Balliu},
title = {Brief Announcement: What Can We Compute in a Single Round of the Congested
Clique?},
booktitle = {Proceedings of the 2023 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2023, Orlando, FL, USA, June 19-23, 2023},
pages = {168--171},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583668.3594575},
doi = {10.1145/3583668.3594575},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/Robinson23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Kutten0T023,
author = {Shay Kutten and
Peter Robinson and
Ming Ming Tan and
Xianbin Zhu},
editor = {Rotem Oshman and
Alexandre Nolin and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Alkida Balliu},
title = {Improved Tradeoffs for Leader Election},
booktitle = {Proceedings of the 2023 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2023, Orlando, FL, USA, June 19-23, 2023},
pages = {355--365},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583668.3594576},
doi = {10.1145/3583668.3594576},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/Kutten0T023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/000223,
author = {Peter Robinson},
editor = {Rotem Oshman},
title = {Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs,
{BFS} Trees, and {LCL} Problems},
booktitle = {37th International Symposium on Distributed Computing, {DISC} 2023,
October 10-12, 2023, L'Aquila, Italy},
series = {LIPIcs},
volume = {281},
pages = {32:1--32:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.DISC.2023.32},
doi = {10.4230/LIPICS.DISC.2023.32},
timestamp = {Thu, 05 Oct 2023 15:45:05 +0200},
biburl = {https://dblp.org/rec/conf/wdag/000223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-08235,
author = {Shay Kutten and
Peter Robinson and
Ming Ming Tan and
Xianbin Zhu},
title = {Improved Tradeoffs for Leader Election},
journal = {CoRR},
volume = {abs/2301.08235},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.08235},
doi = {10.48550/ARXIV.2301.08235},
eprinttype = {arXiv},
eprint = {2301.08235},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-08235.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-14811,
author = {Fabien Dufoulon and
Shreyas Pai and
Gopal Pandurangan and
Sriram V. Pemmaraju and
Peter Robinson},
title = {The Message Complexity of Distributed Graph Optimization},
journal = {CoRR},
volume = {abs/2311.14811},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.14811},
doi = {10.48550/ARXIV.2311.14811},
eprinttype = {arXiv},
eprint = {2311.14811},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-14811.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AugustineGKRS22,
author = {John Augustine and
Seth Gilbert and
Fabian Kuhn and
Peter Robinson and
Suman Sourav},
title = {Latency, capacity, and distributed minimum spanning trees},
journal = {J. Comput. Syst. Sci.},
volume = {126},
pages = {1--20},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.11.006},
doi = {10.1016/J.JCSS.2021.11.006},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AugustineGKRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/ChatterjeePR22,
author = {Soumyottam Chatterjee and
Gopal Pandurangan and
Peter Robinson},
title = {Byzantine-Resilient Counting in Networks},
booktitle = {42nd {IEEE} International Conference on Distributed Computing Systems,
{ICDCS} 2022, Bologna, Italy, July 10-13, 2022},
pages = {12--22},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ICDCS54860.2022.00011},
doi = {10.1109/ICDCS54860.2022.00011},
timestamp = {Thu, 20 Oct 2022 09:13:03 +0200},
biburl = {https://dblp.org/rec/conf/icdcs/ChatterjeePR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/HouraniPR22,
author = {Khalid Hourani and
Gopal Pandurangan and
Peter Robinson},
title = {Awake-Efficient Distributed Algorithms for Maximal Independent Set},
booktitle = {42nd {IEEE} International Conference on Distributed Computing Systems,
{ICDCS} 2022, Bologna, Italy, July 10-13, 2022},
pages = {1338--1339},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ICDCS54860.2022.00153},
doi = {10.1109/ICDCS54860.2022.00153},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdcs/HouraniPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-11951,
author = {Soumyottam Chatterjee and
Gopal Pandurangan and
Peter Robinson},
title = {Byzantine-Resilient Counting in Networks},
journal = {CoRR},
volume = {abs/2204.11951},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.11951},
doi = {10.48550/ARXIV.2204.11951},
eprinttype = {arXiv},
eprint = {2204.11951},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-11951.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-02638,
author = {Peter Robinson},
title = {What Can We Compute in a Single Round of the Congested Clique?},
journal = {CoRR},
volume = {abs/2210.02638},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.02638},
doi = {10.48550/ARXIV.2210.02638},
eprinttype = {arXiv},
eprint = {2210.02638},
timestamp = {Tue, 20 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-02638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/PanduranganRS21,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
title = {On the Distributed Complexity of Large-Scale Graph Computations},
journal = {{ACM} Trans. Parallel Comput.},
volume = {8},
number = {2},
pages = {7:1--7:28},
year = {2021},
url = {https://doi.org/10.1145/3460900},
doi = {10.1145/3460900},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/PanduranganRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/PaiPP021,
author = {Shreyas Pai and
Gopal Pandurangan and
Sriram V. Pemmaraju and
Peter Robinson},
editor = {Avery Miller and
Keren Censor{-}Hillel and
Janne H. Korhonen},
title = {Can We Break Symmetry with o(m) Communication?},
booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, July 26-30, 2021},
pages = {247--257},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3465084.3467909},
doi = {10.1145/3465084.3467909},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/PaiPP021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Robinson21,
author = {Peter Robinson},
editor = {D{\'{a}}niel Marx},
title = {Being Fast Means Being Chatty: The Local Information Cost of Graph
Spanners},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2105--2120},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.126},
doi = {10.1137/1.9781611976465.126},
timestamp = {Mon, 15 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Robinson21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-09197,
author = {Soumyottam Chatterjee and
Gopal Pandurangan and
Peter Robinson},
title = {Network Size Estimation in Small-World Networks under Byzantine Faults},
journal = {CoRR},
volume = {abs/2102.09197},
year = {2021},
url = {https://arxiv.org/abs/2102.09197},
eprinttype = {arXiv},
eprint = {2102.09197},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-09197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-07027,
author = {Christian Konrad and
Peter Robinson and
Viktor Zamaraev},
title = {Robust Lower Bounds for Graph Problems in the Blackboard Model of
Communication},
journal = {CoRR},
volume = {abs/2103.07027},
year = {2021},
url = {https://arxiv.org/abs/2103.07027},
eprinttype = {arXiv},
eprint = {2103.07027},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-07027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-01833,
author = {Christian Konrad and
Sriram V. Pemmaraju and
Talal Riaz and
Peter Robinson},
title = {The Complexity of Symmetry Breaking in Massive Graphs},
journal = {CoRR},
volume = {abs/2105.01833},
year = {2021},
url = {https://arxiv.org/abs/2105.01833},
eprinttype = {arXiv},
eprint = {2105.01833},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-01833.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08917,
author = {Shreyas Pai and
Gopal Pandurangan and
Sriram V. Pemmaraju and
Peter Robinson},
title = {Can We Break Symmetry with o(m) Communication?},
journal = {CoRR},
volume = {abs/2105.08917},
year = {2021},
url = {https://arxiv.org/abs/2105.08917},
eprinttype = {arXiv},
eprint = {2105.08917},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08917.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ChatterjeePR20,
author = {Soumyottam Chatterjee and
Gopal Pandurangan and
Peter Robinson},
title = {The complexity of leader election in diameter-two networks},
journal = {Distributed Comput.},
volume = {33},
number = {2},
pages = {189--205},
year = {2020},
url = {https://doi.org/10.1007/s00446-019-00354-2},
doi = {10.1007/S00446-019-00354-2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/ChatterjeePR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Pandurangan0S20,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
title = {A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning
Trees},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {1},
pages = {13:1--13:27},
year = {2020},
url = {https://doi.org/10.1145/3365005},
doi = {10.1145/3365005},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Pandurangan0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/AugustineGK0S20,
author = {John Augustine and
Seth Gilbert and
Fabian Kuhn and
Peter Robinson and
Suman Sourav},
title = {Latency, Capacity, and Distributed Minimum Spanning Tree{\textdagger}},
booktitle = {40th {IEEE} International Conference on Distributed Computing Systems,
{ICDCS} 2020, Singapore, November 29 - December 1, 2020},
pages = {157--167},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ICDCS47774.2020.00055},
doi = {10.1109/ICDCS47774.2020.00055},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcs/AugustineGK0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GilbertP0T20,
author = {Seth Gilbert and
Gopal Pandurangan and
Peter Robinson and
Amitabh Trehan},
editor = {Yuval Emek and
Christian Cachin},
title = {DConstructor: Efficient and Robust Network Construction with Polylogarithmic
Overhead},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {438--447},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405716},
doi = {10.1145/3382734.3405716},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GilbertP0T20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-09895,
author = {Peter Robinson},
title = {Being Fast Means Being Chatty: The Local Information Cost of Graph
Spanners},
journal = {CoRR},
volume = {abs/2003.09895},
year = {2020},
url = {https://arxiv.org/abs/2003.09895},
eprinttype = {arXiv},
eprint = {2003.09895},
timestamp = {Mon, 15 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-09895.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/SouravRG19,
author = {Suman Sourav and
Peter Robinson and
Seth Gilbert},
title = {Slow Links, Fast Links, and the Cost of Gossip},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {30},
number = {9},
pages = {2130--2147},
year = {2019},
url = {https://doi.org/10.1109/TPDS.2019.2905568},
doi = {10.1109/TPDS.2019.2905568},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tpds/SouravRG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/Biely019,
author = {Martin Biely and
Peter Robinson},
editor = {R. C. Hansdah and
Dilip Krishnaswamy and
Nitin H. Vaidya},
title = {On the hardness of the strongly dependent decision problem},
booktitle = {Proceedings of the 20th International Conference on Distributed Computing
and Networking, {ICDCN} 2019, Bangalore, India, January 04-07, 2019},
pages = {120--123},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3288599.3288614},
doi = {10.1145/3288599.3288614},
timestamp = {Wed, 01 Sep 2021 12:22:37 +0200},
biburl = {https://dblp.org/rec/conf/icdcn/Biely019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/ChatterjeeP019,
author = {Soumyottam Chatterjee and
Gopal Pandurangan and
Peter Robinson},
title = {Network Size Estimation in Small-World Networks Under Byzantine Faults},
booktitle = {2019 {IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2019, Rio de Janeiro, Brazil, May 20-24, 2019},
pages = {855--865},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/IPDPS.2019.00094},
doi = {10.1109/IPDPS.2019.00094},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipps/ChatterjeeP019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/KonradPR019,
author = {Christian Konrad and
Sriram V. Pemmaraju and
Talal Riaz and
Peter Robinson},
editor = {Jukka Suomela},
title = {The Complexity of Symmetry Breaking in Massive Graphs},
booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019,
October 14-18, 2019, Budapest, Hungary},
series = {LIPIcs},
volume = {146},
pages = {26:1--26:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.DISC.2019.26},
doi = {10.4230/LIPICS.DISC.2019.26},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wdag/KonradPR019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/podc/2019,
editor = {Peter Robinson and
Faith Ellen},
title = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
publisher = {{ACM}},
year = {2019},
url = {https://dl.acm.org/citation.cfm?id=3293611},
isbn = {978-1-4503-6217-7},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-00342,
author = {Seth Gilbert and
Peter Robinson and
Suman Sourav},
title = {Leader Election in Well-Connected Graphs},
journal = {CoRR},
volume = {abs/1901.00342},
year = {2019},
url = {http://arxiv.org/abs/1901.00342},
eprinttype = {arXiv},
eprint = {1901.00342},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-00342.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08979,
author = {John Augustine and
Seth Gilbert and
Fabian Kuhn and
Peter Robinson and
Suman Sourav},
title = {Latency, Capacity, and Distributed {MST}},
journal = {CoRR},
volume = {abs/1902.08979},
year = {2019},
url = {http://arxiv.org/abs/1902.08979},
eprinttype = {arXiv},
eprint = {1902.08979},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08979.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Pandurangan0S18,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
title = {The Distributed Minimum Spanning Tree Problem},
journal = {Bull. {EATCS}},
volume = {125},
year = {2018},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/538},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Pandurangan0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PanduranganR18,
author = {Gopal Pandurangan and
Peter Robinson},
title = {Special Issue of {ICDCN} 2016 (Distributed Computing Track)},
journal = {Theor. Comput. Sci.},
volume = {709},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.12.008},
doi = {10.1016/J.TCS.2017.12.008},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/PanduranganR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BielyRSSW18,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid and
Manfred Schwarz and
Kyrill Winkler},
title = {Gracefully degrading consensus and \emph{k}-set agreement in directed
dynamic networks},
journal = {Theor. Comput. Sci.},
volume = {726},
pages = {41--77},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.02.019},
doi = {10.1016/J.TCS.2018.02.019},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BielyRSSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/PanduranganRS18,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
title = {Fast Distributed Algorithms for Connectivity and {MST} in Large Graphs},
journal = {{ACM} Trans. Parallel Comput.},
volume = {5},
number = {1},
pages = {4:1--4:22},
year = {2018},
url = {https://doi.org/10.1145/3209689},
doi = {10.1145/3209689},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/PanduranganRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/ChatterjeeP018,
author = {Soumyottam Chatterjee and
Gopal Pandurangan and
Peter Robinson},
editor = {Paolo Bellavista and
Vijay K. Garg},
title = {The Complexity of Leader Election: {A} Chasm at Diameter Two},
booktitle = {Proceedings of the 19th International Conference on Distributed Computing
and Networking, {ICDCN} 2018, Varanasi, India, January 4-7, 2018},
pages = {13:1--13:10},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3154273.3154308},
doi = {10.1145/3154273.3154308},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdcn/ChatterjeeP018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/SouravRG18,
author = {Suman Sourav and
Peter Robinson and
Seth Gilbert},
title = {Slow Links, Fast Links, and the Cost of Gossip},
booktitle = {38th {IEEE} International Conference on Distributed Computing Systems,
{ICDCS} 2018, Vienna, Austria, July 2-6, 2018},
pages = {786--796},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/ICDCS.2018.00081},
doi = {10.1109/ICDCS.2018.00081},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcs/SouravRG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GilbertRS18,
author = {Seth Gilbert and
Peter Robinson and
Suman Sourav},
editor = {Calvin Newport and
Idit Keidar},
title = {Leader Election in Well-Connected Graphs},
booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018},
pages = {227--236},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3212734.3212754},
doi = {10.1145/3212734.3212754},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GilbertRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Robinson18,
author = {Peter Robinson},
editor = {Calvin Newport and
Idit Keidar},
title = {Session details: Session 1D: Graph Algorithms},
booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018},
publisher = {{ACM}},
year = {2018},
url = {https://dl.acm.org/citation.cfm?id=3258698},
timestamp = {Wed, 09 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/Robinson18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/RobinsonSS18,
author = {Peter Robinson and
Christian Scheideler and
Alexander Setzer},
editor = {Christian Scheideler and
Jeremy T. Fineman},
title = {Breaking the {\textdollar}ilde{\textdollar}Omega({\textdollar}sqrt\{n\}){\textdollar}
Barrier: Fast Consensus under a Late Adversary},
booktitle = {Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2018, Vienna, Austria, July 16-18, 2018},
pages = {173--182},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3210377.3210399},
doi = {10.1145/3210377.3210399},
timestamp = {Wed, 21 Nov 2018 12:44:27 +0100},
biburl = {https://dblp.org/rec/conf/spaa/RobinsonSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Pandurangan0S18,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
editor = {Christian Scheideler and
Jeremy T. Fineman},
title = {On the Distributed Complexity of Large-Scale Graph Computations},
booktitle = {Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2018, Vienna, Austria, July 16-18, 2018},
pages = {405--414},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3210377.3210409},
doi = {10.1145/3210377.3210409},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/Pandurangan0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Newport018,
author = {Calvin Newport and
Peter Robinson},
editor = {Ulrich Schmid and
Josef Widder},
title = {Fault-Tolerant Consensus with an Abstract {MAC} Layer},
booktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018,
New Orleans, LA, USA, October 15-19, 2018},
series = {LIPIcs},
volume = {121},
pages = {38:1--38:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.DISC.2018.38},
doi = {10.4230/LIPICS.DISC.2018.38},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/wdag/Newport018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-00774,
author = {Peter Robinson and
Christian Scheideler and
Alexander Setzer},
title = {Breaking the {\(\Omega\)}{\~}({\(\surd\)}n) Barrier: Fast Consensus
under a Late Adversary},
journal = {CoRR},
volume = {abs/1805.00774},
year = {2018},
url = {http://arxiv.org/abs/1805.00774},
eprinttype = {arXiv},
eprint = {1805.00774},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-00774.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-00273,
author = {Soumyottam Chatterjee and
Gopal Pandurangan and
Peter Robinson},
title = {The Complexity of Leader Election: {A} Chasm at Diameter Two},
journal = {CoRR},
volume = {abs/1809.00273},
year = {2018},
url = {http://arxiv.org/abs/1809.00273},
eprinttype = {arXiv},
eprint = {1809.00273},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-00273.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-11060,
author = {Martin Biely and
Peter Robinson},
title = {On the Hardness of the Strongly Dependent Decision Problem},
journal = {CoRR},
volume = {abs/1809.11060},
year = {2018},
url = {http://arxiv.org/abs/1809.11060},
eprinttype = {arXiv},
eprint = {1809.11060},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-11060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-02848,
author = {Calvin C. Newport and
Peter Robinson},
title = {Fault-Tolerant Consensus with an Abstract {MAC} Layer},
journal = {CoRR},
volume = {abs/1810.02848},
year = {2018},
url = {http://arxiv.org/abs/1810.02848},
eprinttype = {arXiv},
eprint = {1810.02848},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-02848.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/PaiPPR017,
author = {Shreyas Pai and
Gopal Pandurangan and
Sriram V. Pemmaraju and
Talal Riaz and
Peter Robinson},
editor = {Elad Michael Schiller and
Alexander A. Schwarzmann},
title = {Brief Announcement: Symmetry Breaking in the {CONGEST} Model: Time-
and Message-Efficient Algorithms for Ruling Sets},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,
{PODC} 2017, Washington, DC, USA, July 25-27, 2017},
pages = {207--209},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087801.3087865},
doi = {10.1145/3087801.3087865},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/PaiPPR017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GilbertRS17,
author = {Seth Gilbert and
Peter Robinson and
Suman Sourav},
editor = {Elad Michael Schiller and
Alexander A. Schwarzmann},
title = {Brief Announcement: Gossiping with Latencies},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,
{PODC} 2017, Washington, DC, USA, July 25-27, 2017},
pages = {255--257},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087801.3087846},
doi = {10.1145/3087801.3087846},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GilbertRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Pandurangan0S17,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {A time- and message-optimal distributed algorithm for minimum spanning
trees},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {743--756},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055449},
doi = {10.1145/3055399.3055449},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Pandurangan0S17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/PaiPPR017,
author = {Shreyas Pai and
Gopal Pandurangan and
Sriram V. Pemmaraju and
Talal Riaz and
Peter Robinson},
editor = {Andr{\'{e}}a W. Richa},
title = {Symmetry Breaking in the Congest Model: Time- and Message-Efficient
Algorithms for Ruling Sets},
booktitle = {31st International Symposium on Distributed Computing, {DISC} 2017,
October 16-20, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {91},
pages = {38:1--38:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.DISC.2017.38},
doi = {10.4230/LIPICS.DISC.2017.38},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/PaiPPR017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PaiPPR017,
author = {Shreyas Pai and
Gopal Pandurangan and
Sriram V. Pemmaraju and
Talal Riaz and
Peter Robinson},
title = {Symmetry Breaking in the Congest Model: Time- and Message-Efficient
Algorithms for Ruling Sets},
journal = {CoRR},
volume = {abs/1705.07861},
year = {2017},
url = {http://arxiv.org/abs/1705.07861},
eprinttype = {arXiv},
eprint = {1705.07861},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PaiPPR017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/Pandurangan0T16,
author = {Gopal Pandurangan and
Peter Robinson and
Amitabh Trehan},
title = {{DEX:} self-healing expanders},
journal = {Distributed Comput.},
volume = {29},
number = {3},
pages = {163--185},
year = {2016},
url = {https://doi.org/10.1007/s00446-015-0258-3},
doi = {10.1007/S00446-015-0258-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/Pandurangan0T16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HarrisMPRS16,
author = {David G. Harris and
Ehab Morsy and
Gopal Pandurangan and
Peter Robinson and
Aravind Srinivasan},
title = {Efficient computation of sparse structures},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {322--344},
year = {2016},
url = {https://doi.org/10.1002/rsa.20653},
doi = {10.1002/RSA.20653},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HarrisMPRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/AugustinePR16,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson},
title = {Distributed Algorithmic Foundations of Dynamic Networks},
journal = {{SIGACT} News},
volume = {47},
number = {1},
pages = {69--98},
year = {2016},
url = {https://doi.org/10.1145/2902945.2902959},
doi = {10.1145/2902945.2902959},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/AugustinePR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Pandurangan0S16,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
editor = {Christian Scheideler and
Seth Gilbert},
title = {Fast Distributed Algorithms for Connectivity and {MST} in Large Graphs},
booktitle = {Proceedings of the 28th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2016, Asilomar State Beach/Pacific Grove,
CA, USA, July 11-13, 2016},
pages = {429--438},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2935764.2935785},
doi = {10.1145/2935764.2935785},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/Pandurangan0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Pandurangan0S16,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
title = {Tight Bounds for Distributed Graph Computations},
journal = {CoRR},
volume = {abs/1602.08481},
year = {2016},
url = {http://arxiv.org/abs/1602.08481},
eprinttype = {arXiv},
eprint = {1602.08481},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Pandurangan0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Pandurangan0S16a,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
title = {A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning
Trees},
journal = {CoRR},
volume = {abs/1607.06883},
year = {2016},
url = {http://arxiv.org/abs/1607.06883},
eprinttype = {arXiv},
eprint = {1607.06883},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Pandurangan0S16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GilbertRS16,
author = {Seth Gilbert and
Peter Robinson and
Suman Sourav},
title = {Gossiping with Latencies},
journal = {CoRR},
volume = {abs/1611.06343},
year = {2016},
url = {http://arxiv.org/abs/1611.06343},
eprinttype = {arXiv},
eprint = {1611.06343},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GilbertRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KuttenPP0T15,
author = {Shay Kutten and
Gopal Pandurangan and
David Peleg and
Peter Robinson and
Amitabh Trehan},
title = {On the Complexity of Universal Leader Election},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {7:1--7:27},
year = {2015},
url = {https://doi.org/10.1145/2699440},
doi = {10.1145/2699440},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KuttenPP0T15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AugustineP0U15,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson and
Eli Upfal},
title = {Distributed agreement in dynamic peer-to-peer networks},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {7},
pages = {1088--1109},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.10.005},
doi = {10.1016/J.JCSS.2014.10.005},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AugustineP0U15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KuttenPP0T15,
author = {Shay Kutten and
Gopal Pandurangan and
David Peleg and
Peter Robinson and
Amitabh Trehan},
title = {Sublinear bounds for randomized leader election},
journal = {Theor. Comput. Sci.},
volume = {561},
pages = {134--143},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.02.009},
doi = {10.1016/J.TCS.2014.02.009},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KuttenPP0T15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AugustineP0RU15,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson and
Scott T. Roche and
Eli Upfal},
editor = {Venkatesan Guruswami},
title = {Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer
Networks},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {350--369},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.29},
doi = {10.1109/FOCS.2015.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AugustineP0RU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/netys/Biely0SSW15,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid and
Manfred Schwarz and
Kyrill Winkler},
editor = {Ahmed Bouajjani and
Hugues Fauconnier},
title = {Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic
Networks},
booktitle = {Networked Systems - Third International Conference, {NETYS} 2015,
Agadir, Morocco, May 13-15, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9466},
pages = {109--124},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-26850-7\_8},
doi = {10.1007/978-3-319-26850-7\_8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/netys/Biely0SSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KlauckNP015,
author = {Hartmut Klauck and
Danupon Nanongkai and
Gopal Pandurangan and
Peter Robinson},
editor = {Piotr Indyk},
title = {Distributed Computation of Large-scale Graph Problems},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {391--410},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.28},
doi = {10.1137/1.9781611973730.28},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KlauckNP015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AugustineP015,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson},
editor = {Yoram Moses},
title = {Fast Byzantine Leader Election in Dynamic Networks},
booktitle = {Distributed Computing - 29th International Symposium, {DISC} 2015,
Tokyo, Japan, October 7-9, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9363},
pages = {276--291},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48653-5\_19},
doi = {10.1007/978-3-662-48653-5\_19},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AugustineP015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Biely0SSW15,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid and
Manfred Schwarz and
Kyrill Winkler},
title = {Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic
Networks},
journal = {CoRR},
volume = {abs/1501.02716},
year = {2015},
url = {http://arxiv.org/abs/1501.02716},
eprinttype = {arXiv},
eprint = {1501.02716},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Biely0SSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Pandurangan0S15,
author = {Gopal Pandurangan and
Peter Robinson and
Michele Scquizzato},
title = {Almost Optimal Distributed Algorithms for Large-Scale Graph Problems},
journal = {CoRR},
volume = {abs/1503.02353},
year = {2015},
url = {http://arxiv.org/abs/1503.02353},
eprinttype = {arXiv},
eprint = {1503.02353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Pandurangan0S15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/BielyRS14,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
title = {The Generalized Loneliness Detector and Weak System Models for k-Set
Agreement},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {25},
number = {4},
pages = {1078--1088},
year = {2014},
url = {https://doi.org/10.1109/TPDS.2013.77},
doi = {10.1109/TPDS.2013.77},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/BielyRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/PanduranganRT14,
author = {Gopal Pandurangan and
Peter Robinson and
Amitabh Trehan},
title = {{DEX:} Self-Healing Expanders},
booktitle = {2014 {IEEE} 28th International Parallel and Distributed Processing
Symposium, Phoenix, AZ, USA, May 19-23, 2014},
pages = {702--711},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/IPDPS.2014.78},
doi = {10.1109/IPDPS.2014.78},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/PanduranganRT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/SchwarzWSBR13,
author = {Manfred Schwarz and
Kyrill Winkler and
Ulrich Schmid and
Martin Biely and
Peter Robinson},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Shlomi Dolev},
title = {Brief announcement: gracefully degrading consensus and k-set agreement
under dynamic link failures},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '14,
Paris, France, July 15-18, 2014},
pages = {341--343},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2611462.2611506},
doi = {10.1145/2611462.2611506},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/SchwarzWSBR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/KuttenNP014,
author = {Shay Kutten and
Danupon Nanongkai and
Gopal Pandurangan and
Peter Robinson},
editor = {Fabian Kuhn},
title = {Distributed Symmetry Breaking in Hypergraphs},
booktitle = {Distributed Computing - 28th International Symposium, {DISC} 2014,
Austin, TX, USA, October 12-15, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8784},
pages = {469--483},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45174-8\_32},
doi = {10.1007/978-3-662-45174-8\_32},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/KuttenNP014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KuttenNPR14,
author = {Shay Kutten and
Danupon Nanongkai and
Gopal Pandurangan and
Peter Robinson},
title = {Distributed Symmetry Breaking in Hypergraphs},
journal = {CoRR},
volume = {abs/1405.1649},
year = {2014},
url = {http://arxiv.org/abs/1405.1649},
eprinttype = {arXiv},
eprint = {1405.1649},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KuttenNPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HarrisMPRS13,
author = {David G. Harris and
Ehab Morsy and
Gopal Pandurangan and
Peter Robinson and
Aravind Srinivasan},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Efficient Computation of Balanced Structures},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7966},
pages = {581--593},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39212-2\_51},
doi = {10.1007/978-3-642-39212-2\_51},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HarrisMPRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/KuttenPPRT13,
author = {Shay Kutten and
Gopal Pandurangan and
David Peleg and
Peter Robinson and
Amitabh Trehan},
editor = {Davide Frey and
Michel Raynal and
Saswati Sarkar and
Rudrapatna K. Shyamasundar and
Prasun Sinha},
title = {Sublinear Bounds for Randomized Leader Election},
booktitle = {Distributed Computing and Networking, 14th International Conference,
{ICDCN} 2013, Mumbai, India, January 3-6, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7730},
pages = {348--362},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-35668-1\_24},
doi = {10.1007/978-3-642-35668-1\_24},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcn/KuttenPPRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AugustinePR13,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson},
editor = {Panagiota Fatourou and
Gadi Taubenfeld},
title = {Fast byzantine agreement in dynamic networks},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '13,
Montreal, QC, Canada, July 22-24, 2013},
pages = {74--83},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2484239.2484275},
doi = {10.1145/2484239.2484275},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/AugustinePR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/KuttenPPRT13,
author = {Shay Kutten and
Gopal Pandurangan and
David Peleg and
Peter Robinson and
Amitabh Trehan},
editor = {Panagiota Fatourou and
Gadi Taubenfeld},
title = {On the complexity of universal leader election},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '13,
Montreal, QC, Canada, July 22-24, 2013},
pages = {100--109},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2484239.2484274},
doi = {10.1145/2484239.2484274},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/KuttenPPRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AugustineMMPRU13,
author = {John Augustine and
Anisur Rahaman Molla and
Ehab Morsy and
Gopal Pandurangan and
Peter Robinson and
Eli Upfal},
editor = {Guy E. Blelloch and
Berthold V{\"{o}}cking},
title = {Storage and search in dynamic peer-to-peer networks},
booktitle = {25th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '13, Montreal, QC, Canada - July 23 - 25, 2013},
pages = {53--62},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2486159.2486170},
doi = {10.1145/2486159.2486170},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/AugustineMMPRU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/AugustineKNR13,
author = {John Augustine and
Tejas Kulkarni and
Paresh Nakhe and
Peter Robinson},
editor = {Keren Censor{-}Hillel and
Valerie King},
title = {Robust Leader Election in a Fast-Changing World},
booktitle = {Proceedings Ninth International Workshop on Foundations of Mobile
Computing, {FOMC} 2013, Jerusalem, Israel, October 17-18, 2013},
series = {{EPTCS}},
volume = {132},
pages = {38--49},
year = {2013},
url = {https://doi.org/10.4204/EPTCS.132.4},
doi = {10.4204/EPTCS.132.4},
timestamp = {Wed, 12 Sep 2018 01:05:13 +0200},
biburl = {https://dblp.org/rec/journals/corr/AugustineKNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-1121,
author = {John Augustine and
Anisur Rahaman Molla and
Ehab Morsy and
Gopal Pandurangan and
Peter Robinson and
Eli Upfal},
title = {Storage and Search in Dynamic Peer-to-Peer Networks},
journal = {CoRR},
volume = {abs/1305.1121},
year = {2013},
url = {http://arxiv.org/abs/1305.1121},
eprinttype = {arXiv},
eprint = {1305.1121},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-1121.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KlauckNPR13,
author = {Hartmut Klauck and
Danupon Nanongkai and
Gopal Pandurangan and
Peter Robinson},
title = {The Distributed Complexity of Large-scale Graph Processing},
journal = {CoRR},
volume = {abs/1311.6209},
year = {2013},
url = {http://arxiv.org/abs/1311.6209},
eprinttype = {arXiv},
eprint = {1311.6209},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KlauckNPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BielyRS12,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
editor = {Guy Even and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Agreement in Directed Dynamic Networks},
booktitle = {Structural Information and Communication Complexity - 19th International
Colloquium, {SIROCCO} 2012, Reykjavik, Iceland, June 30-July 2, 2012,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7355},
pages = {73--84},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31104-8\_7},
doi = {10.1007/978-3-642-31104-8\_7},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BielyRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AugustinePRU12,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson and
Eli Upfal},
editor = {Yuval Rabani},
title = {Towards robust and efficient computation in dynamic peer-to-peer networks},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {551--569},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.47},
doi = {10.1137/1.9781611973099.47},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AugustinePRU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0641,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
title = {Agreement in Directed Dynamic Networks},
journal = {CoRR},
volume = {abs/1204.0641},
year = {2012},
url = {http://arxiv.org/abs/1204.0641},
eprinttype = {arXiv},
eprint = {1204.0641},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-0641.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-1522,
author = {Gopal Pandurangan and
Peter Robinson and
Amitabh Trehan},
title = {Self-healing Deterministic Expanders},
journal = {CoRR},
volume = {abs/1206.1522},
year = {2012},
url = {http://arxiv.org/abs/1206.1522},
eprinttype = {arXiv},
eprint = {1206.1522},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-1522.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-4822,
author = {Shay Kutten and
Gopal Pandurangan and
David Peleg and
Peter Robinson and
Amitabh Trehan},
title = {Sublinear Bounds for Randomized Leader Election},
journal = {CoRR},
volume = {abs/1210.4822},
year = {2012},
url = {http://arxiv.org/abs/1210.4822},
eprinttype = {arXiv},
eprint = {1210.4822},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-4822.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RobinsonS11,
author = {Peter Robinson and
Ulrich Schmid},
title = {The Asynchronous Bounded-Cycle model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5580--5601},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.08.001},
doi = {10.1016/J.TCS.2010.08.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RobinsonS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dialm/ChungRW11,
author = {Hyun Chul Chung and
Peter Robinson and
Jennifer L. Welch},
editor = {Augustin Chaintreau and
Dariusz R. Kowalski},
title = {Optimal regional consecutive leader election in mobile ad-hoc networks},
booktitle = {FOMC'11, The Seventh {ACM} {SIGACT/SIGMOBILE} International Workshop
on Foundations of Mobile Computing (part of {FCRC} 2011), San Jose,
CA, USA, June 9, 2011, Proceedings},
pages = {52--61},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1998476.1998485},
doi = {10.1145/1998476.1998485},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dialm/ChungRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/BielyRS11,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
title = {Solving k-Set Agreement with Stable Skeleton Graphs},
booktitle = {25th {IEEE} International Symposium on Parallel and Distributed Processing,
{IPDPS} 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings},
pages = {1488--1495},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/IPDPS.2011.301},
doi = {10.1109/IPDPS.2011.301},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/BielyRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/BielyRS11,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
editor = {Antonio Fern{\'{a}}ndez Anta and
Giuseppe Lipari and
Matthieu Roy},
title = {Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems},
booktitle = {Principles of Distributed Systems - 15th International Conference,
{OPODIS} 2011, Toulouse, France, December 13-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7109},
pages = {299--312},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25873-2\_21},
doi = {10.1007/978-3-642-25873-2\_21},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/opodis/BielyRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BielyRS11,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
editor = {Cyril Gavoille and
Pierre Fraigniaud},
title = {Easy impossibility proofs for k-set agreement in message passing systems},
booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2011, San Jose, CA, USA, June 6-8, 2011},
pages = {227--228},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993806.1993846},
doi = {10.1145/1993806.1993846},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BielyRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-4423,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
title = {Solving k-Set Agreement with Stable Skeleton Graphs},
journal = {CoRR},
volume = {abs/1102.4423},
year = {2011},
url = {http://arxiv.org/abs/1102.4423},
eprinttype = {arXiv},
eprint = {1102.4423},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-4423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-3671,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
title = {Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems},
journal = {CoRR},
volume = {abs/1103.3671},
year = {2011},
url = {http://arxiv.org/abs/1103.3671},
eprinttype = {arXiv},
eprint = {1103.3671},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-3671.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-0809,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson and
Eli Upfal},
title = {Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks},
journal = {CoRR},
volume = {abs/1108.0809},
year = {2011},
url = {http://arxiv.org/abs/1108.0809},
eprinttype = {arXiv},
eprint = {1108.0809},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-0809.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/ChungRW10,
author = {Hyun Chul Chung and
Peter Robinson and
Jennifer L. Welch},
editor = {Christian Scheideler},
title = {Brief Announcement: Regional Consecutive Leader Election in Mobile
Ad-Hoc Networks},
booktitle = {Algorithms for Sensor Systems - 6th International Workshop on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, {ALGOSENSORS} 2010, Bordeaux, France, July 5, 2010, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6451},
pages = {89--91},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16988-5\_8},
doi = {10.1007/978-3-642-16988-5\_8},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/ChungRW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dialm/ChungRW10,
author = {Hyun Chul Chung and
Peter Robinson and
Jennifer L. Welch},
editor = {Andr{\'{e}}a W. Richa and
Thomas Moscibroda},
title = {Regional consecutive leader election in mobile ad-hoc networks},
booktitle = {Proceedings of the {DIALM-POMC} Joint Workshop on Foundations of Mobile
Computing, Cambridge, Massachusetts, USA, September 16, 2010},
pages = {81--90},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1860684.1860701},
doi = {10.1145/1860684.1860701},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dialm/ChungRW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/BielyRS09,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
editor = {Tarek F. Abdelzaher and
Michel Raynal and
Nicola Santoro},
title = {Weak Synchrony Models and Failure Detectors for Message Passing (\emph{k}-)Set
Agreement},
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 = {285--299},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10877-8\_23},
doi = {10.1007/978-3-642-10877-8\_23},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/opodis/BielyRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BielyRS09,
author = {Martin Biely and
Peter Robinson and
Ulrich Schmid},
editor = {Idit Keidar},
title = {Brief Announcement: Weak Synchrony Models and Failure Detectors for
Message Passing (\emph{k}-)Set Agreement},
booktitle = {Distributed Computing, 23rd International Symposium, {DISC} 2009,
Elche, Spain, September 23-25, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5805},
pages = {360--361},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04355-0\_38},
doi = {10.1007/978-3-642-04355-0\_38},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BielyRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/RobinsonS08,
author = {Peter Robinson and
Ulrich Schmid},
editor = {Rida A. Bazzi and
Boaz Patt{-}Shamir},
title = {The asynchronous bounded-cycle model},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2008, Toronto, Canada, August 18-21,
2008},
pages = {423},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1400751.1400815},
doi = {10.1145/1400751.1400815},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/RobinsonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/RobinsonS08,
author = {Peter Robinson and
Ulrich Schmid},
editor = {Sandeep S. Kulkarni and
Andr{\'{e}} Schiper},
title = {The Asynchronous Bounded-Cycle Model},
booktitle = {Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, {SSS} 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5340},
pages = {246--262},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-89335-6\_20},
doi = {10.1007/978-3-540-89335-6\_20},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/sss/RobinsonS08.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-21 18:02 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:
