Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th SIROCCO 2018: Ma'ale HaHamisha, Israel
- Zvi Lotker, Boaz Patt-Shamir:
Structural Information and Communication Complexity - 25th International Colloquium, SIROCCO 2018, Ma'ale HaHamisha, Israel, June 18-21, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11085, Springer 2018, ISBN 978-3-030-01324-0
Invited Talks and Brief Announcments
- Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Realizability of Graph Specifications: Characterizations and Algorithms. 3-13 - Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier:
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model. 14-19 - Anaïs Durand
, Shay Kutten:
Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection. 20-24 - Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Constant-Space Self-stabilizing Token Distribution in Trees. 25-29 - Vitalii Demianiuk, Sergey Gorinsky, Sergey I. Nikolenko, Kirill Kogan:
Distributed Counting Along Lossy Paths Without Feedback. 30-33 - Yefim Dinitz, Shlomi Dolev, Daniel Khankin:
Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN. 34-37 - Othon Michail, Paul G. Spirakis, Michail Theofilatos:
Brief Announcement: Fast Approximate Counting and Leader Election in Populations. 38-42 - Mark Korenblit:
One-Max Constant-Probability Networks: Results and Future Work. 43-47 - Dor Bank, Moshe Sulamy, Eyal Waserman:
Reaching Distributed Equilibrium with Limited ID Space. 48-51
Full Papers
- Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). 55-71 - Volker Turau:
A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(\log n) Time. 72-87 - Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and Local Independent Set Approximation. 88-101 - Ulrich Schmid, Manfred Schwarz, Kyrill Winkler:
On the Strongest Message Adversary for Consensus in Directed Dynamic Networks. 102-120 - Konstantinos Georgiou, Jay Griffiths, Yuval Yakubov:
Symmetric Rendezvous with Advice: How to Rendezvous in a Disk. 121-133 - Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. 134-148 - Masahiro Shibata, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings. 149-164 - Andrzej Pelc:
Explorable Families of Graphs. 165-177 - Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa:
A Characterization of t-Resilient Colorless Task Anonymous Solvability. 178-192 - Fabian Kuhn, Yannic Maus, Simon Weidner:
Deterministic Distributed Ruling Sets of Line Graphs. 193-208 - Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. 209-225 - Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. 226-236 - Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
Online Service with Delay on a Line. 237-248 - Tal Navon, David Peleg:
Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup. 249-263 - Tomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki:
Communication Complexity in Vertex Partition Whiteboard Model. 264-279 - Gennaro Cordasco, Luisa Gargano, Joseph G. Peters, Adele A. Rescigno, Ugo Vaccaro:
Time-Bounded Influence Diffusion with Incentives. 280-295 - Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume:
Balanced Allocations and Global Clock in Population Protocols: An Accurate Analysis. 296-311 - Daniel Pfleger, Ulrich Schmid:
On Knowledge and Communication Complexity in Distributed Systems. 312-330 - Tomasz Jurdzinski, Krzysztof Nowicki:
Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique. 331-344 - Vidhya Tekken Valapil, Sandeep S. Kulkarni:
Biased Clocks: A Novel Approach to Improve the Ability To Perform Predicate Detection with O(1) Clocks. 345-360 - Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce:
Gathering in the Plane of Location-Aware Robots in the Presence of Spies. 361-376 - Pavel Chuprikov, Alex Davydow, Kirill Kogan, Sergey I. Nikolenko, Alexander Sirotkin:
Formalizing Compute-Aggregate Problems in Cloud Computing. 377-391 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract). 392-407
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
