default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st DISC 2017: Vienna, Austria
- Andréa W. Richa:
31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria. LIPIcs 91, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-053-8 - Front Matter, Table of Contents, Preface, Symposium Organization, Awards. 0:i-0:xviii
- Christian Cachin, Marko Vukolic:
Blockchain Consensus Protocols in the Wild (Keynote Talk). 1:1-1:16 - Anne-Marie Kermarrec:
Recommenders: from the Lab to the Wild (Keynote Talk). 2:1-2:1 - Dana Randall:
Phase Transitions and Emergent Phenomena in Random Structures and Algorithms (Keynote Talk). 3:1-3:2 - Maya Arbel-Raviv, Trevor Brown:
Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors. 4:1-4:16 - Chen Avin
, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Designs of Bounded Degree. 5:1-5:16 - Alkida Balliu, Pierre Fraigniaud:
Certification of Compact Low-Stretch Routing Schemes. 6:1-6:16 - Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. 7:1-7:16 - Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, Franck Petit:
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm. 8:1-8:16 - Trevor Brown, Srivatsan Ravi:
Cost of Concurrency in Hybrid Transactional Memory. 9:1-9:16 - Keren Censor-Hillel, Seri Khoury, Ami Paz:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. 10:1-10:16 - Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. 11:1-11:16 - David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects. 12:1-12:14 - Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast Plurality Consensus in Regular Expanders. 13:1-13:16 - Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Meeting in a Polygon by Anonymous Oblivious Robots. 14:1-14:15 - Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
Three Notes on Distributed Property Testing. 15:1-15:30 - Laurent Feuilloley, Pierre Fraigniaud:
Error-Sensitive Proof-Labeling Schemes. 16:1-16:15 - Manuela Fischer:
Improved Deterministic Distributed Matching via Rounding. 17:1-17:15 - Manuela Fischer, Mohsen Ghaffari:
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. 18:1-18:16 - Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. 19:1-19:15 - Mohsen Ghaffari, Christiana Lymouri:
Simple and Near-Optimal Distributed Coloring for Sparse Graphs. 20:1-20:14 - Mohsen Ghaffari, Merav Parter:
Near-Optimal Distributed DFS in Planar Graphs. 21:1-21:16 - Abdolhamid Ghodselahi, Fabian Kuhn:
Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks. 22:1-22:16 - Alexey Gotsman, Sebastian Burckhardt:
Consistency Models with Global Operation Sequencing and their Composition. 23:1-23:16 - Ofer Grossman, Merav Parter:
Improved Deterministic Distributed Construction of Spanners. 24:1-24:16 - Magnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, Calvin Newport:
An Efficient Communication Abstraction for Dense Wireless Networks. 25:1-25:16 - Itay Hazan, Eyal Kushilevitz:
Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity. 26:1-26:15 - Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Which Broadcast Abstraction Captures k-Set Agreement?. 27:1-27:16 - Shady Issa, Pascal Felber, Alexander Matveev, Paolo Romano:
Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend/Resume. 28:1-28:16 - Irvan Jahja, Haifeng Yu, Yuda Zhao:
Some Lower Bounds in Dynamic Networks with Oblivious Adversaries. 29:1-29:16 - Prasad Jayanti, Anup Joshi:
Recoverable FCFS Mutual Exclusion with Wait-Free Recovery. 30:1-30:15 - Gillat Kol, Rotem Oshman, Dafna Sadeh:
Interactive Compression for Multi-Party Protocol. 31:1-31:15 - Christoph Lenzen, Joel Rybicki:
Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. 32:1-32:15 - Nancy A. Lynch, Cameron Musco, Merav Parter:
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. 33:1-33:16 - Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
How Large Is Your Graph?. 34:1-34:16 - Hammurabi Mendes, Maurice Herlihy:
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. 35:1-35:16 - Ellis Michael, Dan R. K. Ports, Naveen Kr. Sharma, Adriana Szekeres:
Recovering Shared Objects Without Stable Storage. 36:1-36:16 - Faisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B. Morrey III, Dhruva R. Chakrabarti, Michael L. Scott:
Dalí: A Periodically Persistent Hash Map. 37:1-37:16 - Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. 38:1-38:16 - Rafael Pass, Elaine Shi:
Hybrid Consensus: Efficient Consensus in the Permissionless Model. 39:1-39:16 - Alexander Spiegelman, Idit Keidar, Dahlia Malkhi:
Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution. 40:1-40:15 - Ittai Abraham, Srinivas Devadas, Kartik Nayak, Ling Ren:
Brief Announcement: Practical Synchronous Byzantine Consensus. 41:1-41:4 - Yehuda Afek, Yuval Emek, Noa Kolikant:
Brief Announcement: The Synergy of Finite State Machines. 42:1-42:3 - Lélia Blin, Sébastien Tixeuil:
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs. 43:1-43:3 - Karl Bringmann, Sebastian Krinninger:
Brief Announcement: A Note on Hardness of Diameter Approximation. 44:1-44:3 - Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera:
Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures. 45:1-45:3 - Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. 46:1-46:4 - Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. 47:1-47:4 - Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Brief Announcement: Shape Formation by Programmable Particles. 48:1-48:3 - Ryota Eguchi, Taisuke Izumi:
Brief Announcement: Fast Aggregation in Population Protocols. 49:1-49:3 - Michal Friedman, Maurice Herlihy, Virendra J. Marathe, Erez Petrank:
Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory. 50:1-50:4 - Matthias Függer, Thomas Nowak, Manfred Schwarz:
Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks. 51:1-51:3 - Vijay K. Garg:
Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem. 52:1-52:3 - Rati Gelashvili, Idit Keidar, Alexander Spiegelman, Roger Wattenhofer:
Brief Announcement: Towards Reduced Instruction Sets for Synchronization. 53:1-53:4 - Tomasz Jurdzinski, Krzysztof Nowicki:
Brief Announcement: On Connectivity in the Broadcast Congested Clique. 54:1-54:4 - Janne H. Korhonen, Jukka Suomela:
Brief Announcement: Towards a Complexity Theory for the Congested Clique. 55:1-55:3 - Petr Kuznetsov, Thibault Rieutord, Yuan He:
Brief Announcement: Compact Topology of Shared-Memory Adversaries. 56:1-56:4 - Christoph Lenzen, Reut Levi:
Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem. 57:1-57:3 - Bruna Soares Peres, Olga Goussevskaia, Stefan Schmid, Chen Avin:
Brief Announcement: Distributed SplayNets. 58:1-58:3 - Laurent Massoulié, Rémi Varloot:
Brief Announcement: Rapid Mixing of Local Dynamics on Graphs. 59:1-59:3
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-11-08 20:18 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:
