Остановите войну!
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 33 matches
- 2014
- Uri Abraham, Gal Amram:
On the Mailbox Problem. OPODIS 2014: 453-468 - Zahra Aghazadeh, Philipp Woelfel:
Space- and Time-Efficient Long-Lived Test-And-Set Objects. OPODIS 2014: 404-419 - Elli Androulaki, Christian Cachin, Dan Dobre, Marko Vukolic:
Erasure-Coded Byzantine Storage with Separate Metadata. OPODIS 2014: 76-90 - Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. OPODIS 2014: 277-292 - Zohir Bouzid, Eli Gafni, Petr Kuznetsov:
Strong Equivalence Relations for Iterated Models. OPODIS 2014: 139-154 - Christian Cachin, Olga Ohrimenko:
Verifying the Consistency of Remote Untrusted Services with Commutative Operations. OPODIS 2014: 1-16 - Bogdan S. Chlebus, Gianluca De Marco, Dariusz R. Kowalski:
Scalable Wake-up of Multi-channel Single-Hop Radio Networks. OPODIS 2014: 186-201 - Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs. OPODIS 2014: 49-59 - Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees. OPODIS 2014: 293-306 - François Delbot, Christian Laforest, Stephane Rovedakis:
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems. OPODIS 2014: 307-322 - Dana Drachsler-Cohen, Erez Petrank:
LCD: Local Combining on Demand. OPODIS 2014: 355-371 - Sisi Duan, Hein Meling, Sean Peisert, Haibin Zhang:
BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration. OPODIS 2014: 91-106 - Martina Eikel, Christian Scheideler, Alexander Setzer:
RoBuSt: A Crash-Failure-Resistant Distributed Storage System. OPODIS 2014: 107-122 - Panagiota Fatourou, Eleni Kanellou, Eleftherios Kosmas, Md Forhad Rabbi:
WFR-TM: Wait-Free Readers without Sacrificing Speculation of Writers. OPODIS 2014: 420-436 - Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. OPODIS 2014: 217-232 - Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
The Opinion Number of Set-Agreement. OPODIS 2014: 155-170 - Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit:
On the Importance of Registers for Computability. OPODIS 2014: 171-185 - Ahmed Hassan, Roberto Palmieri, Binoy Ravindran:
On Developing Optimistic Transactional Lazy Set. OPODIS 2014: 437-452 - Tomoko Izumi, Sayaka Kamei, Yukiko Yamauchi:
Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots. OPODIS 2014: 233-247 - Taisuke Izumi, Roger Wattenhofer:
Time Lower Bounds for Distributed Distance Oracles. OPODIS 2014: 60-75 - Sandeep S. Kulkarni, Murat Demirbas, Deepak Madappa, Bharadwaj Avva, Marcelo Leone:
Logical Physical Clocks. OPODIS 2014: 17-32 - Shay Kutten, Chhaya Trehan:
Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree. OPODIS 2014: 323-338 - Tamás Lukovszki, Friedhelm Meyer auf der Heide:
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. OPODIS 2014: 248-262 - Odorico Machado Mendizabal, Parisa Jalili Marandi, Fernando Luís Dotti, Fernando Pedone:
Checkpointing in Parallel State-Machine Replication. OPODIS 2014: 123-138 - Avery Miller, Andrzej Pelc:
Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt. OPODIS 2014: 263-276 - Nhan Nguyen, Philippas Tsigas, Håkan Sundell:
ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List. OPODIS 2014: 372-387 - Kenneth Platz, Neeraj Mittal, Subbarayan Venkatesan:
Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization. OPODIS 2014: 388-403 - Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Distributed Universality. OPODIS 2014: 469-484 - Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols. OPODIS 2014: 339-354 - Pierre Sutra, Etienne Rivière, Pascal Felber:
A Practical Distributed Universal Construction with Unknown Participants. OPODIS 2014: 485-500
skipping 3 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-04-25 10:52 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