Остановите войну!
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 30 matches
- 2008
- Shlomi Dolev, Ronen I. Kat:
HyperTree for self-stabilizing peer-to-peer systems. Distributed Comput. 20(5): 375-388 (2008) - Shlomi Dolev, Alexander A. Shvartsman:
Introduction to special issue dedicated to the DISC 20th anniversary. Distributed Comput. 20(6): 389-390 (2008) - Rachid Guerraoui, Petr Kouznetsov:
Failure detectors as type boosters. Distributed Comput. 20(5): 343-358 (2008) - Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov:
The weakest failure detectors to boost obstruction-freedom. Distributed Comput. 20(6): 415-433 (2008) - Maleq Khan, Gopal Pandurangan:
A fast distributed approximation algorithm for minimum spanning trees. Distributed Comput. 20(6): 391-402 (2008) - Edya Ladan-Mozes, Nir Shavit:
An optimistic approach to lock-free FIFO queues. Distributed Comput. 20(5): 323-341 (2008) - Tal Mizrahi, Yoram Moses:
Continuous consensus via common knowledge. Distributed Comput. 20(5): 305-321 (2008) - Michael Okun, Amnon Barak, Eli Gafni:
Renaming in synchronous message passing systems with Byzantine failures. Distributed Comput. 20(6): 403-413 (2008) - Bojian Xu, Srikanta Tirthapura, Costas Busch:
Sketching asynchronous data streams over sliding windows. Distributed Comput. 20(5): 359-374 (2008) - Piotr Zielinski:
Low-latency atomic broadcast in the presence of contention. Distributed Comput. 20(6): 435-450 (2008) - 2007
- Yehuda Afek, Eli Gafni, Adam Morrison:
Common2 extended to stacks and unbounded concurrency. Distributed Comput. 20(4): 239-252 (2007) - Yehuda Afek, Yaron De Levie:
Efficient adaptive collect algorithms. Distributed Comput. 20(3): 221-238 (2007) - Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. Distributed Comput. 20(4): 279-304 (2007) - Anish Arora:
Introduction. Distributed Comput. 20(1): 1 (2007) - Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil:
Transient fault detectors. Distributed Comput. 20(1): 39-51 (2007) - Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Comput. 20(1): 75-93 (2007) - Alain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Snap-stabilization and PIF in tree networks. Distributed Comput. 20(1): 3-19 (2007) - Shlomi Dolev, Ted Herman:
Parallel composition for time-to-fault adaptive stabilization. Distributed Comput. 20(1): 29-38 (2007) - Pierre Fraigniaud:
Special Issue DISC 2005. Distributed Comput. 20(3): 163 (2007) - Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Erwan Le Merrer, Laurent Massoulié:
Peer counting and sampling in overlay networks based on random walks. Distributed Comput. 20(4): 267-278 (2007) - Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju:
Fault-containing self-stabilizing distributed protocols. Distributed Comput. 20(1): 53-73 (2007) - Mohamed G. Gouda, F. Furman Haddix:
The alternator. Distributed Comput. 20(1): 21-28 (2007) - Rachid Guerraoui, Eric Ruppert:
Anonymous and fault-tolerant shared-memory computing. Distributed Comput. 20(3): 165-177 (2007) - Indranil Gupta, Mahvesh Nagda, Christo Frank Devaraj:
The design of novel distributed protocols from differential equations. Distributed Comput. 20(2): 95-114 (2007) - Maurice Herlihy, Ye Sun:
Distributed transactional memory for metric-space networks. Distributed Comput. 20(3): 195-208 (2007) - Amos Korman:
General compact labeling schemes for dynamic trees. Distributed Comput. 20(3): 179-193 (2007) - Amos Korman, Shay Kutten:
Distributed verification of minimum spanning trees. Distributed Comput. 20(4): 253-266 (2007) - Dahlia Malkhi, Douglas B. Terry:
Concise version vectors in WinFS. Distributed Comput. 20(3): 209-219 (2007) - Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
A family of optimal termination detection algorithms. Distributed Comput. 20(2): 141-162 (2007) - Josef Widder, Ulrich Schmid:
Booting clock synchronization in partially synchronous systems with hybrid process and link failures. Distributed Comput. 20(2): 115-140 (2007)
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-05-28 10:37 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