@Proceedings{schmid_et_al:LIPIcs.DISC.2018,
title = {{LIPIcs, Volume 121, DISC'18, Complete Volume}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018},
URN = {urn:nbn:de:0030-drops-98456},
doi = {10.4230/LIPIcs.DISC.2018},
annote = {Keywords: Software and its engineering, Distributed systems organizing principles, Computing methodologies, Distributed computing methodologies}
}
@InProceedings{schmid_et_al:LIPIcs.DISC.2018.0,
author = {Schmid, Ulrich and Widder, Josef},
title = {{Front Matter, Table of Contents, Preface, Conference Organization, Awards}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.0},
URN = {urn:nbn:de:0030-drops-97899},
doi = {10.4230/LIPIcs.DISC.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization, Awards}
}
@InProceedings{fekete:LIPIcs.DISC.2018.1,
author = {Fekete, S\'{a}ndor P.},
title = {{Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.1},
URN = {urn:nbn:de:0030-drops-97904},
doi = {10.4230/LIPIcs.DISC.2018.1},
annote = {Keywords: Autonomous vehicles, interaction, robot swarms, game theory}
}
@InProceedings{goldstein:LIPIcs.DISC.2018.2,
author = {Goldstein, Tom},
title = {{Challenges for Machine Learning on Distributed Platforms}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {2:1--2:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.2},
URN = {urn:nbn:de:0030-drops-97910},
doi = {10.4230/LIPIcs.DISC.2018.2},
annote = {Keywords: Machine learning, distributed optimization}
}
@InProceedings{mendler:LIPIcs.DISC.2018.3,
author = {Mendler, Michael},
title = {{Logical Analysis of Distributed Systems: The Importance of Being Constructive}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.3},
URN = {urn:nbn:de:0030-drops-97925},
doi = {10.4230/LIPIcs.DISC.2018.3},
annote = {Keywords: Hardware synchronisation, inertial delays, delay-insensitive circuits, constructive circuits, metastability, constructive modal logic}
}
@InProceedings{afek_et_al:LIPIcs.DISC.2018.4,
author = {Afek, Yehuda and Emek, Yuval and Kolikant, Noa},
title = {{Selecting a Leader in a Network of Finite State Machines}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.4},
URN = {urn:nbn:de:0030-drops-97933},
doi = {10.4230/LIPIcs.DISC.2018.4},
annote = {Keywords: stone age model, beeping communication scheme, leader election, k-leader selection, randomized finite state machines, asynchronous scheduler}
}
@InProceedings{afek_et_al:LIPIcs.DISC.2018.5,
author = {Afek, Yehuda and Rafaeli, Shaked and Sulamy, Moshe},
title = {{The Role of A-priori Information in Networks of Rational Agents}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.5},
URN = {urn:nbn:de:0030-drops-97945},
doi = {10.4230/LIPIcs.DISC.2018.5},
annote = {Keywords: rational agents, distributed game theory, coloring, knowledge sharing}
}
@InProceedings{ahmadi_et_al:LIPIcs.DISC.2018.6,
author = {Ahmadi, Mohamad and Kuhn, Fabian and Oshman, Rotem},
title = {{Distributed Approximate Maximum Matching in the CONGEST Model}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.6},
URN = {urn:nbn:de:0030-drops-97950},
doi = {10.4230/LIPIcs.DISC.2018.6},
annote = {Keywords: distributed graph algorithms, maximum matching, deterministic rounding, communication complexity}
}
@InProceedings{antoniadis_et_al:LIPIcs.DISC.2018.7,
author = {Antoniadis, Karolos and Guerraoui, Rachid and Malkhi, Dahlia and Seredinschi, Dragos-Adrian},
title = {{State Machine Replication Is More Expensive Than Consensus}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.7},
URN = {urn:nbn:de:0030-drops-97961},
doi = {10.4230/LIPIcs.DISC.2018.7},
annote = {Keywords: Consensus, State machine replication, Synchronous model}
}
@InProceedings{aspnes_et_al:LIPIcs.DISC.2018.8,
author = {Aspnes, James and Haeupler, Bernhard and Tong, Alexander and Woelfel, Philipp},
title = {{Allocate-On-Use Space Complexity of Shared-Memory Algorithms}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.8},
URN = {urn:nbn:de:0030-drops-97974},
doi = {10.4230/LIPIcs.DISC.2018.8},
annote = {Keywords: Space complexity, memory allocation, mutual exclusion}
}
@InProceedings{balliu_et_al:LIPIcs.DISC.2018.9,
author = {Balliu, Alkida and Brandt, Sebastian and Olivetti, Dennis and Suomela, Jukka},
title = {{Almost Global Problems in the LOCAL Model}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.9},
URN = {urn:nbn:de:0030-drops-97982},
doi = {10.4230/LIPIcs.DISC.2018.9},
annote = {Keywords: Distributed complexity theory, locally checkable labellings, LOCAL model}
}
@InProceedings{berenbrink_et_al:LIPIcs.DISC.2018.10,
author = {Berenbrink, Petra and Els\"{a}sser, Robert and Friedetzky, Tom and Kaaser, Dominik and Kling, Peter and Radzik, Tomasz},
title = {{A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.10},
URN = {urn:nbn:de:0030-drops-97999},
doi = {10.4230/LIPIcs.DISC.2018.10},
annote = {Keywords: Population Protocols, Randomized Algorithms, Majority}
}
@InProceedings{berger_et_al:LIPIcs.DISC.2018.11,
author = {Berger, Alon and Keidar, Idit and Spiegelman, Alexander},
title = {{Integrated Bounds for Disintegrated Storage}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {11:1--11:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.11},
URN = {urn:nbn:de:0030-drops-98009},
doi = {10.4230/LIPIcs.DISC.2018.11},
annote = {Keywords: storage, coding, lower bounds, space complexity, register emulations}
}
@InProceedings{bonamy_et_al:LIPIcs.DISC.2018.12,
author = {Bonamy, Marthe and Ouvrard, Paul and Rabie, Mika\"{e}l and Suomela, Jukka and Uitto, Jara},
title = {{Distributed Recoloring}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.12},
URN = {urn:nbn:de:0030-drops-98012},
doi = {10.4230/LIPIcs.DISC.2018.12},
annote = {Keywords: Distributed Systems, Graph Algorithms, Local Computations}
}
@InProceedings{brandt_et_al:LIPIcs.DISC.2018.13,
author = {Brandt, Sebastian and Uitto, Jara and Wattenhofer, Roger},
title = {{A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.13},
URN = {urn:nbn:de:0030-drops-98029},
doi = {10.4230/LIPIcs.DISC.2018.13},
annote = {Keywords: Finite automata, Graph exploration, Mobile robots}
}
@InProceedings{chockler_et_al:LIPIcs.DISC.2018.14,
author = {Chockler, Gregory and Gotsman, Alexey},
title = {{Multi-Shot Distributed Transaction Commit}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.14},
URN = {urn:nbn:de:0030-drops-98038},
doi = {10.4230/LIPIcs.DISC.2018.14},
annote = {Keywords: Atomic commit problem, two-phase commit, Paxos}
}
@InProceedings{czumaj_et_al:LIPIcs.DISC.2018.15,
author = {Czumaj, Artur and Davies, Peter},
title = {{Deterministic Blind Radio Networks}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.15},
URN = {urn:nbn:de:0030-drops-98047},
doi = {10.4230/LIPIcs.DISC.2018.15},
annote = {Keywords: Broadcasting, Deterministic Algorithms, Radio Networks}
}
@InProceedings{czumaj_et_al:LIPIcs.DISC.2018.16,
author = {Czumaj, Artur and Konrad, Christian},
title = {{Detecting Cliques in CONGEST Networks}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.16},
URN = {urn:nbn:de:0030-drops-98057},
doi = {10.4230/LIPIcs.DISC.2018.16},
annote = {Keywords: Lower bounds, CONGEST, subgraph detection, two-party communication}
}
@InProceedings{daian_et_al:LIPIcs.DISC.2018.17,
author = {Daian, Eli and Losa, Giuliano and Afek, Yehuda and Gafni, Eli},
title = {{A Wealth of Sub-Consensus Deterministic Objects}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.17},
URN = {urn:nbn:de:0030-drops-98061},
doi = {10.4230/LIPIcs.DISC.2018.17},
annote = {Keywords: shared memory, distributed algorithms, wait-free, set consensus}
}
@InProceedings{daly_et_al:LIPIcs.DISC.2018.18,
author = {Daly, Henry and Hassan, Ahmed and Spear, Michael F. and Palmieri, Roberto},
title = {{NUMASK: High Performance Scalable Skip List for NUMA}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.18},
URN = {urn:nbn:de:0030-drops-98076},
doi = {10.4230/LIPIcs.DISC.2018.18},
annote = {Keywords: Skip list, NUMA, Concurrent Data Structure}
}
@InProceedings{diluna_et_al:LIPIcs.DISC.2018.19,
author = {Di Luna, Giuseppe A. and Flocchini, Paola and Santoro, Nicola and Viglietta, Giovanni},
title = {{TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.19},
URN = {urn:nbn:de:0030-drops-98086},
doi = {10.4230/LIPIcs.DISC.2018.19},
annote = {Keywords: Mobile Robots, Turing Machine, Real RAM}
}
@InProceedings{dufoulon_et_al:LIPIcs.DISC.2018.20,
author = {Dufoulon, Fabien and Burman, Janna and Beauquier, Joffroy},
title = {{Beeping a Deterministic Time-Optimal Leader Election}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.20},
URN = {urn:nbn:de:0030-drops-98090},
doi = {10.4230/LIPIcs.DISC.2018.20},
annote = {Keywords: distributed algorithms, leader election, beeping model, time complexity, deterministic algorithms, wireless networks}
}
@InProceedings{eghbali_et_al:LIPIcs.DISC.2018.21,
author = {Eghbali, Aryaz and Woelfel, Philipp},
title = {{An Almost Tight RMR Lower Bound for Abortable Test-And-Set}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {21:1--21:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.21},
URN = {urn:nbn:de:0030-drops-98103},
doi = {10.4230/LIPIcs.DISC.2018.21},
annote = {Keywords: Abortability, Test-And-Set, Leader Election, Compare-and-Swap, RMR Complexity, Lower Bound}
}
@InProceedings{even_et_al:LIPIcs.DISC.2018.22,
author = {Even, Guy and Ghaffari, Mohsen and Medina, Moti},
title = {{Distributed Set Cover Approximation: Primal-Dual with Optimal Locality}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.22},
URN = {urn:nbn:de:0030-drops-98114},
doi = {10.4230/LIPIcs.DISC.2018.22},
annote = {Keywords: Distributed Algorithms, Approximation Algorithms, Set Cover, Vertex Cover}
}
@InProceedings{feldman_et_al:LIPIcs.DISC.2018.23,
author = {Feldman, Yotam M. Y. and Enea, Constantin and Morrison, Adam and Rinetzky, Noam and Shoham, Sharon},
title = {{Order out of Chaos: Proving Linearizability Using Local Views}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {23:1--23:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.23},
URN = {urn:nbn:de:0030-drops-98124},
doi = {10.4230/LIPIcs.DISC.2018.23},
annote = {Keywords: concurrency and synchronization, concurrent data structures, lineariazability, optimistic concurrency control, verification and formal methods}
}
@InProceedings{feuilloley_et_al:LIPIcs.DISC.2018.24,
author = {Feuilloley, Laurent and Fraigniaud, Pierre and Hirvonen, Juho and Paz, Ami and Perry, Mor},
title = {{Redundancy in Distributed Proofs}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.24},
URN = {urn:nbn:de:0030-drops-98139},
doi = {10.4230/LIPIcs.DISC.2018.24},
annote = {Keywords: Distributed verification, Distributed graph algorithms, Proof-labeling schemes, Space-time tradeoffs, Non-determinism}
}
@InProceedings{feuilloley_et_al:LIPIcs.DISC.2018.25,
author = {Feuilloley, Laurent and Hirvonen, Juho},
title = {{Local Verification of Global Proofs}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.25},
URN = {urn:nbn:de:0030-drops-98146},
doi = {10.4230/LIPIcs.DISC.2018.25},
annote = {Keywords: Proof-labeling schemes, distributed verification, non-determinism, local proofs}
}
@InProceedings{fischer_et_al:LIPIcs.DISC.2018.26,
author = {Fischer, Manuela and Ghaffari, Mohsen},
title = {{A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {26:1--26:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.26},
URN = {urn:nbn:de:0030-drops-98154},
doi = {10.4230/LIPIcs.DISC.2018.26},
annote = {Keywords: Distributed Graph Algorithms, Parallel Algorithms, Local Algorithms, Locality, Sampling, Glauber Dynamics, Coloring}
}
@InProceedings{fugger_et_al:LIPIcs.DISC.2018.27,
author = {F\"{u}gger, Matthias and Nowak, Thomas},
title = {{Fast Multidimensional Asymptotic and Approximate Consensus}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.27},
URN = {urn:nbn:de:0030-drops-98167},
doi = {10.4230/LIPIcs.DISC.2018.27},
annote = {Keywords: asymptotic consensus, approximate consensus, multidimensional data, dynamic networks, Byzantine processes}
}
@InProceedings{garncarek_et_al:LIPIcs.DISC.2018.28,
author = {Garncarek, Pawel and Jurdzinski, Tomasz and Kowalski, Dariusz R.},
title = {{Local Queuing Under Contention}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.28},
URN = {urn:nbn:de:0030-drops-98172},
doi = {10.4230/LIPIcs.DISC.2018.28},
annote = {Keywords: Distributed algorithms, local queuing, shared channel, multiple-access channel, adversarial packet arrivals, stability, deterministic algorithms}
}
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2018.29,
author = {Ghaffari, Mohsen and Kuhn, Fabian},
title = {{Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.29},
URN = {urn:nbn:de:0030-drops-98181},
doi = {10.4230/LIPIcs.DISC.2018.29},
annote = {Keywords: Distributed Algorithms, Derandomization, Spanners, Dominating Set}
}
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2018.30,
author = {Ghaffari, Mohsen and Kuhn, Fabian},
title = {{Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {30:1--30:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.30},
URN = {urn:nbn:de:0030-drops-98194},
doi = {10.4230/LIPIcs.DISC.2018.30},
annote = {Keywords: Distributed Algorithms, Minimum Spanning Tree, Round Complexity, Message Complexity, Gossiping, Broadcast}
}
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2018.31,
author = {Ghaffari, Mohsen and Li, Jason},
title = {{New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.31},
URN = {urn:nbn:de:0030-drops-98207},
doi = {10.4230/LIPIcs.DISC.2018.31},
annote = {Keywords: Distributed Graph Algorithms, Mixing Time, Random Graphs, Multi-Commodity Routing}
}
@InProceedings{gmyr_et_al:LIPIcs.DISC.2018.32,
author = {Gmyr, Robert and Pandurangan, Gopal},
title = {{Time-Message Trade-Offs in Distributed Algorithms}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.32},
URN = {urn:nbn:de:0030-drops-98216},
doi = {10.4230/LIPIcs.DISC.2018.32},
annote = {Keywords: Randomized Algorithm, KT\underline1 Model, Sparsifier, MST, Singular Optimality}
}
@InProceedings{haeupler_et_al:LIPIcs.DISC.2018.33,
author = {Haeupler, Bernhard and Li, Jason},
title = {{Faster Distributed Shortest Path Approximations via Shortcuts}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.33},
URN = {urn:nbn:de:0030-drops-98229},
doi = {10.4230/LIPIcs.DISC.2018.33},
annote = {Keywords: Distributed Graph Algorithms, Shortest Path, Shortcuts}
}
@InProceedings{taumankalai_et_al:LIPIcs.DISC.2018.34,
author = {Tauman Kalai, Yael and Komargodski, Ilan and Raz, Ran},
title = {{A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.34},
URN = {urn:nbn:de:0030-drops-98230},
doi = {10.4230/LIPIcs.DISC.2018.34},
annote = {Keywords: Coin flipping, adaptive corruptions, byzantine faults, lower bound}
}
@InProceedings{kawarabayashi_et_al:LIPIcs.DISC.2018.35,
author = {Kawarabayashi, Ken-ichi and Schwartzman, Gregory},
title = {{Adapting Local Sequential Algorithms to the Distributed Setting}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {35:1--35:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.35},
URN = {urn:nbn:de:0030-drops-98245},
doi = {10.4230/LIPIcs.DISC.2018.35},
annote = {Keywords: Distributed, Approximation Algorithms, Derandomization, Max-Cut}
}
@InProceedings{loss_et_al:LIPIcs.DISC.2018.36,
author = {Loss, Julian and Maurer, Ueli and Tschudi, Daniel},
title = {{Strong Separations Between Broadcast and Authenticated Channels}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {36:1--36:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.36},
URN = {urn:nbn:de:0030-drops-98252},
doi = {10.4230/LIPIcs.DISC.2018.36},
annote = {Keywords: cryptography, multi-party computation, broadcast, impossibility}
}
@InProceedings{mashreghi_et_al:LIPIcs.DISC.2018.37,
author = {Mashreghi, Ali and King, Valerie},
title = {{Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {37:1--37:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.37},
URN = {urn:nbn:de:0030-drops-98263},
doi = {10.4230/LIPIcs.DISC.2018.37},
annote = {Keywords: Distributed Computing, Minimum Spanning Tree, Broadcast Tree}
}
@InProceedings{newport_et_al:LIPIcs.DISC.2018.38,
author = {Newport, Calvin and Robinson, Peter},
title = {{Fault-Tolerant Consensus with an Abstract MAC Layer}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {38:1--38:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.38},
URN = {urn:nbn:de:0030-drops-98277},
doi = {10.4230/LIPIcs.DISC.2018.38},
annote = {Keywords: abstract MAC layer, wireless networks, consensus, fault tolerance}
}
@InProceedings{parter_et_al:LIPIcs.DISC.2018.39,
author = {Parter, Merav and Su, Hsin-Hao},
title = {{Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {39:1--39:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.39},
URN = {urn:nbn:de:0030-drops-98286},
doi = {10.4230/LIPIcs.DISC.2018.39},
annote = {Keywords: Distributed Graph Algorithms, Coloring, congested clique}
}
@InProceedings{parter_et_al:LIPIcs.DISC.2018.40,
author = {Parter, Merav and Yogev, Eylon},
title = {{Congested Clique Algorithms for Graph Spanners}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {40:1--40:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.40},
URN = {urn:nbn:de:0030-drops-98298},
doi = {10.4230/LIPIcs.DISC.2018.40},
annote = {Keywords: Distributed Graph Algorithms, Spanner, Congested Clique}
}
@InProceedings{zheng_et_al:LIPIcs.DISC.2018.41,
author = {Zheng, Xiong and Hu, Changyong and Garg, Vijay K.},
title = {{Lattice Agreement in Message Passing Systems}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {41:1--41:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.41},
URN = {urn:nbn:de:0030-drops-98301},
doi = {10.4230/LIPIcs.DISC.2018.41},
annote = {Keywords: Lattice Agreement, Replicated State Machine, Consensus}
}
@InProceedings{bamberger_et_al:LIPIcs.DISC.2018.42,
author = {Bamberger, Philipp and Kuhn, Fabian and Maus, Yannic},
title = {{Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {42:1--42:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.42},
URN = {urn:nbn:de:0030-drops-98318},
doi = {10.4230/LIPIcs.DISC.2018.42},
annote = {Keywords: dynamic networks, distributed graph algorithms, MIS, vertex coloring}
}
@InProceedings{czumaj_et_al:LIPIcs.DISC.2018.43,
author = {Czumaj, Artur and Davies, Peter},
title = {{Brief Announcement: Randomized Blind Radio Networks}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {43:1--43:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.43},
URN = {urn:nbn:de:0030-drops-98323},
doi = {10.4230/LIPIcs.DISC.2018.43},
annote = {Keywords: Broadcasting, Randomized Algorithms, Radio Networks}
}
@InProceedings{demarco_et_al:LIPIcs.DISC.2018.44,
author = {De Marco, Gianluca and Kowalski, Dariusz R. and Stachowiak, Grzegorz},
title = {{Brief Announcement: Deterministic Contention Resolution on a Shared Channel}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {44:1--44:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.44},
URN = {urn:nbn:de:0030-drops-98331},
doi = {10.4230/LIPIcs.DISC.2018.44},
annote = {Keywords: Shared channel, multiple-access channel, distributed algorithm}
}
@InProceedings{doherty_et_al:LIPIcs.DISC.2018.45,
author = {Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John},
title = {{Brief Announcement: Generalising Concurrent Correctness to Weak Memory}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {45:1--45:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.45},
URN = {urn:nbn:de:0030-drops-98344},
doi = {10.4230/LIPIcs.DISC.2018.45},
annote = {Keywords: Weak Memory, Concurrent Object, Execution Structure}
}
@InProceedings{doty_et_al:LIPIcs.DISC.2018.46,
author = {Doty, David and Eftekhari, Mahsa and Michail, Othon and Spirakis, Paul G. and Theofilatos, Michail},
title = {{Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {46:1--46:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.46},
URN = {urn:nbn:de:0030-drops-98359},
doi = {10.4230/LIPIcs.DISC.2018.46},
annote = {Keywords: population protocol, counting, leader election, polylogarithmic time}
}
@InProceedings{frank_et_al:LIPIcs.DISC.2018.47,
author = {Frank, Reginald and Welch, Jennifer L.},
title = {{Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {47:1--47:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.47},
URN = {urn:nbn:de:0030-drops-98360},
doi = {10.4230/LIPIcs.DISC.2018.47},
annote = {Keywords: Clock synchronization, Lower bound, k-ary m-toroid}
}
@InProceedings{gilbert_et_al:LIPIcs.DISC.2018.48,
author = {Gilbert, Seth and Lynch, Nancy and Newport, Calvin and Pajak, Dominik},
title = {{Brief Announcement: On Simple Back-Off in Unreliable Radio Networks}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {48:1--48:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.48},
URN = {urn:nbn:de:0030-drops-98373},
doi = {10.4230/LIPIcs.DISC.2018.48},
annote = {Keywords: radio networks, broadcast, unreliable links, distributed algorithm, robustness}
}
@InProceedings{gokhale_et_al:LIPIcs.DISC.2018.49,
author = {Gokhale, Shreyas and Mittal, Neeraj},
title = {{Brief Announcement: Fast and Scalable Group Mutual Exclusion}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {49:1--49:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.49},
URN = {urn:nbn:de:0030-drops-98381},
doi = {10.4230/LIPIcs.DISC.2018.49},
annote = {Keywords: Group Mutual Exclusion, Fine-Grained Synchronization, Space Complexity, Contention-Free Step Complexity}
}
@InProceedings{goubault_et_al:LIPIcs.DISC.2018.50,
author = {Goubault, \'{E}ric and Ledent, J\'{e}r\'{e}my and Mimram, Samuel},
title = {{Brief Announcement: On the Impossibility of Detecting Concurrency}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {50:1--50:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.50},
URN = {urn:nbn:de:0030-drops-98392},
doi = {10.4230/LIPIcs.DISC.2018.50},
annote = {Keywords: concurrent specification, concurrent object, linearizability}
}
@InProceedings{sakavalas_et_al:LIPIcs.DISC.2018.51,
author = {Sakavalas, Dimitris and Tseng, Lewis and Vaidya, Nitin H.},
title = {{Brief Announcement: Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {51:1--51:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.51},
URN = {urn:nbn:de:0030-drops-98405},
doi = {10.4230/LIPIcs.DISC.2018.51},
annote = {Keywords: Asynchrony, crash fault, consensus, topology knowledge, relay}
}
@InProceedings{sudo_et_al:LIPIcs.DISC.2018.52,
author = {Sudo, Yuichi and Ooshita, Fukuhito and Kakugawa, Hirotsugu and Masuzawa, Toshimitsu},
title = {{Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time}},
booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)},
pages = {52:1--52:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-092-7},
ISSN = {1868-8969},
year = {2018},
volume = {121},
editor = {Schmid, Ulrich and Widder, Josef},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.52},
URN = {urn:nbn:de:0030-drops-98410},
doi = {10.4230/LIPIcs.DISC.2018.52},
annote = {Keywords: Self-stabilization, Loose-stabilization, Population protocols}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing