Остановите войну!
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 42 matches
- 2011
- Sven Köhler, Volker Turau:
Space-Efficient Fault-Containment in Dynamic Networks. SSS 2011: 311-325 - Hrishikesh B. Acharya, Taehwan Choi, Rida A. Bazzi, Mohamed G. Gouda:
The K-Observer Problem in Computer Networks. SSS 2011: 5-18 - Hrishikesh B. Acharya, Anil Kumar Katti, Mohamed G. Gouda:
Brief Announcement: A Conjecture on Traceability, and a New Class of Traceable Networks. SSS 2011: 431-432 - Fawaz M. Al-Azemi, Mehmet Hakan Karaata:
Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs. SSS 2011: 433-434 - Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil:
Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. SSS 2011: 19-31 - Richard Anthony, Mariusz Pelc, Haffiz Suahib:
Brief Announcement: Towards Interoperability Standards and Services for Autonomic Systems. SSS 2011: 435-436 - Hagit Attiya, Armando Castañeda:
A Non-topological Proof for the Impossibility of k-Set Agreement. SSS 2011: 108-119 - Roberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad:
An Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn. SSS 2011: 32-46 - Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët:
Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example. SSS 2011: 47-61 - Roberto Beraldi, Adriano Cerocchi, Fabio Papale, Leonardo Querzoni:
Brief Announcement: Distributed Self-organizing Event Space Partitioning for Content-Based Publish/Subscribe Systems. SSS 2011: 437-438 - Andrew Berns, Sukumar Ghosh, Sriram V. Pemmaraju:
Building Self-stabilizing Overlay Networks with the Transitive Closure Framework. SSS 2011: 62-76 - Borzoo Bonakdarpour, Sandeep S. Kulkarni:
Active Stabilization. SSS 2011: 77-91 - Zohir Bouzid, Anissa Lamani:
Robot Networks with Homonyms: The Case of Patterns Formation. SSS 2011: 92-107 - Bernadette Charron-Bost, Henri Debrat, Stephan Merz:
Formal Verification of Consensus Algorithms Tolerating Malicious Faults. SSS 2011: 120-134 - Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis:
The Computational Power of Simple Protocols for Self-awareness on Graphs. SSS 2011: 135-147 - Jacek Cichon, Rafal Kapelko, Karol Marchwicki:
Brief Announcement: A Note on Replication of Documents. SSS 2011: 439-440 - Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Brief Announcement: Sorting on Skip Chains. SSS 2011: 443-444 - Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing Labeling and Ranking in Ordered Trees. SSS 2011: 148-162 - Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer:
Brief Announcement: A Stable and Robust Membership Protocol. SSS 2011: 441-442 - Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid:
Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract]. SSS 2011: 163-177 - Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The South Zone: Distributed Algorithms for Alliances. SSS 2011: 178-192 - Davide Frey, Arnaud Jégou, Anne-Marie Kermarrec:
Social Market: Combining Explicit and Implicit Social Networks. SSS 2011: 193-207 - Christian Gorecki, Felix C. Freiling, Marc Kührer, Thorsten Holz:
TrumanBox: Improving Dynamic Malware Analysis by Emulating the Internet. SSS 2011: 208-222 - Ofer Hermoni, Niv Gilboa, Eyal Felstaine, Yuval Elovici, Shlomi Dolev:
Rendezvous Tunnel for Anonymous Publishing: Clean Slate and Tor Based Designs. SSS 2011: 223-237 - Tatsuro Iida, Atsuko Miyaji, Kazumasa Omote:
POLISH: Proactive Co-operative LInk Self-Healing for Wireless Sensor Networks. SSS 2011: 253-267 - Damien Imbs, Michel Raynal:
The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid Communication. SSS 2011: 268-282 - Yonghwan Kim, Tadashi Araragi, Junya Nakamura, Toshimitsu Masuzawa:
Brief Announcement: A Concurrent Partial Snapshot Algorithm for Large-Scale and Dynamic Distributed Systems. SSS 2011: 445-446 - Jun Kiniwa, Kensaku Kikuta:
Price Stabilization in Networks - What Is an Appropriate Model ? SSS 2011: 283-295 - Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
Dynamic Regular Registers in Systems with Churn. SSS 2011: 296-310 - William Leal, Micah McCreery, Daniel Faria:
The OCRC Fuel Cell Lab Safety System: A Self-Stabilizing Safety-Critical System. SSS 2011: 326-340
skipping 12 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-26 02:19 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