default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. SIROCCO 2004: Smolenice Castle, Slovakia
- Rastislav Kralovic, Ondrej Sýkora:
Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slovakia, June 21-23, 2004, Proceedings. Lecture Notes in Computer Science 3104, Springer 2004, ISBN 3-540-22230-8 - Eric Angel, Evripidis Bampis, Fanny Pascual:
Traffic Grooming in a Passive Star WDM Network. 1-12 - Vittorio Bilò
, Luca Moscardelli:
The Price of Anarchy in All-Optical Networks. 13-22 - Paul Boone, Edgar Chávez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia:
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. 23-34 - Anat Bremler-Barr, Leah Epstein:
Path Layout on Tree Networks: Bounds in Different Label Switching Models. 35-46 - Miroslav Chlebík, Janka Chlebíková:
On Approximability of the Independent Set Problem for Low Degree Graphs. 47-56 - Bogdan S. Chlebus, Mariusz A. Rokicki:
Asynchronous Broadcast in Radio Networks. 57-68 - Sébastien Choplin, Lata Narayanan, Jaroslav Opatrny:
Two-Hop Virtual Path Layout in Tori. 69-78 - Reuven Cohen, David Peleg:
Robot Convergence via Center-of-Gravity Algorithms. 79-88 - Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano:
F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). 89-98 - Aleksej Di Salvo, Guido Proietti:
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. 99-110 - Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Improved Bounds for Optimal Black Hole Search with a Network Map. 111-122 - Yon Dourisboure, Cyril Gavoille:
Sparse Additive Spanners for Bounded Tree-Length Graphs. 123-137 - Guillaume Fertin, André Raspaud, Ondrej Sýkora:
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. 138-148 - Alessandro Ferrante, Mimmo Parente:
Existence of Nash Equilibria in Selfish Routing Problems. 149-160 - Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio, Nicola Santoro, Cindy Sawchuk:
Mobile Agents Rendezvous When Tokens Fail. 161-172 - Leszek Gasieniec, Igor Potapov, Qin Xin:
Time Efficient Gossiping in Known Radio Networks. 173-184 - Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman:
Long-Lived Rambo: Trading Knowledge for Communication. 185-196 - Arvind Gupta, Ján Manuch, Ladislav Stacho:
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. 197-208 - Flaminia L. Luccio, Jop F. Sibeyn:
Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks. 209-220 - Luciano Margara, Alessandro Pistocchi, Marco Vassura:
Perfect Token Distribution on Trees. 221-232 - Rachel Matichin, David Peleg:
Approximation Algorithm for Hotlink Assignment in the Greedy Model. 233-244 - Michel Paquette, Andrzej Pelc:
Optimal Decision Strategies in Byzantine Environments. 245-254 - Paolo Penna, Carmine Ventre:
Sharing the Cost of Multicast Transmissions in Wireless Networks. 255-266 - Rui Wang, Francis C. M. Lau, Yan Yan Liu:
NP-Completeness Results for All-Shortest-Path Interval Routing. 267-278 - Deshi Ye, Guochuan Zhang:
On-Line Scheduling of Parallel Jobs. 279-290 - Deshi Ye, Hu Zhang:
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. 291-302
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-11-28 20:34 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:
