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 46 matches
- 2011
- Ittai Abraham, Cyril Gavoille:
On Approximate Distance Labels and Routing Schemes with Affine Stretch. DISC 2011: 404-415 - Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a Maximal Independent Set. DISC 2011: 32-50 - Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Oblivious Collaboration. DISC 2011: 489-504 - Yehuda Afek, Michael Hakimi, Adam Morrison:
Fast and Scalable Rendezvousing. DISC 2011: 16-31 - Dan Alistarh, James Aspnes:
Sub-logarithmic Test-and-Set against a Weak Adversary. DISC 2011: 97-109 - Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz:
Unbounded Contention Resolution in Multiple-Access Channels. DISC 2011: 225-236 - James Aspnes:
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers. DISC 2011: 363-373 - Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, André Schiper:
Structured Derivation of Semi-Synchronous Algorithms. DISC 2011: 374-388 - Mahesh Balakrishnan, Dahlia Malkhi, Vijayan Prabhakaran, Ted Wobber:
DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond Paxos. DISC 2011: 208-210 - Piyush Bansal, Prasant Gopal, Anuj Gupta, Kannan Srinathan, Pranav K. Vasishta:
Byzantine Agreement Using Partial Authentication. DISC 2011: 389-403 - Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky:
Deterministic and Energy-Optimal Wireless Synchronization. DISC 2011: 237-251 - Leonid Barenboim, Michael Elkin:
Combinatorial Algorithms for Distributed Graph Coloring. DISC 2011: 66-81 - Dmitry Basin, Rui Fan, Idit Keidar, Ofer Kiselov, Dmitri Perelman:
CAFÉ: Scalable Task Pools with Adjustable Fairness and Contention. DISC 2011: 475-488 - Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
Leakage-Resilient Coin Tossing. DISC 2011: 181-196 - Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC 2011: 432-446 - Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro:
Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication. DISC 2011: 147-149 - Andrea E. F. Clementi, Riccardo Silvestri:
Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). DISC 2011: 298-310 - Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin:
Synchronous Rendezvous for Location-Aware Agents. DISC 2011: 447-459 - Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak:
Brief Announcement: Distributed Approximations for the Semi-matching Problem. DISC 2011: 200-201 - Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Brief Announcement: On the Meaning of Solving a Task with a Failure Detector. DISC 2011: 145-146 - Shlomi Dolev, Seth Gilbert, Majid Khabbazian, Calvin C. Newport:
Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast. DISC 2011: 252-267 - Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil:
Maximum Metric Spanning Tree Made Byzantine Tolerant. DISC 2011: 150-164 - Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. DISC 2011: 202-204 - Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Locality and Checkability in Wait-Free Computing. DISC 2011: 333-347 - Chryssis Georgiou, Dariusz R. Kowalski:
Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts. DISC 2011: 165-180 - Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry:
Leader Election Using Loneliness Detection. DISC 2011: 268-282 - Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada:
Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. DISC 2011: 330-331 - Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Mathieu Valero:
Physical Expander in Virtual Tree Overlay. DISC 2011: 82-96 - Fabian Kuhn, Rotem Oshman:
The Complexity of Data Aggregation in Directed Networks. DISC 2011: 416-431 - Shay Kutten, Ron Lavi, Amitabh Trehan:
Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games. DISC 2011: 197-199
skipping 16 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-12-15 18:45 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