default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th DISC 2014: Austin, TX, USA
- Fabian Kuhn:
Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings. Lecture Notes in Computer Science 8784, Springer 2014, ISBN 978-3-662-45173-1
Concurrency
- Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Automatically Adjusting Concurrency to the Level of Synchrony. 1-15
Biological and Chemical Networks
- Ho-Lin Chen, Rachel Cummings, David Doty, David Soloveichik:
Speed Faults in Computation by Chemical Reaction Networks. 16-30 - Tobias Langner, Jara Uitto, David Stolz, Roger Wattenhofer:
Fault-Tolerant ANTS. 31-45 - Alejandro Cornejo, Anna R. Dornhaus, Nancy A. Lynch, Radhika Nagpal
:
Task Allocation in Ant Colonies. 46-60
Agreement Problems
- Dan Alistarh, James Aspnes, Valerie King, Jared Saia:
Communication-Efficient Randomized Consensus. 61-75 - François Bonnet, Xavier Défago, Thanh Dang Nguyen, Maria Potop-Butucaru:
Tight Bound on Mobile Byzantine Agreement. 76-90 - Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Unbeatable Consensus. 91-106 - Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Reliable Broadcast with Respect to Topology Knowledge. 107-121
Robot Coordination, Scheduling
- Jurek Czyzowicz, Leszek Gasieniec, Thomas Gorry, Evangelos Kranakis, Russell Martin, Dominik Pajak:
Evacuating Robots via Unknown Exit in a Disk. 122-136 - Yukiko Yamauchi, Masafumi Yamashita:
Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile Robots. 137-151 - Shaolei Ren, Yuxiong He, Kathryn S. McKinley:
A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive Applications. 152-166
Graph Distances and Routing
- Merav Parter:
Vertex Fault Tolerant Additive Spanners. 167-181 - Liam Roditty, Roei Tov:
Close to Linear Space Routing Schemes. 182-196 - Mohsen Ghaffari, Christoph Lenzen:
Near-Optimal Distributed Tree Embedding. 197-211
Radio Networks
- Klaus-Tycho Förster, Jochen Seidel, Roger Wattenhofer:
Deterministic Leader Election in Multi-hop Beeping Networks - (Extended Abstract). 212-226 - Seth Gilbert, Calvin C. Newport, Chaodong Zheng:
Who Are You? Secure Identities in Ad Hoc Networks. 227-242 - Zhiyu Liu, Maurice Herlihy:
Approximate Local Sums and Their Applications in Radio Networks. 243-257 - Calvin C. Newport:
Radio Network Lower Bounds Made Easy. 258-272
Shared Memory
- Kfir Lev-Ari, Gregory V. Chockler, Idit Keidar:
On Correctness of Data Structures under Reads-Write Concurrency. 273-287 - Claire Capdevielle, Colette Johnen, Alessia Milani:
Solo-Fast Universal Constructions for Deterministic Abortable Objects. 288-302 - Maryam Helmi, Lisa Higham, Philipp Woelfel:
Space Bounds for Adaptive Renaming. 303-317
Dynamic and Social Networks
- Calvin C. Newport:
Lower Bounds for Structuring Unreliable Radio Networks. 318-332 - Oksana Denysyuk, Luís E. T. Rodrigues:
Random Walks on Evolving Graphs with Recurring Topologies. 333-345 - Abbas Mehrabian, Ali Pourmiri:
Randomized Rumor Spreading in Poorly Connected Small-World Networks. 346-360
Relativistic Systems
- Seth Gilbert, Wojciech M. Golab:
Making Sense of Relativistic Distributed Systems. 361-375
Transactional Memory and Concurrent Data Structures
- Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient. 376-390 - Mohsen Lesani, Jens Palsberg:
Decomposing Opacity. 391-405 - Irina Calciu, Hammurabi Mendes, Maurice Herlihy:
The Adaptive Priority Queue with Elimination and Combining. 406-420 - Edward Talmage, Jennifer L. Welch:
Improving Average Performance by Relaxing Distributed Data Structures. 421-438
Distributed Graph Algorithms
- Danupon Nanongkai, Hsin-Hao Su:
Almost-Tight Distributed Minimum Cut Algorithms. 439-453 - Magnús M. Halldórsson, Christian Konrad:
Distributed Algorithms for Coloring Interval Graphs. 454-468 - Shay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson:
Distributed Symmetry Breaking in Hypergraphs. 469-483
Communication
- Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
On Streaming and Communication Complexity of the Set Cover Problem. 484-498 - Yi Li, Xiaoming Sun, Chengu Wang, David P. Woodruff:
On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model. 499-513 - James W. Hegeman, Sriram V. Pemmaraju, Vivek Sardeshmukh:
Near-Constant-Time Distributed Algorithms on a Congested Clique. 514-530
Brief Announcements
- Leander Jehl, Tormod Erevik Lea, Hein Meling:
Replacement - Handling Failures in a Replicated State Machine. 531-532 - Panagiota Fatourou, Nikolaos D. Kallimanis:
The Power of Scheduling-Aware Synchronization. 533-534 - Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment of Different-Sized Inputs in MapReduce. 536-537 - Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Scheduling Multiple Objects in Distributed Transactional Memory. 538-539 - Konrad Siek, Pawel T. Wojciechowski:
Relaxing Opacity in Pessimistic Transactional Memory. 540-541 - Shahar Timnat, Maurice Herlihy, Erez Petrank:
A Practical Transactional Memory Interface. 542-543 - Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
On Dynamic and Multi-functional Labeling Schemes. 544-545 - Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Update Consistency in Partitionable Systems. 546-549 - Sebastiano Peluso, Roberto Palmieri, Paolo Romano, Binoy Ravindran, Francesco Quaglia:
Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TM. 548-549 - Hillel Avni, Adi Suissa-Peleg:
COP Composition Using Transaction Suspension in the Compiler. 550-552 - Wei-Lun Hung, Himanshu Chauhan, Vijay K. Garg:
Non-blocking Monitor Executions for Increased Parallelism. 553-554 - Adam Sealfon, Aikaterini A. Sotiraki:
Agreement in Partitioned Dynamic Networks. 555-556 - Pierre Bertrand, Christoph Lenzen:
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. 557-558 - Stephan Holzer, Sebastian Kohler, Roger Wattenhofer:
k-Selection and Sorting in the SINR Model. 559-561 - Stephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer:
Distributed 3/2-Approximation of the Diameter. 562-564 - Lélia Blin, Pierre Fraigniaud:
Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes. 565-566 - Mahnush Movahedi, Jared Saia, Mahdi Zamani:
Secure Anonymous Broadcast. 567-568 - Mahnush Movahedi, Mahdi Zamani:
Privacy-Preserving Location-Based Services. 569-571
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 2025-10-29 01:33 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:
