Остановите войну!
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 38 matches
- 2016
- Emmanuelle Anceaume, Christian Cachin, Maria Gradinariu Potop-Butucaru:
19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France. LIPIcs 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-939897-98-9 [contents] - 2015
- Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The Cost of Global Broadcast in Dynamic Radio Networks. OPODIS 2015: 7:1-7:17 - Antonio Fernández Anta, Nicolas C. Nicolaou, Alexandru Popa:
Making "Fast" Atomic Operations Computationally Tractable. OPODIS 2015: 19:1-19:16 - Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS 2015: 31:1-31:16 - Hagit Attiya, Arie Fouren:
Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives. OPODIS 2015: 36:1-36:16 - Joffroy Beauquier, Peva Blanchard, Janna Burman, Rachid Guerraoui:
The Benefits of Entropy in Population Protocols. OPODIS 2015: 21:1-21:15 - Ryan Berryhill, Wojciech M. Golab, Mahesh Tripunitara:
Robust Shared Objects for Non-Volatile Main Memory. OPODIS 2015: 20:1-20:17 - Zohir Bouzid, Michel Raynal, Pierre Sutra:
Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers. OPODIS 2015: 18:1-18:17 - Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the Uncontended Complexity of Anonymous Consensus. OPODIS 2015: 12:1-12:16 - Yen-Jung Chang, Vijay K. Garg:
QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed Computations. OPODIS 2015: 25:1-25:17 - Jingshu Chen, Mohammad Roohitavaf, Sandeep S. Kulkarni:
Ensuring Average Recovery with Adversarial Scheduler. OPODIS 2015: 23:1-23:18 - Artur Czumaj, Peter Davies:
Communicating with Beeps. OPODIS 2015: 30:1-30:16 - Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Maximum Matching for Anonymous Trees with Constant Space per Process. OPODIS 2015: 16:1-16:16 - Juan A. Garay:
Blockchain-Based Consensus (Keynote). OPODIS 2015: 5:1-5:1 - Seth Gilbert, Calvin C. Newport, Tonghe Wang:
Bounds for Blind Rate Adaptation. OPODIS 2015: 8:1-8:17 - Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
Distributed Approximation of k-Service Assignment. OPODIS 2015: 11:1-11:16 - Stephan Holzer, Nathan Pinsker:
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. OPODIS 2015: 6:1-6:16 - Wei-Lun Hung, Himanshu Chauhan, Vijay K. Garg:
ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object Synchronization. OPODIS 2015: 29:1-29:17 - Damien Imbs:
The Synchronization Power of Atomic Bitwise Operations. OPODIS 2015: 26:1-26:17 - Nikolaos D. Kallimanis, Eleni Kanellou:
Wait-Free Concurrent Graph Objects with Dynamic Traversals. OPODIS 2015: 27:1-27:17 - Fabian Kuhn, Anisur Rahaman Molla:
Distributed Sparse Cut Approximation. OPODIS 2015: 10:1-10:14 - Tobias Langner, Barbara Keller, Jara Uitto, Roger Wattenhofer:
Overcoming Obstacles with Ants. OPODIS 2015: 9:1-9:17 - Giuseppe Antonio Di Luna, Roberto Baldoni:
Non Trivial Computations in Anonymous Dynamic Networks. OPODIS 2015: 33:1-33:16 - Alessia Milani, Miguel A. Mosteiro:
A Faster Counting Protocol for Anonymous Dynamic Networks. OPODIS 2015: 28:1-28:13 - Michel Raynal:
Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial). OPODIS 2015: 1:1-1:10 - Nicola Santoro:
Time to Change: On Distributed Computing in Dynamic Networks (Keynote). OPODIS 2015: 3:1-3:14 - Vikram Saraph, Maurice Herlihy:
The Relative Power of Composite Loop Agreement Tasks. OPODIS 2015: 13:1-13:16 - Christian Scheideler, Alexander Setzer, Thim Strothmann:
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. OPODIS 2015: 24:1-24:17 - Niloufar Shafiei:
Non-Blocking Doubly-Linked Lists with Good Amortized Complexity. OPODIS 2015: 35:1-35:17 - Alexander Spiegelman, Yuval Cassuto, Gregory V. Chockler, Idit Keidar:
Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote). OPODIS 2015: 4:1-4:3
skipping 8 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-05-01 23:47 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