Остановите войну!
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
- 2016
- Karine Altisen, Ajoy Kumar Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Leader Election in Rings with Bounded Multiplicity (Short Paper). SSS 2016: 1-6 - Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm. SSS 2016: 7-19 - Joffroy Beauquier, Peva Blanchard, Janna Burman, Oksana Denysyuk:
On the Power of Oracle \varOmega ? for Self-Stabilizing Leader Election in Population Protocols. SSS 2016: 20-35 - Alexander Binun, Thierry Coupaye, Shlomi Dolev, Mohammed Kassi-Lahlou, Marc Lacoste, Alex Palesandro, Reuven Yagel, Leonid Yankulin:
Self-stabilizing Byzantine-Tolerant Distributed Replicated State Machine. SSS 2016: 36-53 - Marjorie Bournat, Ajoy K. Datta, Swan Dubois:
Self-stabilizing Robots in Highly Dynamic Environments. SSS 2016: 54-69 - Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil:
Packet Efficient Implementation of the Omega Failure Detector. SSS 2016: 70-87 - Quentin Bramas, Sébastien Tixeuil:
Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper). SSS 2016: 88-93 - Davide Canepa, Xavier Défago, Taisuke Izumi, Maria Potop-Butucaru:
Flocking with Oblivious Robots. SSS 2016: 94-108 - Armando Castañeda, Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
Making Local Algorithms Wait-Free: The Case of Ring Coloring. SSS 2016: 109-125 - Alexandre Dambreville, Joanna Tomasik, Johanne Cohen:
Meta-algorithm to Choose a Good On-Line Prediction (Short Paper). SSS 2016: 126-130 - Guy Even, Moti Medina, Boaz Patt-Shamir:
On-Line Path Computation and Function Placement in SDNs. SSS 2016: 131-147 - Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil:
Infinite Unlimited Churn (Short Paper). SSS 2016: 148-153 - Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect Failure Detection with Very Few Bits. SSS 2016: 154-169 - Robert Gmyr, Jonas Lefèvre, Christian Scheideler:
Self-stabilizing Metric Graphs. SSS 2016: 248-262 - Emmanuel Godard:
Snap-Stabilizing Tasks in Anonymous Networks. SSS 2016: 170-184 - Mohammed Haddad, Colette Johnen, Sven Köhler:
Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper). SSS 2016: 185-189 - Marijn J. H. Heule, Rezwana Reaz, Hrishikesh B. Acharya, Mohamed G. Gouda:
Analysis of Computing Policies Using SAT Solvers (Short Paper). SSS 2016: 190-194 - Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil:
An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers. SSS 2016: 195-212 - Pankaj Khanchandani, Christoph Lenzen:
Self-stabilizing Byzantine Clock Synchronization with Optimal Precision. SSS 2016: 213-230 - Olaf Landsiedel, Thomas Petig, Elad Michael Schiller:
DecTDMA: A Decentralized-TDMA - With Link Quality Estimation for WSNs. SSS 2016: 231-247 - Christoph Lenzen, Joel Rybicki:
Near-Optimal Self-stabilising Counting and Firing Squads. SSS 2016: 263-280 - Florence Levé, Khaled Mohamed, Vincent Villain:
Snap-Stabilizing PIF on Arbitrary Connected Networks in Message Passing Model. SSS 2016: 281-297 - Lucas Perronne, Sara Bouchenak:
Towards Efficient and Robust BFT Protocols with ER-BFT (Short Paper). SSS 2016: 298-303 - Mikaël Rabie:
Global Versus Local Computations: Fast Computing with Identifiers (Short Paper). SSS 2016: 304-309 - Mohammad Roohitavaf, Sandeep S. Kulkarni:
Automatic Addition of Conflicting Properties. SSS 2016: 310-326 - Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan, Costas Busch, Suresh Rai:
Complete Visibility for Robots with Lights in O(1) Time. SSS 2016: 327-345 - Gerry Siegemund, Volker Turau:
PSVR - Self-stabilizing Publish/Subscribe Communication for Ad-Hoc Networks (Short Paper). SSS 2016: 346-351 - Lili Su, Nitin H. Vaidya:
Asynchronous Non-Bayesian Learning in the Presence of Crash Failures. SSS 2016: 352-367 - Lili Su, Nitin H. Vaidya:
Robust Multi-agent Optimization: Coping with Byzantine Agents with Input Redundancy. SSS 2016: 368-382 - Taichi Uehara, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. SSS 2016: 383-398
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-05-23 23:34 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