default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th DISC 2015: Tokyo, Japan
- Yoram Moses:
Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings. Lecture Notes in Computer Science 9363, Springer 2015, ISBN 978-3-662-48652-8 - Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. 1-15 - Christoph Lenzen, Joel Rybicki
:
Efficient Counting with Optimal Resilience. 16-30 - Seth Gilbert, Calvin C. Newport:
The Computational Power of Beeps. 31-46 - Rachid Guerraoui, Alexandre Maurer:
Byzantine Fireflies. 47-59 - Oksana Denysyuk, Philipp Woelfel:
Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. 60-74 - Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract). 75-91 - Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. 92-106 - Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
Anonymous Graph Exploration with Binoculars. 107-122 - Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Limit Behavior of the Multi-agent Rotor-Router System. 123-139 - Eli Gafni, Dahlia Malkhi:
Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution. 140-153 - Leander Jehl, Roman Vitenberg, Hein Meling:
SmartMerge: A New Approach to Reconfiguration for Atomic Storage. 154-169 - Maya Arbel, Guy Golan-Gueta, Eshcar Hillel, Idit Keidar:
Towards Automatic Lock Removal for Scalable Synchronization. 170-184 - Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent Limitations of Hybrid Transactional Memory. 185-199 - Joel Gibson, Vincent Gramoli:
Why Non-blocking Operations Should be Selfish. 200-214 - Wenjia Ruan, Michael F. Spear:
Hybrid Transactional Memory Revisited. 215-231 - Petr Kuznetsov, Srivatsan Ravi:
Grasping the Gap Between Blocking and Non-Blocking Transactional Memories. 232-247 - Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast Consensus for Voting on General Expander Graphs. 248-262 - Jochen Seidel, Jara Uitto, Roger Wattenhofer:
Randomness vs. Time in Anonymous Networks. 263-275 - John Augustine, Gopal Pandurangan, Peter Robinson:
Fast Byzantine Leader Election in Dynamic Networks. 276-291 - Yuezhou Lv, Thomas Moscibroda:
Local Information in Influence Networks. 292-308 - Yehuda Afek, Alexander Matveev, Oscar R. Moll, Nir Shavit:
Amalgamated Lock-Elision. 309-324 - Ahmed Hassan, Roberto Palmieri, Binoy Ravindran:
Transactional Interference-Less Balanced Tree. 325-340 - Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
Analyzing the Performance of Lock-Free Data Structures: A Conflict-Based Model. 341-355 - Kfir Lev-Ari, Gregory V. Chockler, Idit Keidar:
A Constructive Approach for Proving Data Structures' Linearizability. 356-370 - Nir Hemed, Noam Rinetzky, Viktor Vafeiadis:
Modular Verification of Concurrency-Aware Linearizability. 371-387 - Andrea Cerone, Alexey Gotsman, Hongseok Yang:
Transaction Chopping for Parallel Snapshot Isolation. 388-404 - Keren Censor-Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter:
Computing in Additive Networks with Bounded-Information Codes. 405-419 - Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract). 420-435 - Eric Goubault, Samuel Mimram, Christine Tasson:
From Geometric Semantics to Asynchronous Computability. 436-451 - Rati Gelashvili:
On the Optimal Space Complexity of Consensus for Anonymous Processes. 452-466 - Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. 467-479 - George Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec, Nupur Mittal:
Privacy-Conscious Information Diffusion in Social Networks. 480-496 - Juan A. Garay, Björn Tackmann, Vassilis Zikas:
Fair Distributed Computation of Reactive Functions. 497-512 - Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin C. Newport:
Smoothed Analysis of Dynamic Networks. 513-527 - Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault Tolerant Reachability for Directed Graphs. 528-543 - Laurent Feuilloley, Juho Hirvonen, Jukka Suomela:
Locally Optimal Load Balancing. 544-558 - Magnús M. Halldórsson, Christian Konrad:
Distributed Large Independent Sets in One Round on Bounded-Independence Graphs. 559-572 - Sebastian Daum, Fabian Kuhn:
Tight Bounds for MIS in Multichannel Radio Networks. 573-587 - Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Nonuniform SINR+Voroni Diagrams Are Effectively Uniform. 588-601 - David Doty, David Soloveichik:
Stable Leader Election in Population Protocols Requires Linear Time. 602-616 - Hillel Avni, Eliezer Levy, Avi Mendelson:
Hardware Transactions in Nonvolatile Memory. 617-630 - Joffroy Beauquier, Janna Burman, Simon Clavière, Devan Sohier:
Space-Optimal Counting in Population Protocols. 631-646
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-12-05 22:22 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:
