ITCS 2024 Program and Schedule


Welcome to ITCS 2024. The conference will run in a single track and all sessions will take place at the main Calvin Lab auditorium of the Simons Institiute for the Theory of Computing on the UC Berkeley campus.


All timings are in Pacific Standard Time (PST).

Tuesday, January 30th
9:00am- 9:25am Coffee and Check-in
9:25am - 9:30am
 		Welcome remarks.
Session 1
9:30am-10:40am
Chair: Gregory Valiant
  • Differentially Private Approximate Pattern Matching [video, paper]
    Teresa Anna Steiner (Technical University of Denmark)

  • Differentially Private Medians and Interior Points for Non-Pathological Data [video, paper]
    Rose Silver (Northeastern University), Maryam Aliakbarpour (Rice University), Thomas Steinke (Google Research) and Jonathan Ullman (Northeastern University)

  • General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation [video, paper]
    Aleksandar Nikolov (University of Toronto) and Haohua Tang (University of Toronto)

  • Advanced Composition Theorems for Differential Obliviousness [video, paper]
    Mingxun Zhou (Carnegie Mellon University), Mengshi Zhao (The University of Hong Kong), T-H. Hubert Chan (The University of Hong Kong) and Elaine Shi (Carnegie Mellon University)

  • Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine [video, paper]
    Clément Canonne (University of Sydney) and Yucheng Sun (ETH Zurich)

  • Distribution Testing with a Confused Collector [video, paper]
    Renato Ferreira Pinto Jr. (University of Waterloo) and Nathaniel Harms (EPFL)
10:40am- 11:10am Break (Coffee and Refreshments)
Session 2
11:10am-12:30pm
Chair: Jonathan Mosheiff
  • Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming [video, paper]
    Josh Alman (Columbia), Ethan Turok (Columbia), Hantao Yu (Columbia) and Hengzhi Zhang (Columbia)

  • Deterministic 3SUM-Hardness [video, paper]
    Nick Fischer (Weizmann Institute of Science), Piotr Kaliciak (Jagiellonian University) and Adam Polak (Max Planck Institute for Informatics)

  • The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds [video, paper]
    Karl Bringmann (Saarland University and Max-Planck-Institute for Informatics), Allan Grønlund (Aarhus University), Marvin Künnemann (RPTU Kaiserslautern-Landau) and Kasper Green Larsen (Aarhus University)

  • Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis [video, paper]
    Gregory Valiant (Stanford)

  • Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time [video, paper]
    Zhao Song (Adobe Research), Lichen Zhang (Massachusetts Institute of Technology) and Ruizhe Zhang (Simons Institute for the Theory of Computing)

  • Loss Minimization Yields Multicalibration for Large Neural Networks [video, paper]
    Jarosław Błasiok (Columbia University), Parikshit Gopalan (Apple), Lunjia Hu (Stanford University), Adam Tauman Kalai (Microsoft Research) and Preetum Nakkiran (Apple)

  • Rethinking Fairness for Human-AI Collaboration [video, paper]
    Haosen Ge (Wharton School, University of Pennsylvania), Hamsa Bastani (Wharton School, University of Pennsylvania) and Osbert Bastani (University of Pennsylvania)
12:30pm-2:00pm Lunch break (on your own).
Session 3
2:00pm-3:20pm
Chair: Ben Lee Volk
  • One-Way Functions vs. TFNP: Simpler and Improved [video, paper]
    Lukáš Folwarczný (Czech Academy of Sciences and Charles University), Mika Göös (EPFL), Pavel Hubáček (Czech Academy of Sciences and Charles University), Gilbert Maystre (EPFL) and Weiqiang Yuan (EPFL)

  • (Joint talk) Intersection Classes in TFNP and Proof Complexity [video, paper]
    Yuhao Li (Columbia), William Pires (Columbia) and Robert Robere (McGill)
    TFNP Intersections through the Lens of Feasible Disjunction [video, paper]
    Pavel Hubáček (Czech Academy of Sciences and Charles University), Erfan Khaniki (Czech Academy of Sciences and Charles University) and Neil Thapen (Czech Academy of Sciences)

  • Total NP Search Problems with Abundant Solutions [video, paper]
    Jiawei Li (University of Texas at Austin)

  • Lower Bounds for Planar Arithmetic Circuits [video, paper]
    Ramya C (Institute of Mathematical Sciences) and Pratik Shastri (Institute of Mathematical Sciences)

  • A VLSI Circuit Model Accounting for Wire Delay [video, paper]
    Nathaniel Young (Unaffiliated), Ce Jin (MIT) and Ryan Williams (MIT)

  • On Parallel Repetition of PCPs [video, paper]
    Alessandro Chiesa (EPFL), Ziyi Guan (EPFL) and Burcu Yildiz (EPFL)

  • Quantum Merlin-Arthur and proofs without relative phase [video, paper]
    Roozbeh Bassirian (University of Chicago), Bill Fefferman (University of Chicago) and Kunal Marwaha (University of Chicago)
3:20pm- 3:50pm Break (Coffee and Refreshments)
Session 4
3:50pm-5:00pm
Chair: Seth Pettie
  • Electrical Flows for Polylogarithmic Competitive Oblivious Routing [video, paper]
    Gramoz Goranci (University of Vienna), Monika Henzinger (IST Austria), Harald Räcke (Technical University Munich), Sushant Sachdeva (University of Toronto) and A. R. Sricharan (University of Vienna)

  • Spanning Adjacency Oracles in Sublinear Time [video, paper]
    Henry Fleischmann (University of Cambridge) and Greg Bodwin (University of Michigan)

  • On the Size Overhead of Pairwise Spanners [video, paper]
    Idan Shabat (Ben-Gurion University) and Ofer Neiman (Ben-Gurion University)

  • Color Fault-Tolerant Spanners [video, paper]
    Asaf Petruschka (Weizmann Institute), Shay Sapir (Weizmann Institute) and Elad Tzailk (Weizmann Institute)

  • Graph Threading [video, paper]
    Erik D. Demaine (MIT), Yael Kirkpatrick (MIT) and Rebecca Lin (MIT)

  • Are there graphs whose shortest path structure requires large edge weights? [video, paper]
    Aaron Bernstein (Rutgers University), Greg Bodwin (University of Michigan) and Nicole Wein (Simons Institute)
5:00pm-6:00pm Business Meeting and Reception

Wednesday, January 31st
9:00am- 9:30am Coffee and Check-in
Session 5
9:30am - 10:40am
Chair: Sami Davies
  • FPT Approximation for Capacitated Sum of Radii [video, paper]
    Ragesh Jaiswal (IIT Delhi), Amit Kumar (IIT Delhi) and Jatin Yadav (IIT Delhi)

  • Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions [video, paper]
    Arvind V. Mahankali (Stanford University), David P. Woodruff (Carnegie Mellon University) and Ziyu Zhang (Massachusetts Institute of Technology)

  • Exponential-time Approximation Schemes via Compression [video, paper]
    Tanmay Inamdar (University of Bergen), Madhumita Kundu (University of Bergen), Pekka Parviainen (University of Bergen), M. S. Ramanujan (University of Warwick) and Saket Saurabh (Institute of Mathematical Sciences)

  • Quickly Determining Who Won an Election [video, paper]
    Lisa Hellerstein (New York University), Naifeng Liu (University of Mannheim) and Kevin Schewior (University of Southern Denmark)

  • Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs [video, paper]
    Euiwoong Lee (University of Michigan) and Pasin Manurangsi (Google Research)

  • On the (in)approximability of Combinatorial Contracts [video, paper]
    Tomer Ezra (SLMath), Michal Feldman (Tel Aviv University) and Maya Schlesinger (Tel Aviv University)
