Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. SIROCCO 2001: Val de Nuria, Spain
- Francesc Comellas, Josep Fàbrega, Pierre Fraigniaud:
SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001. Proceedings in Informatics 8, Carleton Scientific 2001, ISBN 1-894145-10-0 - Lali Barrière, Stefan Dobrev:
Leader Election in Abelian Cayley Graphs. SIROCCO 2001: 5-20 - Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot:
Cycle Covering. SIROCCO 2001: 21-34 - Prosenjit Bose, Pat Morin:
Competitive Online Routing in Geometric Graphs. SIROCCO 2001: 35-44 - Stefan D. Bruda, Selim G. Akl:
Parallel Real-Time Complexity A Strong Infinite Hierarchy. SIROCCO 2001: 45-60 - Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Group Mutual Exclusion in Token Rings. SIROCCO 2001: 61-76 - Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies. SIROCCO 2001: 77-88 - Victor Chepoi, Alexis Rollin:
Interval Routing in Some Planar Quadrangulations. SIROCCO 2001: 89-104 - Peter Damaschke:
Worst-case bounds for blind broadcasting in small-degree networks. SIROCCO 2001: 105-116 - Michael Elkin, David Peleg:
The Client-Server 2-Spanner Problem with Applications to Network Design. SIROCCO 2001: 117-132 - Guillaume Fertin, André Raspaud:
k-Neighborhood Broadcasting. SIROCCO 2001: 133-146 - Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Pattern Formation by Anonymous Robots Without Chirality. SIROCCO 2001: 147-162 - Yashar Ganjali:
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes. SIROCCO 2001: 163-178 - Emmanuel Godard, Yves Métivier:
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO 2001: 179-194 - Peter Gvozdjak, Joseph G. Peters:
Modelling Links in Inclined LEO Satellite Networks. SIROCCO 2001: 195-208 - Paul R. Hafner:
On the graphs of McKay-Miller-Sirán. SIROCCO 2001: 209-216 - Alexander Kesselman, Yishay Mansour:
QoS-Competitive Video Buffering. SIROCCO 2001: 217-230 - Rastislav Kralovic, Peter Ruzicka:
On Immunity and Catastrophic Indices of Graphs. SIROCCO 2001: 231-242 - Martin Makuch, Peter Ruzicka:
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. SIROCCO 2001: 243-258 - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman:
Optimal Scheduling for Distributed Cooperation Without Communication. SIROCCO 2001: 259-274 - Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
Efficient Condition-Based Consensus. SIROCCO 2001: 275-292 - Toshio Nakata, Masafumi Yamashita:
Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. SIROCCO 2001: 293-304 - Andre Osterloh:
Oblivious Routing on d-Dimensional Meshes. SIROCCO 2001: 305-320 - Petr Salinger, Pavel Tvrdík:
Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing. SIROCCO 2001: 321-336 - John Watkinson, Micah Adler, Faith E. Fich:
New Protocols for Asymmetric Communication Channels. SIROCCO 2001: 337-350 - Norbert Zeh, Nicola Santoro:
On Finding Minimum Deadly Sets for Directed Networks. SIROCCO 2001: 351-366
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-04-25 05:27 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:
