Остановите войну!
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
- 2008
- Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport:
The Mailbox Problem. DISC 2008: 1-15 - Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi, Allen Clement:
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems. DISC 2008: 16-31 - Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
How to Solve Consensus in the Smallest Window of Synchrony. DISC 2008: 32-46 - Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. DISC 2008: 504-506 - Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. DISC 2008: 496-497 - Marin Bertier, Anne-Marie Kermarrec, Guang Tan:
Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network. DISC 2008: 516-517 - Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Local Terminations and Distributed Computability in Anonymous Networks. DISC 2008: 47-62 - Ioannis Chatzigiannakis, Paul G. Spirakis:
The Dynamics of Probabilistic Population Protocols. DISC 2008: 498-499 - Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77 - David Coudert, Florian Huc, Dorian Mazauric:
A Distributed Algorithm for Computing and Updating the Process Number of a Forest. DISC 2008: 500-501 - Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak:
Fast Distributed Approximations in Planar Graphs. DISC 2008: 78-92 - Robert Danek, Wojciech M. Golab:
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion. DISC 2008: 93-108 - Robert Danek, Hyonho Lee:
Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems. DISC 2008: 512-513 - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann:
The Weakest Failure Detector for Message Passing Set-Agreement. DISC 2008: 109-120 - Bilel Derbel:
Local Maps: New Insights into Mobile Agent Algorithms. DISC 2008: 121-136 - Stanko Dimitrov, Parameshwaran Krishnan, Colin L. Mallows, Jean Meloche, Shalini Yajnik:
r3: Resilient Random Regular Graphs. DISC 2008: 137-151 - Michael Dinitz:
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics. DISC 2008: 152-166 - Danny Dolev, Ezra N. Hoch:
Constant-Space Localized Byzantine Consensus. DISC 2008: 167-181 - Shlomi Dolev, Nir Tzachar:
Brief Announcment: Corruption Resilient Fountain Codes. DISC 2008: 502-503 - Partha Dutta, Rachid Guerraoui, Ron R. Levy:
Optimistic Erasure-Coded Distributed Storage. DISC 2008: 182-196 - Mahmoud Elhaddad, Rami G. Melhem:
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing. DISC 2008: 197-211 - Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald:
On Radio Broadcasting in Random Geometric Graphs. DISC 2008: 212-226 - Paola Flocchini, David Ilcinkas, Nicola Santoro:
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. DISC 2008: 227-241 - Pierre Fraigniaud, Andrzej Pelc:
Deterministic Rendezvous in Trees with Little Memory. DISC 2008: 242-256 - Felix C. Freiling, Christian Lambertz, Mila E. Majster-Cederbaum:
Easy Consensus Algorithms for the Crash-Recovery Model. DISC 2008: 507-508 - Emanuele G. Fusco, Andrzej Pelc:
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information. DISC 2008: 257-273 - Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen:
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC 2008: 274-288 - Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman:
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. DISC 2008: 289-304 - Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh:
Permissiveness in Transactional Memories. DISC 2008: 305-319 - Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus:
The Synchronization Power of Coalesced Memory Accesses. DISC 2008: 320-334
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-09 23:31 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