Остановите войну!
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 26 matches
- 2012
- Sven Köhler, Volker Turau:
Fault-containing self-stabilization in asynchronous systems with constant fault-gap. Distributed Comput. 25(3): 207-224 (2012) - Yehuda Afek, Petr Kuznetsov, Israel Nir:
Renaming and the weakest family of failure detectors. Distributed Comput. 25(6): 411-425 (2012) - Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Partial synchrony based on set timeliness. Distributed Comput. 25(3): 249-260 (2012) - Marcos K. Aguilera, Sam Toueg:
The correctness proof of Ben-Or's randomized consensus algorithm. Distributed Comput. 25(5): 371-381 (2012) - Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Comput. 25(4): 279-296 (2012) - James Aspnes:
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. Distributed Comput. 25(2): 179-188 (2012) - Hagit Attiya:
Announcement: best reviewer award 2011. Distributed Comput. 25(1): 1 (2012) - Borzoo Bonakdarpour, Marius Bozga, Mohamad Jaber, Jean Quilbeuf, Joseph Sifakis:
A framework for automated distributed implementation of component-based models. Distributed Comput. 25(5): 383-409 (2012) - Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abujarad:
Symbolic synthesis of masking fault-tolerant distributed programs. Distributed Comput. 25(1): 83-108 (2012) - Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. 25(4): 297-311 (2012) - Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Comput. 25(2): 165-178 (2012) - Catalin Dima, Ruggero Lanotte:
A study on shuffle, stopwatches and independently evolving clocks. Distributed Comput. 25(1): 5-33 (2012) - Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry:
Leader election using loneliness detection. Distributed Comput. 25(6): 427-450 (2012) - Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel:
RMR-efficient implementations of comparison primitives using read and write operations. Distributed Comput. 25(2): 109-162 (2012) - Rachid Guerraoui:
Special section with selected papers from PODC 2010. Distributed Comput. 25(2): 163 (2012) - Thomas P. Hayes, Jared Saia, Amitabh Trehan:
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Comput. 25(4): 261-278 (2012) - Robert M. Hierons:
Overcoming controllability problems in distributed testing from an input output transition system. Distributed Comput. 25(1): 63-81 (2012) - Robert M. Hierons, Mercedes G. Merayo, Manuel Núñez:
Implementation relations and test generation for systems with distributed interfaces. Distributed Comput. 25(1): 35-62 (2012) - Martin Hoefer, Siddharth Suri:
Dynamics in network interaction games. Distributed Comput. 25(5): 359-370 (2012) - Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern:
Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion. Distributed Comput. 25(5): 335-357 (2012) - Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar:
Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Comput. 25(3): 189-205 (2012) - Dmitry N. Kozlov:
Gathering identical autonomous systems on a circle using stigmergy. Distributed Comput. 25(6): 461-472 (2012) - Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Comput. 25(6): 451-460 (2012) - Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Failure detectors encapsulate fairness. Distributed Comput. 25(4): 313-333 (2012) - Davide Sangiorgi:
Concurrency theory: timed automata, testing, program synthesis. Distributed Comput. 25(1): 3-4 (2012) - Gokarna Sharma, Costas Busch:
Window-based greedy contention management for transactional memory: theory and practice. Distributed Comput. 25(3): 225-248 (2012)
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-04-23 13: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