Остановите войну!
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
- 2011
- Yehuda Afek, Hillel Avni, Nir Shavit:
Towards Consistency Oblivious Programming. OPODIS 2011: 65-79 - Mohammad Alaggan, Sébastien Gambs, Anne-Marie Kermarrec:
Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy. OPODIS 2011: 357-377 - Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. OPODIS 2011: 513-527 - Bharath Balasubramanian, Vijay K. Garg:
Fused State Machines for Fault Tolerance in Distributed Systems. OPODIS 2011: 266-282 - Gal Bar-Nissan, Danny Hendler, Adi Suissa:
A Dynamic Elimination-Combining Stack Algorithm. OPODIS 2011: 544-561 - Joffroy Beauquier, Janna Burman:
Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering. OPODIS 2011: 235-250 - Martin Biely, Peter Robinson, Ulrich Schmid:
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. OPODIS 2011: 299-312 - Jan Olaf Blech:
Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties. OPODIS 2011: 222-234 - François Bonnet, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil:
Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction. OPODIS 2011: 251-265 - Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie:
Computing with Pavlovian Populations. OPODIS 2011: 409-420 - Zohir Bouzid, Pierre Sutra, Corentin Travers:
Anonymous Agreement: The Janus Algorithm. OPODIS 2011: 175-190 - Trevor Brown, Joanna Helga:
Non-blocking k-ary Search Trees. OPODIS 2011: 207-221 - Alain Cournier, Stephane Rovedakis, Vincent Villain:
The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction. OPODIS 2011: 159-174 - Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman:
Robust Network Supercomputing without Centralized Control. OPODIS 2011: 435-450 - Jeremy P. Erickson, James H. Anderson:
Response Time Bounds for G-EDF without Intra-Task Precedence Constraints. OPODIS 2011: 128-142 - Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS 2011: 96-111 - Emanuele G. Fusco, Andrzej Pelc:
Communication Complexity of Consensus in Anonymous Message Passing Systems. OPODIS 2011: 191-206 - Vijay K. Garg, John Bridgman, Bharath Balasubramanian:
Accurate Byzantine Agreement with Feedback. OPODIS 2011: 465-480 - Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. OPODIS 2011: 143-158 - Christian Glacet, Nicolas Hanusse, David Ilcinkas:
The Impact of Edge Deletions on the Number of Errors in Networks. OPODIS 2011: 378-391 - Samuel Guilbault, Andrzej Pelc:
Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs. OPODIS 2011: 421-434 - Maurice Herlihy, Nir Shavit:
On the Nature of Progress. OPODIS 2011: 313-328 - Chiahsun Ho, Shelby H. Funk:
Partially Non-Preemptive Dual Priority Multiprocessor Scheduling. OPODIS 2011: 343-356 - David Ilcinkas, Ahmed Mouhamadou Wade:
On the Power of Waiting When Exploring Public Transportation Systems. OPODIS 2011: 451-464 - Petr Kuznetsov, Srivatsan Ravi:
On the Cost of Concurrency in Transactional Memory. OPODIS 2011: 112-127 - Peng Lu, Binoy Ravindran, Changsoo Kim:
Enhancing the Performance of High Availability Lightweight Live Migration. OPODIS 2011: 50-64 - Matthias Majuntke, Dan Dobre, Christian Cachin, Neeraj Suri:
Fork-Consistent Constructions from Registers. OPODIS 2011: 283-298 - Marco Ajmone Marsan:
From Energy-Efficient Networking to ZEN. OPODIS 2011: 1-3 - George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. OPODIS 2011: 4-17 - Samaneh Navabpour, Borzoo Bonakdarpour, Sebastian Fischmeister:
Optimal Instrumentation of Data-flow in Concurrent Data Structures. OPODIS 2011: 497-512
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-06-04 11:15 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