10:40am- 11:10am Break (Coffee and Refreshments)
Session 6
11:10am-12:30pm
Chair: Adam Bouland
  • Quantum Money from Abelian Group Actions [video, paper]
    Mark Zhandry (NTT Research)

  • The Space-Time Cost of Purifying Quantum Computations [video, paper]
    Mark Zhandry (NTT Research)

  • Quantum Pseudoentanglement [video, paper]
    Scott Aaronson (University of Texas, Austin), Adam Bouland (Stanford University), Bill Fefferman (University of Chicago), Soumik Ghosh (University of Chicago), Umesh Vazirani (University of California, Berkeley), Chenyi Zhang (Stanford University) and Zixin Zhou (Stanford University)

  • Pseudorandom Strings from Pseudorandom Quantum States [video, paper]
    Prabhanjan Ananth (UC Santa Barbara), Yao-Ting Lin (UC Santa Barbara) and Henry Yuen (Columbia University)

  • Classical Verification of Quantum Learning [video, paper]
    Matthias C. Caro (California Institute of Technology, Freie Universität Berlin), Marcel Hinsche (Freie Universität Berlin), Marios Ioannou (Freie Universität Berlin), Alexander Nietner (Freie Universität Berlin) and Ryan Sweke (IBM Quantum)

  • Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle [video, paper]
    Xingjian Li (Tsinghua University), Qipeng Liu (UCSD), Angelos Pelecanos (UC Berkeley) and Takashi Yamakawa (NTT Social Informatics Laboratories)

  • A Qubit, a Coin, and an Advice String Walk Into a Relational Problem [video, paper]
    Scott Aaronson (UT Austin/OpenAI), Harry Buhrman (QuSoft/CWI/University of Amsterdam) and William Kretschmer (Simons Institute/UC Berkeley)
12:30pm- 2:00pm Lunch break (on your own).
Session 7
2:00pm- 3:20pm
Chair: Maryam Aliakbarpour
  • Testing Intersecting and Union-Closed Families [video, paper]
    Xi Chen (Columbia University), Anindya De (University of Pennsylvania), Yuhao Li (Columbia University), Shivam Nadimpalli (Columbia University) and Rocco A. Servedio (Columbia University)

  • Testing and Learning Convex Sets in the Ternary Hypercube [video, paper]
    Hadley Black (UCLA), Eric Blais (University of Waterloo) and Nathaniel Harms (EPFL)

  • Property Testing with Online Adversaries [video, paper]
    Omri Ben-Eliezer (Massachusetts Institute of Technology), Esty Kelman (Boston University and Massachusetts Institute of Technology), Uri Meir (Tel Aviv University) and Sofya Raskhodnikova (Boston University)

  • The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees [video, paper]
    Yi-Jun Chang (National University of Singapore)

  • The Message Complexity of Distributed Graph Optimization [video, paper]
    Fabien Dufoulon (University of Houston), Shreyas Pai (Aalto University), Gopal Pandurangan (University of Houston), Sriram V. Pemmaraju (University of Iowa) and Peter Robinson (Augusta University)

  • Time- and Communication-Efficient Overlay Network Construction via Gossip [video, paper]
    Fabien Dufoulon (University of Houston), Michael Moorman (University of Houston), William K. Moses Jr. (Durham University) and Gopal Pandurangan (University of Houston)

  • Dynamic Maximal Matching in Clique Networks [video, paper]
    Minming Li (City University of Hong Kong), Peter Robinson (Augusta University) and Xianbin Zhu (City University of Hong Kong)
3:20pm- 3:50pm Break (Coffee and Refreshments)
Session 8
3:50pm-5:00pm
Chair: Nicolas Resch
  • Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election [video, paper]
    Rex Fernando (CMU), Yuval Gelles (Hebrew University) and Ilan Komargodski (Hebrew University and NTT Research)

  • On The Black-Box Complexity of Correlation Intractability [video, paper]
    Nico Dottling (Helmholtz Center for Information Security (CISPA)) and Tamer Mour (Weizmann Institute for Science)

  • Homomorphic Indistinguishability Obfuscation and its Applications [video, paper]
    Kaartik Bhushan (Indian Institute of Technology, Mumbai), Venkata Koppula (Indian Institute of Technology, Delhi) and Manoj Prabhakaran (Indian Institute of Technology, Mumbai)

  • A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications [video, paper]
    Keller Blackwell (Stanford University) and Mary Wootters (Stanford University)

  • Pseudorandom Linear Codes are List-Decodable to Capacity [video, paper]
    Aaron (Louie) Putterman (Harvard University) and Edward Pyne (MIT)

  • Noisy decoding by shallow circuits with parities: classical and quantum [video, paper]
    Jop Briet (CWI), Harry Buhrman (CWI, University of Amsterdam), Davi Castro-Silva (CWI) and Niels M. P. Neumann (CWI, TNO)

Thursday, February 1st
9:00am- 9:30am Coffee and Check-in
Session 9
9:30am-10:40am
Chair: Noah Golowich
  • On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games [video, paper]
    Ioannis Anagnostides (Carnegie Mellon University), Alkis Kalavasis (Yale University), Tuomas Sandholm (Carnegie Mellon University) and Manolis Zampetakis (Yale University)

  • Winning without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round [video, paper]
    Melissa Dutz (Toyota Technological Institute at Chicago) and Avrim Blum (Toyota Technological Institute at Chicago)

  • Equivocal Blends: Prior Independent Lower Bounds [video, paper]
    Aleck Johnsen (Northwestern University) and Jason Hartline (Northwestern University)

  • Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints [video, paper]
    Rian Neogi (University of Waterloo), Kanstantsin Pashkovich (University of Waterloo) and Chaitanya Swamy (University of Waterloo)

  • Maximizing Miner Revenue in Transaction Fee Mechanism Design [video, paper]
    Ke Wu (CMU), Elaine Shi (CMU) and Hao Chung (Carnegie Mellon University)

  • A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers [video, paper]
    Jason Milionis (Columbia University), Ciamac C. Moallemi (Columbia University) and Tim Roughgarden (Columbia University / a16z crypto)
10:40am- 11:10am Break (Coffee and Refreshments)
Session 10
11:10am - 12:20pm
Chair: Venkatesan Guruswami
  • Best Student Paper: 🏆
    Distributional PAC-Learning from Nisan's Natural Proofs [video, paper]
    Ari Karchmer (Boston University)

  • Learning Arithmetic Circuits in the Presence of Noise: A General Framework and Applications to Unsupervised Learning [video, paper]
    Pritam Chandra (Microsoft Research), Ankit Garg (Microsoft Research India), Tanmay Sinha (Microsoft Research), Neeraj Kayal (Microsoft Research) and Kunal Mittal (Princeton University)

  • Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness [video, paper]
    Iddo Tzameret (Imperial College London) and Lu-Ming Zhang (London School of Economics)

  • The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False [video, paper]
    Noam Mazor (Cornell Tech) and Rafael Pass (Tel Aviv University & Cornell Tech)

  • Towards Stronger Depth Lower Bounds [video, paper]
    Gabriel Bathie (DI ENS, PSL Research University, and LaBRI, Université de Bordeaux) and Ryan Williams (MIT)

  • Proving Unsatisfiability with Hitting Formulas [video, paper]
    Yuval Filmus (Technion - Israel Institute of Technology, Haifa, Israel), Edward A. Hirsch (Ariel University, Ariel, Israel), Artur Riazanov (EPFL, Lausanne, Switzerland), Alexander Smal (Technion - Israel Institute of Technology, Haifa, Israel) and Marc Vinyals (University of Auckland, Auckland, New Zealand)
12:20pm- 2:10pm Graduating Bits and Pizza 🍕 🍕 🍕
Session 11
2:10pm-3:20pm
Chair: Venkatsan Guruswami
  • The Chromatic Number of Kneser Hypergraphs via Consensus Division [video, paper]
    Ishay Haviv (The Academic College of Tel Aviv-Yaffo)

  • On generalized corners and matrix multiplication [video, paper]
    Kevin Pratt (Carnegie Mellon University)

  • Small sunflowers and the structure of slice rank decompositions [video, paper]
    Thomas Karam (University of Oxford)

  • Discreteness of Asymptotic Tensor Ranks [video, paper]
    Jop Briet (CWI), Matthias Christandl (University of Copenhagen), Itai Leigh (Tel-Aviv University), Amir Shpilka (Tel-Aviv University) and Jeroen Zuiddam (University of Amsterdam)

  • Geometric Covering via Extraction Theorem [video, paper]
    Sayan Bandyapadhyay (Portland State University), Anil Maheshwari (Carleton University), Sasanka Roy (Indian Statistical Institute), Michiel Smid (Carleton University) and Kasturi Varadarajan (University of Iowa)

  • Modularity and graph expansion [video, paper]
    Baptiste Louf (CNRS Bordeaux), Colin McDiarmid (University of Oxford) and Fiona Skerman (Uppsala University)
