Остановите войну!
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 45 matches
- 2023
- Mahmoud Abdelgawad, Indrakshi Ray, Tomas Vasquez:
Workflow Resilience for Mission Critical Systems. SSS 2023: 498-512 - Winfred Afeaneku, Andrew Berns, Weston Kuchenberg, Sara Leisinger, Cedric Liu:
Brief Announcement: Understanding Self-stabilizing Node-Capacitated Overlay Networks Through Simulation. SSS 2023: 52-56 - Orestis Alpos, Christian Cachin:
Do Not Trust in Numbers: Practical Distributed Cryptography with General Trust. SSS 2023: 536-551 - Talley Amir, James Aspnes:
Privacy in Population Protocols with Probabilistic Scheduling. SSS 2023: 400-413 - Vijeth Aradhya, Seth Gilbert, Aquinas Hobor:
Robust Overlays Meet Blockchains - On Handling High Churn and Catastrophic Failures. SSS 2023: 191-206 - Yuichi Asahiro, Masafumi Yamashita:
Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract). SSS 2023: 312-327 - Asif Uz Zaman Asif, Hossein Shirazi, Indrakshi Ray:
Machine Learning-Based Phishing Detection Using URL Features: A Comprehensive Review. SSS 2023: 481-497 - Anushree Belel, Ratna Dutta, Sourav Mukhopadhyay:
Hierarchical Identity-Based Inner Product Functional Encryption for Unbounded Hierarchical Depth. SSS 2023: 274-288 - Gaurav Bhardwaj, Bapi Chatterjee, Abhay Jain, Sathya Peri:
Wait-Free Updates and Range Search Using Uruv. SSS 2023: 435-450 - Gaurav Bhardwaj, Sathya Peri, Pratik Shetty:
Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. SSS 2023: 106-110 - Ken Birman, Sagar Jha, Mae Milano, Lorenzo Rosa, Weijia Song, Edward Tremel:
Invited Paper: Monotonicity and Opportunistically-Batched Actions in Derecho. SSS 2023: 172-190 - Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines. SSS 2023: 451-465 - Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Offline Constrained Backward Time Travel Planning. SSS 2023: 466-480 - Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents. SSS 2023: 380-384 - Christian Cachin, David Lehnherr, Thomas Studer:
Synergistic Knowledge. SSS 2023: 552-567 - Amit Kumar Chauhan, Abhishek Kumar, Somitra Kumar Sanadhya:
Square Attacks on Reduced-Round FEA-1 and FEA-2. SSS 2023: 583-597 - Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski, Jedrzej Olkowski:
Disconnected Agreement in Networks Prone to Link Failures. SSS 2023: 207-222 - Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. SSS 2023: 385-399 - Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi:
The Fence Complexity of Persistent Sets. SSS 2023: 36-51 - Bibhuti Das, Krishnendu Mukhopadhyaya:
Uniform k-Circle Formation by Fat Robots. SSS 2023: 359-373 - Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Meeting Times of Non-atomic Random Walks. SSS 2023: 297-311 - Eli Gafni, Giuliano Losa:
Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20. SSS 2023: 62-74 - Vijay K. Garg, Changyong Hu:
Improved Paths to Stability for the Stable Marriage Problem. SSS 2023: 126-140 - Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
The Fagnano Triangle Patrolling Problem (Extended Abstract). SSS 2023: 157-171 - Chryssis Georgiou, Michel Raynal, Elad Michael Schiller:
Self-stabilizing Byzantine-Tolerant Recycling. SSS 2023: 518-535 - Satakshi Ghosh, Avisek Sharma, Pritam Goswami, Buddhadeb Sau:
Brief Announcement: Asynchronous Gathering of Finite Memory Robots on a Circle Under Limited Visibility. SSS 2023: 430-434 - Pritam Goswami, Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau:
Brief Announcement: Rendezvous on a Known Dynamic Point in a Finite Unoriented Grid. SSS 2023: 374-379 - Arya Tanmay Gupta, Sandeep S. Kulkarni:
Lattice Linearity of Multiplication and Modulo. SSS 2023: 141-156 - Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot:
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. SSS 2023: 344-358 - Erwan Jahier, Karine Altisen, Stéphane Devismes:
Exploring Worst Cases of Self-stabilizing Algorithms Using Simulations. SSS 2023: 1-17
skipping 15 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-12 08:11 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