default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 509
Volume 509, October 2013
- Adrian Kosowski, Masafumi Yamashita:
Preface. 1-2
- Maurice Herlihy, Sergio Rajsbaum, Michel Raynal:
Power and limits of distributed computing shared memory models. 3-24 - Thomas Nowak
, Matthias Függer, Alexander Kößler:
On the performance of a retransmission-based synchronizer. 25-39 - Johannes Schneider, Michael Elkin, Roger Wattenhofer:
Symmetry breaking depending on the chromatic number or the neighborhood growth. 40-50 - Colin Cooper, Alan M. Frieze, Tomasz Radzik:
The cover times of random walks on random uniform hypergraphs. 51-69 - Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight bounds for black hole search with scattered agents in synchronous rings. 70-85 - Samuel Guilbault, Andrzej Pelc:
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. 86-96 - Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Energy-efficient strategies for building short chains of mobile robots locally. 97-112 - Brona Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar:
Efficient routing in carrier-based mobile networks. 113-121 - Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro:
Optimal time data gathering in wireless networks with multidirectional antennas. 122-139
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 2025-12-14 23:10 CET 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:
