Остановите войну!
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
- 2012
- Emmanuelle Anceaume, Erwan Le Merrer, Romaric Ludinard, Bruno Sericola, Gilles Straub:
FixMe: A Self-organizing Isolated Anomaly Detection Architecture for Large Scale Distributed Systems. OPODIS 2012: 1-15 - Björn Andersson, Dionisio de Niz:
Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks. OPODIS 2012: 16-30 - Joffroy Beauquier, Janna Burman, Laurent Rosaz, Brigitte Rozoy:
Non-deterministic Population Protocols. OPODIS 2012: 61-75 - Silvia Bonomi, Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers. OPODIS 2012: 76-90 - Trevor Brown, Hillel Avni:
Range Queries in Non-blocking k-ary Search Trees. OPODIS 2012: 31-45 - Armando Castañeda, Michel Raynal, Julien Stainer:
When and How Process Groups Can Be Used to Reduce the Renaming Space. OPODIS 2012: 91-105 - Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc:
Electing a Leader in Multi-hop Radio Networks. OPODIS 2012: 106-120 - Jurek Czyzowicz, Andrzej Pelc, Mélanie Roy:
Tree Exploration by a Swarm of Mobile Agents. OPODIS 2012: 121-134 - Shlomi Dolev, Swan Dubois, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Crash Resilient and Pseudo-Stabilizing Atomic Registers. OPODIS 2012: 135-150 - Klaus-Tycho Förster, Roger Wattenhofer:
Directed Graph Exploration. OPODIS 2012: 151-165 - Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. OPODIS 2012: 224-238 - Vijay K. Garg:
Lattice Completion Algorithms for Distributed Computations. OPODIS 2012: 166-180 - Mohsen Ghaffari, Seth Gilbert, Calvin C. Newport, Henry Tan:
Optimal Broadcast in Shared Spectrum Radio Networks. OPODIS 2012: 181-195 - Sascha Grau:
Attack-Resilient Multitree Data Distribution Topologies. OPODIS 2012: 196-208 - Bao-Thien Hoang, Abdessamad Imine:
On the Polling Problem for Social Networks. OPODIS 2012: 46-60 - Tomasz Jurdzinski, Dariusz R. Kowalski:
On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks. OPODIS 2012: 209-223 - Euripides Markou, Michel Paquette:
Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata. OPODIS 2012: 239-253 - Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. OPODIS 2012: 269-283 - Robbert van Renesse, Chi Ho, Nicolas Schiper:
Byzantine Chain Replication. OPODIS 2012: 345-359 - Srikanth Sastry, Jennifer L. Welch, Josef Widder:
Wait-Free Stabilizing Dining Using Regular Registers. OPODIS 2012: 284-299 - Andrés Sevilla, Alberto Mozo, Antonio Fernández Anta:
Node Sampling Using Random Centrifugal Walks. OPODIS 2012: 300-314 - Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings. OPODIS 2012: 254-268 - Devan Sohier, Giorgos Georgiadis, Simon Clavière, Marina Papatriantafilou, Alain Bui:
Physarum-Inspired Self-biased Walkers for Distributed Clustering. OPODIS 2012: 315-329 - Shahar Timnat, Anastasia Braginsky, Alex Kogan, Erez Petrank:
Wait-Free Linked-Lists. OPODIS 2012: 330-344 - Roberto Baldoni, Paola Flocchini, Binoy Ravindran:
Principles of Distributed Systems, 16th International Conference, OPODIS 2012, Rome, Italy, December 18-20, 2012. Proceedings. Lecture Notes in Computer Science 7702, Springer 2012, ISBN 978-3-642-35475-5 [contents]
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-23 18:56 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