 |
An open access journal in theoretical computer science |
Coming soon
- Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. Sophie Huiberts ; Yin Tat Lee ; Xinzhi Zhang (Accepted on: 2025-09-01)
- Simple Sublinear Algorithms for $(\Delta+1)$ Vertex Coloring via Asymmetric Palette Sparsification. Sepehr Assadi ; Helia Yazdanyar (Accepted on: 2025-09-01)
- Optimal Padded Decomposition For Bounded Treewidth Graphs. Arnold Filtser ; Tobias Friedrich ; Davis Issac ; Nikhil Kumar ; Hung Le ; Nadym Mallek ; Ziena Zeif (Accepted on: 2025-08-17)
- 3SUM in Preprocessed Universes: Faster and Simpler. Shashwat Kasliwal ; Adam Polak ; Pratyush Sharma (Accepted on: 2025-08-11)
- Directed Acyclic Outerplanar Graphs Have Constant Stack Number. Paul Jungeblut ; Laura Merker ; Torsten Ueckerdt (Accepted on: 2025-07-26)
- Randomized Communication and Implicit Graph Representations. Nathaniel Harms ; Sebastian Wild ; Viktor Zamaraev (Accepted on: 2025-07-18)
- Determinantal Sieving. Eduard Eiben ; Tomohiro Koana ; Magnus Wahlström (Accepted on: 2025-06-29)
- Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Siddharth Bhandari ; Prahladh Harsha ; Mrinal Kumar ; Ashutosh Shankar (Accepted on: 2025-05-23)