default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th DISC 2010: Cambridge, MA, USA
- Nancy A. Lynch, Alexander A. Shvartsman
:
Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6343, Springer 2010, ISBN 978-3-642-15762-2 - Marcos Kawazoe Aguilera, Michel Raynal:
The 2010 Edsger W. Dijkstra Prize in Distributed Computing. 1-2
Invited Lecture I: Consensus
- Barbara Liskov:
The Power of Abstraction - (Invited Lecture Abstract). 3 - Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Malkhi:
Fast Asynchronous Consensus with Optimal Resilience. 4-19
Transactions
- Luke Dalessandro, Michael L. Scott, Michael F. Spear:
Transactions as the Foundation of a Memory Consistency Model. 20-34 - Hagit Attiya, Eshcar Hillel:
The Cost of Privatization. 35-49 - François Carouge, Michael F. Spear:
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware. 50-63 - Gokarna Sharma, Brett Estrade, Costas Busch:
Window-Based Greedy Contention Management for Transactional Memory. 64-78
Shared Memory Services and Concurrency
- Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir:
Scalable Flat-Combining Based Synchronous Queues. 79-93 - Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, Rachid Guerraoui:
Fast Randomized Test-and-Set and Renaming. 94-108 - Maurice Herlihy, Sergio Rajsbaum:
Concurrent Computing and Shellable Complexes. 109-123
Brief Announcements I
- Pascal Felber, Christof Fetzer, Patrick Marlier, Martin Nowack, Torvald Riegel:
Brief Announcement: Hybrid Time-Based Transactional Memory. 124-126 - Yehuda Afek, Guy Korland, Eitan Yanovsky:
Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency. 127-129 - Hyonho Lee:
Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space. 130-132
Wireless Networks
- Johannes Schneider, Roger Wattenhofer:
What Is the Use of Collision Detection (in Wireless Networks)? 133-147 - Alejandro Cornejo, Fabian Kuhn:
Deploying Wireless Networks with Beeps. 148-162 - Thomas Kesselheim, Berthold Vöcking:
Distributed Contention Resolution in Wireless Networks. 163-178 - Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang:
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. 179-193
Brief Announcements II
- Michael Ben-Or, Danny Dolev, Ezra N. Hoch:
Brief Announcement: Simple Gradecast Based Algorithms. 194-197 - Sukhyun Song, Peter J. Keleher, Bobby Bhattacharjee, Alan Sussman:
Brief Announcement: Decentralized Network Bandwidth Prediction. 198-200 - Abhinav Mehta, Shashank Agrawal, Kannan Srinathan:
Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT. 201-203
Invited Lecture II: Best Student Paper
- Rachid Guerraoui:
Foundations of Speculative Distributed Computing - (Invited Lecture Extended Abstract). 204-205 - François Bonnet, Michel Raynal:
Anonymous Asynchronous Systems: The Case of Failure Detectors. 206-220
Consensus and Leader Election
- Gadi Taubenfeld:
The Computational Structure of Progress Conditions. 221-235 - Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski:
Scalable Quantum Consensus for Crash Failures. 236-250 - Emanuele G. Fusco, Andrzej Pelc:
How Much Memory Is Needed for Leader Election. 251-266 - Yoann Dieudonné, Franck Petit, Vincent Villain:
Leader Election Problem versus Pattern Formation Problem. 267-281
Mobile Agents
- Jérémie Chalopin, Shantanu Das, Peter Widmayer:
Rendezvous of Mobile Agents in Directed Graphs. 282-296 - Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel:
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. 297-311 - Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil:
Exclusive Perpetual Ring Exploration without Chirality. 312-327 - Dariusz Dereniowski, Andrzej Pelc:
Drawing Maps with Advice. 328-342
Invited Lecture III: Wireless Networks
- Nitin H. Vaidya:
Network-Aware Distributed Algorithms: Challenges and Opportunities in Wireless Networks - (Invited Lecture Summary). 343 - Dariusz R. Kowalski, Mariusz A. Rokicki:
Connectivity Problem in Wireless Networks. 344-358
Computing in Wireless and Mobile Networks
- Seth Gilbert, Dariusz R. Kowalski:
Trusted Computing for Fault-Prone Wireless Networks. 359-373 - Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. 374-388
Brief Announcements III
- Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Brief Announcement: Failure Detectors Encapsulate Fairness. 389-391 - Francesco Alberti, Silvio Ghilardi, Elena Pagani, Silvio Ranise, Gian Paolo Rossi:
Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study. 392-394 - Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Brief Announcement: On Reversible and Irreversible Conversions. 395-397 - Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting. 398-400 - Mahesh Balakrishnan, Philip A. Bernstein, Dahlia Malkhi, Vijayan Prabhakaran, Colin W. Reid:
Brief Announcement: Flash-Log - A High Throughput Log. 401-403 - Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
Brief Announcement: New Bounds for Partially Synchronous Set Agreement. 404-405
Modeling Issues and Adversity
- Edmund L. Wong, Joshua B. Leners, Lorenzo Alvisi:
It's on Me! The Benefit of Altruism in BAR Environments. 406-420 - Ido Ben-Zvi, Yoram Moses:
Beyond Lamport's Happened-Before: On the Role of Time Bounds in Synchronous Systems. 421-436 - Hrishikesh B. Acharya, Mohamed G. Gouda:
On the Power of Non-spoofing Adversaries. 437-449 - Vijay K. Garg:
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication. 450-464
Self-stabilizing and Graph Algortihms
- Shay Kutten, Dmitry Zinenko:
Low Communication Self-stabilization through Randomization. 465-479 - Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis:
Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme. 480-494 - Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil:
The Impact of Topology on Byzantine Containment in Stabilization. 495-509 - Christoph Lenzen, Roger Wattenhofer:
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity. 510-524
Brief Announcements IV
- Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil:
Brief Announcement: Sharing Memory in a Self-stabilizing Manner. 525-527 - Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Brief Announcement: Stabilizing Consensus with the Power of Two Choices. 528-530
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.
last updated on 2024-10-31 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
