Powered by
54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022),
June 20–24, 2022,
Rome, Italy
Frontmatter
Papers
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)
Article Search
Info
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, n.n.; Princeton University, USA; CWI, Netherlands)
Article Search
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)
Preprint
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)
Article Search
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)
Article Search
Pricing Ordered Items
Shuchi Chawla

, Rojin Rezvan

, Yifeng Teng

, and Christos Tzamos
(University of Texas at Austin, USA; Google Research, USA; University of Wisconsin-Madison, USA)
Article Search
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)
Article Search
Constant Inapproximability for PPA
Argyrios Deligkas

, John Fearnley

, Alexandros Hollender

, and Themistoklis Melissourgos
(Royal Holloway University of London, UK; University of Liverpool, UK; University of Oxford, UK; University of Essex, UK)
Article Search
proc time: 0.42