Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24. SIROCCO 2017: Porquerolles, France
- Shantanu Das, Sébastien Tixeuil:
Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10641, Springer 2017, ISBN 978-3-319-72049-4
Wireless Networks
- Magnús M. Halldórsson
, Stephan Holzer, Evangelia Anna Markatou:
Leader Election in SINR Model with Arbitrary Power Control. 3-14 - Tomasz Jurdzinski, Michal Rózanski, Grzegorz Stachowiak:
Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing. 15-33
Identifiers and Labelling
- Barun Gorain, Andrzej Pelc:
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. 37-52 - Rafail Ostrovsky, Mor Perry, Will Rosenbaum:
Space-Time Tradeoffs for Distributed Verification. 53-70 - Keren Censor-Hillel, Ami Paz, Mor Perry:
Approximate Proof-Labeling Schemes. 71-89 - Mikaël Rabie:
Global Versus Local Computations: Fast Computing with Identifiers. 90-105 - Peva Blanchard, Rachid Guerraoui:
On the Smallest Grain of Salt to Get a Unique Identity. 106-121
Mobile Agents
- Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A General Lower Bound for Collaborative Tree Exploration. 125-139 - Sebastian Brandt, Klaus-Tycho Foerster, Benjamin Richner, Roger Wattenhofer:
Wireless Evacuation on m Rays with k Searchers. 140-157 - Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk:
Evacuation from a Disc in the Presence of a Faulty Robot. 158-173 - Karol Gotfryd, Marek Klonowski, Dominik Pajak:
On Location Hiding in Distributed Systems. 174-192
Probabilistic Algorithms
- Amos Korman, Yoav Rodeh:
Parallel Search with No Coordination. 195-211 - Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier:
Monitoring of Domain-Related Problems in Distributed Data Streams. 212-226 - François Bonnet, Quentin Bramas, Xavier Défago, Thanh Dang Nguyen:
Killing Nodes as a Countermeasure to Virus Expansion. 227-243
Computational Complexity
- Magnús M. Halldórsson, Christian Konrad:
Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. 247-262 - Laurent Feuilloley:
How Long It Takes for an Ordinary Node with an Ordinary ID to Output? 263-282 - Lata Narayanan, Kangkang Wu:
How to Choose Friends Strategically. 283-302 - Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. 303-317
Dynamic Networks
- Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. 321-338 - Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in Dynamic Rings. 339-355 - Alexander Spiegelman, Idit Keidar:
On Liveness of Dynamic Storage. 356-376
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-06-29 00:49 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:
