DISC 2015 29th International Symposium on Distributed Computing

Accepted Submissions

Accepted Papers

  • Ahmed Hassan, Roberto Palmieri and Binoy Ravindran. “Transactional Interference-Less Balanced Tree.”
  • Andrea Cerone, Alexey Gotsman and Hongseok Yang. “Transaction Chopping for Parallel Snapshot Isolation.”
  • Aras Atalar, Paul Renaud-Goud and Philippas Tsigas. “Analyzing the Performance of Lock-Free Data Structures: A Conflict-Based Model.”
  • Armando Castañeda, Sergio Rajsbaum and Michel Raynal. “Specifying Concurrent Problems: Beyond Linearizability and up to Tasks.”
  • Benjamin Fish, Jeremy Kun, Ádám D. Lelkes, Lev Reyzin and György Turán. “On the Computational Complexity of MapReduce.”
  • Christoph Lenzen and Joel Rybicki. “Efficient Counting with Optimal Resilience.”
  • Colin Cooper, Tomasz Radzik, Robert Elsässer, Takeharu Shiraga and Nicolás Rivera. “Fast Consensus for Voting on General Expander Graphs.”
  • Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory.”
  • David Doty and David Soloveichik. “Stable Leader Election in Population Protocols Requires Linear Time.”
  • Eli Gafni and Dahlia Malkhi. “Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution.”
  • Erez Kantor, Zvi Lotker, Merav Parter and David Peleg. “Nonuniform SINR+Voroni Diagrams are Effectively Uniform.”
  • Éric Goubault, Samuel Mimram and Christine Tasson. “From Geometric Semantics to Asynchronous Computability.”
  • George Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec and Nupur Mittal. “Privacy-Conscious Information Diffusion in Social Networks.”
  • Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar and Jennifer L. Welch. “Simulating a Shared Register in an Asynchronous System that Never Stops Changing.”
  • Hillel Avni, Eliezer Levy and Avi Mendelson. “Hardware Transactions in Nonvolatile Memory.”
  • Ilan Komargodski and Yael Tauman Kalai. “Compressing Communication in Distributed Protocols.”
  • Jěrémie Chalopin, Emmanuel Godard and Antoine Naudin. “Anonymous Graph Exploration with Binoculars.”
  • Jěrémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel and Przemysław Uznański. “Limit Behavior of the Multi-agent Rotor-Router System.”
  • Jochen Seidel, Jara Uitto and Roger Wattenhofer. “Randomness vs. Time in Anonymous Networks.”
  • Joel Gibson and Vincent Gramoli. “Why Non-Blocking Operations Should be Selfish.”
  • Joffroy Beauquier, Janna Burman, Simon Clavière and Devan Sohier. “Space-Optimal Counting in Population Protocols.”
  • John Augustine, Gopal Pandurangan and Peter Robinson. “Fast Byzantine Leader Election in Dynamic Networks.”
  • Juan A. Garay, Björn Tackmann and Vassilis Zikas. “Fair Distributed Computation of Reactive Functions.”
  • Keerti Choudhary, Surender Baswana and Liam Roditty. “Fault Tolerant Reachability for Directed Graphs.”
  • Keren Censor-Hillel, Erez Kantor, Nancy Lynch and Merav Parter. “Computing in Additive Networks with Bounded-Information Codes.”
  • Kfir Lev-Ari, Gregory Chockler and Idit Keidar. “A Constructive Approach for Proving Data Structures’ Linearizability.”
  • Laurent Feuilloley, Juho Hirvonen and Jukka Suomela. “Locally Optimal Load Balancing.”
  • Leander Jehl, Roman Vitenberg and Hein Meling. “SmartMerge: A New Approach to Reconfiguration for Atomic Storage.”
  • Magnus M. Halldorsson and Christian Konrad. “Distributed Large Independent Sets in One Round On Bounded-Independence Graphs.”
  • Maya Arbel, Guy Golan-Gueta, Eshcar Hillel and Idit Keidar. “Towards Automatic Lock Removal for Scalable Synchronization.”
  • Michael Dinitz, Jeremy Fineman, Seth Gilbert and Calvin Newport. “Smoothed Analysis of Dynamic Networks.”
  • Nir Hemed, Noam Rinetzky and Viktor Vafeiadis. “Modular Verification of Concurrency-Aware Linearizability.”
  • Oksana Denysyuk and Philipp Woelfel. “Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability.”
  • Petr Kuznetsov and Srivatsan Ravi. “Grasping the Gap between Blocking and Non-Blocking Transactional Memories.”
  • Rachid Guerraoui and Alexandre Maurer. “Byzantine Fireflies.”
  • Rati Gelashvili. “On the Optimal Space Complexity of Consensus for Anonymous Processes.”
  • Sebastian Daum and Fabian Kuhn. “Tight Bounds for MIS in Multichannel Radio Networks.”
  • Seth Gilbert and Calvin Newport. “The Computational Power of Beeps.”
  • Wenjia Ruan and Michael Spear. “Hybrid Transactional Memory Revisited.”
  • Yehuda Afek, Alexander Matveev, Oscar R. Moll and Nir Shavit. “Amalgamated Lock-Elision.”
  • Yuezhou Lv and Thomas Moscibroda. “Local Information in Influence Networks.”
  • Yukiko Yamauchi, Taichi Uehara, Shuji Kijima and Masafumi Yamashita. “Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space.”

 

Brief Announcements

  • Alex Kogan and Yossi Lev. “Brief Announcement: HTM-Assisted Combining.”
  • Anna Dornhaus, Nancy Lynch, Tsvetomira Radeva and Hsin-Hao Su. “Brief Announcement: Distributed Task Allocation in Ant Colonies.”
  • Artur Menc, Dominik Pająk and Przemysław Uznański. “Brief Announcement: On the Power of One Bit in Graph Exploration Without Backtracking.”
  • Zohir Bouzid, Michel Raynal and Pierre Sutra. “Brief Announcement: Anonymous Obstruction-free (n,k)-Set Agreement with n-k+1 Atomic Read/Write Registers.”
  • Claire Capdevielle, Colette Johnen, Petr Kuznetsov and Alessia Milani. “Brief Announcement: On the Uncontended Complexity of Anonymous Consensus.”
  • Dominik Kaaser, Frederik Mallmann-Trenn and Emanuele Natale. “Brief Announcement: On the Voting Time of the Deterministic Majority Process.”
  • Gregory Chockler, Dan Dobre, Alexander Shraer and Alexander Spiegelman. “Brief Announcement: Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives.”
  • Leqi Zhu. “Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus.”
  • Li Ning, Dongxiao Yu, Yong Zhang, Yuexuan Wang, Francis C.M. Lau and Shengzhong Feng. “Brief Announcement: Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks.”
  • Pedro Ramalhete and Andreia Correia. “Brief Announcement: Left-Right – A Concurrency Control Technique with Wait-Free Population Oblivious Reads.”
  • Sebastian Daum, Fabian Kuhn and Yannic Maus. “Brief Announcement: Rumor Spreading with Bounded In-Degree.”
  • Shlomi Dolev, Chryssis Georgiou, Ioannis Marcoullis and Elad M. Schiller. “Brief Announcement: Self-Stabilizing Virtual Synchrony.”
  • Trevor Brown. “Brief Announcement: Faster Data Structures in Transactional Memory Using Three Paths.”
  • Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi and Di Shang. “Brief Announcement: A Concurrency-Optimal List-Based Set.”

Leave a Reply

Your email address will not be published. Required fields are marked *