Остановите войну!
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 44 matches
- 2008
- Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld:
Group Renaming. OPODIS 2008: 58-72 - Eduardo Adílio Pelinson Alchieri, Alysson Neves Bessani, Joni da Silva Fraga, Fabíola Greve:
Byzantine Consensus with Unknown Participants. OPODIS 2008: 22-40 - Paulo Sérgio Almeida, Carlos Baquero, Victor Fonte:
Interval Tree Clocks. OPODIS 2008: 259-274 - Björn Andersson:
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%. OPODIS 2008: 73-88 - Björn Andersson:
Uniprocessor EDF Scheduling with Mode Change. OPODIS 2008: 572-577 - Antonio Fernández Anta, Alessia Milani:
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks. OPODIS 2008: 164-183 - Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita:
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. OPODIS 2008: 125-144 - Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. OPODIS 2008: 428-445 - Sanjoy K. Baruah, Joël Goossens:
Deadline Monotonic Scheduling on Uniform Multiprocessors. OPODIS 2008: 89-104 - Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque:
A Distributed Algorithm for Resource Clustering in Large Scale Platforms. OPODIS 2008: 564-567 - Marcin Bienkowski, André Brinkmann, Miroslaw Korzeniowski:
Degree 3 Suffices: A Large-Scale Overlay for P2P Networks. OPODIS 2008: 184-196 - Borzoo Bonakdarpour, Sandeep S. Kulkarni:
Revising Distributed UNITY Programs Is NP-Complete. OPODIS 2008: 408-427 - Björn B. Brandenburg, James H. Anderson:
A Comparison of the M-PCP, D-PCP, and FMLPon LITMUSRT. OPODIS 2008: 105-124 - André Brinkmann, Sascha Effert:
Redundant Data Placement Strategies for Cluster Storage Environments. OPODIS 2008: 551-554 - Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc:
Impact of Information on the Complexity of Asynchronous Radio Broadcasting. OPODIS 2008: 311-330 - Hyon-Young Choi, Kwang-Ryoul Kim, Hyo-Beom Lee, Sung-Gi Min:
Reactive Smart Buffering Scheme for Seamless Handover in PMIPv6. OPODIS 2008: 568-571 - Thomas Clouser, Mark Miyashita, Mikhail Nesterenko:
Fast Geometric Routing with Concurrent Face Traversal. OPODIS 2008: 346-362 - David Coudert, Florian Huc, Dorian Mazauric:
Computing and Updating the Process Number in Trees. OPODIS 2008: 546-550 - Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer:
Rendezvous of Mobile Agents When Tokens Fail Anytime. OPODIS 2008: 463-480 - Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam Toueg:
With Finite Memory Consensus Is Easier Than Reliable Broadcast. OPODIS 2008: 41-57 - Dan Dobre, Matthias Majuntke, Neeraj Suri:
On the Time-Complexity of Robust and Amnesic Storage. OPODIS 2008: 197-216 - Stefan Dobrev, Rastislav Kralovic, Dana Pardubská:
Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS 2008: 512-526 - Eli Gafni:
The 0-1-Exclusion Families of Tasks. OPODIS 2008: 246-258 - Joël Goossens, Dragomir Milojevic, Vincent Nélis:
Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms. OPODIS 2008: 388-407 - Vincent Gramoli, Derin Harmanci, Pascal Felber:
Toward a Theory of Input Acceptance for Transactional Memories. OPODIS 2008: 527-533 - Rachid Guerraoui:
The Next 700 BFT Protocols. OPODIS 2008: 1 - Damien Imbs, Michel Raynal:
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness. OPODIS 2008: 226-245 - Sayaka Kamei, Hirotsugu Kakugawa:
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence. OPODIS 2008: 496-511 - Hyeong Seog Kim, Eunjin Jung, Heon Young Yeom:
Load-Balanced and Sybil-Resilient File Search in P2P Networks. OPODIS 2008: 542-545 - Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS 2008: 446-462
skipping 14 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:42 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