Abstract is missing.
- Computational thinking in programming language and compiler design (keynote)Alfred V. Aho. 1 [doi]
- Climbing algorithms (invited talk)Leonid A. Levin. 2-3 [doi]
- A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros. 4 [doi]
- Chasing convex bodies with linear competitive ratio (invited paper)C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang. 5 [doi]
- Neural tangent kernel: convergence and generalization in neural networks (invited paper)Arthur Jacot, Franck Gabriel, Clément Hongler. 6 [doi]
- Simplicity creates inequity: implications for fairness, stereotypes, and interpretability (invited paper)Jon M. Kleinberg, Sendhil Mullainathan. 7 [doi]
- The ghost in the radiation: robust encodings of the black hole interior (invited paper)Isaac H. Kim, Eugene Tang, John Preskill. 8 [doi]
- A new analysis of differential privacy's generalization guarantees (invited paper)Christopher Jung 0001, Katrina Ligett, Seth Neel, Aaron Roth 0001, Saeed Sharifi-Malvajerdi, Moshe Shenfeld. 9 [doi]
- Load balancing guardrails: keeping your heavy traffic on the road to low response times (invited paper)Isaac Grosof, Ziv Scully, Mor Harchol-Balter. 10 [doi]
- Learnability can be independent of set theory (invited paper)Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff. 11 [doi]
- Log-concave polynomials in theory and applications (tutorial)Nima Anari, Cynthia Vinzant. 12 [doi]
- Statistical physics of random CSPs (tutorial)Nike Sun. 13 [doi]
- Discrepancy minimization via a self-balancing walkRyan Alweiss, Yang P. Liu, Mehtaab Sawhney. 14-20 [doi]
- Separating words and trace reconstructionZachary Chase 0001. 21-31 [doi]
- A (slightly) improved approximation algorithm for metric TSPAnna R. Karlin, Nathan Klein, Shayan Oveis Gharan. 32-45 [doi]
- The complexity of gradient descent: CLS = PPAD ∩ PLSJohn Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani. 46-59 [doi]
- Indistinguishability obfuscation from well-founded assumptionsAayush Jain, Huijia Lin, Amit Sahai. 60-73 [doi]
- Linear bandits with limited adaptivity and learning distributional optimal designYufei Ruan, Jiaqi Yang, Yuan Zhou 0007. 74-87 [doi]
- Efficiently learning halfspaces with Tsybakov noiseIlias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis. 88-101 [doi]
- Robust linear regression: optimal rates in polynomial timeAinesh Bakshi, Adarsh Prasad. 102-115 [doi]
- Statistical query complexity of manifold estimationEddie Aamari, Alexander Knop. 116-122 [doi]
- When is memorization of irrelevant training data necessary for high-accuracy learning?Gavin Brown, Mark Bun, Vitaly Feldman, Adam Smith, Kunal Talwar. 123-132 [doi]
- Sample-optimal and efficient learning of tree Ising modelsConstantinos Daskalakis, Qinxuan Pan. 133-146 [doi]
- Near-optimal learning of tree-structured distributions by Chow-LiuArnab Bhattacharyya 0001, Sutanu Gayen, Eric Price, N. V. Vinodchandran. 147-160 [doi]
- Learning Ising models from one or multiple samplesYuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Anthimos Vardis Kandiros. 161-168 [doi]
- A new coreset framework for clusteringVincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn. 169-182 [doi]
- Sample-efficient proper PAC learning with approximate differential privacyBadih Ghazi, Noah Golowich, Ravi Kumar 0001, Pasin Manurangsi. 183-196 [doi]
- Log-rank and lifting for AND-functionsAlexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan 0002. 197-208 [doi]
- Automating algebraic proof systems is NP-hardSusanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov 0001. 209-222 [doi]
- Strong co-nondeterministic lower bounds for NP cannot be proved feasiblyJán Pich, Rahul Santhanam. 223-233 [doi]
- Iterated lower bound formulas: a diagonalization-based approach to proof complexityRahul Santhanam, Iddo Tzameret. 234-247 [doi]
- New separations results for external informationMark Braverman, Dor Minzer. 248-258 [doi]
- [2] circuits via Edelstein-Kelly type theorem for quadratic polynomialsShir Peleg, Amir Shpilka. 259-271 [doi]
- An improved derandomization of the switching lemmaZander Kelley. 272-282 [doi]
- Simple and fast derandomization from very hard functions: eliminating randomness at almost no costLijie Chen 0001, Roei Tell. 283-291 [doi]
- Average-case hardness of NP from exponential worst-case hardness assumptionsShuichi Hirahara. 292-302 [doi]
- Pseudodeterministic algorithms and the structure of probabilistic timeZhenjian Lu, Igor Carboni Oliveira, Rahul Santhanam. 303-316 [doi]
- Vertex connectivity in poly-logarithmic max-flowsJason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai. 317-329 [doi]
- >t -free graphs in quasipolynomial timePeter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski. 330-341 [doi]
- Clan embeddings into trees, and low treewidth graphsArnold Filtser, Hung Le. 342-355 [doi]
- Tree embeddings for hop-constrained network designBernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. 356-369 [doi]
- Bridging the gap between tree and connectivity augmentation: unified and stronger approachesFederica Cecchetto, Vera Traub, Rico Zenklusen. 370-383 [doi]
- Deterministic mincut in almost-linear timeJason Li. 384-395 [doi]
- Support of closed walks and second eigenvalue multiplicity of graphsTheo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava. 396-407 [doi]
- Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forestsNima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant, Thuy Duong Vuong. 408-420 [doi]
- Breaking the quadratic barrier for matroid intersectionJoakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai. 421-432 [doi]
- Fractionally log-concave and sector-stable polynomials: counting planar matchings and moreYeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, Thuy Duong Vuong. 433-446 [doi]
- Adversarial laws of large numbers and optimal regret in online classificationNoga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev. 447-455 [doi]
- Stronger calibration lower bounds via sidesteppingMingda Qiao, Gregory Valiant. 456-466 [doi]
- Hardness of learning DNFs using halfspacesSuprovat Ghoshal, Rishi Saket. 467-480 [doi]
- Boosting simple learnersNoga Alon, Alon Gonen, Elad Hazan, Shay Moran. 481-489 [doi]
- Algorithmic foundations for the diffraction limitSitan Chen, Ankur Moitra. 490-503 [doi]
- VC dimension and distribution-free sample-based testingEric Blais, Renato Ferreira Pinto Jr., Nathaniel Harms. 504-517 [doi]
- Settling the robust learnability of mixtures of GaussiansAllen Liu, Ankur Moitra. 518-531 [doi]
- A theory of universal learningOlivier Bousquet, Steve Hanneke, Shay Moran, Ramon van Handel, Amir Yehudayoff. 532-541 [doi]
- Optimal testing of discrete distributions with high probabilityIlias Diakonikolas, Themis Gouleakis, Daniel M. Kane, John Peebles, Eric Price. 542-555 [doi]
- Information theoretic limits of cardinality estimation: Fisher meets ShannonSeth Pettie, Dingyu Wang. 556-569 [doi]
- Almost optimal super-constant-pass streaming lower bounds for reachabilityLijie Chen 0001, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song 0002, Huacheng Yu. 570-583 [doi]
- Robust testing of low dimensional functionsAnindya De, Elchanan Mossel, Joe Neeman. 584-597 [doi]
- Towards tight bounds for spectral sparsification of hypergraphsMichael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida. 598-611 [doi]
- Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemmaSepehr Assadi, Vishvajeet N. 612-625 [doi]
- Decremental all-pairs shortest paths in deterministic near-linear timeJulia Chuzhoy. 626-639 [doi]
- Improved dynamic algorithms for longest increasing subsequenceTomasz Kociumaka, Saeed Seddighin. 640-653 [doi]
- Fully dynamic approximation of LIS in polylogarithmic timePawel Gawrychowski, Wojciech Janczewski. 654-667 [doi]
- A framework for dynamic matching in weighted graphsAaron Bernstein, Aditi Dudeja, Zachary Langley. 668-681 [doi]
- Online stochastic matching, poisson arrivals, and the natural linear programZhiyi Huang, Xinkai Shu. 682-693 [doi]
- Continuous LWEJoan Bruna, Oded Regev 0001, Min Jae Song, Yi Tang. 694-707 [doi]
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWERuta Jawale, Yael Tauman Kalai, Dakshita Khurana, Rachel Zhang. 708-721 [doi]
- Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexityYanyi Liu, Rafael Pass. 722-735 [doi]
- Indistinguishability obfuscation from circular securityRomain Gay, Rafael Pass. 736-749 [doi]
- Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)Justin Holmgren, Alex Lombardi, Ron D. Rothblum. 750-760 [doi]
- Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemmaLijie Chen 0001, Xin Lyu. 761-771 [doi]
- Kronecker products, low-depth circuits, and matrix rigidityJosh Alman. 772-785 [doi]
- Lower bounds for monotone arithmetic circuits via communication complexityArkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay. 786-799 [doi]
- Structure vs. randomness for bilinear mapsAlex Cohen, Guy Moshkovitz. 800-808 [doi]
- Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuitsVishwas Bhargava, Shubhangi Saraf, Ilya Volkovich. 809-822 [doi]
- A faster algorithm for solving general LPsShunhua Jiang, Zhao Song 0002, Omri Weinstein, Hengjie Zhang. 823-832 [doi]
- Combinatorial Bernoulli factories: matchings, flows, and other polytopesRad Niazadeh, Renato Paes Leme, Jon Schneider. 833-846 [doi]
- Capacity lower bounds via productizationLeonid Gurvits, Jonathan Leake. 847-858 [doi]
- 1-regression in nearly linear time for dense instancesJan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song 0002, Di Wang. 859-869 [doi]
- A framework for quadratic form maximization over convex sets through nonconvex relaxationsVijay Bhattiprolu, Euiwoong Lee, Assaf Naor. 870-881 [doi]
- The randomized communication complexity of randomized auctionsAviad Rubinstein, Junyao Zhao. 882-895 [doi]
- Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimizationOren Mangoubi, Nisheeth K. Vishnoi. 896-909 [doi]
- Contextual search in the presence of irrational agentsAkshay Krishnamurthy, Thodoris Lykouris, Chara Podimata, Robert E. Schapire. 910-918 [doi]
- How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm designMaria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik. 919-932 [doi]
- The communication complexity of payment computationShahar Dobzinski, Shiri Ron. 933-946 [doi]
- Exponential communication separations between notions of selfishnessAviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao. 947-960 [doi]
- 2) volume algorithmHe Jia, Aditi Laddha, Yin Tat Lee, Santosh S. Vempala. 961-974 [doi]
- A new algorithm for Euclidean shortest paths in the planeHaitao Wang. 975-988 [doi]
- Stronger bounds for weak epsilon-nets in higher dimensionsNatan Rubin. 989-1002 [doi]
- Dynamic planar point location in optimal timeYakov Nekrich. 1003-1014 [doi]
- When is approximate counting for conjunctive queries tractable?Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros. 1015-1027 [doi]
- Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spacesYair Bartal, Lee-Ad Gottlieb. 1028-1041 [doi]
- ε)-approximation algorithm for preemptive weighted flow time on a single machineLars Rohwedder, Andreas Wiese. 1042-1055 [doi]
- ε)-approximation for planar sparsest cutVincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li 0006. 1056-1069 [doi]
- Flow time scheduling with uncertain processing timeYossi Azar, Stefano Leonardi, Noam Touitou. 1070-1080 [doi]
- The limits of pan privacy and shuffle privacy for learning and estimationAlbert Cheu, Jonathan R. Ullman. 1081-1094 [doi]
- Outcome indistinguishabilityCynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona. 1095-1108 [doi]
- Optimal labelling schemes for adjacency, comparability, and reachabilityMarthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott. 1109-1117 [doi]
- Bipartite perfect matching as a real polynomialGal Beniamini, Noam Nisan. 1118-1131 [doi]
- Efficient and near-optimal algorithms for sampling connected subgraphsMarco Bressan 0002. 1132-1143 [doi]
- Distributed weighted min-cut in nearly-optimal timeMichal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai. 1144-1153 [doi]
- A deterministic algorithm for the MST problem in constant rounds of congested cliqueKrzysztof Nowicki 0002. 1154-1165 [doi]
- Universally-optimal distributed algorithms for known topologiesBernhard Haeupler, David Wajc, Goran Zuzic. 1166-1179 [doi]
- Efficient randomized distributed coloring in CONGESTMagnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan. 1180-1193 [doi]
- The communication complexity of multiparty set disjointness under product distributionsNachum Dershowitz, Rotem Oshman, Tal Roth. 1194-1207 [doi]
- Hop-constrained oblivious routingMohsen Ghaffari, Bernhard Haeupler, Goran Zuzic. 1208-1220 [doi]
- Efficient randomized DCASGeorge Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel. 1221-1234 [doi]
- Optimal error resilience of adaptive message exchangeKlim Efremenko, Gillat Kol, Raghuvansh R. Saxena. 1235-1247 [doi]
- How asymmetry helps buffer management: achieving optimal tail size in cup gamesWilliam Kuszmaul. 1248-1261 [doi]
- Load balancing with dynamic set of balls and binsAnders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup. 1262-1275 [doi]
- n) barrier for Quantum LDPC codesMatthew B. Hastings, Jeongwan Haah, Ryan O'Donnell. 1276-1288 [doi]
- An optimal separation of randomized and Quantum query complexityAlexander A. Sherstov, Andrey A. Storozhenko, Pei Wu. 1289-1302 [doi]
- k-forrelation optimally separates Quantum and classical query complexityNikhil Bansal, Makrand Sinha. 1303-1316 [doi]
- n) distanceTali Kaufman, Ran J. Tessler. 1317-1329 [doi]
- Degree vs. approximate degree and Quantum implications of Huang's sensitivity theoremScott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal. 1330-1342 [doi]
- Eliminating intermediate measurements in space-bounded Quantum computationBill Fefferman, Zachary Remscrim. 1343-1356 [doi]
- (Sub)Exponential advantage of adiabatic Quantum computation with no sign problemAndrás Gilyén, Matthew B. Hastings, Umesh Vazirani. 1357-1369 [doi]
- Succinct blind Quantum computation using a random oracleJiayu Zhang. 1370-1383 [doi]
- Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with applications to Quantum inference and differential privacyJonathan Leake, Colin S. McSwiggen, Nisheeth K. Vishnoi. 1384-1397 [doi]
- Improved Quantum data analysisCostin Badescu, Ryan O'Donnell. 1398-1411 [doi]
- Approximating Nash social welfare under rado valuationsJugal Garg, Edin Husic, László A. Végh. 1412-1425 [doi]
- Settling the complexity of Nash equilibrium in congestion gamesYakov Babichenko, Aviad Rubinstein. 1426-1437 [doi]
- Revelation gap for pricing from samplesYiding Feng, Jason D. Hartline, Yingkai Li. 1438-1451 [doi]
- Efficient two-sided markets with limited informationPaul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser. 1452-1465 [doi]
- The complexity of constrained min-max optimizationConstantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis. 1466-1478 [doi]
- On codes decoding a constant fraction of errors on the BSCJan Hazla, Alex Samorodnitsky, Ori Sberlo. 1479-1488 [doi]
- Decoding multivariate multiplicity codes on product setsSiddharth Bhandari, Prahladh Harsha, Mrinal Kumar 0001, Madhu Sudan. 1489-1501 [doi]
- Efficient list-decoding with constant alphabet and list sizesZeyu Guo, Noga Ron-Zewi. 1502-1515 [doi]
- Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacityRonen Shaltiel, Jad Silbak. 1516-1526 [doi]
- Near-linear time decoding of Ta-Shma's codes via splittable regularityFernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani. 1527-1536 [doi]
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansionZongchen Chen, Kuikui Liu, Eric Vigoda. 1537-1550 [doi]
- dAntonio Blanca, Pietro Caputo, Daniel Parisi, Alistair Sinclair, Eric Vigoda. 1551-1564 [doi]
- Sampling constraint satisfaction solutions in the local lemma regimeWeiming Feng, Kun He 0011, Yitong Yin. 1565-1578 [doi]
- Frozen 1-RSB structure of the symmetric Ising perceptronWill Perkins, Changji Xu. 1579-1588 [doi]
- o(1))Δ-colorings in graphsVishesh Jain, Ashwin Sah, Mehtaab Sawhney. 1589-1600 [doi]
- 2/3k) gapRoy Schwartz 0002, Nitzan Tur. 1601-1614 [doi]
- Optimal inapproximability of satisfiable k-LIN over non-abelian groupsAmey Bhangale, Subhash Khot. 1615-1628 [doi]
- Playing unique games on certified small-set expandersMitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer. 1629-1642 [doi]
- Expander random walks: a Fourier-analytic approachGil Cohen, Noam Peri, Amnon Ta-Shma. 1643-1655 [doi]
- Local concentration inequalities and Tomaszewski's conjectureNathan Keller, Ohad Klein. 1656-1669 [doi]
- Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectorsJesper Nederlof, Karol Wegrzycki. 1670-1683 [doi]
- Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH)Ray Li. 1684-1696 [doi]
- Tight conditional lower bounds for approximating diameter in directed graphsMina Dalirrooyfard, Nicole Wein. 1697-1710 [doi]
- Sparse nonnegative convolution is equivalent to dense nonnegative convolutionKarl Bringmann, Nick Fischer, Vasileios Nakos. 1711-1724 [doi]
- Subcubic algorithms for Gomory-Hu tree in unweighted graphsAmir Abboud, Robert Krauthgamer, Ohad Trabelsi. 1725-1737 [doi]
- n - 1 max-flowsJason Li, Debmalya Panigrahi. 1738-1748 [doi]
- Constant approximating k-clique is w[1]-hardBingkai Lin. 1749-1756 [doi]
- Vertex deletion parameterized by elimination distance and even lessBart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk 0001. 1757-1769 [doi]
- A full complexity dichotomy for immanant familiesRadu Curticapean. 1770-1783 [doi]
- A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central pathSally Dong, Yin Tat Lee, Guanghao Ye. 1784-1797 [doi]