![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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
- 2007
- Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Josef Widder:
Clock Synchronization in the Byzantine-Recovery Failure Model. OPODIS 2007: 90-104 - Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Deterministic Communication in the Weak Sensor Model. OPODIS 2007: 119-131 - Antonio Fernández Anta, Michel Raynal:
From an Intermittent Rotating Star to a Leader. OPODIS 2007: 189-203 - James Aspnes, Navin Rustagi, Jared Saia:
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. OPODIS 2007: 443-456 - James Aspnes, Yinghua Wu:
O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. OPODIS 2007: 286-300 - Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir:
Asynchronous Active Recommendation Systems. OPODIS 2007: 48-61 - Laurent Baduel, Satoshi Matsuoka:
A Decentralized, Scalable, and Autonomous Grid Monitoring System. OPODIS 2007: 1-15 - Theodore P. Baker, Michele Cirinei:
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks. OPODIS 2007: 62-75 - Sanjoy K. Baruah, Nathan Fisher:
Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems. OPODIS 2007: 204-216 - Olivier Beaumont
, Anne-Marie Kermarrec, Etienne Rivière:
Peer to Peer Multidimensional Overlays: Approximating Complex Structures. OPODIS 2007: 315-328 - Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
On the Self-stabilization of Mobile Robots in Graphs. OPODIS 2007: 301-314 - François Bonnet
, Anne-Marie Kermarrec, Michel Raynal:
Small-World Networks: From Theoretical Bounds to Practical Systems. OPODIS 2007: 372-385 - Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri:
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. OPODIS 2007: 247-259 - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert:
Secretive Birds: Privacy in Population Protocols. OPODIS 2007: 329-342 - Yoann Dieudonné, Franck Petit:
Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System. OPODIS 2007: 132-142 - Danny Dolev, Ezra N. Hoch, Robbert van Renesse:
Self-stabilizing and Byzantine-Tolerant Overlay Network. OPODIS 2007: 343-357 - Philippe Duchon, Nicole Eggemann, Nicolas Hanusse:
Non-Searchability of Random Power-Law Graphs. OPODIS 2007: 274-285 - Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS 2007: 105-118 - Eli Gafni, Petr Kuznetsov:
N-Consensus is the Second Strongest Object for N+1 Processes. OPODIS 2007: 260-273 - Anders Gidenstam, Marina Papatriantafilou:
LFthreads: A Lock-Free Thread Library. OPODIS 2007: 217-231 - Vincent Gramoli, Michel Raynal:
Timed Quorum Systems for Large-Scale and Dynamic Environments. OPODIS 2007: 429-442 - Christian Groß, Holger Hermanns, Reza Pulungan
:
Does Clock Precision Influence ZigBee's Energy Consumptions? OPODIS 2007: 174-188 - Moumen Hamouma, Achour Mostéfaoui, Gilles Trédan:
Byzantine Consensus with Few Synchronous Links. OPODIS 2007: 76-89 - Chi Ho, Danny Dolev, Robbert van Renesse:
Making Distributed Applications Robust. OPODIS 2007: 232-246 - Moshe Hoffman, Ori Shalev, Nir Shavit:
The Baskets Queue. OPODIS 2007: 401-414 - David Ilcinkas, Nicolas Nisse, David Soguet:
The Cost of Monotonicity in Distributed Graph Searching. OPODIS 2007: 415-428 - Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp:
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. OPODIS 2007: 159-173 - Vinodkrishnan Kulathumani, Anish Arora:
Distance Sensitive Snapshots in Wireless Sensor Networks. OPODIS 2007: 143-158 - Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Separability to Help Parallel Simulation of Distributed Computations. OPODIS 2007: 358-371 - Eric Ruppert:
The Anonymous Consensus Hierarchy and Naming Problems. OPODIS 2007: 386-400
skipping 3 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-30 02:41 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