References

Ueber einige Aufgaben der Analysis situs

Otto Toeplitz · 1911 · misc

Verhandlungen der Schweizerischen Naturforschenden Gesellschaft in Solothurn 94 (1911), 197.

A Survey on the Square Peg Problem

Benjamin Matschke · 2014 · misc

Notices of the American Mathematical Society 61 (2014), no. 4, 346–352.

On the Square Peg Problem

Gregory R. Chambers · 2025 · misc

Discrete and Computational Geometry 73 (2025), 1144–1153.

Einige Bemerkungen über das Minkowskische Flächenmaß

Martin Kneser · 1955 · misc

Archiv der Mathematik 6 (1955), 382–390.

On the Volume of the Union of Balls

Balázs Csikós · 1998 · misc

Discrete and Computational Geometry 20 (1998), 449–461.

Pushing disks apart–-the Kneser–Poulsen conjecture in the plane

Károly Bezdek and Robert Connelly · 2002 · misc

Journal für die reine und angewandte Mathematik 553 (2002), 221–236.

Selected topics from the theory of intersections of balls

Károly Bezdek and Zsolt Lángi and Márton Naszódi · 2026 · misc

Discrete Applied Mathematics 382 (2026), 60–82.

Ovals in a Finite Projective Plane

Beniamino Segre · 1955 · misc

Canadian Journal of Mathematics 7 (1955), 414–416.

On sets of vectors of a finite vector space in which every subset of basis size is a basis

Simeon Ball · 2012 · misc

Journal of the European Mathematical Society 14 (2012), 733–748.

On sets of vectors of a finite vector space in which every subset of basis size is a basis II

Simeon Ball and Jan De Beule · 2012 · misc

Designs, Codes and Cryptography 65 (2012), 5–14.

The Maximal Length of $q$-ary MDS Elliptic Codes Is Close to $q-2$

Dongchun Han and Yuan Ren · 2024 · misc

International Mathematics Research Notices 2024, no. 11, 9036–9043.

The Complexity of Stochastic Games

Anne Condon · 1992 · misc

Information and Computation 96 (1992), 203–224.

A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem

Walter Ludwig · 1995 · misc

Information and Computation 117 (1995), 151–155.

Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level

Bernd Gärtner and Sebastian Haslebacher and Hung P. Hoang · 2026 · misc

13th International Conference on Fun with Algorithms, LIPIcs 366 (2026), article 19, 19:1–19:16.

Relations between average case complexity and approximation complexity

Uriel Feige · 2002 · misc

Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 534–543.

Easily refutable subformulas of large random 3CNF formulas

Uriel Feige and Eran Ofek · 2007 · misc

Theory of Computing 3 (2007), 25–43.

Graph expansion and the Unique Games Conjecture

Prasad Raghavendra and David Steurer · 2010 · misc

Proceedings of the 42nd ACM Symposium on Theory of Computing, 755–764.

Reductions Between Expansion Problems

Prasad Raghavendra and David Steurer and Madhur Tulsiani · 2012 · misc

Proceedings of the 27th IEEE Conference on Computational Complexity, 64–73.

Subexponential Algorithms for Unique Games and Related Problems

Sanjeev Arora and Boaz Barak and David Steurer · 2015 · misc

Journal of the ACM 62 (2015), no. 5, article 42, 1–25.

Integer-making theorems

Jozsef Beck and Tibor Fiala · 1981 · misc

Discrete Applied Mathematics 3 (1981), 1–8.

Balancing vectors and Gaussian measures of $n$-dimensional convex bodies

Wojciech Banaszczyk · 1998 · misc

Random Structures and Algorithms 12 (1998), 351–360.

Decoupling via affine spectral-independence: Beck–Fiala and Komlos bounds beyond Banaszczyk

Nikhil Bansal and Haotian Jiang · 2025 · misc

arXiv:2508.03961v2.

Online Beck–Fiala down to logarithmic sparsity

Dylan J. Altschuler and Konstantin Tikhomirov · 2026 · misc

