Program Outline

jump to detailed program

Social events:
  • Reception (Dec. 5, 18:00-20:00),
  • Banquet (Dec. 7, 19:00-21:30)
Dec. 6 Dec. 7 Dec. 8
9:00 Opening
9:10 Keynote 1 Keynote 2 Keynote 3
10:10 coffee break
10:35 Session 1
(3 talks)		 Session 4
(3 talks)		 Session 7
(3 talks)
11:45 lunch
13:30 Session 2
(4 talks)		 Session 5
(4 talks)		 Session 8
(4 talks)
15:05 coffee break
15:30 Session 3 (3 talks) Session 6
(4 talks)		 Session 9
(4 talks)
16:40 business meeting
(ca.1h)
Closing

Detailed Program

We had an excellent OPODIS 2023 with many interesting talks and research discussions. The program is left here for nostalgia and bureaucratic reference...

All paper presentations are scheduled for max. 20 minutes, plus Q&A and setup.

Welcome Reception (Tue Dec. 5): 18:00-20:00 (registration from 17:30), location: Tokyo Tech Front, room Royal Blue Hall (map)

Registration

Opening

Keynote 1:  
(chair: Xavier Défago)

Roger Wattenhofer, ETH Zurich

3
Distributed Algorithms as a Gateway to Deductive Learning

Coffee break

Session 1: Agreement I  
(chair: Junya Nakamura)

  • [**best paper**]
    21
    Fault-tolerant computing with unreliable channels A. Pastoriza, G. Chockler, A. Gotsman.
  • 19
    Probable Approximate Coordination A. Livshits, Y. Moses.
  • 9
    Byzantine Consensus in Abstract MAC Layer L. Tseng, C. Sardina.
LUNCH

Session 2: Blockchains and Security  
(chair: Roy Friedman)

  • 8
    A Fair and Resilient Decentralized Clock Network for Transaction Ordering. A. Constantinescu, D. Ghinea, L. Heimbach, Z. Wang, R. Wattenhofer.
  • 12
    Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. O. Alpos, I. Amores-Sesar, C. Cachin, M. Yeo.
  • 31
    A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies. J. Bezerra de Araújo, P. Kuznetsov.
  • 23
    A Holistic Approach for Trustworthy Distributed Systems with WebAssembly and TEEs. J. Ménétrey, A. Grueter, P. Yuhala, J. Oeftiger, P. Felber, M. Pasin, V. Schiavoni.
Coffee break

Session 3: Mobile computing I  
(chair: Sébastien Tixeuil)

  • 25
    Silent Programmable Matter: Coating. A. Navarra, F. Piselli.
  • 5
    O(log n)-time Uniform Circle Formation for Asynchronous Opaque Luminous Robots. C. Feletti, C. Mereghetti, B. Palano.
  • 28
    On Asynchrony, Memory, and Communication: Separations and Landscapes. P. Flocchini, N. Santoro, Y. Sudo, K. Wada.

Business Meeting

End of Day 1
Registration

Keynote 2:  
(chair: Koichi Wada)

François Le Gall, Nagoya University

2
Quantum distributed computing: potential and limitations

Coffee break

Session 4: Storage and Machine Learning  
(chair: Jennifer L. Welch)

  • [** best student paper **]
    20
    Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks. J. Lee, L. Schmid, S. Yun.
  • 4
    The Synchronization Power of Auditable Registers. H. Attiya, A. Pozzo, A. Milani, U. Pavloff, A. Rapetti.
  • 35
    Atomic Register Abstractions for Byzantine-Prone Distributed Systems. V. Kowalski, A. Mostéfaoui, M. Perrin.
LUNCH

Session 5: Distributed Graphs I  
(chair: Fukuhito Ooshita)

  • 10
    Discrete Incremental Voting C. Cooper, T. Radzik, T. Shiraga.
  • 11
    On the convergence time in graphical games: a locality-sensitive approach. J. Hirvonen, L. Schmid, K. Chatterjee, S. Schmid.
  • 13
    Improved Distributed Algorithms for Random Colorings. C. Carlson, E. Vigoda, D. Frishberg.
  • 27
    On Polynomial Time Local Decision. E. Aldema Tshuva, R. Oshman.
Coffee break

Session 6: Concurrent programming  
(chair: Achour Mostéfaoui)

  • 15
    Nova: Safe Off-Heap Memory Allocation and Reclamation. R. Fakhoury, A. Braginsky, I. Keidar, Y. Zuriel.
  • 17
    A Wait-Free Deque with Polylogarithmic Step Complexity. S. Asbell, E. Ruppert.
  • 34
    Sketching the Path to Efficiency: Lightweight Learned Cache Replacement. R. Shahout, R. Friedman.
  • 24
    Recoverable and Detectable Self-Implementations of Swap. T. Lehman, H. Attiya, D. Hendler.
Move to banquet

Banquet (until 21:30)

Meguro Gajoen

Registration

Keynote 3:  
(chair: Alysson Bessani)

Vincent Gramoli, University of Sydney and Redbelly Network

1
From Consensus Research to Redbelly Network Pty Ltd

Coffee break

Session 7: Mobile computing II  
(chair: Toshimitsu Masuzawa)

  • 7
    Energy-Constrained Programmable Matter Under Unfair Adversaries. J. Weber, T. Chhabra, A. Richa, J. Daymude.
  • 33
    Black Hole Search in Dynamic Rings: The Scattered Case. G. Di Luna, P. Flocchini, G. Prencipe, N. Santoro.
  • 18
    Reliable Broadcast despite Mobile Byzantine Faults. S. Bonomi, G. Farina, S. Tixeuil.
LUNCH

Session 8: Agreement II  
(chair: Gregory Chockler)

  • 14
    Fever: Optimal Responsive View Synchronisation. A. Lewis-Pye, I. Abraham.
  • 32
    Bounds on Worst-Case Responsiveness for Agreement Algorithms. H. Attiya, J. Welch.
  • 29
    On the Round Complexity of Asynchronous Crusader Agreement. I. Abraham, N. Ben-David, G. Stern, S. Yandamuri.
  • 6
    Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. H. Attiya, J. Welch.
Coffee break

Session 9: Distributed Graphs II  
(chair: Taisuke Izumi)

  • 16
    Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs. Y. Gil.
  • 22
    Local Problems in the SUPPORTED Model. A. Agrawal, J. Augustine, D. Peleg, S. Ramachandran.
  • 26
    Tight Bounds on the Message Complexity of Distributed Tree Verification. S. Kutten, P. Robinson, M. Tan.
  • 30
    Distributed Partial Coloring via Gradual Rounding. A. Das, P. Fraigniaud, A. Rosen.

Closing

End of OPODIS 2023