3:20pm- 3:50pm Break (Coffee and Refreshments)
Session 12
3:50pm-5:00pm
Chair: Euiwoong Lee
  • An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio [video, paper]
    Mayank Goswami (Queens College, CUNY, New York) and Riko Jacob (IT University of Copenhagen)

  • Collective Tree Exploration via Potential Function Method [video, paper]
    Romain Cosson (Inria, Paris) and Laurent Massoulie (Inria, Paris)

  • Simple and Optimal Online Contention Resolution Schemes for $k$-Uniform Matroids [video, paper]
    Atanas Dinev (Massachusetts Institute of Technology) and S. Matthew Weinberg (Princeton University)

  • Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra [video, paper]
    Rajarshi Bhattacharjee (University of Massachusetts Amherst), Gregory Dexter (Purdue University), Cameron Musco (University of Massachusetts Amherst), Archan Ray (University of Massachusetts Amherst), Sushant Sachdeva (University of Toronto) and David P. Woodruff (Carnegie Mellon University)

  • A Combinatorial Approach to Robust PCA [video, paper]
    Weihao Kong (Google Research), Mingda Qiao (University of California, Berkeley) and Rajat Sen (Google Research)

  • Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions [video, paper]
    Justin Y. Chen (MIT), Piotr Indyk (MIT) and David P. Woodruff (Carnegie Mellon University)

Friday, February 2nd
9:00am- 9:30am Coffee and Check-in
Session 13
9:30am - 10:40am
Chair: Nicolas Resch
  • An improved protocol for ExactlyN with more than 3 players [video, paper]
    Lianna Hambardzumyan (Hebrew University of Jerusalem), Toniann Pitassi (Columbia University), Suhail Sherif (University of Lisbon), Morgan Shirley (University of Toronto) and Adi Shraibman (The Academic College of Tel Aviv-Yaffo)

  • Sampling, Flowers and Communication [video, paper]
    Huacheng Yu (Princeton University) and Wei Zhan (University of Chicago)

  • Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions [video, paper]
    Huacheng Yu (Princeton University) and Wei Zhan (University of Chicago)

  • New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification [video, paper]
    Prantar Ghosh (Georgetown University) and Vihan Shah (University of Waterloo)

  • Recursive Error Reduction for Regular Branching Programs [video, paper]
    Eshan Chattopadhyay (Cornell University) and Jyun-Jie Liao (Cornell University)

  • Extractors for polynomial sources over $F_2$ [video, paper]
    Eshan Chattopadhyay (Cornell University), Jesse Goodman (Cornell University) and Mohit Gurumukhani (Cornell University)
10:40am- 11:10am Break (Coffee and Refreshments)
Session 14
11:10am-12:30pm
Chair: Chaitanya Swamy
  • Communicating with Anecdotes [video, paper]
    Nika Haghtalab (UC Berkeley), Nicole Immorlica (Microsoft Research), Brendan Lucier (Microsoft Research), Markus Mobius (Microsoft Research) and Divyarthi Mohan (Tel Aviv University)

  • Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations [video, paper]
    Siddharth Barman (Indian Institute of Science), Anand Krishna (Indian Institute of Science), Pooja Kulkarni (University of Illinois Urbana-Champaign) and Shivika Narang (Indian Institute of Science)

  • Smooth Nash Equilibria: Algorithms and Complexity [video, paper]
    Constantinos Daskalakis (EECS, MIT), Noah Golowich (EECS, MIT), Nika Haghtalab (UC Berkeley) and Abhishek Shetty (UC Berkeley)

  • An Axiomatic Characterization of CFMMs and Equivalence to Prediction Markets [video, paper]
    Rafael Frongillo (U. Colorado, Boulder), Maneesha Papireddygari (University of Colorado, Boulder) and Bo Waggoner (U. Colorado, Boulder)

  • On the Complexity of Algorithms with Predictions for Dynamic Graph Problems [video, paper]
    Monika Henzinger (IST Austria), Barna Saha (University of California, San Diego), Martin P. Seybold (University of Vienna) and Christopher Ye (University of California, San Diego)

  • Making Progress Based on False Discoveries [video, paper]
    Roi Livni (Tel Aviv University)

  • Rumors with Changing Credibility [video, paper]
    Charlotte Out (University of Cambridge), Nicolas Rivera (Universidad de Valparaíso), Thomas Sauerwald (University of Cambridge) and John Sylvester (University of Liverpool)
12:30pm- 2:00pm Lunch break (on your own).
Session 15
2:00pm-3:20pm
Chair: Qipeng Liu
  • A Computational Separation Between Quantum No-cloning and No-telegraphing [paper]
    Barak Nehoran (Princeton University) and Mark Zhandry (NTT Research & Princeton University)

  • NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes [video, paper]
    Louis Golowich (UC Berkeley) and Tali Kaufman (Bar Ilan University)

  • Parity vs. AC0 with quantum preprocessing [video, paper]
    Joseph Slote (California Institute of Technology)

  • Quantum Event Learning and Gentle Random Measurements [video, paper]
    John Bostanci (Columbia University) and Adam Bene Watts (University of Waterloo)

  • Quantum and classical low-degree learning via a dimension-free Remez inequality [video, paper]
    Ohad Klein (Hebrew University), Joseph Slote (California Institute of Technology), Alexander Volberg (Michigan State University) and Haonan Zhang (University of South Carolina)

  • Fraud Detection for Random Walks [video, paper]
    Varsha Dani (Rochester Institute of Technology), Thomas P. Hayes (University at Buffalo), Seth Pettie (University of Michigan) and Jared Saia (University of New Mexico)

  • Kernelization of Counting Problems [video, paper]
    Daniel Lokshtanov (University of California Santa Barbara, USA), Pranabendu Misra (Chennai Mathematical Institute), Saket Saurabh (IMSc) and Meirav Zehavi (Ben-Gurion University of the Negev)
3:20pm- 3:50pm Break (Coffee and Refreshments)
Session 16
3:50pm-5:00pm
Chair: Venkata Gandikota
  • Influence Maximization in Ising Models [video, paper]
    Zongchen Chen (University at Buffalo) and Elchanan Mossel (MIT)

  • Two-State Spin Systems with Negative Interactions [video, paper]
    Yumou Fei (Peking University), Leslie Ann Goldberg (Department of Computer Science, University of Oxford) and Pinyan Lu (Shanghai University of Finance and Economics)

  • Tensor Reconstruction Beyond Constant Rank [video, paper]
    Shir Peleg (Tel Aviv University), Amir Shpilka (Tel-Aviv University) and Ben Lee Volk (Reichman University)

  • On the complexity of isomorphism problems for tensors, groups, and polynomials under the actions of classical groups [video, paper]
    Zhili Chen (University of Technology Sydney), Joshua Grochow (Departments of Computer Science and Mathematics, University of Colorado—Boulder, Boulder, CO 80309-0430, United States), Youming Qiao (Center for Quantum Software and Information, University of Technology, Ultimo NSW 2007, Australia), Gang Tang (University of Technology Sydney) and Chuanqi Zhang (University of Technology Sydney)

  • Determinants vs. Algebraic Branching Programs [video, paper]
    Abhranil Chatterjee (Indian Statistical Institute, Kolkata), Mrinal Kumar (TIFR Bombay) and Ben Lee Volk (Reichman University)

  • Homogeneous algebraic complexity theory and algebraic formulas [video, paper]
    Pranjal Dutta (School of Computing, National University of Singapore (NUS)), Fulvio Gesmundo (Saarland University), Christian Ikenmeyer (University of Warwick), Gorav Jindal (Max Planck Institute for Software Systems, Saarbrücken) and Vladimir Lysikov (Ruhr University Bochum)