{"id":354,"date":"2016-07-23T09:49:03","date_gmt":"2016-07-23T13:49:03","guid":{"rendered":"http:\/\/www.podc.org\/podc2016\/?page_id=354"},"modified":"2021-10-29T10:38:32","modified_gmt":"2021-10-29T14:38:32","slug":"proceedings","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2016\/proceedings\/","title":{"rendered":"PODC 2016 Proceedings"},"content":{"rendered":"<div id=\"DLtoc\">\n<div id=\"DLheader\">\n<a class=\"DLcitLink\" title=\"Go to the ACM Digital Library for additional information about this proceeding\" href=\"http:\/\/dl.acm.org\/citation.cfm?id=2933057\"><img loading=\"lazy\" decoding=\"async\" class=\"DLlogo\" src=\"http:\/\/dl.acm.org\/img\/dllogo.png\" alt=\"Digital Library logo\" width=\"30\" height=\"30\" \/>Full Citation in the ACM Digital Library<\/a><\/p>\n<\/div>\n<div id=\"DLcontent\">\n<h2 style=\"text-align:left\">SESSION: Keynote Lecture 1<\/h2>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18953\">New Opportunities for PODC?: Massive, Volatile, but Highly Predictable Resources<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Andrew A. Chien<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 1<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18954\">A Distributed (2+\u03b5)-Approximation for Vertex Cover in O(log\u03b4\/\u03b5 log log \u03b4) Rounds<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Reuven Bar-Yehuda<\/li>\n<li class=\"nameList\">Keren Censor-Hillel<\/li>\n<li class=\"nameList Last\">Gregory Schwartzman<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18965\">The Greedy Spanner is Existentially Optimal<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Arnold Filtser<\/li>\n<li class=\"nameList Last\">Shay Solomon<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18966\">MST in Log-Star Rounds of Congested Clique<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Ghaffari<\/li>\n<li class=\"nameList Last\">Merav Parter<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18967\">Distributed Algorithms for Planar Networks I: Planar Embedding<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Ghaffari<\/li>\n<li class=\"nameList Last\">Bernhard Haeupler<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18968\">Brief Announcement: Labeling Schemes for Power-Law Graphs<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Casper Petersen<\/li>\n<li class=\"nameList\">Noy Rotbart<\/li>\n<li class=\"nameList\">Jakob Grue Simonsen<\/li>\n<li class=\"nameList Last\">Christian Wulff-Nilsen<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18969\">Brief Announcement: Sublinear-Space Distance Labeling Using Hubs<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Pawel Gawrychowski<\/li>\n<li class=\"nameList\">Adrian Kosowski<\/li>\n<li class=\"nameList Last\">Przemyslaw Uznanski<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18960\">Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Artur Czumaj<\/li>\n<li class=\"nameList Last\">Peter Davies<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18961\">Brief Announcement: The Small World of Curious Beings<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Soroush Alamdari<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 2<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Oksana Denysyuk<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18962\">Analysing Snapshot Isolation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Andrea Cerone<\/li>\n<li class=\"nameList Last\">Alexey Gotsman<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18963\">Recoverable Mutual Exclusion: [Extended Abstract]<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Wojciech Golab<\/li>\n<li class=\"nameList Last\">Aditya Ramaraju<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18964\">A Randomized Concurrent Algorithm for Disjoint Set Union<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Siddhartha V. Jayanti<\/li>\n<li class=\"nameList Last\">Robert E. Tarjan<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18975\">Self-stabilizing Balls &amp; Bins in Batches: The Power of Leaky Bins [Extended Abstract]<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Petra Berenbrink<\/li>\n<li class=\"nameList\">Tom Friedetzky<\/li>\n<li class=\"nameList\">Peter Kling<\/li>\n<li class=\"nameList\">Frederik Mallmann-Trenn<\/li>\n<li class=\"nameList\">Lars Nagel<\/li>\n<li class=\"nameList Last\">Christopher Wastell<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18976\">Brief Announcement: Local Independent Set Approximation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Marijke H.L. Bodlaender<\/li>\n<li class=\"nameList\">Magn\u00fas M. Halld\u00f3rsson<\/li>\n<li class=\"nameList\">Christian Konrad<\/li>\n<li class=\"nameList Last\">Fabian Kuhn<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 3<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Wojciech Golab<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18977\">Deterministic Objects: Life Beyond Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yehuda Afek<\/li>\n<li class=\"nameList\">Faith Ellen<\/li>\n<li class=\"nameList Last\">Eli Gafni<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18978\">Unbeatable Set Consensus via Topological and Combinatorial Reasoning<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Armando Casta\u00f1eda<\/li>\n<li class=\"nameList\">Yannai A. Gonczarowski<\/li>\n<li class=\"nameList Last\">Yoram Moses<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18979\">A Polylogarithmic Gossip Algorithm for Plurality Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Ghaffari<\/li>\n<li class=\"nameList Last\">Merav Parter<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18970\">Noisy Rumor Spreading and Plurality Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Pierre Fraigniaud<\/li>\n<li class=\"nameList Last\">Emanuele Natale<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18971\">Rational Consensus: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Joseph Y. Halpern<\/li>\n<li class=\"nameList Last\">Xavier Vila\u00e7a<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18972\">Brief Announcement: A Tight Space Bound for Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Leqi Zhu<\/li>\n<\/ul>\n<h2 style=\"text-align:left\">SESSION: Keynote Lecture 2<\/h2>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18973\">Concurrent Data Structures<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Faith Ellen<\/li>\n<li class=\"nameList Last\">Trevor Brown<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 4<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Andrea Richa<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18974\">Contention Resolution on a Fading Channel<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Jeremy T. Fineman<\/li>\n<li class=\"nameList\">Seth Gilbert<\/li>\n<li class=\"nameList\">Fabian Kuhn<\/li>\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18985\">Reliable Communication over Highly Connected Noisy Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Noga Alon<\/li>\n<li class=\"nameList\">Mark Braverman<\/li>\n<li class=\"nameList\">Klim Efremenko<\/li>\n<li class=\"nameList\">Ran Gelles<\/li>\n<li class=\"nameList Last\">Bernhard Haeupler<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18986\">Contention Resolution on Multiple Channels with Collision Detection<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Jeremy T. Fineman<\/li>\n<li class=\"nameList\">Calvin Newport<\/li>\n<li class=\"nameList Last\">Tonghe Wang<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18987\">How Asynchrony Affects Rumor Spreading Time<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">George Giakkoupis<\/li>\n<li class=\"nameList\">Yasamin Nazari<\/li>\n<li class=\"nameList Last\">Philipp Woelfel<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18988\">Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yi-Jun Chang<\/li>\n<li class=\"nameList\">Tsvi Kopelowitz<\/li>\n<li class=\"nameList Last\">Seth Pettie<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18989\">Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Magnus M. Halld\u00f3rsson<\/li>\n<li class=\"nameList\">Tigran Tonoyan<\/li>\n<li class=\"nameList\">Yuexuan Wang<\/li>\n<li class=\"nameList Last\">Dongxiao Yu<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18980\">Brief Announcement: Reliable Message Transmission under Partial Knowledge and General Adversaries<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Aris Pagourtzis<\/li>\n<li class=\"nameList\">Giorgos Panagiotakos<\/li>\n<li class=\"nameList Last\">Dimitris Sakavalas<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18981\">Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Lucas Boczkowski<\/li>\n<li class=\"nameList\">Amos Korman<\/li>\n<li class=\"nameList Last\">Emanuele Natale<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 5<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Merav Parter<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18982\">Distributed Strong Diameter Network Decomposition: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michael Elkin<\/li>\n<li class=\"nameList Last\">Ofer Neiman<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18983\">Optimal Dynamic Distributed MIS<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Keren Censor-Hillel<\/li>\n<li class=\"nameList\">Elad Haramaty<\/li>\n<li class=\"nameList Last\">Zohar Karnin<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18984\">A Local Constant Factor MDS Approximation for Bounded Genus Graphs<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Saeed Akhoondian Amiri<\/li>\n<li class=\"nameList\">Stefan Schmid<\/li>\n<li class=\"nameList Last\">Sebastian Siebertz<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18995\">On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michael Elkin<\/li>\n<li class=\"nameList Last\">Ofer Neiman<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18996\">Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Pedro Montealegre<\/li>\n<li class=\"nameList Last\">Ioan Todinca<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 6<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Gadi Taubenfeld<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18997\">Space Bounds for Reliable Storage: Fundamental Limits of Coding<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Alexander Spiegelman<\/li>\n<li class=\"nameList\">Yuval Cassuto<\/li>\n<li class=\"nameList\">Gregory Chockler<\/li>\n<li class=\"nameList Last\">Idit Keidar<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18998\">Specification and Complexity of Collaborative Text Editing<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Hagit Attiya<\/li>\n<li class=\"nameList\">Sebastian Burckhardt<\/li>\n<li class=\"nameList\">Alexey Gotsman<\/li>\n<li class=\"nameList\">Adam Morrison<\/li>\n<li class=\"nameList\">Hongseok Yang<\/li>\n<li class=\"nameList Last\">Marek Zawirski<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18999\">Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Silvia Bonomi<\/li>\n<li class=\"nameList\">Antonella Del Pozzo<\/li>\n<li class=\"nameList\">Maria Potop-Butucaru<\/li>\n<li class=\"nameList Last\">S\u00e9bastien Tixeuil<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18990\">A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Sarah Cannon<\/li>\n<li class=\"nameList\">Joshua J. Daymude<\/li>\n<li class=\"nameList\">Dana Randall<\/li>\n<li class=\"nameList Last\">Andr\u00e9a W. Richa<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18991\">A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Faith Ellen<\/li>\n<li class=\"nameList\">Rati Gelashvili<\/li>\n<li class=\"nameList\">Nir Shavit<\/li>\n<li class=\"nameList Last\">Leqi Zhu<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18992\">Brief Announcement: Asynchronous Coordination with Constraints and Preferences<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Armando Casta\u00f1eda<\/li>\n<li class=\"nameList\">Pierre Fraigniaud<\/li>\n<li class=\"nameList\">Eli Gafni<\/li>\n<li class=\"nameList\">Sergio instituto de Matem\u00e1ticas Rajsbaum<\/li>\n<li class=\"nameList Last\">Matthieu Roy<\/li>\n<\/ul>\n<h2 style=\"text-align:left\">SESSION: Keynote Lecture 3<\/h2>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18993\">How Emerging Memory Technologies Will Have You Rethinking Algorithm Design<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Phillip B. Gibbons<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 7<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Yehuda Afek<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18994\">Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Viveck R. Cadambe<\/li>\n<li class=\"nameList\">Zhiying Wang<\/li>\n<li class=\"nameList Last\">Nancy Lynch<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18905\">On the Complexity of Reader-Writer Locks: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Danny Hendler<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18906\">An Algorithm for Replicated Objects with Efficient Reads<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Tushar D. Chandra<\/li>\n<li class=\"nameList\">Vassos Hadzilacos<\/li>\n<li class=\"nameList Last\">Sam Toueg<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18907\">Are Shared Objects Composable under an Oblivious Adversary?<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Oksana Denysyuk<\/li>\n<li class=\"nameList Last\">Philipp Woelfel<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18908\">Brief Announcement: A Family of Leaderless Generalized-Consensus Algorithms<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Giuliano Losa<\/li>\n<li class=\"nameList\">Sebastiano Peluso<\/li>\n<li class=\"nameList Last\">Binoy Ravindran<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18909\">Brief Announcement: Computing in the Presence of Weak Crash Failures<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Gadi Taubenfeld<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18900\">Brief Announcement: Oh-RAM! One and a Half Round Read\/Write Atomic Memory<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Theophanis Hadjistasi<\/li>\n<li class=\"nameList\">Nicolas Nicolaou<\/li>\n<li class=\"nameList Last\">Alexander A. Schwarzmann<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18901\">Brief Announcement: Space-Time Tradeoffs for Distributed Verification<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mor Baruch<\/li>\n<li class=\"nameList\">Rafail Ostrovsky<\/li>\n<li class=\"nameList Last\">Will Rosenbaum<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 8<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Marcos K. Aguilera<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18902\">A Faster Distributed Radio Broadcast Primitive: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Bernhard Haeupler<\/li>\n<li class=\"nameList Last\">David Wajc<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18903\">Broadcast Extensions with Optimal Communication and Round Complexity<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Chaya Ganesh<\/li>\n<li class=\"nameList Last\">Arpita Patra<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18904\">Two-Bit Messages are Sufficient to Implement Atomic Read\/Write Registers in Crash-prone Systems<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Achour Mostefaoui<\/li>\n<li class=\"nameList Last\">Michel Raynal<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18915\">How Proofs are Prepared at Camelot: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Andreas Bj\u00f6rklund<\/li>\n<li class=\"nameList Last\">Petteri Kaski<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18916\">Brief Announcement: Proactive Secret Sharing with a Dishonest Majority<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Shlomi Dolev<\/li>\n<li class=\"nameList\">Karim ElDefrawy<\/li>\n<li class=\"nameList\">Joshua Lampkins<\/li>\n<li class=\"nameList\">Rafail Ostrovsky<\/li>\n<li class=\"nameList Last\">Moti Yung<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 9<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Adrian Kosowski<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18917\">Search on a Line with Faulty Robots<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Jurek Czyzowicz<\/li>\n<li class=\"nameList\">Evangelos Kranakis<\/li>\n<li class=\"nameList\">Danny Krizanc<\/li>\n<li class=\"nameList\">Lata Narayanan<\/li>\n<li class=\"nameList Last\">Jaroslav Opatrny<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18918\">Uniform Deployment of Mobile Agents in Asynchronous Rings<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Masahiro Shibata<\/li>\n<li class=\"nameList\">Toshiya Mega<\/li>\n<li class=\"nameList\">Fukuhito Ooshita<\/li>\n<li class=\"nameList\">Hirotsugu Kakugawa<\/li>\n<li class=\"nameList Last\">Toshimitsu Masuzawa<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18919\">Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed Algorithms<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Lili Su<\/li>\n<li class=\"nameList Last\">Nitin H. Vaidya<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18910\">Brief Announcement: Active Information Spread in Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Gennaro Cordasco<\/li>\n<li class=\"nameList\">Luisa Gargano<\/li>\n<li class=\"nameList\">Adele A. Rescigno<\/li>\n<li class=\"nameList Last\">Ugo Vaccaro<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18911\">Brief Announcement: Certified Universal Gathering in R<sup>2<\/sup> for Oblivious Mobile Robots<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Pierre Courtieu<\/li>\n<li class=\"nameList\">Lionel Rieg<\/li>\n<li class=\"nameList\">S\u00e9bastien Tixeuil<\/li>\n<li class=\"nameList Last\">Xavier Urbain<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18912\">Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Quentin Bramas<\/li>\n<li class=\"nameList Last\">S\u00e9bastien Tixeuil<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18913\">Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yukiko Yamauchi<\/li>\n<li class=\"nameList\">Taichi Uehara<\/li>\n<li class=\"nameList Last\">Masafumi Yamashita<\/li>\n<\/ul>\n<h2 style=\"text-align:left; margin-bottom:0em;\">SESSION: Session 10<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Philipp Woelfel<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18914\">Low-Congestion Shortcuts without Embedding<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Bernhard Haeupler<\/li>\n<li class=\"nameList\">Taisuke Izumi<\/li>\n<li class=\"nameList Last\">Goran Zuzic<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18925\">The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Colin Cooper<\/li>\n<li class=\"nameList\">Tomasz Radzik<\/li>\n<li class=\"nameList Last\">Nicolas Rivera<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18926\">Ant-Inspired Density Estimation via Random Walks: Extended Abstract<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Cameron Musco<\/li>\n<li class=\"nameList\">Hsin-Hao Su<\/li>\n<li class=\"nameList Last\">Nancy Lynch<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18927\">Brief Announcement: Multi-Broadcasting under the SINR Model<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Sai Praneeth Reddy<\/li>\n<li class=\"nameList Last\">Shailesh Vaya<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18928\">Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Sriram V. Pemmaraju<\/li>\n<li class=\"nameList Last\">Talal Riaz<\/li>\n<\/ul>\n<p style=\"margin-top:1em; margin-bottom:0em;\"><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N18929\">Brief Announcement: A Key-Value Map for Massive Real-Time Analytics<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Dmitry Basin<\/li>\n<li class=\"nameList\">Edward Bortnikov<\/li>\n<li class=\"nameList\">Anastasia Braginsky<\/li>\n<li class=\"nameList\">Guy Golan Gueta<\/li>\n<li class=\"nameList\">Eshcar Hillel<\/li>\n<li class=\"nameList\">Idit Keidar<\/li>\n<li class=\"nameList Last\">Moshe Sulamy<\/li>\n<\/ul>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Full Citation in the ACM Digital Library SESSION: Keynote Lecture 1 New Opportunities for PODC?: Massive, Volatile, but Highly Predictable Resources Andrew A. Chien SESSION: Session 1 Calvin Newport A Distributed (2+\u03b5)-Approximation for Vertex Cover in O(log\u03b4\/\u03b5 log log \u03b4) Rounds Reuven Bar-Yehuda Keren Censor-Hillel Gregory Schwartzman The Greedy Spanner is Existentially Optimal Arnold Filtser &hellip; <a href=\"https:\/\/www.podc.org\/podc2016\/proceedings\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;PODC 2016 Proceedings&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-354","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/pages\/354","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/comments?post=354"}],"version-history":[{"count":8,"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/pages\/354\/revisions"}],"predecessor-version":[{"id":362,"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/pages\/354\/revisions\/362"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2016\/wp-json\/wp\/v2\/media?parent=354"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}