default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2006
- Hagit Attiya:
Adapting to Point Contention with Long-Lived Safe Agreement . SIROCCO 2006: 10-23 - Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. SIROCCO 2006: 171-181 - Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore:
Self-stabilizing Space Optimal Synchronization Algorithms on Trees. SIROCCO 2006: 334-348 - Davide Bilò, Luciano Gualà, Guido Proietti:
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO 2006: 295-309 - Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed Chasing of Network Intruders. SIROCCO 2006: 70-84 - Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. SIROCCO 2006: 143-156 - Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri:
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO 2006: 227-239 - Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca:
L(h, 1, 1)-Labeling of Outerplanar Graphs. SIROCCO 2006: 268-279 - Jérémie Chalopin:
Election in the Qualitative World. SIROCCO 2006: 85-99 - Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Average-Time Complexity of Gossiping in Radio Networks. SIROCCO 2006: 253-267 - Reuven Cohen, David Peleg:
Local Algorithms for Autonomous Robot Systems. SIROCCO 2006: 29-43 - Graham Cormode, S. Muthukrishnan:
Combinatorial Algorithms for Compressed Sensing. SIROCCO 2006: 280-294 - Bilel Derbel, Cyril Gavoille:
Fast Deterministic Distributed Algorithms for Sparse Spanners. SIROCCO 2006: 100-114 - Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro:
On Fractional Dynamic Faults with Threshold. SIROCCO 2006: 197-211 - Travis Gagie:
Dynamic Asymmetric Communication. SIROCCO 2006: 310-318 - Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356 - Jaap-Henk Hoepman, Shay Kutten, Zvi Lotker:
Efficient Distributed Weighted Matchings on Trees. SIROCCO 2006: 115-129 - David Ilcinkas:
Setting Port Numbers for Fast Graph Exploration. SIROCCO 2006: 59-69 - Adrian Kosowski:
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. SIROCCO 2006: 130-142 - Dariusz R. Kowalski, Adam Malinowski:
How to Meet in Anonymous Network. SIROCCO 2006: 44-58 - Evangelos Kranakis, Danny Krizanc, Sergio Rajsbaum:
Mobile Agent Rendezvous: A Survey. SIROCCO 2006: 1-9 - Alfredo Navarra:
3-D Minimum Energy Broadcasting. SIROCCO 2006: 240-252 - Mikhail Nesterenko, Sébastien Tixeuil:
Discovering Network Topology in the Presence of Byzantine Faults. SIROCCO 2006: 212-226 - Philippe Raipin Parvédy, Michel Raynal, Corentin Travers:
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. SIROCCO 2006: 182-196 - Boaz Patt-Shamir, Allon Shafrir:
Approximate Top-k Queries in Sensor Networks. SIROCCO 2006: 319-333 - Nicolas Thibault, Christian Laforest:
An Optimal Rebuilding Strategy for a Decremental Tree Problem. SIROCCO 2006: 157-170 - Roger Wattenhofer:
Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?. SIROCCO 2006: 24-28 - Paola Flocchini, Leszek Gasieniec:
Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings. Lecture Notes in Computer Science 4056, Springer 2006, ISBN 3-540-35474-3 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-15 21:40 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint