Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th PODC 2016: Chicago, IL, USA
- George Giakkoupis:
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016. ACM 2016, ISBN 978-1-4503-3964-3
Keynote Lecture 1
- Andrew A. Chien:
New Opportunities for PODC?: Massive, Volatile, but Highly Predictable Resources. 1
Session 1
- Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. 3-8 - Arnold Filtser, Shay Solomon:
The Greedy Spanner is Existentially Optimal. 9-17 - Mohsen Ghaffari, Merav Parter:
MST in Log-Star Rounds of Congested Clique. 19-28 - Mohsen Ghaffari, Bernhard Haeupler
:
Distributed Algorithms for Planar Networks I: Planar Embedding. 29-38 - Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen:
Brief Announcement: Labeling Schemes for Power-Law Graphs. 39-41 - Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. 43-45 - Artur Czumaj, Peter Davies:
Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. 47-49 - Soroush Alamdari:
Brief Announcement: The Small World of Curious Beings. 51-53
Session 2
- Andrea Cerone, Alexey Gotsman:
Analysing Snapshot Isolation. 55-64 - Wojciech M. Golab, Aditya Ramaraju:
Recoverable Mutual Exclusion: [Extended Abstract]. 65-74 - Siddhartha V. Jayanti, Robert E. Tarjan:
A Randomized Concurrent Algorithm for Disjoint Set Union. 75-82 - Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Christopher Wastell:
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]. 83-92 - Marijke H. L. Bodlaender, Magnús M. Halldórsson, Christian Konrad, Fabian Kuhn:
Brief Announcement: Local Independent Set Approximation. 93-95
Session 3
- Yehuda Afek, Faith Ellen, Eli Gafni:
Deterministic Objects: Life Beyond Consensus. 97-106 - Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses:
Unbeatable Set Consensus via Topological and Combinatorial Reasoning. 107-116 - Mohsen Ghaffari, Merav Parter:
A Polylogarithmic Gossip Algorithm for Plurality Consensus. 117-126 - Pierre Fraigniaud, Emanuele Natale:
Noisy Rumor Spreading and Plurality Consensus. 127-136 - Joseph Y. Halpern, Xavier Vilaça:
Rational Consensus: Extended Abstract. 137-146 - Leqi Zhu:
Brief Announcement: A Tight Space Bound for Consensus. 147-149
Keynote Lecture 2
- Faith Ellen, Trevor Brown:
Concurrent Data Structures. 151-153
Session 4
- Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Contention Resolution on a Fading Channel. 155-164 - Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. 165-173 - Jeremy T. Fineman, Calvin Newport, Tonghe Wang:
Contention Resolution on Multiple Channels with Collision Detection. 175-184 - George Giakkoupis, Yasamin Nazari, Philipp Woelfel:
How Asynchrony Affects Rumor Spreading Time. 185-194 - Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. 195-197 - Magnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu:
Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks. 199-201 - Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas:
Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries. 203-205 - Lucas Boczkowski, Amos Korman, Emanuele Natale:
Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages. 207-209
Session 5
- Michael Elkin, Ofer Neiman:
Distributed Strong Diameter Network Decomposition: Extended Abstract. 211-216 - Keren Censor-Hillel, Elad Haramaty, Zohar S. Karnin:
Optimal Dynamic Distributed MIS. 217-226 - Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
A Local Constant Factor MDS Approximation for Bounded Genus Graphs. 227-233 - Michael Elkin, Ofer Neiman:
On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract. 235-244 - Pedro Montealegre, Ioan Todinca:
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. 245-247
Session 6
- Alexander Spiegelman, Yuval Cassuto, Gregory V. Chockler, Idit Keidar:
Space Bounds for Reliable Storage: Fundamental Limits of Coding. 249-258 - Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and Complexity of Collaborative Text Editing. 259-268 - Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil:
Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract. 269-278 - Sarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa:
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. 279-288 - Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. 289-298 - Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Brief Announcement: Asynchronous Coordination with Constraints and Preferences. 299-301
Keynote Lecture 3
- Phillip B. Gibbons:
How Emerging Memory Technologies Will Have You Rethinking Algorithm Design. 303
Session 7
- Viveck R. Cadambe, Zhiying Wang, Nancy A. Lynch:
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation. 305-313 - Danny Hendler:
On the Complexity of Reader-Writer Locks: Extended Abstract. 315-324 - Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg:
An Algorithm for Replicated Objects with Efficient Reads. 325-334 - Oksana Denysyuk, Philipp Woelfel:
Are Shared Objects Composable under an Oblivious Adversary? 335-344 - Giuliano Losa, Sebastiano Peluso, Binoy Ravindran:
Brief Announcement: A Family of Leaderless Generalized-Consensus Algorithms. 345-347 - Gadi Taubenfeld:
Brief Announcement: Computing in the Presence of Weak Crash Failures. 349-351 - Theophanis Hadjistasi, Nicolas C. Nicolaou, Alexander A. Schwarzmann:
Brief Announcement: Oh-RAM! One and a Half Round Read/Write Atomic Memory. 353-355 - Mor Baruch, Rafail Ostrovsky, Will Rosenbaum:
Brief Announcement: Space-Time Tradeoffs for Distributed Verification. 357-359
Session 8
- Bernhard Haeupler, David Wajc:
A Faster Distributed Radio Broadcast Primitive: Extended Abstract. 361-370 - Chaya Ganesh, Arpita Patra:
Broadcast Extensions with Optimal Communication and Round Complexity. 371-380 - Achour Mostéfaoui, Michel Raynal:
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems. 381-389 - Andreas Björklund, Petteri Kaski:
How Proofs are Prepared at Camelot: Extended Abstract. 391-400 - Shlomi Dolev, Karim Eldefrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority. 401-403
Session 9
- Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny:
Search on a Line with Faulty Robots. 405-414 - Masahiro Shibata, Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Uniform Deployment of Mobile Agents in Asynchronous Rings. 415-424 - Lili Su, Nitin H. Vaidya:
Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms. 425-434 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Brief Announcement: Active Information Spread in Networks. 435-437 - Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Brief Announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots. 439-441 - Quentin Bramas, Sébastien Tixeuil:
Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation. 443-445 - Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita:
Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space. 447-449
Session 10
- Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion Shortcuts without Embedding. 451-460 - Colin Cooper, Tomasz Radzik, Nicolas Rivera:
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process. 461-467 - Cameron Musco, Hsin-Hao Su, Nancy A. Lynch:
Ant-Inspired Density Estimation via Random Walks: Extended Abstract. 469-478 - Sai Praneeth Reddy, Shailesh Vaya:
Brief Announcement: Multi-Broadcasting under the SINR Model. 479-481 - Sriram V. Pemmaraju, Talal Riaz:
Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm. 483-485 - Dmitry Basin, Edward Bortnikov, Anastasia Braginsky, Guy Golan-Gueta, Eshcar Hillel, Idit Keidar, Moshe Sulamy:
Brief Announcement: A Key-Value Map for Massive Real-Time Analytics. 487-489
a service of 
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-06-27 21:46 CEST 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:
