 |
An open access journal in theoretical computer science |
Coming soon
- Improved Hardness Results for Learning Intersections of Halfspaces. Stefan Tiegel (Accepted on: 2025-10-06)
- Deterministic approximate counting of colorings with fewer than $2\Delta$ colors via absence of zeros. Ferenc Bencs ; Khallil Berrekkal ; Guus Regts (Accepted on: 2025-09-29)
- Protocols for Quantum Weak Coin Flipping. Atul Singh Arora ; Jérémie Roland ; Chrysoula Vlachou ; Stephan Weis (Accepted on: 2025-09-16)
- 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)
- 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)
- Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Siddharth Bhandari ; Prahladh Harsha ; Mrinal Kumar ; Ashutosh Shankar (Accepted on: 2025-05-23)