default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th DISC 2013: Jerusalem, Israel
- Yehuda Afek:
Distributed Computing - 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings. Lecture Notes in Computer Science 8205, Springer 2013, ISBN 978-3-642-41526-5
Graph Problems in the Message Passing Model
- Mohsen Ghaffari, Fabian Kuhn:
Distributed Minimum Cut Approximation. 1-15 - David P. Woodruff, Qin Zhang:
When Distributed Computation Is Communication Expensive. 16-30
Topology, Leader Election, and Spanning Trees
- Emanuele Guido Fusco
, Andrzej Pelc, Rossella Petreschi:
Use Knowledge to Learn Faster: Topology Recognition with Advice. 31-45 - George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
An O(sqrt n) Space Bound for Obstruction-Free Leader Election. 46-60 - Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
Distributed Protocols for Leader Election: A Game-Theoretic Perspective. 61-75 - Lélia Blin, Sébastien Tixeuil:
Compact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative. 76-90 - Alex Kravchik, Shay Kutten:
Time Optimal Synchronous Self Stabilizing Spanning Tree. 91-105
Software Transactional Memory
- Mohsen Lesani, Jens Palsberg:
Proving Non-opacity. 106-120 - Danny Hendler, Alex Naiman, Sebastiano Peluso, Francesco Quaglia, Paolo Romano, Adi Suissa:
Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration. 121-133 - Li Lu, Michael L. Scott:
Generic Multiversion STM. 134-148 - Nuno Diegues, João P. Cachopo:
Practical Parallel Nesting for Software Transactional Memory. 149-163
Shared Memory Executions
- Sagar Chordia, Sriram K. Rajamani, Kaushik Rajan, Ganesan Ramalingam, Kapil Vaswani:
Asynchronous Resilient Linearizability. 164-178 - Gadi Taubenfeld:
Fair Synchronization. 179-193
Gossip and Rumor
- George Giakkoupis, Anne-Marie Kermarrec, Philipp Woelfel:
Gossip Protocols for Renaming and Sorting. 194-208 - Chen Avin, Robert Elsässer:
Faster Rumor Spreading: Breaking the logn Barrier. 209-223
Shared Memory Tasks and Data Structures
- Erez Petrank, Shahar Timnat:
Lock-Free Data-Structure Iterators. 224-238 - Kunlong Zhang, Yujiao Zhao, Yajun Yang, Yujie Liu, Michael F. Spear:
Practical Non-blocking Unordered Lists. 239-253 - James Aspnes, Keren Censor-Hillel:
Atomic Snapshots in O(log3 n) Steps Using Randomized Helping. 254-268 - Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Leslie Lamport:
Adaptive Register Allocation with a Linear Number of Registers. 269-283 - Faith Ellen, Philipp Woelfel:
An Optimal Implementation of Fetch-and-Increment. 284-298
Replication and Consensus
- Flavio Paiva Junqueira, Marco Serafini:
On Barriers and the Gap between Active and Passive Replication. 299-313
Wireless Networks
- Bojun Huang, Thomas Moscibroda:
Conflict Resolution and Membership Problem in Beeping Channels. 314-328 - Yuval Emek, Roger Wattenhofer:
Frequency Hopping against a Powerful Adversary. 329-343 - Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Sleeping Experts in Wireless Networks. 344-357 - Sebastian Daum, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Broadcast in the Ad Hoc SINR Model. 358-372 - Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. 373-387
Crypto, Trust, and Influence
- Ashish Choudhury, Martin Hirt, Arpita Patra:
Asynchronous Multiparty Computation with Linear Communication Complexity. 388-402 - Paul Bunn, Rafail Ostrovsky:
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary. 403-417 - Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
On the Communication Complexity of Distributed Name-Independent Routing Schemes. 418-432 - Silvio Frischknecht, Barbara Keller, Roger Wattenhofer:
Convergence in (Social) Influence Networks. 433-446 - Olivier Bournez, Jonas Lefèvre, Mikaël Rabie:
Trustful Population Protocols. 447-461
Networking
- Israel Cidon, Erez Kantor, Shay Kutten:
Prudent Opportunistic Cognitive Radio Access Protocols. 462-476 - Michael Dinitz, Merav Parter:
Braess's Paradox in Wireless Networks: The Danger of Improved Technology. 477-491 - Mohsen Ghaffari, Bernhard Haeupler:
Fast Structuring of Radio Networks Large for Multi-message Communications. 492-506 - Ittay Eyal, Idit Keidar, Stacy Patterson, Raphi Rom:
In-Network Analytics for Ubiquitous Sensing. 507-521 - James Hegeman, Sriram V. Pemmaraju:
A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location. 522-536 - Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler:
CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System. 537-549
Brief Announcements / Backmatter
- Brief Announcements / Back Matter. 552-586
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 2026-03-27 20:52 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:
