Остановите войну!
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 19 matches
- 2011
- Heiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens:
Distributed algorithms for QoS load balancing. Distributed Comput. 23(5-6): 321-330 (2011) - Lung-Pin Chen, Der-Johng Sun, William C. Chu:
Efficient online algorithm for identifying useless states in distributed systems. Distributed Comput. 23(5-6): 359-372 (2011) - Joan Feigenbaum, Vijay Ramachandran, Michael Schapira:
Incentive-compatible interdomain routing. Distributed Comput. 23(5-6): 301-319 (2011) - Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari:
An optimal bit complexity randomized distributed MIS algorithm. Distributed Comput. 23(5-6): 331-340 (2011) - Tatsuhiro Tsuchiya, André Schiper:
Verification of consensus algorithms using satisfiability solving. Distributed Comput. 23(5-6): 341-358 (2011) - Haifeng Yu:
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling. Distributed Comput. 23(5-6): 373-394 (2011) - 2010
- Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport:
The mailbox problem. Distributed Comput. 23(2): 113-134 (2010) - Jérémie Chalopin, Yves Métivier:
On the power of synchronization between two adjacent processes. Distributed Comput. 23(3): 177-196 (2010) - Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms. Distributed Comput. 23(1): 43-60 (2010) - Robert Danek, Wojciech M. Golab:
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion. Distributed Comput. 23(2): 87-111 (2010) - Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman:
Rambo: a robust, reconfigurable atomic memory service for dynamic networks. Distributed Comput. 23(4): 225-272 (2010) - Daniele Gorla:
A taxonomy of process calculi for distribution and mobility. Distributed Comput. 23(4): 273-299 (2010) - Rachid Guerraoui, Marko Vukolic:
Refined quorum systems. Distributed Comput. 23(1): 1-42 (2010) - Joseph Y. Halpern, Sabina Petride:
A knowledge-based analysis of global function computation. Distributed Comput. 23(3): 197-224 (2010) - Flavio Paiva Junqueira, Keith Marzullo, Maurice Herlihy, Lucia Draque Penso:
Threshold protocols in survivor set systems. Distributed Comput. 23(2): 135-149 (2010) - Alexander Kesselman, Kirill Kogan, Michael Segal:
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distributed Comput. 23(3): 163-175 (2010) - Alexander Kipnis, Boaz Patt-Shamir:
On the complexity of distributed stable matching with small messages. Distributed Comput. 23(3): 151-161 (2010) - Étienne Lozes, Jules Villard:
A spatial equational logic for the applied pi-calculus. Distributed Comput. 23(1): 61-83 (2010) - Gadi Taubenfeld:
Special issue on DISC 2008. Distributed Comput. 23(2): 85-86 (2010)
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-03-28 17:18 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