{"id":1377,"date":"2015-07-21T11:17:16","date_gmt":"2015-07-21T16:17:16","guid":{"rendered":"http:\/\/www.podc.org\/podc2015\/?page_id=1377"},"modified":"2021-10-29T09:38:04","modified_gmt":"2021-10-29T14:38:04","slug":"proceedings","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2015\/proceedings\/","title":{"rendered":"PODC 2015 Proceedings"},"content":{"rendered":"<div>\n<div>\n<div>\n<p><a title=\"Go to the ACM Digital Library for additional information about this proceeding\" href=\"http:\/\/dl.acm.org\/citation.cfm?id=2767386\" target=\"_blank\" rel=\"noopener\"><img loading=\"lazy\" decoding=\"async\" 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>\n<h2>SESSION: Keynote Lecture<\/h2>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90651\" target=\"_blank\" rel=\"noopener\">Cortical Computation<\/a><\/p>\n<ul>\n<li>Christos H. Papadimitriou<\/li>\n<li>Santosh S. Vempala<\/li>\n<\/ul>\n<h2>SESSION: Session 1<\/h2>\n<ul>\n<li>Friedhelm Meyer auf der Heide<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90652\" target=\"_blank\" rel=\"noopener\">Near-Optimal Scheduling of Distributed Algorithms<\/a><\/p>\n<ul>\n<li>Mohsen Ghaffari<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90653\" target=\"_blank\" rel=\"noopener\">Scheduling Loop-free Network Updates: It&#8217;s Good to Relax!<\/a><\/p>\n<ul>\n<li>Arne Ludwig<\/li>\n<li>Jan Marcinkowski<\/li>\n<li>Stefan Schmid<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90654\" target=\"_blank\" rel=\"noopener\">New Routing Techniques and their Applications<\/a><\/p>\n<ul>\n<li>Liam Roditty<\/li>\n<li>Roei Tov<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90665\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Routing the Internet with Very Few Entries<\/a><\/p>\n<ul>\n<li>Cyril Gavoille<\/li>\n<li>Christian Glacet<\/li>\n<li>Nicolas Hanusse<\/li>\n<li>David Ilcinkas<\/li>\n<\/ul>\n<h2>SESSION: Session 2<\/h2>\n<ul>\n<li>Paul G. Spirakis<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90666\" target=\"_blank\" rel=\"noopener\">Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata<\/a><\/p>\n<ul>\n<li>Othon Michail<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90667\" target=\"_blank\" rel=\"noopener\">Fast and Exact Majority in Population Protocols<\/a><\/p>\n<ul>\n<li>Dan Alistarh<\/li>\n<li>Rati Gelashvili<\/li>\n<li>Milan Vojnovi\u0107<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90668\" target=\"_blank\" rel=\"noopener\">Distributed House-Hunting in Ant Colonies<\/a><\/p>\n<ul>\n<li>Mohsen Ghaffari<\/li>\n<li>Cameron Musco<\/li>\n<li>Tsvetomira Radeva<\/li>\n<li>Nancy Lynch<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90669\" target=\"_blank\" rel=\"noopener\">Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter<\/a><\/p>\n<ul>\n<li>Zahra Derakhshandeh<\/li>\n<li>Robert Gmyr<\/li>\n<li>Thim Strothmann<\/li>\n<li>Rida Bazzi<\/li>\n<li>Andrea Richa<\/li>\n<li>Christian Scheideler<\/li>\n<\/ul>\n<h2>SESSION: Session 3<\/h2>\n<ul>\n<li>Antonio Fern\u00e1ndez Anta<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90660\" target=\"_blank\" rel=\"noopener\">Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication<\/a><\/p>\n<ul>\n<li>Valerie King<\/li>\n<li>Shay Kutten<\/li>\n<li>Mikkel Thorup<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90661\" target=\"_blank\" rel=\"noopener\">Near-Optimal Distributed Maximum Flow: Extended Abstract<\/a><\/p>\n<ul>\n<li>Mohsen Ghaffari<\/li>\n<li>Andreas Karrenbauer<\/li>\n<li>Fabian Kuhn<\/li>\n<li>Christoph Lenzen<\/li>\n<li>Boaz Patt-Shamir<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90662\" target=\"_blank\" rel=\"noopener\">Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST<\/a><\/p>\n<ul>\n<li>James W. Hegeman<\/li>\n<li>Gopal Pandurangan<\/li>\n<li>Sriram V. Pemmaraju<\/li>\n<li>Vivek B. Sardeshmukh<\/li>\n<li>Michele Scquizzato<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90663\" target=\"_blank\" rel=\"noopener\">Fast Distributed Almost Stable Matchings<\/a><\/p>\n<ul>\n<li>Rafail Ostrovsky<\/li>\n<li>Will Rosenbaum<\/li>\n<\/ul>\n<h2>SESSION: Session 4<\/h2>\n<ul>\n<li>Christian Scheideler<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90664\" target=\"_blank\" rel=\"noopener\">A (Truly) Local Broadcast Layer for Unreliable Radio Networks<\/a><\/p>\n<ul>\n<li>Nancy Lynch<\/li>\n<li>Calvin Newport<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90675\" target=\"_blank\" rel=\"noopener\">Efficient Communication in Cognitive Radio Networks<\/a><\/p>\n<ul>\n<li>Seth Gilbert<\/li>\n<li>Fabian Kuhn<\/li>\n<li>Calvin Newport<\/li>\n<li>Chaodong Zheng<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90676\" target=\"_blank\" rel=\"noopener\">A Local Broadcast Layer for the SINR Network Model<\/a><\/p>\n<ul>\n<li>Magnus M. Halld\u00f3rsson<\/li>\n<li>Stephan Holzer<\/li>\n<li>Nancy Lynch<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90677\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Fast and Simple Node Coloring in the SINR Model<\/a><\/p>\n<ul>\n<li>Fabian Fuchs<\/li>\n<\/ul>\n<h2>SESSION: Session 5<\/h2>\n<ul>\n<li>Thomas Erlebach<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90678\" target=\"_blank\" rel=\"noopener\">Algebraic Methods in the Congested Clique<\/a><\/p>\n<ul>\n<li>Keren Censor-Hillel<\/li>\n<li>Petteri Kaski<\/li>\n<li>Janne H. Korhonen<\/li>\n<li>Christoph Lenzen<\/li>\n<li>Ami Paz<\/li>\n<li>Jukka Suomela<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90679\" target=\"_blank\" rel=\"noopener\">Fast Partial Distance Estimation and Applications<\/a><\/p>\n<ul>\n<li>Christoph Lenzen<\/li>\n<li>Boaz Patt-Shamir<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90670\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Distributed Single-Source Reachability<\/a><\/p>\n<ul>\n<li>Mohsen Ghaffari<\/li>\n<li>Rajan Udwani<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90671\" target=\"_blank\" rel=\"noopener\">Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast<\/a><\/p>\n<ul>\n<li>Florent Becker<\/li>\n<li>Antonio Fernandez Anta<\/li>\n<li>Ivan Rapaport<\/li>\n<li>Eric Re\u00e9mila<\/li>\n<\/ul>\n<h2>SESSION: Keynote Lecture<\/h2>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90672\" target=\"_blank\" rel=\"noopener\">The &#8220;Mobile Adversary&#8221; Paradigm in Distributed Computation and Systems<\/a><\/p>\n<ul>\n<li>Moti Yung<\/li>\n<\/ul>\n<h2>SESSION: Session 6<\/h2>\n<ul>\n<li>Nitin Vaidya<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90673\" target=\"_blank\" rel=\"noopener\">Trading Fences with RMRs and Separating Memory Models<\/a><\/p>\n<ul>\n<li>Hagit Attiya<\/li>\n<li>Danny Hendler<\/li>\n<li>Philipp Woelfel<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90674\" target=\"_blank\" rel=\"noopener\">The Price of being Adaptive<\/a><\/p>\n<ul>\n<li>Ohad Ben-Baruch<\/li>\n<li>Danny Hendler<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90685\" target=\"_blank\" rel=\"noopener\">On the Time and Space Complexity of ABA Prevention and Detection<\/a><\/p>\n<ul>\n<li>Zahra Aghazadeh<\/li>\n<li>Philipp Woelfel<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90686\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Fault-tolerant Broadcast in Anonymous Distributed Systems with Fair Lossy Communication Channels<\/a><\/p>\n<ul>\n<li>Jian Tang<\/li>\n<li>Mikel Larrea<\/li>\n<li>Sergio Ar\u00e9valo<\/li>\n<li>Ernesto Jim\u00e9nez<\/li>\n<\/ul>\n<h2>SESSION: Session 7<\/h2>\n<ul>\n<li>Eric Ruppert<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90687\" target=\"_blank\" rel=\"noopener\">Impossibility Results for Distributed Transactional Memory<\/a><\/p>\n<ul>\n<li>Costas Busch<\/li>\n<li>Maurice Herlihy<\/li>\n<li>Miroslav Popovic<\/li>\n<li>Gokarna Sharma<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90688\" target=\"_blank\" rel=\"noopener\">Disjoint-Access Parallelism: Impossibility, Possibility, and Cost of Transactional Memory Implementations<\/a><\/p>\n<ul>\n<li>Sebastiano Peluso<\/li>\n<li>Roberto Palmieri<\/li>\n<li>Paolo Romano<\/li>\n<li>Binoy Ravindran<\/li>\n<li>Francesco Quaglia<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90689\" target=\"_blank\" rel=\"noopener\">Safety-Liveness Exclusion in Distributed Computing<\/a><\/p>\n<ul>\n<li>Victor Bushkov<\/li>\n<li>Rachid Guerraoui<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90680\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Eventually Consistent Linearizability<\/a><\/p>\n<ul>\n<li>Maciej Kokoci\u0144ski<\/li>\n<li>Tadeusz Kobus<\/li>\n<li>Pawe\u0142 T. Wojciechowski<\/li>\n<\/ul>\n<h2>SESSION: Session 8<\/h2>\n<ul>\n<li>Alexander A. Shvartsman<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90681\" target=\"_blank\" rel=\"noopener\">Help!<\/a><\/p>\n<ul>\n<li>Keren Censor-Hillel<\/li>\n<li>Erez Petrank<\/li>\n<li>Shahar Timnat<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90682\" target=\"_blank\" rel=\"noopener\">Lock-Free Algorithms under Stochastic Schedulers<\/a><\/p>\n<ul>\n<li>Dan Alistarh<\/li>\n<li>Thomas Sauerwald<\/li>\n<li>Milan Vojnovi\u0107<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90683\" target=\"_blank\" rel=\"noopener\">Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way<\/a><\/p>\n<ul>\n<li>Trevor Alexander Brown<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90684\" target=\"_blank\" rel=\"noopener\">On the Space Complexity of Set Agreement?<\/a><\/p>\n<ul>\n<li>Carole Delporte-Gallet<\/li>\n<li>Hugues Fauconnier<\/li>\n<li>Petr Kuznetsov<\/li>\n<li>Eric Ruppert<\/li>\n<\/ul>\n<h2>SESSION: Session 9<\/h2>\n<ul>\n<li>Moti Yung<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90695\" target=\"_blank\" rel=\"noopener\">How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality<\/a><\/p>\n<ul>\n<li>Juan Garay<\/li>\n<li>Jonathan Katz<\/li>\n<li>Bj\u00f6rn Tackmann<\/li>\n<li>Vassilis Zikas<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90696\" target=\"_blank\" rel=\"noopener\">Adaptively Secure Computation with Partial Erasures<\/a><\/p>\n<ul>\n<li>Carmit Hazay<\/li>\n<li>Yehuda Lindell<\/li>\n<li>Arpita Patra<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90697\" target=\"_blank\" rel=\"noopener\">Improved Analysis of Deterministic Load-Balancing Schemes<\/a><\/p>\n<ul>\n<li>Petra Berenbrink<\/li>\n<li>Ralf Klasing<\/li>\n<li>Adrian Kosowski<\/li>\n<li>Frederik Mallmann-Trenn<\/li>\n<li>Przemyslaw Uznanski<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90698\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Robust and Private Distributed Shared Atomic Memory in Message Passing Networks<\/a><\/p>\n<ul>\n<li>Shlomi Dolev<\/li>\n<li>Thomas Petig<\/li>\n<li>Elad Michael Schiller<\/li>\n<\/ul>\n<h2>SESSION: Session 10<\/h2>\n<ul>\n<li>Othon Michail<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90699\" target=\"_blank\" rel=\"noopener\">Randomized Proof-Labeling Schemes<\/a><\/p>\n<ul>\n<li>Mor Baruch<\/li>\n<li>Pierre Fraigniaud<\/li>\n<li>Boaz Patt-Shamir<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90690\" target=\"_blank\" rel=\"noopener\">Distributed Convex Thresholding<\/a><\/p>\n<ul>\n<li>Ran Wolff<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90691\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Average Complexity for the LOCAL Model<\/a><\/p>\n<ul>\n<li>Laurent Feuilloley<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90692\" target=\"_blank\" rel=\"noopener\">Brief Announcement: Investigating the Cost of Anonymity on Dynamic Networks<\/a><\/p>\n<ul>\n<li>Giuseppe Antonio Di Luna<\/li>\n<li>Roberto Baldoni<\/li>\n<\/ul>\n<h2>SESSION: Keynote Lecture<\/h2>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90693\" target=\"_blank\" rel=\"noopener\">Online Resource Leasing<\/a><\/p>\n<ul>\n<li>Christine Markarian<\/li>\n<li>Friedhelm Meyer auf der Heide<\/li>\n<\/ul>\n<h2>SESSION: Session 11<\/h2>\n<ul>\n<li>Elad M. Schiller<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90694\" target=\"_blank\" rel=\"noopener\">Deterministic (\u0394 + 1)-Coloring in Sublinear (in \u0394) Time in Static, Dynamic and Faulty Networks<\/a><\/p>\n<ul>\n<li>Leonid Barenboim<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90605\" target=\"_blank\" rel=\"noopener\">On Information Complexity in the Broadcast Model<\/a><\/p>\n<ul>\n<li>Mark Braverman<\/li>\n<li>Rotem Oshman<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90606\" target=\"_blank\" rel=\"noopener\">How To Elect a Leader Faster than a Tournament<\/a><\/p>\n<ul>\n<li>Dan Alistarh<\/li>\n<li>Rati Gelashvili<\/li>\n<li>Adrian Vladu<\/li>\n<\/ul>\n<h2>SESSION: Session 12<\/h2>\n<ul>\n<li>Michel Raynal<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90607\" target=\"_blank\" rel=\"noopener\">The Weakest Failure Detector for Eventual Consistency<\/a><\/p>\n<ul>\n<li>Swan Dubois<\/li>\n<li>Rachid Guerraoui<\/li>\n<li>Petr Kuznetsov<\/li>\n<li>Franck Petit<\/li>\n<li>Pierre Sens<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90608\" target=\"_blank\" rel=\"noopener\">Limitations of Highly-Available Eventually-Consistent Data Stores<\/a><\/p>\n<ul>\n<li>Hagit Attiya<\/li>\n<li>Faith Ellen<\/li>\n<li>Adam Morrison<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90609\" target=\"_blank\" rel=\"noopener\">Computing Weak Consistency in Polynomial Time: [Extended Abstract]<\/a><\/p>\n<ul>\n<li>Wojciech Golab<\/li>\n<li>Xiaozhou (Steve) Li<\/li>\n<li>Alejandro L\u00f3pez-Ortiz<\/li>\n<li>Naomi Nishimura<\/li>\n<\/ul>\n<h2>SESSION: Session 13<\/h2>\n<ul>\n<li>Shlomi Dolev<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90600\" target=\"_blank\" rel=\"noopener\">On the Push&amp;Pull Protocol for Rumour Spreading: [Extended Abstract]<\/a><\/p>\n<ul>\n<li>Huseyin Acan<\/li>\n<li>Andrea Collevecchio<\/li>\n<li>Abbas Mehrabian<\/li>\n<li>Nick Wormald<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90601\" target=\"_blank\" rel=\"noopener\">Distributed Resource Discovery in Sub-Logarithmic Time<\/a><\/p>\n<ul>\n<li>Bernhard Haeupler<\/li>\n<li>Dahlia Malkhi<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90602\" target=\"_blank\" rel=\"noopener\">The Cost of Synchronizing Multiple-Access Channels<\/a><\/p>\n<ul>\n<li>Tomasz Jurdzinski<\/li>\n<li>Grzegorz Stachowiak<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90603\" target=\"_blank\" rel=\"noopener\">Leveraging Multiple Channels in Ad Hoc Networks<\/a><\/p>\n<ul>\n<li>Magnus M. Halldorsson<\/li>\n<li>Yuexuan Wang<\/li>\n<li>Dongxiao Yu<\/li>\n<\/ul>\n<h2>SESSION: Session 14<\/h2>\n<ul>\n<li>Danny Hendler<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90604\" target=\"_blank\" rel=\"noopener\">Towards Optimal Synchronous Counting<\/a><\/p>\n<ul>\n<li>Christoph Lenzen<\/li>\n<li>Joel Rybicki<\/li>\n<li>Jukka Suomela<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90615\" target=\"_blank\" rel=\"noopener\">Fault-Tolerant Consensus in Directed Graphs<\/a><\/p>\n<ul>\n<li>Lewis Tseng<\/li>\n<li>Nitin H. Vaidya<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90616\" target=\"_blank\" rel=\"noopener\">Minimal Synchrony for Byzantine Consensus<\/a><\/p>\n<ul>\n<li>Zohir Bouzid<\/li>\n<li>Achour Mostfaoui<\/li>\n<li>Michel Raynal<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90617\" target=\"_blank\" rel=\"noopener\">Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems: Extended abstract<\/a><\/p>\n<ul>\n<li>Silvia Bonomi<\/li>\n<li>Shlomi Dolev<\/li>\n<li>Maria Potop-Butucaru<\/li>\n<li>Michel Raynal<\/li>\n<\/ul>\n<p><a title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?N90618\" target=\"_blank\" rel=\"noopener\">Dual Failure Resilient BFS Structure<\/a><\/p>\n<ul>\n<li>Merav Parter<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"\n<p>Full Citation in the ACM Digital Library<\/p>\n<p> SESSION: Keynote Lecture <\/p>\n<p>Cortical Computation<\/p>\n<p> Christos H. Papadimitriou Santosh S. Vempala SESSION: Session 1 Friedhelm Meyer auf der Heide <\/p>\n<p>Near-Optimal Scheduling of Distributed Algorithms<\/p>\n<p> Mohsen Ghaffari <\/p>\n<p>Scheduling Loop-free Network Updates: It&#8217;s Good to Relax!<\/p>\n<p> Arne Ludwig Jan Marcinkowski Stefan Schmid <\/p>\n<p>New Routing Techniques and their Applications<\/p>\n<p> Liam [&#8230;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-1377","page","type-page","status-publish","hentry","odd"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/1377","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/comments?post=1377"}],"version-history":[{"count":4,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/1377\/revisions"}],"predecessor-version":[{"id":1392,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/1377\/revisions\/1392"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/media?parent=1377"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}