default search action
Theoretical Computer Science, Volume 584
Volume 584, June 2015
- Thomas Moscibroda, Adele A. Rescigno:
Guest Editorial: Special issue on Structural Information and Communication Complexity. 1-2
- Nidhi Hegde, Laurent Massoulié, Laurent Viennot:
Self-organizing flows in social networks. 3-18 - Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed community detection in dynamic graphs. 19-41 - Amir Levi, Boaz Patt-Shamir:
Non-additive two-option ski rental. 42-52 - Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence diffusion in social networks under time window constraints. 53-66 - Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler:
A deterministic worst-case message complexity optimal solution for resource discovery. 67-79 - Étienne Coulouma, Emmanuel Godard, Joseph G. Peters:
A characterization of oblivious message adversaries for which Consensus is solvable. 80-90 - Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting grid networks to minimize expected path length. 91-102 - Hadassa Daltrophe, Shlomi Dolev, Zvi Lotker:
Probabilistic connectivity threshold for directional antenna widths. 103-114 - Yves Métivier, John Michael Robson, Akka Zemmari:
Analysis of fully distributed splitting and naming probabilistic procedures and applications. 115-130 - Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, R. Soares:
Connected surveillance game. 131-143 - Guy Even, Moti Medina:
A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations. 144-154 - Lakshmi Anantharamu, Bogdan S. Chlebus:
Broadcasting in ad hoc multiple access channels. 155-176
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.