Остановите войну!
for scientists:
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 54 matches
- 2009
- Ittai Abraham, Dahlia Malkhi, David Ratajczak:
Compact Multicast Routing. DISC 2009: 364-378 - Yehuda Afek, Eli Gafni, Opher Lieber:
Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. DISC 2009: 111-126 - Yehuda Afek, Nir Shavit, Moran Tzafrir:
Interrupting Snapshots and the JavaTM{\mbox{\tiny TM}} Size() Method. DISC 2009: 78-92 - Lorenzo Alvisi, Rachid Guerraoui, Prasad Jayanti, Idit Keidar, Shay Kutten, Jennifer L. Welch:
The 2009 Edsger W. Dijkstra Prize in Distributed Computing. DISC 2009: 1-2 - Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto:
A Local 2-Approximation Algorithm for the Vertex Cover Problem. DISC 2009: 191-205 - Hagit Attiya, Alessia Milani:
Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. DISC 2009: 108-110 - Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Euler Tour Lock-In Problem in the Rotor-Router Model. DISC 2009: 423-435 - Ananda Basu, Borzoo Bonakdarpour, Marius Bozga, Joseph Sifakis:
Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset. DISC 2009: 174-175 - Vibhor Bhatt, Prasad Jayanti:
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion. DISC 2009: 311-325 - Martin Biely, Peter Robinson, Ulrich Schmid:
Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. DISC 2009: 360-361 - Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. DISC 2009: 407-422 - Péter Bokor, Marco Serafini, Neeraj Suri, Helmut Veith:
Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction. DISC 2009: 289-290 - François Bonnet, Michel Raynal:
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity. DISC 2009: 341-355 - Fatemeh Borran, André Schiper:
Brief Announcement: A Leader-free Byzantine Consensus Algorithm. DISC 2009: 479-480 - Zvika Brakerski, Boaz Patt-Shamir:
Distributed Discovery of Large Near-Cliques. DISC 2009: 206-220 - Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. DISC 2009: 239-240 - Wei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang:
Compact Routing in Power-Law Graphs. DISC 2009: 379-391 - Alejandro Cornejo, Fabian Kuhn, Ruy Ley-Wild, Nancy A. Lynch:
Keeping Mobile Robot Swarms Connected. DISC 2009: 496-511 - Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc:
Consensus and Mutual Exclusion in a Multiple Access Channel. DISC 2009: 512-526 - Ashraf Al Daoud, Sachin Agarwal, Tansu Alpcan:
Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers. DISC 2009: 309-310 - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann:
The Disagreement Power of an Adversary. DISC 2009: 8-21 - Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems. DISC 2009: 358-359 - Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot:
Local Computation of Nearly Additive Spanners. DISC 2009: 176-190 - Simon Doherty, Mark Moir:
Nonblocking Algorithms and Backward Simulation. DISC 2009: 274-288 - Swan Dubois, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison. DISC 2009: 291-293 - Yuval Emek, Amos Korman:
New Bounds for the Controller Problem. DISC 2009: 22-34 - Panagiota Fatourou, Nikolaos D. Kallimanis:
The RedBlue Adaptive Universal Constructions. DISC 2009: 127-141 - Pascal Felber, Vincent Gramoli, Rachid Guerraoui:
Elastic Transactions. DISC 2009: 93-107 - Matthias Fitzi, Jesper Buus Nielsen:
On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. DISC 2009: 449-463 - Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou:
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. DISC 2009: 529-530
skipping 24 more matches
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-06-05 23:16 CEST 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