PODC 2021

PODC 2021 was held on July 26-30, 2021, as a virtual conference.

• Gem sessions this year are:
  • How to locally certify a global property? From spanning trees to planar graphs, and beyond. by Laurent Feuilloley
  • Classic Consensus Impossibilities in Modern Byzantine Fault Tolerance by Naama Ben-David
• The schedule and program are now available.
• The 2021 Dissertation Award will go to Leqi Zhu, advised by Faith Ellen at University of Toronto,  for “On the Space Complexity of Colourless Tasks” and Goran Zuzic, advised by Bernhard Haeupler at Carnegie-Mellon University, for “Towards Universal Optimality in Distributed Optimization“.
• Info about workshops & tutorials here.
• Best paper announced.
• List of accepted papers has been released.
• Keynote talks this year are:
  • Differential Privacy in Distributed Environments: An Overview and Open Questions by Cynthia Dwork
  • Elle: Finding Isolation Violations in Real-World Databases by Kyle Kingsbury
• The 2021 Dijkstra Prize will go to Paris C. Kanellakis and Scott A. Smolka for “CCS Expressions, Finite State Processes, and Three Problems of Equivalence” in Information and Computation, Volume 86, Issue 1, pages 43–68, 1990.
• (Feb. 9th, 2021) – An update to the CFP is as follows:
  Original – It is not permitted to submit the same material concurrently to journals or conferences with proceedings.
  Update – It is not permitted to submit the same material concurrently to journals or conferences with proceedings. The only exception to this is prior or simultaneous publications appearing in the Science and Nature journals.
• The submission website https://podc2021.hotcrp.com/ is open for submissions.
• It has been decided to hold the conference virtually this year.
• Follow PODC on Twitter: @podc_disc.
• View PODC talks on YouTube: https://www.youtube.com/c/PODC-DISC.

Scope

The ACM Symposium on Principles of Distributed Computing is an international forum on the theory, design, analysis, implementation and application of distributed systems and networks. We solicit papers in all areas of distributed computing. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. The goal of the conference is to improve understanding of the principles underlying distributed computing. Topics of interest include, but are not limited to, the following:

• biological distributed algorithms
• blockchain protocols
• coding and reliable communication
• communication networks: algorithms, protocols, applications
• complexity and impossibility results for distributed computing
• concurrency, synchronization, and persistence
• design and analysis of distributed algorithms
• distributed and cloud storage
• distributed and concurrent data structures
• distributed graph algorithms
• distributed machine learning algorithms
• distributed operating systems, middleware, databases
• distributed resource management and scheduling
• fault-tolerance, reliability, self-organization, self-stabilization
• game-theoretic approaches to distributed computing
• high-performance, cluster, cloud and grid computing
• internet applications, social networks, recommendation systems
• languages, verification, formal methods for distributed systems
• multiprocessor and multi-core architectures and algorithms
• parallel network computations
• peer-to-peer systems, overlay networks
• population protocols
• quantum and optics based distributed algorithms
• replication and consistency
• security in distributed computing, cryptographic protocols
• sensor, mesh, and ad hoc networks
• specifications and semantics
• system-on-chip and network-on-chip architectures
• transactional memory
• wireless networks, mobile computing, autonomous agents