31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Proceedings{richa:LIPIcs.DISC.2017, title = {{LIPIcs, Volume 91, DISC'17, Complete Volume}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017}, URN = {urn:nbn:de:0030-drops-80247}, doi = {10.4230/LIPIcs.DISC.2017}, annote = {Keywords: Computer-Communication Networks, Distributed Systems, Concurrent Programming, Data Structures, Theory of Computation, Models of Computation, Modes of Computation} }
31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{richa:LIPIcs.DISC.2017.0, author = {Richa, Andr\'{e}a}, title = {{Front Matter, Table of Contents, Preface, Symposium Organization, Awards}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.0}, URN = {urn:nbn:de:0030-drops-79629}, doi = {10.4230/LIPIcs.DISC.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Symposium Organization, Edsger W. Dijkstra Prize in Distributed Computing, Principles of Distributed Computi} }
Christian Cachin and Marko Vukolic. Blockchain Consensus Protocols in the Wild (Keynote Talk). In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 1:1-1:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{cachin_et_al:LIPIcs.DISC.2017.1, author = {Cachin, Christian and Vukolic, Marko}, title = {{Blockchain Consensus Protocols in the Wild}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {1:1--1:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.1}, URN = {urn:nbn:de:0030-drops-80160}, doi = {10.4230/LIPIcs.DISC.2017.1}, annote = {Keywords: Permissioned blockchains, consensus, Byzantine fault-tolerance, snake oil, protocol analysis} }
Anne-Marie Kermarrec. Recommenders: from the Lab to the Wild (Keynote Talk). In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kermarrec:LIPIcs.DISC.2017.2, author = {Kermarrec, Anne-Marie}, title = {{Recommenders: from the Lab to the Wild}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.2}, URN = {urn:nbn:de:0030-drops-79652}, doi = {10.4230/LIPIcs.DISC.2017.2}, annote = {Keywords: Recommenders, Collaborative filtering, Distributed systems} }
Dana Randall. Phase Transitions and Emergent Phenomena in Random Structures and Algorithms (Keynote Talk). In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{randall:LIPIcs.DISC.2017.3, author = {Randall, Dana}, title = {{Phase Transitions and Emergent Phenomena in Random Structures and Algorithms}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {3:1--3:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.3}, URN = {urn:nbn:de:0030-drops-80212}, doi = {10.4230/LIPIcs.DISC.2017.3}, annote = {Keywords: Markov chains, phase transitions, sampling, emergent phenomena, programmable matter} }
Maya Arbel-Raviv and Trevor Brown. Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 4:1-4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{arbelraviv_et_al:LIPIcs.DISC.2017.4, author = {Arbel-Raviv, Maya and Brown, Trevor}, title = {{Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.4}, URN = {urn:nbn:de:0030-drops-80092}, doi = {10.4230/LIPIcs.DISC.2017.4}, annote = {Keywords: Concurrency, data structures, lock-free, synchronization, descriptors} }
Chen Avin, Kaushik Mondal, and Stefan Schmid. Demand-Aware Network Designs of Bounded Degree. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{avin_et_al:LIPIcs.DISC.2017.5, author = {Avin, Chen and Mondal, Kaushik and Schmid, Stefan}, title = {{Demand-Aware Network Designs of Bounded Degree}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.5}, URN = {urn:nbn:de:0030-drops-80153}, doi = {10.4230/LIPIcs.DISC.2017.5}, annote = {Keywords: Network design, reconfigurable networks, datacenter topology, peer-topeer computing, entropy, sparse spanners} }
Alkida Balliu and Pierre Fraigniaud. Certification of Compact Low-Stretch Routing Schemes. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{balliu_et_al:LIPIcs.DISC.2017.6, author = {Balliu, Alkida and Fraigniaud, Pierre}, title = {{Certification of Compact Low-Stretch Routing Schemes}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.6}, URN = {urn:nbn:de:0030-drops-79807}, doi = {10.4230/LIPIcs.DISC.2017.6}, annote = {Keywords: Distributed verification, compact routing, local computing} }
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{becker_et_al:LIPIcs.DISC.2017.7, author = {Becker, Ruben and Karrenbauer, Andreas and Krinninger, Sebastian and Lenzen, Christoph}, title = {{Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.7}, URN = {urn:nbn:de:0030-drops-80031}, doi = {10.4230/LIPIcs.DISC.2017.7}, annote = {Keywords: Shortest Paths, Shortest Transshipment, Undirected Min-cost Flow, Gradient Descent, Spanner} }
Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, and Franck Petit. Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bouchard_et_al:LIPIcs.DISC.2017.8, author = {Bouchard, S\'{e}bastien and Bournat, Marjorie and Dieudonn\'{e}, Yoann and Dubois, Swan and Petit, Franck}, title = {{Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.8}, URN = {urn:nbn:de:0030-drops-79631}, doi = {10.4230/LIPIcs.DISC.2017.8}, annote = {Keywords: mobile agents, asynchronous rendezvous, plane, infinite grid, deterministic algorithm, polynomial cost} }
Trevor Brown and Srivatsan Ravi. Cost of Concurrency in Hybrid Transactional Memory. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{brown_et_al:LIPIcs.DISC.2017.9, author = {Brown, Trevor and Ravi, Srivatsan}, title = {{Cost of Concurrency in Hybrid Transactional Memory}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.9}, URN = {urn:nbn:de:0030-drops-79958}, doi = {10.4230/LIPIcs.DISC.2017.9}, annote = {Keywords: Transactional memory, Lower bounds, Opacity} }
Keren Censor-Hillel, Seri Khoury, and Ami Paz. Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{censorhillel_et_al:LIPIcs.DISC.2017.10, author = {Censor-Hillel, Keren and Khoury, Seri and Paz, Ami}, title = {{Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.10}, URN = {urn:nbn:de:0030-drops-79969}, doi = {10.4230/LIPIcs.DISC.2017.10}, annote = {Keywords: CONGEST, Lower Bounds, Minimum Vertex Cover, Chromatic Number, Weighted APSP} }
Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{censorhillel_et_al:LIPIcs.DISC.2017.11, author = {Censor-Hillel, Keren and Parter, Merav and Schwartzman, Gregory}, title = {{Derandomizing Local Distributed Algorithms under Bandwidth Restrictions}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.11}, URN = {urn:nbn:de:0030-drops-79759}, doi = {10.4230/LIPIcs.DISC.2017.11}, annote = {Keywords: Local problems, congested clique, derandomization} }
David Yu Cheng Chan, Vassos Hadzilacos, and Sam Toueg. On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chan_et_al:LIPIcs.DISC.2017.12, author = {Chan, David Yu Cheng and Hadzilacos, Vassos and Toueg, Sam}, title = {{On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.12}, URN = {urn:nbn:de:0030-drops-79973}, doi = {10.4230/LIPIcs.DISC.2017.12}, annote = {Keywords: Set Agreement, Asynchronous System, Shared Memory} }
Colin Cooper, Tomasz Radzik, Nicolás Rivera, and Takeharu Shiraga. Fast Plurality Consensus in Regular Expanders. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{cooper_et_al:LIPIcs.DISC.2017.13, author = {Cooper, Colin and Radzik, Tomasz and Rivera, Nicol\'{a}s and Shiraga, Takeharu}, title = {{Fast Plurality Consensus in Regular Expanders}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.13}, URN = {urn:nbn:de:0030-drops-79778}, doi = {10.4230/LIPIcs.DISC.2017.13}, annote = {Keywords: Plurality consensus, Regular expanders} }
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita. Meeting in a Polygon by Anonymous Oblivious Robots. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{diluna_et_al:LIPIcs.DISC.2017.14, author = {Di Luna, Giuseppe A. and Flocchini, Paola and Santoro, Nicola and Viglietta, Giovanni and Yamashita, Masafumi}, title = {{Meeting in a Polygon by Anonymous Oblivious Robots}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.14}, URN = {urn:nbn:de:0030-drops-79833}, doi = {10.4230/LIPIcs.DISC.2017.14}, annote = {Keywords: Meeting problem, Oblivious robots, Polygon, Self-stabilization} }
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, and Ioan Todinca. Three Notes on Distributed Property Testing. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 15:1-15:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{even_et_al:LIPIcs.DISC.2017.15, author = {Even, Guy and Fischer, Orr and Fraigniaud, Pierre and Gonen, Tzlil and Levi, Reut and Medina, Moti and Montealegre, Pedro and Olivetti, Dennis and Oshman, Rotem and Rapaport, Ivan and Todinca, Ioan}, title = {{Three Notes on Distributed Property Testing}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {15:1--15:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.15}, URN = {urn:nbn:de:0030-drops-79847}, doi = {10.4230/LIPIcs.DISC.2017.15}, annote = {Keywords: Property testing, Property correcting, Distributed algorithms, CONGEST model} }
Laurent Feuilloley and Pierre Fraigniaud. Error-Sensitive Proof-Labeling Schemes. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{feuilloley_et_al:LIPIcs.DISC.2017.16, author = {Feuilloley, Laurent and Fraigniaud, Pierre}, title = {{Error-Sensitive Proof-Labeling Schemes}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.16}, URN = {urn:nbn:de:0030-drops-80180}, doi = {10.4230/LIPIcs.DISC.2017.16}, annote = {Keywords: Fault-tolerance, distributed decision, distributed property testing} }
Manuela Fischer. Improved Deterministic Distributed Matching via Rounding. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fischer:LIPIcs.DISC.2017.17, author = {Fischer, Manuela}, title = {{Improved Deterministic Distributed Matching via Rounding}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.17}, URN = {urn:nbn:de:0030-drops-80027}, doi = {10.4230/LIPIcs.DISC.2017.17}, annote = {Keywords: distributed graph algorithms, deterministic distributed algorithms, rounding linear programs, maximal matching, maximum matching approximation} }
Manuela Fischer and Mohsen Ghaffari. Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fischer_et_al:LIPIcs.DISC.2017.18, author = {Fischer, Manuela and Ghaffari, Mohsen}, title = {{Sublogarithmic Distributed Algorithms for Lov\'{a}sz Local Lemma, and the Complexity Hierarchy}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.18}, URN = {urn:nbn:de:0030-drops-79732}, doi = {10.4230/LIPIcs.DISC.2017.18}, annote = {Keywords: Distributed Graph Algorithms, the Lov'\{a\}sz Local Lemma (LLL), Locally Checkable Labeling problems (LCL), Defective Coloring, Frugal Coloring, List Ve} }
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, and Jara Uitto. Improved Distributed Degree Splitting and Edge Coloring. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2017.19, author = {Ghaffari, Mohsen and Hirvonen, Juho and Kuhn, Fabian and Maus, Yannic and Suomela, Jukka and Uitto, Jara}, title = {{Improved Distributed Degree Splitting and Edge Coloring}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.19}, URN = {urn:nbn:de:0030-drops-79794}, doi = {10.4230/LIPIcs.DISC.2017.19}, annote = {Keywords: Distributed Graph Algorithms, Degree Splitting, Edge Coloring, Discrepancy} }
Mohsen Ghaffari and Christiana Lymouri. Simple and Near-Optimal Distributed Coloring for Sparse Graphs. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2017.20, author = {Ghaffari, Mohsen and Lymouri, Christiana}, title = {{Simple and Near-Optimal Distributed Coloring for Sparse Graphs}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.20}, URN = {urn:nbn:de:0030-drops-80178}, doi = {10.4230/LIPIcs.DISC.2017.20}, annote = {Keywords: Distributed Graph Algorithms, Graph Coloring, Arboricity} }
Mohsen Ghaffari and Merav Parter. Near-Optimal Distributed DFS in Planar Graphs. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2017.21, author = {Ghaffari, Mohsen and Parter, Merav}, title = {{Near-Optimal Distributed DFS in Planar Graphs}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.21}, URN = {urn:nbn:de:0030-drops-80195}, doi = {10.4230/LIPIcs.DISC.2017.21}, annote = {Keywords: congest model, planar graphs, separator} }
Abdolhamid Ghodselahi and Fabian Kuhn. Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ghodselahi_et_al:LIPIcs.DISC.2017.22, author = {Ghodselahi, Abdolhamid and Kuhn, Fabian}, title = {{Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.22}, URN = {urn:nbn:de:0030-drops-79857}, doi = {10.4230/LIPIcs.DISC.2017.22}, annote = {Keywords: Arrow protocol, competitive analysis, distributed queueing, shared objects, tree embeddings} }
Alexey Gotsman and Sebastian Burckhardt. Consistency Models with Global Operation Sequencing and their Composition. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gotsman_et_al:LIPIcs.DISC.2017.23, author = {Gotsman, Alexey and Burckhardt, Sebastian}, title = {{Consistency Models with Global Operation Sequencing and their Composition}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.23}, URN = {urn:nbn:de:0030-drops-79748}, doi = {10.4230/LIPIcs.DISC.2017.23}, annote = {Keywords: Consistency conditions, Weak memory models, Compositionality} }
Ofer Grossman and Merav Parter. Improved Deterministic Distributed Construction of Spanners. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{grossman_et_al:LIPIcs.DISC.2017.24, author = {Grossman, Ofer and Parter, Merav}, title = {{Improved Deterministic Distributed Construction of Spanners}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.24}, URN = {urn:nbn:de:0030-drops-80085}, doi = {10.4230/LIPIcs.DISC.2017.24}, annote = {Keywords: spanners, clustering, deterministic algorithms, congest model} }
Magnús M. Halldórsson, Fabian Kuhn, Nancy Lynch, and Calvin Newport. An Efficient Communication Abstraction for Dense Wireless Networks. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{halldorsson_et_al:LIPIcs.DISC.2017.25, author = {Halld\'{o}rsson, Magn\'{u}s M. and Kuhn, Fabian and Lynch, Nancy and Newport, Calvin}, title = {{An Efficient Communication Abstraction for Dense Wireless Networks}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.25}, URN = {urn:nbn:de:0030-drops-79898}, doi = {10.4230/LIPIcs.DISC.2017.25}, annote = {Keywords: wireless networks, abstractions, SINR, signal fading} }
Itay Hazan and Eyal Kushilevitz. Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{hazan_et_al:LIPIcs.DISC.2017.26, author = {Hazan, Itay and Kushilevitz, Eyal}, title = {{Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.26}, URN = {urn:nbn:de:0030-drops-79998}, doi = {10.4230/LIPIcs.DISC.2017.26}, annote = {Keywords: Communication Complexity, Direct Sum, Multiparty Communication} }
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal. Which Broadcast Abstraction Captures k-Set Agreement?. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{imbs_et_al:LIPIcs.DISC.2017.27, author = {Imbs, Damien and Most\'{e}faoui, Achour and Perrin, Matthieu and Raynal, Michel}, title = {{Which Broadcast Abstraction Captures k-Set Agreement?}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.27}, URN = {urn:nbn:de:0030-drops-79943}, doi = {10.4230/LIPIcs.DISC.2017.27}, annote = {Keywords: Agreement problem, Antichain, Asynchronous system, Communication abstraction, Consensus, Message-passing system, Partially ordered set, Process crash} }
Shady Issa, Pascal Felber, Alexander Matveev, and Paolo Romano. Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend/Resume. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{issa_et_al:LIPIcs.DISC.2017.28, author = {Issa, Shady and Felber, Pascal and Matveev, Alexander and Romano, Paolo}, title = {{Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend/Resume}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.28}, URN = {urn:nbn:de:0030-drops-79811}, doi = {10.4230/LIPIcs.DISC.2017.28}, annote = {Keywords: hardware transactional memory, self tuning, parallel programming} }
Irvan Jahja, Haifeng Yu, and Yuda Zhao. Some Lower Bounds in Dynamic Networks with Oblivious Adversaries. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jahja_et_al:LIPIcs.DISC.2017.29, author = {Jahja, Irvan and Yu, Haifeng and Zhao, Yuda}, title = {{Some Lower Bounds in Dynamic Networks with Oblivious Adversaries}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.29}, URN = {urn:nbn:de:0030-drops-79690}, doi = {10.4230/LIPIcs.DISC.2017.29}, annote = {Keywords: dynamic networks, oblivious adversary, adaptive adversary, lower bounds, communication complexity} }
Prasad Jayanti and Anup Joshi. Recoverable FCFS Mutual Exclusion with Wait-Free Recovery. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jayanti_et_al:LIPIcs.DISC.2017.30, author = {Jayanti, Prasad and Joshi, Anup}, title = {{Recoverable FCFS Mutual Exclusion with Wait-Free Recovery}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.30}, URN = {urn:nbn:de:0030-drops-80005}, doi = {10.4230/LIPIcs.DISC.2017.30}, annote = {Keywords: concurrent algorithm, synchronization, mutual exclusion, recovery, fault tolerance, non-volatile main memory, shared memory, multi-core algorithms} }
Gillat Kol, Rotem Oshman, and Dafna Sadeh. Interactive Compression for Multi-Party Protocol. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 31:1-31:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kol_et_al:LIPIcs.DISC.2017.31, author = {Kol, Gillat and Oshman, Rotem and Sadeh, Dafna}, title = {{Interactive Compression for Multi-Party Protocol}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {31:1--31:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.31}, URN = {urn:nbn:de:0030-drops-80111}, doi = {10.4230/LIPIcs.DISC.2017.31}, annote = {Keywords: interactive compression, multi-party communication} }
Christoph Lenzen and Joel Rybicki. Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{lenzen_et_al:LIPIcs.DISC.2017.32, author = {Lenzen, Christoph and Rybicki, Joel}, title = {{Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.32}, URN = {urn:nbn:de:0030-drops-79914}, doi = {10.4230/LIPIcs.DISC.2017.32}, annote = {Keywords: Byzantine faults, self-stabilisation, clock synchronisation, consensus} }
Nancy Lynch, Cameron Musco, and Merav Parter. Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{lynch_et_al:LIPIcs.DISC.2017.33, author = {Lynch, Nancy and Musco, Cameron and Parter, Merav}, title = {{Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.33}, URN = {urn:nbn:de:0030-drops-79863}, doi = {10.4230/LIPIcs.DISC.2017.33}, annote = {Keywords: spiking neural networks, biological distributed algorithms, circuit design} }
Varun Kanade, Frederik Mallmann-Trenn, and Victor Verdugo. How Large Is Your Graph?. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 34:1-34:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kanade_et_al:LIPIcs.DISC.2017.34, author = {Kanade, Varun and Mallmann-Trenn, Frederik and Verdugo, Victor}, title = {{How Large Is Your Graph?}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {34:1--34:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.34}, URN = {urn:nbn:de:0030-drops-79767}, doi = {10.4230/LIPIcs.DISC.2017.34}, annote = {Keywords: Estimation, Random Walks, Social Networks} }
Hammurabi Mendes and Maurice Herlihy. Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{mendes_et_al:LIPIcs.DISC.2017.35, author = {Mendes, Hammurabi and Herlihy, Maurice}, title = {{Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {35:1--35:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.35}, URN = {urn:nbn:de:0030-drops-79930}, doi = {10.4230/LIPIcs.DISC.2017.35}, annote = {Keywords: Byzantine, synchronous, k-set agreement, topology, connectivity} }
Ellis Michael, Dan R. K. Ports, Naveen Kr. Sharma, and Adriana Szekeres. Recovering Shared Objects Without Stable Storage. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{michael_et_al:LIPIcs.DISC.2017.36, author = {Michael, Ellis and Ports, Dan R. K. and Sharma, Naveen Kr. and Szekeres, Adriana}, title = {{Recovering Shared Objects Without Stable Storage}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.36}, URN = {urn:nbn:de:0030-drops-80055}, doi = {10.4230/LIPIcs.DISC.2017.36}, annote = {Keywords: asynchronous system, fault-tolerance, crash-recovery, R/W register, state machine replication} }
Faisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B. Morrey III, Dhruva R. Chakrabarti, and Michael L. Scott. Dalí: A Periodically Persistent Hash Map. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 37:1-37:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{nawab_et_al:LIPIcs.DISC.2017.37, author = {Nawab, Faisal and Izraelevitz, Joseph and Kelly, Terence and Morrey III, Charles B. and Chakrabarti, Dhruva R. and Scott, Michael L.}, title = {{Dal{\'\i}: A Periodically Persistent Hash Map}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {37:1--37:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.37}, URN = {urn:nbn:de:0030-drops-80148}, doi = {10.4230/LIPIcs.DISC.2017.37}, annote = {Keywords: data structure, nonvolatile memory, durable linearizability} }
Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson. Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{pai_et_al:LIPIcs.DISC.2017.38, author = {Pai, Shreyas and Pandurangan, Gopal and Pemmaraju, Sriram V. and Riaz, Talal and Robinson, Peter}, title = {{Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.38}, URN = {urn:nbn:de:0030-drops-80132}, doi = {10.4230/LIPIcs.DISC.2017.38}, annote = {Keywords: Congest model, Local model, Maximal independent set, Message complexity, Round complexity, Ruling sets, Symmetry breaking} }
Rafael Pass and Elaine Shi. Hybrid Consensus: Efficient Consensus in the Permissionless Model. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 39:1-39:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{pass_et_al:LIPIcs.DISC.2017.39, author = {Pass, Rafael and Shi, Elaine}, title = {{Hybrid Consensus: Efficient Consensus in the Permissionless Model}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {39:1--39:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.39}, URN = {urn:nbn:de:0030-drops-80040}, doi = {10.4230/LIPIcs.DISC.2017.39}, annote = {Keywords: Distributed Consensus, Permissionless, Responsiveness} }
Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 40:1-40:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{spiegelman_et_al:LIPIcs.DISC.2017.40, author = {Spiegelman, Alexander and Keidar, Idit and Malkhi, Dahlia}, title = {{Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {40:1--40:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.40}, URN = {urn:nbn:de:0030-drops-79673}, doi = {10.4230/LIPIcs.DISC.2017.40}, annote = {Keywords: Reconfiguration, Dynamic Objects, Optimal Algorithm} }
Ittai Abraham, Srinivas Devadas, Kartik Nayak, and Ling Ren. Brief Announcement: Practical Synchronous Byzantine Consensus. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 41:1-41:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{abraham_et_al:LIPIcs.DISC.2017.41, author = {Abraham, Ittai and Devadas, Srinivas and Nayak, Kartik and Ren, Ling}, title = {{Brief Announcement: Practical Synchronous Byzantine Consensus}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {41:1--41:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.41}, URN = {urn:nbn:de:0030-drops-79703}, doi = {10.4230/LIPIcs.DISC.2017.41}, annote = {Keywords: consensus, agreement, Byzantine fault tolerance, replication, synchrony} }
Yehuda Afek, Yuval Emek, and Noa Kolikant. Brief Announcement: The Synergy of Finite State Machines. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 42:1-42:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{afek_et_al:LIPIcs.DISC.2017.42, author = {Afek, Yehuda and Emek, Yuval and Kolikant, Noa}, title = {{Brief Announcement: The Synergy of Finite State Machines}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {42:1--42:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.42}, URN = {urn:nbn:de:0030-drops-80072}, doi = {10.4230/LIPIcs.DISC.2017.42}, annote = {Keywords: beeping communication, finite state machine, stone age model, distributed network complexity} }
Lélia Blin and Sébastien Tixeuil. Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 43:1-43:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{blin_et_al:LIPIcs.DISC.2017.43, author = {Blin, L\'{e}lia and Tixeuil, S\'{e}bastien}, title = {{Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {43:1--43:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.43}, URN = {urn:nbn:de:0030-drops-79829}, doi = {10.4230/LIPIcs.DISC.2017.43}, annote = {Keywords: Leader Election, Self-stabilization, Memory Complexity, Arbitrary Graphs} }
Karl Bringmann and Sebastian Krinninger. Brief Announcement: A Note on Hardness of Diameter Approximation. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 44:1-44:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bringmann_et_al:LIPIcs.DISC.2017.44, author = {Bringmann, Karl and Krinninger, Sebastian}, title = {{Brief Announcement: A Note on Hardness of Diameter Approximation}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {44:1--44:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.44}, URN = {urn:nbn:de:0030-drops-79874}, doi = {10.4230/LIPIcs.DISC.2017.44}, annote = {Keywords: diameter, fine-grained reductions, conditional lower bounds} }
Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, and Marcos K. Aguilera. Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 45:1-45:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{calciu_et_al:LIPIcs.DISC.2017.45, author = {Calciu, Irina and Sen, Siddhartha and Balakrishnan, Mahesh and Aguilera, Marcos K.}, title = {{Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {45:1--45:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.45}, URN = {urn:nbn:de:0030-drops-80122}, doi = {10.4230/LIPIcs.DISC.2017.45}, annote = {Keywords: concurrent data structures, log, NUMA architecture, replication} }
Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, and Pratik Sarkar. Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 46:1-46:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{choudhury_et_al:LIPIcs.DISC.2017.46, author = {Choudhury, Ashish and Garimella, Gayathri and Patra, Arpita and Ravi, Divya and Sarkar, Pratik}, title = {{Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {46:1--46:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.46}, URN = {urn:nbn:de:0030-drops-79784}, doi = {10.4230/LIPIcs.DISC.2017.46}, annote = {Keywords: Directed graph, Consensus, Crash failure, Round complexity} }
Andrea Clementi, Luciano Gualà, Francesco Pasquale, and Giacomo Scornavacca. Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 47:1-47:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{clementi_et_al:LIPIcs.DISC.2017.47, author = {Clementi, Andrea and Gual\`{a}, Luciano and Pasquale, Francesco and Scornavacca, Giacomo}, title = {{Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {47:1--47:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.47}, URN = {urn:nbn:de:0030-drops-79724}, doi = {10.4230/LIPIcs.DISC.2017.47}, annote = {Keywords: Distributed Consensus, Dynamics, Gossip model, Markov chains} }
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi. Brief Announcement: Shape Formation by Programmable Particles. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 48:1-48:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{diluna_et_al:LIPIcs.DISC.2017.48, author = {Di Luna, Giuseppe A. and Flocchini, Paola and Santoro, Nicola and Viglietta, Giovanni and Yamauchi, Yukiko}, title = {{Brief Announcement: Shape Formation by Programmable Particles}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {48:1--48:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.48}, URN = {urn:nbn:de:0030-drops-80019}, doi = {10.4230/LIPIcs.DISC.2017.48}, annote = {Keywords: Shape formation, pattern formation, programmable matter, Amoebots, leader election, distributed algorithms, self-assembly} }
Ryota Eguchi and Taisuke Izumi. Brief Announcement: Fast Aggregation in Population Protocols. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 49:1-49:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{eguchi_et_al:LIPIcs.DISC.2017.49, author = {Eguchi, Ryota and Izumi, Taisuke}, title = {{Brief Announcement: Fast Aggregation in Population Protocols}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {49:1--49:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.49}, URN = {urn:nbn:de:0030-drops-79981}, doi = {10.4230/LIPIcs.DISC.2017.49}, annote = {Keywords: population protocol, aggregation} }
Michal Friedman, Maurice Herlihy, Virendra Marathe, and Erez Petrank. Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 50:1-50:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{friedman_et_al:LIPIcs.DISC.2017.50, author = {Friedman, Michal and Herlihy, Maurice and Marathe, Virendra and Petrank, Erez}, title = {{Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {50:1--50:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.50}, URN = {urn:nbn:de:0030-drops-79689}, doi = {10.4230/LIPIcs.DISC.2017.50}, annote = {Keywords: Non-volatile Memory, Concurrent Data Structures, Non-blocking, Lock-free} }
Matthias Függer, Thomas Nowak, and Manfred Schwarz. Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 51:1-51:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fugger_et_al:LIPIcs.DISC.2017.51, author = {F\"{u}gger, Matthias and Nowak, Thomas and Schwarz, Manfred}, title = {{Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {51:1--51:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.51}, URN = {urn:nbn:de:0030-drops-79921}, doi = {10.4230/LIPIcs.DISC.2017.51}, annote = {Keywords: Asymptotic Consensus, Dynamic Networks, Contraction Rate, Time Commplexity, Lower Bounds} }
Vijay K. Garg. Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 52:1-52:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{garg:LIPIcs.DISC.2017.52, author = {Garg, Vijay K.}, title = {{Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {52:1--52:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.52}, URN = {urn:nbn:de:0030-drops-79719}, doi = {10.4230/LIPIcs.DISC.2017.52}, annote = {Keywords: Stable Matching, Linear Predicates, Distributive Lattices} }
Rati Gelashvili, Idit Keidar, Alexander Spiegelman, and Roger Wattenhofer. Brief Announcement: Towards Reduced Instruction Sets for Synchronization. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 53:1-53:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gelashvili_et_al:LIPIcs.DISC.2017.53, author = {Gelashvili, Rati and Keidar, Idit and Spiegelman, Alexander and Wattenhofer, Roger}, title = {{Brief Announcement: Towards Reduced Instruction Sets for Synchronization}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {53:1--53:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.53}, URN = {urn:nbn:de:0030-drops-80201}, doi = {10.4230/LIPIcs.DISC.2017.53}, annote = {Keywords: Consensus hierarchy, universal construction, synchronization instruction.} }
Tomasz Jurdzínski and Krzysztof Nowicki. Brief Announcement: On Connectivity in the Broadcast Congested Clique. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 54:1-54:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jurdzinski_et_al:LIPIcs.DISC.2017.54, author = {Jurdz{\'\i}nski, Tomasz and Nowicki, Krzysztof}, title = {{Brief Announcement: On Connectivity in the Broadcast Congested Clique}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {54:1--54:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.54}, URN = {urn:nbn:de:0030-drops-79903}, doi = {10.4230/LIPIcs.DISC.2017.54}, annote = {Keywords: congested clique, broadcast, connected components, bandwidth} }
Janne H. Korhonen and Jukka Suomela. Brief Announcement: Towards a Complexity Theory for the Congested Clique. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 55:1-55:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{korhonen_et_al:LIPIcs.DISC.2017.55, author = {Korhonen, Janne H. and Suomela, Jukka}, title = {{Brief Announcement: Towards a Complexity Theory for the Congested Clique}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {55:1--55:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.55}, URN = {urn:nbn:de:0030-drops-79889}, doi = {10.4230/LIPIcs.DISC.2017.55}, annote = {Keywords: distributed computing, congested clique, complexity theory} }
Petr Kuznetsov, Thibault Rieutord, and Yuan He. Brief Announcement: Compact Topology of Shared-Memory Adversaries. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 56:1-56:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kuznetsov_et_al:LIPIcs.DISC.2017.56, author = {Kuznetsov, Petr and Rieutord, Thibault and He, Yuan}, title = {{Brief Announcement: Compact Topology of Shared-Memory Adversaries}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {56:1--56:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.56}, URN = {urn:nbn:de:0030-drops-80108}, doi = {10.4230/LIPIcs.DISC.2017.56}, annote = {Keywords: Adversarial models, Affine tasks, Topological characterization} }
Christoph Lenzen and Reut Levi. Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 57:1-57:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{lenzen_et_al:LIPIcs.DISC.2017.57, author = {Lenzen, Christoph and Levi, Reut}, title = {{Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {57:1--57:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.57}, URN = {urn:nbn:de:0030-drops-80064}, doi = {10.4230/LIPIcs.DISC.2017.57}, annote = {Keywords: local, spanning graph, sparse} }
Bruna S. Peres, Olga Goussevskaia, Stefan Schmid, and Chen Avin. Brief Announcement: Distributed SplayNets. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 58:1-58:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{peres_et_al:LIPIcs.DISC.2017.58, author = {Peres, Bruna S. and Goussevskaia, Olga and Schmid, Stefan and Avin, Chen}, title = {{Brief Announcement: Distributed SplayNets}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {58:1--58:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.58}, URN = {urn:nbn:de:0030-drops-79661}, doi = {10.4230/LIPIcs.DISC.2017.58}, annote = {Keywords: Decentralization, Concurrency, Reconfigurable Networks} }
Laurent Massoulié and Rémi Varloot. Brief Announcement: Rapid Mixing of Local Dynamics on Graphs. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 59:1-59:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{massoulie_et_al:LIPIcs.DISC.2017.59, author = {Massouli\'{e}, Laurent and Varloot, R\'{e}mi}, title = {{Brief Announcement: Rapid Mixing of Local Dynamics on Graphs}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {59:1--59:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.59}, URN = {urn:nbn:de:0030-drops-79649}, doi = {10.4230/LIPIcs.DISC.2017.59}, annote = {Keywords: Markov chains, Mixing time, Dynamic graphs, Local dynamics} }
Feedback for Dagstuhl Publishing