{"id":212,"date":"2017-07-20T16:11:14","date_gmt":"2017-07-20T20:11:14","guid":{"rendered":"http:\/\/www.podc.org\/podc2017\/?page_id=212"},"modified":"2021-10-29T10:39:45","modified_gmt":"2021-10-29T14:39:45","slug":"proceedings","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2017\/proceedings\/","title":{"rendered":"PODC 2017 Proceedings"},"content":{"rendered":"<div class=\"podc2017proceedings\">\n<div id=\"DLtoc\">\n<div id=\"DLheader\">\n<p><a class=\"DLcitLink\" title=\"Go to the ACM Digital Library for additional information about this proceeding\" href=\"\/\/dl.acm.org\/citation.cfm?id=3087801\"><img loading=\"lazy\" decoding=\"async\" class=\"DLlogo\" src=\"\/\/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>SESSION: Keynote 1<\/h2>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32538\">Some Sequential Algorithms are Almost Always Parallel<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Guy E. Blelloch<\/li>\n<\/ul>\n<h2>SESSION: Session 1<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Jennifer Welch<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32539\">Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in 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><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32530\">The Space Requirement of Local Forwarding on Acyclic Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Boaz Patt-Shamir<\/li>\n<li class=\"nameList Last\">Will Rosenbaum<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32531\">Communication Primitives in Cognitive Radio Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Seth Gilbert<\/li>\n<li class=\"nameList\">Fabian Kuhn<\/li>\n<li class=\"nameList Last\">Chaodong Zheng<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32532\">Broadcasting in Noisy Radio Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Keren Censor-Hillel<\/li>\n<li class=\"nameList\">Bernhard Haeupler<\/li>\n<li class=\"nameList\">D. Ellis Hershkowitz<\/li>\n<li class=\"nameList Last\">Goran Zuzic<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32533\">Gossip in a Smartphone Peer-to-Peer Network<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<h2>SESSION: Session 2<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Faith Ellen<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32534\">Analyzing Contention and Backoff in Asynchronous Shared Memory<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Naama Ben-David<\/li>\n<li class=\"nameList Last\">Guy E. Blelloch<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32545\">A Layered Architecture for Erasure-Coded Consistent Distributed Storage<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Kishori M. Konwar<\/li>\n<li class=\"nameList\">N. Prakash<\/li>\n<li class=\"nameList\">Nancy Lynch<\/li>\n<li class=\"nameList Last\">Muriel M\u00e9dard<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32546\">Seeing is Believing: A Client-Centric Specification of Database Isolation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Natacha Crooks<\/li>\n<li class=\"nameList\">Youer Pu<\/li>\n<li class=\"nameList\">Lorenzo Alvisi<\/li>\n<li class=\"nameList Last\">Allen Clement<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32547\">Space Complexity of Fault-Tolerant Register Emulations<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Gregory Chockler<\/li>\n<li class=\"nameList Last\">Alexander Spiegelman<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32548\">Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Eric Ruppert<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32549\">Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Pankaj Khanchandani<\/li>\n<li class=\"nameList Last\">Roger Wattenhofer<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32540\">Brief Announcement: Fence Insertion for Straight-line Programs is in P<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Mohsen Lesani<\/li>\n<\/ul>\n<h2>SESSION: Session 3<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Kishori Konwar<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32541\">LCL Problems on Grids<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Sebastian Brandt<\/li>\n<li class=\"nameList\">Juho Hirvonen<\/li>\n<li class=\"nameList\">Janne H. Korhonen<\/li>\n<li class=\"nameList\">Tuomo Lempi\u00e4inen<\/li>\n<li class=\"nameList\">Patric R.J. \u00d6sterg\u00e5rd<\/li>\n<li class=\"nameList\">Christopher Purcell<\/li>\n<li class=\"nameList\">Joel Rybicki<\/li>\n<li class=\"nameList\">Jukka Suomela<\/li>\n<li class=\"nameList Last\">Przemys\u0142aw Uzna\u0144ski<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32542\">On the Multiparty Communication Complexity of Testing Triangle-Freeness<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Orr Fischer<\/li>\n<li class=\"nameList\">Shay Gershtein<\/li>\n<li class=\"nameList Last\">Rotem Oshman<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32543\">What Can be Sampled Locally?<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Weiming Feng<\/li>\n<li class=\"nameList\">Yuxin Sun<\/li>\n<li class=\"nameList Last\">Yitong Yin<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32544\">Distributed MST and Routing in Almost Mixing Time<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Ghaffari<\/li>\n<li class=\"nameList\">Fabian Kuhn<\/li>\n<li class=\"nameList Last\">Hsin-Hao Su<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32655\">Distributed MIS via All-to-All Communication<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Mohsen Ghaffari<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32656\">Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Hugues Mercier<\/li>\n<li class=\"nameList\">Laurent Hayez<\/li>\n<li class=\"nameList Last\">Miguel Matos<\/li>\n<\/ul>\n<h2>SESSION: Keynote 2<\/h2>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32657\">Blockchains and the Future of Distributed Computing<\/a>\u00a0(<a href=\"\/data\/podc2017\/talks\/herlihy-keynote.pptx\">slides<\/a>)<\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Maurice Herlihy<\/li>\n<\/ul>\n<h2>SESSION: Session 4<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32658\">A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Michael Elkin<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32659\">Distributed Approximation of Maximum Independent Set and Maximum Matching<\/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\">Mohsen Ghaffari<\/li>\n<li class=\"nameList Last\">Gregory Schwartzman<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32650\">Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Leonid Barenboim<\/li>\n<li class=\"nameList\">Michael Elkin<\/li>\n<li class=\"nameList Last\">Tzalik Maimon<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32651\">Optimal Distance Labeling Schemes for Trees<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Ofer Freedman<\/li>\n<li class=\"nameList\">Pawe\u0142 Gawrychowski<\/li>\n<li class=\"nameList\">Patrick K. Nicholson<\/li>\n<li class=\"nameList Last\">Oren Weimann<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32652\">Brief Announcement: How Large is your Graph?<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Varun Kanade<\/li>\n<li class=\"nameList\">Frederik Mallmann-Trenn<\/li>\n<li class=\"nameList Last\">Victor Verdugo<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32653\">Brief Announcement: Distributed Approximation for Tree Augmentation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Keren Censor-Hillel<\/li>\n<li class=\"nameList Last\">Michal Dory<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32654\">Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Magn\u00fas M. Halld\u00f3rsson<\/li>\n<li class=\"nameList\">Stephan Holzer<\/li>\n<li class=\"nameList Last\">Evangelia Anna Markatou<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32665\">Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Shreyas Pai<\/li>\n<li class=\"nameList\">Gopal Pandurangan<\/li>\n<li class=\"nameList\">Sriram V. Pemmaraju<\/li>\n<li class=\"nameList\">Talal Riaz<\/li>\n<li class=\"nameList Last\">Peter Robinson<\/li>\n<\/ul>\n<h2>SESSION: Session 5<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Nancy Lynch<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32666\">Recoverable Mutual Exclusion in Sub-logarithmic Time<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Wojciech Golab<\/li>\n<li class=\"nameList Last\">Danny Hendler<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32667\">Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">George Giakkoupis<\/li>\n<li class=\"nameList Last\">Philipp Woelfel<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32668\">Transactional Lock Elision Meets Combining<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Alex Kogan<\/li>\n<li class=\"nameList Last\">Yossi Lev<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32669\">On Using Time Without Clocks via Zigzag Causality<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Asa Dan<\/li>\n<li class=\"nameList\">Rajit Manohar<\/li>\n<li class=\"nameList Last\">Yoram Moses<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32660\">Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Thomas Dickerson<\/li>\n<li class=\"nameList\">Paul Gazzillo<\/li>\n<li class=\"nameList\">Maurice Herlihy<\/li>\n<li class=\"nameList Last\">Eric Koskinen<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32661\">Brief Announcement: Gossiping with Latencies<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Seth Gilbert<\/li>\n<li class=\"nameList\">Peter Robinson<\/li>\n<li class=\"nameList Last\">Suman Sourav<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32662\">Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Shankha Chatterjee<\/li>\n<li class=\"nameList Last\">Wojciech Golab<\/li>\n<\/ul>\n<h2>SESSION: Session 6<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Gadi Taubenfeld<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32663\">Effectiveness of Delaying Timestamp Computation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Sandeep S. Kulkarni<\/li>\n<li class=\"nameList Last\">Nitin H. Vaidya<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32664\">Symmetry Breaking with Noisy Processes<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Seth Gilbert<\/li>\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32675\">The Power of Choice in Priority Scheduling<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Dan Alistarh<\/li>\n<li class=\"nameList\">Justin Kopinsky<\/li>\n<li class=\"nameList\">Jerry Li<\/li>\n<li class=\"nameList Last\">Giorgi Nadiradze<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32676\">A Template for Implementing Fast Lock-free Trees Using HTM<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Trevor Brown<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32677\">Adding Concurrency to Smart Contracts<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Thomas Dickerson<\/li>\n<li class=\"nameList\">Paul Gazzillo<\/li>\n<li class=\"nameList\">Maurice Herlihy<\/li>\n<li class=\"nameList Last\">Eric Koskinen<\/li>\n<\/ul>\n<h2>SESSION: Keynote 3<\/h2>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32678\">Verifiable Outsourced Computation: A Survey<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Rosario Gennaro<\/li>\n<\/ul>\n<h2>SESSION: Session 7<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Lorenzo Alvisi<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32679\">FruitChains: A Fair Blockchain<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Rafael Pass<\/li>\n<li class=\"nameList Last\">Elaine Shi<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32670\">Coordination Without Prior Agreement<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Gadi Taubenfeld<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32671\">Ignore or Comply?: On Breaking Symmetry in Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Petra Berenbrink<\/li>\n<li class=\"nameList\">Andrea Clementi<\/li>\n<li class=\"nameList\">Robert Els\u00e4sser<\/li>\n<li class=\"nameList\">Peter Kling<\/li>\n<li class=\"nameList\">Frederik Mallmann-Trenn<\/li>\n<li class=\"nameList Last\">Emanuele Natale<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32672\">Life Beyond Set Agreement<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">David Yu Cheng Chan<\/li>\n<li class=\"nameList\">Vassos Hadzilacos<\/li>\n<li class=\"nameList Last\">Sam Toueg<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32673\">Brief Announcement: Hierarchical Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Benjamin Bengfort<\/li>\n<li class=\"nameList Last\">Pete Keleher<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32674\">Brief Announcement: Statement Voting and Liquid Democracy<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Bingsheng Zhang<\/li>\n<li class=\"nameList Last\">Hong-sheng Zhou<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32685\">Brief Announcement: Rapid Asynchronous Plurality Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Robert Els\u00e4sser<\/li>\n<li class=\"nameList\">Tom Friedetzky<\/li>\n<li class=\"nameList\">Dominik Kaaser<\/li>\n<li class=\"nameList\">Frederik Mallmann-Trenn<\/li>\n<li class=\"nameList Last\">Horst Trinker<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32686\">Brief Announcement: Object Oriented Consensus<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yehuda Afek<\/li>\n<li class=\"nameList\">James Aspnes<\/li>\n<li class=\"nameList\">Edo Cohen<\/li>\n<li class=\"nameList Last\">Danny Vainstein<\/li>\n<\/ul>\n<h2>SESSION: Session 8<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Irina Calciu<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32687\">Greedy Routing and the Algorithmic Small-World Phenomenon<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Karl Bringmann<\/li>\n<li class=\"nameList\">Ralph Keusch<\/li>\n<li class=\"nameList\">Johannes Lengler<\/li>\n<li class=\"nameList\">Yannic Maus<\/li>\n<li class=\"nameList Last\">Anisur Rahaman Molla<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32688\">Triangle Finding and Listing in CONGEST Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Taisuke Izumi<\/li>\n<li class=\"nameList Last\">Fran\u00e7ois Le Gall<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32689\">Asynchronous Shared Channel<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Gianluca De Marco<\/li>\n<li class=\"nameList Last\">Grzegorz Stachowiak<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32680\">Self-organized Segregation on the Grid<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Hamed Omidvar<\/li>\n<li class=\"nameList Last\">Massimo Franceschetti<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32681\">Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michiko Inoue<\/li>\n<li class=\"nameList\">Fukuhito Ooshita<\/li>\n<li class=\"nameList Last\">S\u00e9bastien Tixeuil<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32682\">Brief Announcement: Secure Self-Stabilizing Computation<\/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\">Juan Garay<\/li>\n<li class=\"nameList\">Muni Venkateswarlu Kumaramangalam<\/li>\n<li class=\"nameList\">Rafail Ostrovsky<\/li>\n<li class=\"nameList Last\">Moti Yung<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32683\">Stateless Computation<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Danny Dolev<\/li>\n<li class=\"nameList\">Michael Erdmann<\/li>\n<li class=\"nameList\">Neil Lutz<\/li>\n<li class=\"nameList\">Michael Schapira<\/li>\n<li class=\"nameList Last\">Adva Zair<\/li>\n<\/ul>\n<h2>SESSION: Session 9<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Alexander Schwarzmann<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32684\">Towards Efficient Verification of Population Protocols<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michael Blondin<\/li>\n<li class=\"nameList\">Javier Esparza<\/li>\n<li class=\"nameList\">Stefan Jaax<\/li>\n<li class=\"nameList Last\">Philipp J. Meyer<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32695\">Clocked Population Protocols<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">James Aspnes<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32696\">A Distributed Learning Dynamics in Social Groups<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">L. Elisa Celis<\/li>\n<li class=\"nameList\">Peter M. Krafft<\/li>\n<li class=\"nameList Last\">Nisheeth K. Vishnoi<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32697\">Brief Announcement: Population Protocols for Leader Election and Exact Majority with <i>O<\/i>(log<sup>2<\/sup> <i>n<\/i>) States and <i>O<\/i>(log<sup>2<\/sup><i> n<\/i>) Convergence Time<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Andreas Bilke<\/li>\n<li class=\"nameList\">Colin Cooper<\/li>\n<li class=\"nameList\">Robert Els\u00e4sser<\/li>\n<li class=\"nameList Last\">Tomasz Radzik<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32698\">Brief Announcement: Byzantine-Tolerant Machine Learning<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Peva Blanchard<\/li>\n<li class=\"nameList\">El Mahdi El Mhamdi<\/li>\n<li class=\"nameList\">Rachid Guerraoui<\/li>\n<li class=\"nameList Last\">Julien Stainer<\/li>\n<\/ul>\n<p><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"\/\/dl.acm.org\/authorize?N32699\">Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret<\/a><\/p>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Alexander Bagnall<\/li>\n<li class=\"nameList\">Samuel Merten<\/li>\n<li class=\"nameList Last\">Gordon Stewart<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Full Citation in the ACM Digital Library SESSION: Keynote 1 Some Sequential Algorithms are Almost Always Parallel Guy E. Blelloch SESSION: Session 1 Jennifer Welch Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks Artur Czumaj Peter Davies The Space Requirement of Local Forwarding on Acyclic Networks Boaz Patt-Shamir Will Rosenbaum Communication Primitives &hellip; <a href=\"https:\/\/www.podc.org\/podc2017\/proceedings\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;PODC 2017 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-212","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages\/212","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/comments?post=212"}],"version-history":[{"count":5,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages\/212\/revisions"}],"predecessor-version":[{"id":225,"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/pages\/212\/revisions\/225"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2017\/wp-json\/wp\/v2\/media?parent=212"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}