Abstract is missing.
- Leader Election in SINR Model with Arbitrary Power ControlMagnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou. 3-14 [doi]
- Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier SensingTomasz Jurdzinski, Michal Rozanski, Grzegorz Stachowiak. 15-33 [doi]
- Short Labeling Schemes for Topology Recognition in Wireless Tree NetworksBarun Gorain, Andrzej Pelc. 37-52 [doi]
- Space-Time Tradeoffs for Distributed VerificationRafail Ostrovsky, Mor Perry, Will Rosenbaum. 53-70 [doi]
- Approximate Proof-Labeling SchemesKeren Censor Hillel, Ami Paz, Mor Perry. 71-89 [doi]
- Global Versus Local Computations: Fast Computing with IdentifiersMikaël Rabie. 90-105 [doi]
- On the Smallest Grain of Salt to Get a Unique IdentityPeva Blanchard, Rachid Guerraoui. 106-121 [doi]
- A General Lower Bound for Collaborative Tree ExplorationYann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger. 125-139 [doi]
- Wireless Evacuation on m Rays with k SearchersSebastian Brandt, Klaus-Tycho Foerster, Benjamin Richner, Roger Wattenhofer. 140-157 [doi]
- Evacuation from a Disc in the Presence of a Faulty RobotJurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk. 158-173 [doi]
- On Location Hiding in Distributed SystemsKarol Gotfryd, Marek Klonowski, Dominik Pajak. 174-192 [doi]
- Parallel Search with No CoordinationAmos Korman, Yoav Rodeh. 195-211 [doi]
- Monitoring of Domain-Related Problems in Distributed Data StreamsPascal 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. 212-226 [doi]
- Killing Nodes as a Countermeasure to Virus ExpansionFrançois Bonnet 0001, Quentin Bramas, Xavier Défago, Thanh Dang Nguyen. 227-243 [doi]
- Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring TreesMagnús M. Halldórsson, Christian Konrad. 247-262 [doi]
- How Long It Takes for an Ordinary Node with an Ordinary ID to Output?Laurent Feuilloley. 263-282 [doi]
- How to Choose Friends StrategicallyLata Narayanan, Kangkang Wu. 283-302 [doi]
- Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap EdgesDavide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. 303-317 [doi]
- A Generic Framework for Computing Parameters of Sequence-Based Dynamic GraphsArnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters. 321-338 [doi]
- Gathering in Dynamic RingsGiuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta. 339-355 [doi]
- On Liveness of Dynamic StorageAlexander Spiegelman, Idit Keidar. 356-376 [doi]