Powered by
54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022),
June 20–24, 2022,
Rome, Italy
Frontmatter
Session 1A
Session 1B
Session 1C
Session 2A
Session 2B
Session 2C
Award Papers Session I: Best Papers
Session 3A
Session 3B
Session 3C
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers
Jan van den Brand, Yu Gao, Arun Jambulapati,
Yin Tat Lee,
Yang P. Liu, Richard Peng, and
Aaron Sidford
(Simons Institute for the Theory of Computing Berkeley, USA; University of California at Berkeley, USA; Georgia Institute of Technology, USA; Stanford University, USA; University of Washington, USA)
Publisher's Version
Session 4A
Circuits Resilient to Short-Circuit Errors
Klim Efremenko,
Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath,
Gillat Kol, Nicolas Resch, and
Raghuvansh R. Saxena
(Ben-Gurion University of the Negev, Israel; ETH Zurich, Switzerland; Carnegie Mellon University, USA; Microsoft Research, USA; Massachusetts Institute of Technology, USA; Google Research, USA; Princeton University, USA; CWI, Netherlands)
Publisher's Version
Session 4B
Session 4C
Session 5A
Session 5B
Session 5C
Twin-Width IV: Ordered Graphs and Matrices
Édouard Bonnet, Ugo Giocanti,
Patrice Ossona de Mendez,
Pierre Simon,
Stéphan Thomassé, and
Szymon Toruńczyk
(LIP, France; ENS Lyon, France; CAMS, France; CNRS, France; University of California at Berkeley, USA; University of Warsaw, Poland)
Publisher's Version
Directed Flow-Augmentation
Eun Jung Kim, Stefan Kratsch,
Marcin Pilipczuk, and Magnus Wahlström
(Université Paris-Dauphine, France; PSL Research University, France; CNRS, France; Humboldt University of Berlin, Germany; University of Warsaw, Poland; Royal Holloway University of London, UK)
Publisher's Version
Award Papers Session II: Best Student Papers
Session 6A
Session 6B
Session 6C
Session 7A
Session 7B
Session 7C
Session 8A
Rate One-Third Non-malleable Codes
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, and Sruthi Sekar
(National University of Singapore, Singapore; IISc Bangalore, India; Microsoft Research, India; University of California at Berkeley, USA)
Publisher's Version
Info
Session 8B
Session 8C
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond
Amir Abboud,
Karl Bringmann,
Seri Khoury, and Or Zamir
(Weizmann Institute of Science, Israel; Saarland University, Germany; MPI-INF, Germany; University of California at Berkeley, USA; Institute for Advanced Study at Princeton, USA)
Publisher's Version
Session 9A
Session 9B
Session 9C
Dynamic Algorithms against an Adaptive Adversary: Generic Constructions and Lower Bounds
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim,
Thatchaphol Saranurak, and Uri Stemmer
(Ben-Gurion University of the Negev, Israel; Tel Aviv University, Israel; Google Research, Israel; Georgetown University, USA; University of Michigan, USA)
Publisher's Version
proc time: 18.9