arXiv:2607.14238; extends the offline conjecture to sparsity at least $\log(T)^1+o(1)$ and proves an online prefix-discrepancy result.

Ten Lectures on the Probabilistic Method

Joel Spencer · 1994 · misc

Second edition, CBMS-NSF Regional Conference Series in Applied Mathematics 64, SIAM.

An algorithm for Komlos conjecture matching Banaszczyk's bound

Nikhil Bansal and Daniel Dadush and Shashwat Garg · 2016 · misc

Proceedings of FOCS 2016, 788–799.

The nonexistence of certain finite projective planes

Richard H. Bruck and Herbert J. Ryser · 1949 · misc

Canadian Journal of Mathematics 1 (1949), 88–93.

Competitive algorithms for server problems

Mark S. Manasse and Lyle A. McGeoch and Daniel D. Sleator · 1990 · misc

Journal of Algorithms 11 (1990), 208–230.

On the $k$-server conjecture

Elias Koutsoupias and Christos H. Papadimitriou · 1995 · misc

Journal of the ACM 42 (1995), 971–983.

Online Computation and Competitive Analysis

Allan Borodin and Ran El-Yaniv · 1998 · misc

Cambridge University Press.

Quantum NP–-a survey

Dorit Aharonov and Tomer Naveh · 2002 · misc

arXiv:quant-ph/0210077.

Quantum versus classical proofs and advice

Scott Aaronson and Greg Kuperberg · 2007 · misc

Theory of Computing 3 (2007), 129–157.

Separating QMA from QCMA with a classical oracle

John Bostanci and Jonas Haferkamp and Chinmay Nirkhe and Mark Zhandry · 2026 · misc

arXiv:2511.09551; STOC 2026.

Separating quantum and classical advice with good codes

John Bostanci and Andrew Huang and Vinod Vaikuntanathan · 2026 · misc

arXiv:2602.09385; gives a simpler classical-oracle separation of QMA and QCMA.

Deciding the winner in parity games is in UP intersect co-UP

Marcin Jurdzinski · 1998 · misc

Information Processing Letters 68 (1998), 119–124.

Deciding parity games in quasipolynomial time

Cristian S. Calude and Sanjay Jain and Bakhadyr Khoussainov and Wei Li and Frank Stephan · 2017 · misc

Proceedings of STOC 2017, 252–263; journal version DOI 10.1137/17M1145288.

Attractors is all you need: parity games in polynomial time

Rick van der Heijden · 2025 · misc

arXiv:2511.03752; a full claim whose key correctness argument is incomplete.

Statistical Treatment of Polymer Solutions at Infinite Dilution

Orr, W. J. C. · 1947 · article

Exact Critical Point and Critical Exponents of O(n) Models in Two Dimensions

Nienhuis, Bernard · 1982 · article

Self-Avoiding Walks

Slade, Gordon · 2019 · article

First-Passage Percolation, Subadditive Processes, Stochastic Networks, and Generalized Renewal Theory

Hammersley, J. M. and Welsh, D. J. A. · 1965 · incollection

50 Years of First-Passage Percolation

Auffinger, Antonio and Damron, Michael and Hanson, Jack · 2017 · book

Sublinear Variance in First-Passage Percolation for General Distributions

Damron, Michael and Hanson, Jack and Sosoe, Philippe · 2015 · article

On the Liapounoff Limit of Error in the Theory of Probability

Esseen, Carl-Gustav · 1942 · article

On the Absolute Constants in the Berry–Esseen Inequality and Its Structural and Nonuniform Improvements

Shevtsova, Irina G. · 2013 · article

On the Nonuniform Berry–Esseen Bound

Pinelis, Iosif · 2017 · incollection

A Gaussian Inequality for Expected Absolute Products

Li, Wenbo V. and Wei, Ang · 2012 · article

Three-Dimensional Gaussian Product Inequality with Positive Integer Order Moments

Kim, Bara and Kim, Jeongsim and Kim, Jerim · 2025 · article

Towards a Genuinely Polynomial Algorithm for Linear Programming

Megiddo, Nimrod · 1983 · article