Остановите войну!
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 25 matches
- 2016
- Heiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer:
Concurrent imitation dynamics in congestion games. Distributed Comput. 29(2): 105-125 (2016) - Hoda Akbari, Petra Berenbrink, Thomas Sauerwald:
A simple approach for adapting continuous load balancing processes to discrete settings. Distributed Comput. 29(2): 143-161 (2016) - Hagit Attiya:
Special issue in memory of Berthold Vöcking. Distributed Comput. 29(2): 75 (2016) - Béatrice Bérard, Pascal Lafourcade, Laure Millet, Maria Potop-Butucaru, Yann Thierry-Mieg, Sébastien Tixeuil:
Formal verification of mobile robot protocols. Distributed Comput. 29(6): 459-487 (2016) - Petra Berenbrink, Robert Elsässer, Tom Friedetzky:
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. Distributed Comput. 29(5): 317-339 (2016) - Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Randomized mutual exclusion on a multiple access channel. Distributed Comput. 29(5): 341-359 (2016) - Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial:
Byzantine gathering in networks. Distributed Comput. 29(6): 435-457 (2016) - Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Rendezvous in networks in spite of delay faults. Distributed Comput. 29(3): 187-205 (2016) - Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran:
Simple and optimal randomized fault-tolerant rumor spreading. Distributed Comput. 29(2): 89-104 (2016) - Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. 29(4): 251-277 (2016) - Yuval Emek, Erez Kantor, David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks. Distributed Comput. 29(6): 409-434 (2016) - Rob J. van Glabbeek, Peter Höfner, Marius Portmann, Wee Lum Tan:
Modelling and verifying the AODV routing protocol. Distributed Comput. 29(4): 279-315 (2016) - Magnús M. Halldórsson, Pradipta Mitra:
Nearly optimal bounds for distributed wireless scheduling in the SINR model. Distributed Comput. 29(2): 77-88 (2016) - Mohsen Eftekhari Hesari, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Distributed algorithms for barrier coverage using relocatable sensors. Distributed Comput. 29(5): 361-376 (2016) - Peter Jeavons, Alex Scott, Lei Xu:
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring. Distributed Comput. 29(5): 377-393 (2016) - Christoph Lenzen, Roger Wattenhofer:
Tight bounds for parallel randomized load balancing. Distributed Comput. 29(2): 127-142 (2016) - Yuezhou Lv, Thomas Moscibroda:
Fair and resilient Incentive Tree mechanisms. Distributed Comput. 29(1): 1-16 (2016) - Othon Michail, Paul G. Spirakis:
Simple and efficient local codes for distributed stable network construction. Distributed Comput. 29(3): 207-237 (2016) - Avery Miller, Andrzej Pelc:
Time versus cost tradeoffs for deterministic rendezvous in networks. Distributed Comput. 29(1): 51-64 (2016) - Jaroslav Nesetril, Patrice Ossona de Mendez:
A distributed low tree-depth decomposition algorithm for bounded expansion classes. Distributed Comput. 29(1): 39-49 (2016) - Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
DEX: self-healing expanders. Distributed Comput. 29(3): 163-185 (2016) - Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Upper and lower bounds for deterministic broadcast in powerline communication networks. Distributed Comput. 29(4): 239-250 (2016) - Liam Roditty, Roei Tov:
Close to linear space routing schemes. Distributed Comput. 29(1): 65-74 (2016) - Nir Shavit, Gadi Taubenfeld:
The computability of relaxed data structures: queues and stacks as examples. Distributed Comput. 29(5): 395-407 (2016) - Yuda Zhao, Haifeng Yu, Binbin Chen:
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions. Distributed Comput. 29(1): 17-38 (2016)
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-25 09:50 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