Innovations in Theoretical Computer Science 2020

Poster size should be 32 x 40 inches.
Poster Presentations:
Orr Paradise Smooth and Strong PCPs
Stacey Jeffery Span Programs and Quantum Space Complexity
Andrea Lincoln and Nikhil Vyas Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs
Jeremiah Blocki, Seunghoon Lee and Samson Zhou Approximating Cumulative Pebbling Cost is Unique Games Hard
Kira Goldner, Nicole Immorlica and Brendan Lucier Reducing Inefficiency in Carbon Auctions with Imperfect Competition
Greg Bodwin and Ofer Grossman Strategy-Stealing is Non-Constructive
Noah Fleming and Yuichi YoshidaDistribution-Free Testing of Linear Functions on R^n
Andras Pal Gilyen and Tongyang Li Distributional property testing in a quantum world
Nir Bitansky and Nathan Geier On Oblivious Amplification of Coin-Tossing Protocols
Andrej Bogdanov and Baoxiang Wang Learning and Testing Variable Partitions
Fedor Fomin, Petr Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Meirav Zehavi Parameterization Above a Multiplicative Guarantee
Shweta Agrawal, Michael Clear, Sanjam Garg, Adam O'Neill, Justin Thaler and Ophir Frieder Ad Hoc Multi-Input Functional Encryption
Asaf Shapira, Lior Gishboliner and Henrique Stagni Testing linear inequalities of subgraph statistics
Yael Hitron, Merav Parter and Gur Perri The Computational Cost of Asynchronous Neural Communication
Konstantin Makarychev and Yury Makarychev Certified Algorithms: Worst-Case Analysis and Beyond
Avrim Blum and Thodoris Lykouris Advancing subgroup fairness via sleeping experts
Tomer Grossman, Ilan Komargodski and Moni Naor Instance Complexity and Unlabeled Certificates in the Decision Tree Model
Nathan Lindzey and Ansis Rosmanis A Tight Lower Bound for Non-Coherent Index Erasure
Andrei A. Graur, Tristan Pollner, Vidhya Ramaswamy and S. Matthew Weinberg New Query Lower Bounds for Submodular Function Minimization
Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng and Ariel Procaccia Computation-Aware Data Aggregation
Francisco Maturana and K. V. Rashmi Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data
Manuel Fernandez, David Woodruff and Taisuke Yasuda Graph Spanners in the Message-Passing Model
Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty and David P. Woodruff Pseudo-deterministic Streaming
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni and Tal Malkin Limits to Non-Malleability
Parikshit Gopalan, Roie Levin and Udi Wieder Finding Skewed Subcubes Under a Distribution
Arnab Bhattacharyya, Sunil Chandran and Suprovat Ghoshal Combinatorial lower bounds for 3-query LDCs