{"id":3752,"date":"2023-08-29T14:48:04","date_gmt":"2023-08-29T14:48:04","guid":{"rendered":"http:\/\/www.disc-conference.org\/wp\/disc2023\/?page_id=3752"},"modified":"2024-11-28T09:05:17","modified_gmt":"2024-11-28T09:05:17","slug":"detailed-program","status":"publish","type":"page","link":"https:\/\/www.disc-conference.org\/wp\/disc2024\/detailed-program\/","title":{"rendered":"Program"},"content":{"rendered":"\n

DISC’24 proceedings are available on the LIPIcs web site<\/a><\/strong><\/p>\n\n\n\n

Recordings of the DISC sessions are available on Youtube: Tuesday<\/a>, Wednesday<\/a>, Thursday<\/a><\/strong><\/p>\n\n\n\n

<\/p>\n\n\n\n

Monday, October 28: ADGA<\/a>, Flower Tutorial<\/a> (see workshop web-sites for details)<\/h2>\n\n\n\n
09:00 – 09:30<\/td>Registration<\/strong><\/td><\/tr>
09:30 – 10:30<\/td>ADGA<\/a><\/td><\/tr>
10:30 – 11:00<\/td>Coffee Break<\/strong><\/td><\/tr>
11:00 – 13:00<\/td>ADGA<\/a><\/td><\/tr>
13:00 – 14:30<\/td>Lunch<\/strong><\/td><\/tr>
14:30 – 16:30<\/td>ADGA<\/a> \/ Flower Tutorial<\/a><\/td><\/tr>
16:30 – 17:00<\/td>Coffee Break<\/strong><\/td><\/tr>
17:00 – 18:00<\/td>ADGA<\/a> \/ Flower Tutorial<\/a><\/td><\/tr>
18:00 – 19:00<\/td>DISC Reception<\/strong>
Registration for DISC-only attendees open from 17:45<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Tuesday, October 29<\/h2>\n\n\n\n
08:30 – 09:00<\/td>Registration<\/strong><\/td><\/td><\/tr>
09:00 – 09:05             <\/td>Opening Remarks<\/strong><\/td><\/td><\/tr>
09:05 – 10:05<\/td>Keynote: Networks in the Age of Distributed Computation, Stefan Schmid<\/strong><\/td><\/td><\/tr>
<\/td>Session 1: Shared-Memory Algorithms (Chair: Dan Alistarh)<\/strong><\/td><\/td><\/tr>
10:05 – 10:25<\/td>Lock-Free Augmented Trees (Best Paper Co-Winner)<\/strong>
Panagiota Fatourou, Eric Ruppert<\/td>		<\/td><\/tr>
10:25 – 10:45<\/td>A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory
Benyamin Bashari, David Yu Cheng Chan, Philipp Woelfel<\/td>		<\/td><\/tr>
10:45 – 10:50<\/td>BA: Concurrent Aggregate Queries
Gal Sela, Erez Petrank<\/td>		<\/td><\/tr>
10:50 – 11:30<\/td>Coffee Break<\/strong><\/td><\/td><\/tr>
<\/td>Session 2: Challenges in Dynamic Networks (Chair: Ran Gelles)<\/strong><\/td><\/td><\/tr>
11:30 – 11:50<\/td>Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges
Antoine El-Hayek, Monika Henzinger, Stefan Schmid<\/td>		<\/td><\/tr>
11:50 – 12:10<\/td>Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
Garrett Parzych, Joshua J. Daymude<\/td>		<\/td><\/tr>
12:10 – 12:15<\/td>BA: Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
Timoth\u00e9 Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, Fran\u00e7ois Ta\u00efani, Vassilis Zikas<\/td>		<\/td><\/tr>
<\/td>Session 3: Distributed Assignment Problems (Chair: Seth Gilbert)<\/strong><\/td><\/td><\/tr>
12:15 – 12:35<\/td>Near Optimal Algorithms for Token Collision in Anonymous Networks
Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, Chaodong Zheng<\/td>		<\/td><\/tr>
12:35 – 12:55<\/td>Sorting in One and Two Rounds using t-Comparators
Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn<\/td>		<\/td><\/tr>
12:55 – 13:00<\/td>BA: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures
Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz<\/td>		<\/td><\/tr>
13:00 – 14:30<\/td>Lunch<\/strong><\/td><\/td><\/tr>
<\/td>Session 4: Distributed Graph Coloring and Friends (Chair: Sebastian Brandt)<\/strong><\/td><\/td><\/tr>
14:30 – 14:50<\/td>Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, Mika\u00ebl Rabie<\/td>		<\/td><\/tr>
14:50 – 15:10<\/td>Connectivity Labeling in Faulty Colored Graphs
Asaf Petruschka, Shay Spair, Elad Tzalik<\/td>		<\/td><\/tr>
15:10 – 15:15<\/td>BA: Distributed Maximum Flow in Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann<\/td>		<\/td><\/tr>
15:15 – 15:35<\/td>Distributed Delta-Coloring under Bandwidth Limitations
Magn\u00fas M. Halld\u00f3rsson, Yannic Maus<\/td>		<\/td><\/tr>
15:35 – 15:55<\/td>Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs
Maxime Flin, Magn\u00fas M. Halld\u00f3rsson, Alexandre Nolin<\/td>		<\/td><\/tr>
15:55 – 16:00<\/td>BA: Agent-based Leader Election, MST, and Beyond
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma<\/td>		<\/td><\/tr>
16:00 – 16:20<\/td>Coffee Break<\/strong><\/td><\/td><\/tr>
<\/td>Session 5: Flavors of Synchrony (Chair: Nitin Vaidya)<\/strong><\/td><\/td><\/tr>
16:20 – 16:40<\/td>Granular Synchrony
Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren<\/td>		<\/td><\/tr>
16:40 – 16:45<\/td>BA: Unifying Partial Synchrony
Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski, Roger Wattenhofer<\/td>		<\/td><\/tr>
16:45 – 17:05<\/td>Convex Consensus with Asynchronous Fallback
Andrei Constantinescu, Diana Ghinea, Roger Wattenhofer, Floris Westermann<\/td>		<\/td><\/tr>
17:05 – 17:45<\/td>Happy Hour<\/strong><\/td><\/td><\/tr>
17:45 – 19:30<\/td>Business Meeting<\/strong><\/td><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Wednesday, October 30<\/h2>\n\n\n\n
09:00 – 10:00             <\/td>Keynote: Federated Learning in the Presence of Heterogeneity, Gauri Joshi<\/strong><\/td><\/tr>
<\/td>Session 6: The Latest on Linearizability (Chair: Sean Ovens)<\/strong><\/td><\/tr>
10:00 – 10:20<\/td>Hyperproperty-Preserving Register Specifications (Best Paper Co-Winner \/ Best Student Paper)<\/strong>
Yoav Ben Shimon, Ori Lahav, Sharon Shoham<\/td><\/tr>
10:20 – 10:40<\/td>Communication Requirements for Linearizable Registers
Ra\u00efssa Nataf, Yoram Moses<\/td><\/tr>
10:45 – 11:30<\/td>Coffee Break<\/strong><\/td><\/tr>
<\/td>Session 7: Sorry, but You Cannot Compute that Here (Chair: Alexey Gotsman)<\/strong><\/td><\/tr>
11:30 – 11:50<\/td>What Cannot Be Implemented on Weak Memory?
Armando Casta\u00f1eda, Gregory Chockler, Brijesh Dongol, Ori Lahav<\/td><\/tr>
11:50 – 12:10<\/td>A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot
Yannis Coutouly, Emmanuel Godard<\/td><\/tr>
12:10 – 12:15<\/td>BA: Solvability of Three-Process General Tasks
Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum<\/td><\/tr>
12:15 – 12:20<\/td>BA: Colorless tasks and extension-based proofs
Yusong Shi, Weidong Liu<\/td><\/tr>
<\/td>Session 8: Distributed Protocols (Chair: Yoram Moses)<\/strong><\/td><\/tr>
12:20 – 12:40<\/td>A Knowledge-Based Analysis of Intersection Protocols
Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden<\/td><\/tr>
12:40 – 13:00<\/td>The Power of Abstract MAC Layer: A Fault-tolerance Perspective
Qinzi Zhang, Lewis Tseng<\/td><\/tr>
13:00 – 14:30<\/td>Lunch<\/strong><\/td><\/tr>
<\/td>Session 9: Agreement and Replication (Chair: Gregory Chockler)<\/strong><\/td><\/tr>
14:30 – 14:50<\/td>Efficient Signature-Free Validated Agreement
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi<\/td><\/tr>
14:50 – 15:10<\/td>Sing a Song of Simplex
Victor Shoup<\/td><\/tr>
15:10 – 15:15<\/td>BA: Best-Possible Unpredictable Proof-of-Stake
Lei Fan, Jonathan Katz, Zhenghao Lu, Phuc Thai, Hong-Sheng Zhou<\/td><\/tr>
15:15 – 15:35<\/td>Vertical Atomic Broadcast and Passive Replication
Manuel Bravo, Gregory Chockler, Alexey Gotsman, Alejandro Naser-Pastoriza, Christian Rold\u00e1n<\/td><\/tr>
15:35 – 15:55<\/td>Content-Oblivious Leader Election on Rings
Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin<\/td><\/tr>
15:55 – 16:00<\/td>BA: Reconfigurable Heterogeneous Quorum Systems
Xiao Li, Mohsen Lesani<\/td><\/tr>
16:00 – 16:30<\/td>Coffee Break<\/strong><\/td><\/tr>
<\/td>Session 10: Byzantine-Resilient Computing (Chair: Petr Kuznetsov)<\/strong><\/td><\/tr>
16:30 – 16:50<\/td>Quantum Byzantine Agreement Against Full-information Adversary
Longcheng Li, Xiaoming Sun, Jiadong Zhu<\/td><\/tr>
16:50 – 17:10<\/td>Byzantine Resilient Distributed Computing on External Data
John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, Aishwarya Thiruvengadam<\/td><\/tr>
<\/td>Session 11: Graphs, Rumors, and Clocks (Chair: Petr Kuznetsov)<\/strong><\/td><\/tr>
17:10 – 17:30<\/td>On the Power of Graphical Reconfigurable Circuits
Yuval Emek, Yuval Gil, Noga Harlev<\/td><\/tr>
17:30 – 17:50<\/td>On the Limits of Information Spread by Memory-less Agents
Niccol\u00f2 D’Archivio, Robin Vacus<\/td><\/tr>
17:50 – 17:55<\/td>BA: Clock Distribution with Gradient TRIX
Christoph Lenzen, Shreyas Srinivas<\/td><\/tr>
17:55 – 19:30<\/td>Free Time<\/strong><\/td><\/tr>
19:30 – 22:00<\/td>Conference Banquet and Awards Ceremony<\/strong>
Pre-dinner drinks served from 19:30, dinner from 20:00
Directions to the banquet venue<\/a>
Doctoral Dissertation Award citation<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Thursday, October 31<\/h2>\n\n\n\n
09:00 – 10:00             <\/td>Keynote: Resilient Coordination in Networked Multi-Robot Teams, Stephanie Gil<\/strong><\/td><\/tr>
<\/td>Session 12: Robots on a Plane (Chair: Eric Ruppert)<\/strong><\/td><\/tr>
10:00 – 10:20<\/td>Freeze-Tag in L1 has Wake-up Time Five with Linear Complexity
Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse<\/td><\/tr>
10:20 – 10:40<\/td>Near-linear Time Dispersion of Mobile Agents
Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, Toshimitsu Masuzawa<\/td><\/tr>
10:40 – 10:45<\/td>BA: Distinct Gathering Under Round Robin
Fabian Frei, Koichi Wada<\/td><\/tr>
10:45 – 10:50<\/td>BA: Optimal Uniform Circle Formation by Asynchronous Luminous Robots
Caterina Feletti, Debasish Pattanayak, Gokarna Sharma<\/td><\/tr>
10:50 – 11:30<\/td>Coffee Break<\/strong><\/td><\/tr>
<\/td>Session 13: Self-Organization (Chair: Joel Rybicki)<\/strong><\/td><\/tr>
11:30 – 11:50<\/td>Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
J\u00e9r\u00e9mie Chalopin, Shantanu Das, Maria Kokkou<\/td><\/tr>
11:50 – 12:10<\/td>The computational power of discrete chemical reaction networks with bounded executions
David Doty, Ben Heckmann<\/td><\/tr>
12:10 – 12:15<\/td>BA: The Expressive Power of Uniform Population Protocols with Logarithmic Space
Philipp Czerner, Vincent Fischer, Roland Guttenberg<\/td><\/tr>
12:15 – 12:35<\/td>Single Bridge Formation in Self-Organizing Particle Systems
Shunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, Andr\u00e9a W. Richa<\/td><\/tr>
12:35 – 12:55<\/td>Breaking Through the \u03a9(n)-space Barrier: Population Protocols Decide Double-exponential Thresholds
Philipp Czerner<\/td><\/tr>
12:55 – 13:00<\/td>BA: Self-stabilizing Graph Exploration by a Single Agent
Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei<\/td><\/tr>
13:00 – 14:30<\/td>Lunch<\/strong><\/td><\/tr>
<\/td>Session 14: Navigating Graph Congestion (Chair: Jukka Suomela)<\/strong><\/td><\/tr>
14:30 – 14:50<\/td>Self-Stabilizing MIS Computation in the Beeping Model
George Giakkoupis, Volker Turau, Isabella Ziccardi<\/td><\/tr>
14:50 – 15:10<\/td>Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
Leonid Barenboim, Uri Goldenberg<\/td><\/tr>
15:10 – 15:30 <\/td>Faster cycle detection in the Congested Clique
Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams<\/td><\/tr>
15:30 – 16:00<\/td>Coffee Break<\/strong><\/td><\/tr>
<\/td>Session 15: Parallel Graph Algorithms (Chair: Yuanhao Wei)<\/strong><\/td><\/tr>
16:00 – 16:20<\/td>Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
Laxman Dhulipala, Michael Dinitz, Jakub \u0141\u0105cki, Slobodan Mitrovi\u0107<\/td><\/tr>
16:20 – 16:40<\/td>Massively Parallel Ruling Set Made Deterministic
Jeff Giliberti, Zahra Parsaeian<\/td><\/tr>
<\/td>Session 16: Of Graphs and Proofs (Chair: Jukka Suomela)<\/strong><\/td><\/tr>
16:40 – 17:00<\/td>Distributed Model Checking on Graphs of Bounded Treedepth
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca<\/td><\/tr>
17:00 – 17:20<\/td>Fully Local Succinct Distributed Arguments
Eden Aldema Tshuva, Rotem Oshman<\/td><\/tr>
17:20 – 17:25<\/td>BA: Decreasing verification radius in local certification
Jan Maty\u00e1\u0161 K\u0159i\u0161\u0165an, Josef Erik Sedl\u00e1\u010dek<\/td><\/tr>
17:25 – 17:30<\/td>Main Conference Closing<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Friday, November 1: WAND<\/a><\/strong>, AMG<\/a>, HACDA<\/a><\/strong> (see workshop web-sites for details)<\/h2>\n\n\n\n

WAND<\/a> and AMG<\/a>:<\/p>\n\n\n\n

09:00 – 10:30<\/td>WAND<\/a><\/td><\/tr>
10:30 – 11:00<\/td>Coffee Break<\/strong><\/td><\/tr>
11:00 – 12:30<\/td>WAND<\/a><\/td><\/tr>
12:30 – 14:00<\/td>Lunch<\/strong><\/td><\/tr>
14:00 – 15:50<\/td>AMG<\/a><\/td><\/tr>
15:50 – 16:20<\/td>Coffee Break<\/strong><\/td><\/tr>
16:20 – 18:00<\/td>AMG<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

HACDA<\/a>:<\/p>\n\n\n\n

09:00 – 11:00<\/td>HACDA<\/a><\/td><\/tr>
11:00 – 11:30<\/td>Coffee Break<\/strong><\/td><\/tr>
11:30 – 12:30<\/td>HACDA<\/a><\/td><\/tr>
12:30 – 14:00<\/td>Lunch<\/strong><\/td><\/tr>
14:00 – 16:00<\/td>HACDA<\/a><\/td><\/tr>
16:00 – 16:30<\/td>Coffee Break<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"

DISC’24 proceedings are available on the LIPIcs web site Recordings of the DISC sessions are available on Youtube: Tuesday, Wednesday, Thursday Monday, October 28: ADGA, Flower Tutorial (see workshop web-sites for details) 09:00 – 09:30 Registration 09:30 – 10:30 ADGA … Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":30,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"sidebar-page.php","meta":{"footnotes":""},"class_list":["post-3752","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/pages\/3752","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/users\/30"}],"replies":[{"embeddable":true,"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/comments?post=3752"}],"version-history":[{"count":51,"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/pages\/3752\/revisions"}],"predecessor-version":[{"id":4273,"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/pages\/3752\/revisions\/4273"}],"wp:attachment":[{"href":"https:\/\/www.disc-conference.org\/wp\/disc2024\/wp-json\/wp\/v2\/media?parent=3752"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}