PODC18 Program
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

 
View only
 
 
ABCDEFGHIJKLMNOPQRSTUVWXYZAAAB
1
MondayJuly 23
2
16:30Jennifer Welch Jubliee
Main Auditorium, Windsor Building
3
18:30Welcome reception
Picture Gallery, Founder's Building
4
5
TuesdayJuly 24
All PODC sessions are taking place in the Main Auditorium, Windsor Building
6
8:00Registration
Windsor Building Foyer
Registration desk will be open throughout the day
7
Session 1APersistent memory
Chair: Ittay Eyal
8
8:30Keynote:
Overview of Persistent Memory in Distributed Systems Architecture – Past, Present, Future
Rob Peglar
9
9:30
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory
Hagit Attiya, Ohad Ben-Baruch, Danny Hendler
10
Recoverable Mutual Exclusion Under System-Wide Failures
Wojciech Golab, Danny Hendler
11
Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity
Adam Alon, Adam Morrison
12
Brief Announcement: Persistent Multi-Word Compare-And-Swap
Matej Pavlovic, Alex Kogan, Virendra J. Marathe, Tim Harris
13
10:35
Break (Coffee and pastries served in the Windsor Building Foyer)
14
Session 1BShared memory theory
Chair: Dan Alistarh
15
11:05
Separating Lock-Freedom from Wait-Freedom
Hagit Attiya, Armando Castaneda, Danny Hendler:, Matthieu Perrin
16
Passing Messages while Sharing Memory
Marcos K. Aguilera, Naama Ben-David, Irina Calciu, Rachid Guerraoui, Erez Petrank, Sam Toueg
17
Revisionist Simulations: A New Approach to Proving Space Lower Bounds
Faith Ellen, Rati Gelashvili, Leqi Zhu
18
On the Classification of Deterministic Objects via Set Agreement Power
David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg
19
Brief Announcement: Specification and Implementation of Replicated List: The Jupiter Protocol Revisited
Hengfeng Wei, Yu Huang, Jian Lu
20
12:30
Lunch (Buffet-style, Windsor Building Foyer)
21
Session 1CWireless networks
Chair: Janna Burman
22
14:00
Leveraging Indirect Signaling for Topology Inference and Fast Broadcast
Magnus M. Halldorsson, Tigran Tonoyan
23
The Energy Complexity of Broadcast
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie
24
Deterministic Digital Clustering of Wireless Ad Hoc Networks
Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, Grzegorz Stachowiak
25
Brief Announcement: Broadcast in radio networks: time vs. energy tradeoffs
Marek Klonowski, Dominik Pajak
26
15:05
Break (Coffee and cake served in the Windsor Building Foyer)
27
Session 1DGraph algorithms
Chair: Peter Robinson
28
15:30
Round- and Message-Optimal Distributed Graph Algorithms
Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc
29
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovi{\'c}, Ronitt Rubinfeld
30
Distributed Spanner Approximation
Keren Censor-Hillel, Michal Dory
31
Distributed Approximation of Minimum $k$-edge-connected Spanning Subgraphs
Michal Dory
32
Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
Christian Konrad, Viktor Zamaraev
33
Brief Announcement: Simple and Local Independent Set Approximation
Ravi B. Boppana, Magnus M. Halldorsson, Dror Rawitz
34
17:00
Happy hour (Windsor Building Foyer)
35
17:30
Business meeting (Main Auditorium, Windsor Building)
36
37
WednesdayJuly 25
All PODC sessions are taking place in the Main Auditorium, Windsor Building
38
8:00Registration
Windsor Building Foyer
Registration desk will be open throughout the day
39
Session 2A
Approximation and learning
Chair: Yuval Emek
40
8:30Keynote:
Data Summarization and Distributed Computation
Graham Cormode
41
9:30
The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory
Dan Alistarh, Christopher De Sa, Nikola Konstantinov
42
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su
43
On Local Distributed Sampling and Counting
Weiming Feng, Yitong Yin
44
10:30
Break (Coffee and pastries served in the Windsor Building Foyer)
45
Session 2B
Routing and leader election
Chair: Mohsen Ghaffari
46
11:00
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds
Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi
47
Near-Optimal Distributed Routing with Low Memory
Michael Elkin, Ofer Neiman
48
Fair Leader Election for Rational Agents in Asynchronous Rings and Networks
Assaf Yifrach, Yishay Mansour
49
Leader Election in Well-Connected Graphs
Seth Gilbert, Peter Robinson, Suman Sourav
50
Brief Announcement: Beeping a Time-Optimal Leader Election
Fabien Dufoulon, Janna Burman, Joffroy Beauquier
51
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage
Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi
52
12:30
Lunch (Buffet-style, Windsor Building Foyer)
53
Session 2C
Security, blockchains, and
Chair: Gregory Chockler
54
14:00replication
Atomic Cross-Chain Swaps
Maurice Herlihy
55
Interactive Distributed Proofs
Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena
56
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited
Rishabh Bhadauria, Ashish Choudhury
57
Brief Announcement: Sustainable Blockchains through Proof of eXercise
Ali Shoker
58
Brief Announcement: Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm
Zhuolun Xiang, Nitin H. Vaidya
59
Brief Announcement: Optimal Record and Replay under Causal Consistency
Russell L. Jones, Muhammad S. Khan, Nitin H. Vaidya
60
Brief Announcement: MUSIC: Multi-Site Entry Consistency for Geo-Distributed Services
Bharath Balasubramanian, Richard Schlichting, Pamela Zave
61
15:05
Break (Coffee and ice cream served in the Windsor Building Foyer)
62
Session 2DConsensus
Chair: Chryssis Georgiou
63
15:30
Co-best student paper:
Silence
Guy Goren, Yoram Moses
64
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
Laasya Bangalore, Bangalore;Ashish Choudhury, Arpita Patra
65
Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics
Mohsen Ghaffari, Johannes Lengler
66
Sublinear Message Bounds for Randomized Agreement
John Augustine, Anisur Rahaman Molla, Gopal Pandurangan
67
Tight Bounds for Asymptotic and Approximate Consensus
Matthias Függer, Thomas Nowak, Manfred Schwarz
68
17:10Break
69
18:00Banquet receptionFounder's Quad
70
18:30
Banquet and Award Ceremony
Founder's Dining Hall
71
72
ThursdayJuly 26
All PODC sessions are taking place in the Main Auditorium, Windsor Building
73
8:00Registration
Windsor Building Foyer
Registration desk will be open throughout the day
74
Session 3ACongest
Chair: Idit Keidar
75
8:30Keynote:
Barriers due to Congestion and Two Ways to Deal With Them
Keren Censor-Hillel
76
9:30
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
Francois Le Gall, Frederic Magniez
77
Property Testing of Planarity in the CONGEST Model
Reut Levi, Moti Medina, Dana Ron
78
Congested Clique Algorithms for the Minimum Cut Problem
Mohsen Ghaffari, Krzysztof Nowicki
79
10:30
Break (Coffee and pastries served in the Windsor Building Foyer)
80
Session 3BConcurrency
81
11:00
Locking Timestamps Versus Locking Objects
Marcos K. Aguilera, Tudor David, Rachid Guerraoui, Junxiong Wang
82
Relaxed Schedulers Can Efficiently Parallelize Sequential Algorithms
Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
83
Co-best student paper:
An Asynchronous Computability Theorem for Fair Adversaries
Petr Kuznetsov, Thibault Rieutord, Yuan He
84
Population stability: regulating size in the presence of an adversary
Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro, Adam Sealfon
85
Brief Announcement: 2D-Stack: A scalable lock-free stack design that continuously relaxes semantics for better performance
Adones Rukundo,Aras Atalar, Philippas Tsigas
86
Brief Announcement: Performance Prediction for Coarse-Grained Locking
Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov
87
Brief Announcement: Automatic log enhancement for fault diagnosis
Jia Tong, Li Ying, Wu Zhonghai
88
12:35
Lunch (Buffet-style, Windsor Building Foyer)
89
Session 3CColoring
Chair: Magnús Halldórsson
90
14:05
Distributed coloring in sparse graphs with fewer colors
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
91
Improved Distributed Delta-Coloring
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus
92
Best paper:
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models
Leonid Barenboim, Michael Elkin, Uri Goldenberg
93
15:05
Break (Coffee and cake served in the Windsor Building Foyer)
94
Session 3D
Graphs and population
Chair: Michael Elkin
95
15:30protocols
Lower Bounds for Searching Robots, some Faulty
Andrey Kupavskii, Emo Welzl
96
Distributed Uniformity Testing
Orr Fischer, Uri Meir, Rotem Oshman
97
Minor Excluded Network Families Admit Fast Distributed Algorithms
Bernhard Haeupler, Jason Li, Goran Zuzic
98
Brief Announcement: Population Protocols Are Fast
Adrian Kosowski, Przemysław Uznański
99
Brief Announcement: Space-Optimal Naming in Population Protocols
Janna Burman, Joffroy Beauquier, Devan Sohier
100
Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems
Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, Andréa W. Richa
Loading...
 
 
 
Sheet1
 
 
Main menu