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 34 matches
- 2025
- Toshimitsu Masuzawa, Yoshiaki Katayama, Hirotsugu Kakugawa, Junya Nakamura, Yonghwan Kim:
Stabilization, Safety, and Security of Distributed Systems - 26th International Symposium, SSS 2024, Nagoya, Japan, October 20-22, 2024, Proceedings. Lecture Notes in Computer Science 14931, Springer 2025, ISBN 978-3-031-74497-6 [contents] - 2024
- Erik van den Akker, Klaus-Tycho Foerster:
Brief Announcement: On the Feasibility of Local Failover Routing on Directed Graphs. SSS 2024: 375-380 - Yackolley Amoussou-Guenou, Lionel Beltrando, Maurice Herlihy, Maria Potop-Butucaru:
Byzantine Reliable Broadcast with One Trusted Monotonic Counter. SSS 2024: 360-374 - Yackolley Amoussou-Guenou, Maurice Herlihy, Maria Potop-Butucaru, Sergio Rajsbaum:
Invited Paper: The Smart Contract Model. SSS 2024: 55-70 - Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano:
An Optimal Algorithm for Geodesic Mutual Visibility on Hexagonal Grids. SSS 2024: 161-176 - Umesh Biswas, Trisha Chakraborty, Maxwell Young:
Softening the Impact of Collisions in Contention Resolution. SSS 2024: 398-416 - Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
Optimal Asynchronous Perpetual Grid Exploration. SSS 2024: 89-105 - Rachel Bricker, Mikhail Nesterenko, Gokarna Sharma:
Consensus Through Knot Discovery in Asynchronous Dynamic Networks. SSS 2024: 432-445 - Ranjith Chodavarapu, Rabimba Karanjai, Xinxin Fan, Weidong Shi, Lei Xu:
Adding All Flavors: A Hybrid Random Number Generator for dApps and Web3. SSS 2024: 292-306 - Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Gathering of Robots in Butterfly Networks. SSS 2024: 106-120 - Raja Das, Pritam Goswami, Buddhadeb Sau:
Brief Announcement: Perpetual Exploration of Triangular Grid by Myopic Oblivious Robots Without Chirality. SSS 2024: 156-160 - Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber:
Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. SSS 2024: 240-254 - Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch Schieber, Shantanu Sharma:
Brief Announcement: Make Master Private-Keys Secure by Keeping It Public. SSS 2024: 338-343 - Sean Doris, Iosif Salem, Stefan Schmid:
Anomaly Detection Within Mission-Critical Call Processing. SSS 2024: 322-337 - Ali Ebnenasir:
Generating the Convergence Stairs of the Collatz Program. SSS 2024: 417-431 - Fabian Frei, Koichi Wada:
Invited Paper: Gathering Oblivious Robots in the Plane. SSS 2024: 39-54 - Adam Ganczorz, Leszek Gasieniec, Tomasz Jurdzinski, Jakub Kowalski, Grzegorz Stachowiak:
Selective Population Protocols. SSS 2024: 225-239 - Haruki Kanaya, Yuichi Sudo:
Complete Graph Identification in Population Protocols. SSS 2024: 126-140 - Evangelos Kranakis:
Invited Paper: A Survey of the Impact of Knowledge on the Competitive Ratio in Linear Search. SSS 2024: 23-38 - Mohamed Amine Legheraba, Maria Potop-Butucaru, Sébastien Tixeuil:
Brief Announcement: A Self-* and Persistent Hub Sampling Service. SSS 2024: 461-465 - Christoph Lenzen, Sophie Wenning:
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion. SSS 2024: 277-291 - Keita Nakajima, Kaito Takase, Koichi Wada:
Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. SSS 2024: 141-155 - Alfredo Navarra, Francesco Piselli:
Coating in sfSILBOT with One Axis Agreement. SSS 2024: 177-192 - Joseph Oglio, Mikhail Nesterenko, Gokarna Sharma:
TRAIL: Cross-Shard Validation for Byzantine Shard Protection. SSS 2024: 381-397 - Kohei Otaka, Fabian Frei, Koichi Wada:
Gathering Semi-Synchronously Scheduled Two-State Robots. SSS 2024: 209-224 - Michel Raynal:
On Distributed Computing: A View, Physical Versus Logical Objects, and a Look at Fully Anonymous Systems. SSS 2024: 3-19 - Ashish Saxena, Barun Gorain, Subhrangsu Mandal, Kaushik Mondal:
Brief Announcement: Pebble Guided Rendezvous Despite Fault. SSS 2024: 121-125 - Baruch Schieber:
Brief Announcement: Towards Proportionate Fair Assignment. SSS 2024: 255-259 - Kohya Shiozaki, Junya Nakamura:
Selection Guidelines for Geographical SMR Protocols: A Communication Pattern-Based Latency Modeling Approach. SSS 2024: 344-359 - K. Sowjanya, Pabitra Pal, Aman Verma, Bijoy Das, Dhiman Saha, Anand M. Baswade, Brejesh Lall:
SUPI-Rear: Privacy-Preserving Subscription Permanent Identification Strategy in 5G-AKA. SSS 2024: 307-321
skipping 4 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 2025-01-11 03:47 CET 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