{"id":1317,"date":"2015-04-23T06:59:20","date_gmt":"2015-04-23T11:59:20","guid":{"rendered":"http:\/\/www.podc.org\/podc2015\/?page_id=1317"},"modified":"2021-10-29T09:38:04","modified_gmt":"2021-10-29T14:38:04","slug":"program","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2015\/program\/","title":{"rendered":"PODC 2015 Program"},"content":{"rendered":"

(Tentative as of May 28, 2015) <\/strong><\/p>\n

Monday 20 July <\/strong><\/h2>\n

18:00 \u2013 19:00 Alexander A. Shvartsman: 60th<\/sup> Birthday Celebration
\n19:00 \u2013 21:00 Reception<\/strong><\/p>\n

Tuesday 21 July <\/strong><\/h2>\n

08:55 \u2013 09:00 Welcome Address
\n09:00 \u2013 10:00 Keynote Address <\/strong><\/p>\n

Cortical Computation
\nChristos Papadimitriou<\/em><\/p>\n

10:00 \u2013 10:20 Coffee break <\/strong><\/p>\n

10:20 \u2013 11:35 Session 1: 3 regular talks + 1 brief announcement<\/strong> (Chair: Friedhelm Meyer auf der Heide)<\/p>\n\n\n\n\n\n\n
10:20<\/td>\nNear-Optimal Scheduling of Distributed Algorithms (Best student paper award)<\/strong>
\nMohsen Ghaffari<\/em><\/td>\n<\/tr>\n
10:43<\/td>\nScheduling Loop-free Network Updates: It’s Good to Relax!
\nArne Ludwig, Jasiek Marcinkowski and Stefan Schmid<\/em><\/td>\n<\/tr>\n
11:06<\/td>\nNew routing techniques and their applications
\nLiam Roditty and Roei Tov<\/em><\/td>\n<\/tr>\n
11:29<\/td>\nBrief Announcement: Routing the internet with less than fifteen entries
\nCyril Gavoille, Christian Glacet, Nicolas Hanusse and David Ilcinkas<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

11:35 \u2013 12:50 Session 2: 3 regular talks + 1 brief announcement<\/strong> (Chair: Paul Spirakis)<\/p>\n\n\n\n\n\n\n
11:35<\/td>\nTerminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
\nOthon Michail<\/em><\/td>\n<\/tr>\n
11:58<\/td>\nFast and Exact Majority in Population Protocols
\nDan Alistarh, Rati Gelashvili and Milan Vojnovic<\/em><\/td>\n<\/tr>\n
12:21<\/td>\nDistributed House-Hunting in Ant Colonies
\nMohsen Ghaffari, Cameron Musco, Tsvetomira Radeva and Nancy Lynch<\/em><\/td>\n<\/tr>\n
12:44<\/td>\nBrief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter
\nZahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida Bazzi, Andrea Richa and Christian Scheideler<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

12:50 \u2013 14:30 Lunch break <\/strong><\/p>\n

14:30 \u2013 16:02 Session 3: 4 regular talks<\/strong> (Chair: Antonio Fern\u00e1ndez Anta)<\/p>\n\n\n\n\n\n\n
14:30<\/td>\nConstruction and impromptu repair of an MST in a distributed network with $o(m)$ communication
\nValerie King, Shay Kutten and Mikkel Thorup<\/em><\/td>\n<\/tr>\n
14:53<\/td>\nNear-Optimal Distributed Maximum Flow
\nMohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen and Boaz Patt-Shamir<\/em><\/td>\n<\/tr>\n
15:16<\/td>\nToward Optimal Bounds in the Congested Clique: Graph Connectivity and MST
\nJames W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh and Michele Scquizzato<\/em><\/td>\n<\/tr>\n
15:39<\/td>\nFast distributed almost stable matchings
\nRafail Ostrovsky and Will Rosenbaum<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

16:02 \u2013 16:22 Coffee break <\/strong><\/p>\n

16:22 \u2013 17:37 Session 4: 3 regular talks + 1 brief announcement<\/strong> (Chair: Christian Scheideler)<\/p>\n\n\n\n\n\n\n
16:22<\/td>\nA (Truly) Local Broadcast Layer for Unreliable Radio Networks
\nNancy Lynch and Calvin Newport<\/em><\/td>\n<\/tr>\n
16:45<\/td>\nEfficient Communication in Cognitive Radio Networks
\nSeth Gilbert, Fabian Kuhn, Calvin Newport and Chaodong Zheng<\/em><\/td>\n<\/tr>\n
17:08<\/td>\nA Local Broadcast Layer for the SINR Network Model
\nMagnus M. Halldorsson, Stephan Holzer and Nancy Lynch<\/em><\/td>\n<\/tr>\n
17:31<\/td>\nBrief Announcement: Fast and Simple Node Coloring in the SINR Model
\nFabian Fuchs<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

17:37 \u2013 18:35 Session 5: 2 regular talks + 2 brief announcements<\/strong> (Chair: Thomas Erlebach)<\/p>\n\n\n\n\n\n\n
17:37<\/td>\nAlgebraic Methods in the Congested Clique
\nKeren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz and Jukka Suomela<\/em><\/td>\n<\/tr>\n
18:00<\/td>\nFast Partial Distance Estimation and Applications
\nChristoph Lenzen and Boaz Patt-Shamir<\/em><\/td>\n<\/tr>\n
18:23<\/td>\nBrief Announcement: Distributed Single-Source Reachability
\nMohsen Ghaffari and Rajan Udwani<\/em><\/td>\n<\/tr>\n
18:29<\/td>\nBrief Announcement: A Hierarchy of Congested Clique Models: From Broadcast to Unicast
\nFlorent Becker, Antonio Fernandez Anta, Ivan Rapaport and Eric R\u00e9mila<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

18:35 \u2013 20:30 Doctoral Dissertation Award Ceremony + Business meeting <\/strong><\/p>\n

Wednesday 22 July <\/strong><\/h2>\n

09:00 \u2013 10:00 Keynote Address <\/strong><\/p>\n

The Mobile Adversary Paradigm in Distributed Computation and Systems
\nMoti Yung<\/em><\/p>\n

10:00 \u2013 10:20 Coffee break <\/strong><\/p>\n

10:20 \u2013 11:35 Session 6: 3 regular talks + 1 brief announcement<\/strong> (Chair: Nitin Vaidya)<\/p>\n\n\n\n\n\n\n
10:20<\/td>\nTrading Fences with RMRs and Separating Memory Models
\nHagit Attiya, Danny Hendler and Philipp Woelfel<\/em><\/td>\n<\/tr>\n
10:43<\/td>\nThe Price of being Adaptive
\nOhad Ben-Baruch and Danny Hendler<\/em><\/td>\n<\/tr>\n
11:06<\/td>\nOn the Time and Space Complexity of ABA Prevention and Detection
\nZahra Aghazadeh and Philipp Woelfel<\/em><\/td>\n<\/tr>\n
11:29<\/td>\nBrief Announcement: Fault-tolerant Broadcast in Anonymous Distributed Systems with Fair Lossy Communication Channels
\nJian Tang, Mikel Larrea, Sergio Ar\u00e9valo and Ernesto Jim\u00e9nez<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

11:35 \u2013 12:50 Session 7: 3 regular talks + 1 brief announcement<\/strong> (Chair: Eric Ruppert)<\/p>\n\n\n\n\n\n\n
11:35<\/td>\nImpossibility Results for Distributed Transactional Memory
\nCostas Busch, Maurice Herlihy, Miroslav Popovic and Gokarna Sharma<\/em><\/td>\n<\/tr>\n
11:58<\/td>\nDisjoint-Access Parallelism: Impossibility, Possibility, and Cost of Transactional Memory Implementations
\nSebastiano Peluso, Roberto Palmieri, Paolo Romano, Binoy Ravindran and Francesco Quaglia<\/em><\/td>\n<\/tr>\n
12:21<\/td>\nSafety-Liveness Exclusion in Distributed Computing
\nVictor Bushkov and Rachid Guerraoui<\/em><\/td>\n<\/tr>\n
12:44<\/td>\nBrief Announcement: Eventually consistent linearizability
\nTadeusz Kobus, Maciej Kokoci\u0144ski and Pawe\u0142 T. Wojciechowski<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

12:50 \u2013 14:30 Lunch break <\/strong><\/p>\n

14:30 \u2013 16:02 Session 8: 4 regular talks<\/strong> (Chair: Alexander Shvartsman)<\/p>\n\n\n\n\n\n\n
14:30<\/td>\nHelp!
\nKeren Censor-Hillel, Erez Petrank and Shahar Timnat<\/em><\/td>\n<\/tr>\n
14:53<\/td>\nLock-Free Algorithms under High Memory Contention
\nDan Alistarh, Thomas Sauerwald and Milan Vojnovic<\/em><\/td>\n<\/tr>\n
15:16<\/td>\nReclaiming Memory for Lock-Free Data Structures: There has to be a Better Way
\nTrevor Brown<\/em><\/td>\n<\/tr>\n
15:39<\/td>\nOn the Space Complexity of Set Agreement
\nCarole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov and Eric Ruppert<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

16:02 \u2013 16:22 Coffee break <\/strong><\/p>\n

16:22 \u2013 17:37 Session 9: 3 regular talks + 1 brief announcement<\/strong> (Chair: Moti Yung)<\/p>\n\n\n\n\n\n\n
16:22<\/td>\nHow Fair is Your Protocol? A Utility-based Approach to Protocol Optimality
\nJuan A. Garay, Jonathan Katz, Bj\u00f6rn Tackmann and Vassilis Zikas<\/em><\/td>\n<\/tr>\n
16:45<\/td>\nAdaptively Secure Computation with Partial Erasures
\nCarmit Hazay, Yehuda Lindell and Arpita Patra<\/em><\/td>\n<\/tr>\n
17:08<\/td>\nImproved Analysis of Deterministic Load-Balancing Schemes
\nPetra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn and Przemys\u0142aw Uzna\u0144ski<\/em><\/td>\n<\/tr>\n
17:31<\/td>\nBrief Announcement: Robust and Private Distributed Shared Atomic Memory in Message Passing Networks
\nShlomi Dolev, Thomas Petig and Elad Michael Schiller<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

17:37 \u2013 18:35 Session 10: 2 regular talks + 2 brief announcements<\/strong> (Chair: Othon Michail)<\/p>\n\n\n\n\n\n\n
17:37<\/td>\nRandomized Proof-Labeling Schemes
\nMor Baruch, Pierre Fraigniaud and Boaz Patt-Shamir<\/em><\/td>\n<\/tr>\n
18:00<\/td>\nDistributed Convex Thresholding
\nRan Wolff<\/em><\/td>\n<\/tr>\n
18:23<\/td>\nBrief Announcement: Average Complexity for the LOCAL Model
\nLaurent Feuilloley<\/em><\/td>\n<\/tr>\n
18:29<\/td>\nBrief Announcement: Investigating the cost of Anonymity on Dynamic Networks
\nGiuseppe Antonio Di Luna and Roberto Baldoni<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

*** Conference banquet ***<\/strong><\/p>\n

Thursday 23 July<\/strong><\/h2>\n

09:00 \u2013 10:00 Keynote Address <\/strong><\/p>\n

Online Resource Leasing
\nFriedhelm Meyer auf der Heide<\/em><\/p>\n

10:00 \u2013 10:20 Coffee break <\/strong><\/p>\n

10:20 \u2013 11:29 Session 11: 3 regular talks<\/strong> (Chair: Elad Schiller)<\/p>\n\n\n\n\n\n
10:20<\/td>\nDeterministic (Delta + 1)-Coloring in Sublinear (in Delta) Time in Static, Dynamic and Faulty Networks (Best paper award)<\/strong>
\nLeonid Barenboim<\/em><\/td>\n<\/tr>\n
10:43<\/td>\nOn Information Complexity in the Broadcast Model
\nMark Braverman and Rotem Oshman<\/em><\/td>\n<\/tr>\n
11:06<\/td>\nHow to Elect a Leader Faster than a Tournament
\nDan Alistarh, Rati Gelashvili and Adrian Vladu<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

11:35 \u2013 12:44 Session 12: 3 regular talks<\/strong> (Chair: Michel Raynal)<\/p>\n\n\n\n\n\n
11:35<\/td>\nThe Weakest Failure Detector for Eventual Consistency
\nSwan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit and Pierre Sens<\/em><\/td>\n<\/tr>\n
11:58<\/td>\nLimitations of Highly-Available Eventually-Consistent Data Stores
\nHagit Attiya, Faith Ellen and Adam Morrison<\/em><\/td>\n<\/tr>\n
12:21<\/td>\nComputing Weak Consistency in Polynomial Time
\nWojciech Golab, Xiaozhou Steve Li, Alejandro Lopez-Ortiz and Naomi Nishimura<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

12:44 \u2013 14:30 Lunch break <\/strong><\/p>\n

14:30 \u2013 16:02 Session 13: 4 regular talks<\/strong> (Chair: Shlomi Dolev)<\/p>\n\n\n\n\n\n\n
14:30<\/td>\nOn the push&pull protocol for rumour spreading
\nHuseyin Acan, Andrea Collevecchio, Abbas Mehrabian and Nick Wormald<\/em><\/td>\n<\/tr>\n
14:53<\/td>\nDistributed Resource Discovery in Sub-Logarithmic Time
\nBernhard Haeupler and Dahlia Malkhi<\/em><\/td>\n<\/tr>\n
15:16<\/td>\nThe Cost of Synchronizing Multiple-Access Channels
\nTomasz Jurdzinski and Grzegorz Stachowiak<\/em><\/td>\n<\/tr>\n
15:39<\/td>\nLeveraging Multiple Channels in Ad Hoc Networks
\nMagnus M. Halldorsson, Yuexuan Wang and Dongxiao Yu<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

16:02 \u2013 16:22 Coffee break <\/strong><\/p>\n

16:22 \u2013 18:17 Session 14: 5 regular talks<\/strong> (Chair: Danny Hendler)<\/p>\n\n\n\n\n\n\n\n
16:22<\/td>\nDual Failure Resilient BFS Structure
\nMerav Parter<\/em><\/td>\n<\/tr>\n
16:45<\/td>\nFault-Tolerant Consensus in Directed Graphs
\nLewis Tseng and Nitin Vaidya<\/em><\/td>\n<\/tr>\n
17:08<\/td>\nMinimal Synchrony for Asynchronous Byzantine Consensus
\nZohir Bouzid, Achour Most\u00e9faoui and Michel Raynal<\/em><\/td>\n<\/tr>\n
17:31<\/td>\nStabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems
\nSilvia Bonomi, Shlomi Dolev, Maria Potop-Butucaru and Michel Raynal<\/em><\/td>\n<\/tr>\n
17:54<\/td>\nTowards Optimal Synchronous Counting
\nChristoph Lenzen, Joel Rybicki and Jukka Suomela<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

(Tentative as of May 28, 2015) <\/p>\n

Monday 20 July <\/p>\n

18:00 \u2013 19:00 Alexander A. Shvartsman: 60th Birthday Celebration 19:00 \u2013 21:00 Reception<\/p>\n

Tuesday 21 July <\/p>\n

08:55 \u2013 09:00 Welcome Address 09:00 \u2013 10:00 Keynote Address <\/p>\n

Cortical Computation Christos Papadimitriou<\/p>\n

10:00 \u2013 10:20 Coffee break <\/p>\n

10:20 \u2013 11:35 Session […]<\/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-1317","page","type-page","status-publish","hentry","odd"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/1317","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=1317"}],"version-history":[{"count":13,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/1317\/revisions"}],"predecessor-version":[{"id":1375,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/1317\/revisions\/1375"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/media?parent=1317"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}