Paper titles and author information appears as submitted.
Paper title and author changes will not be made to this page. The online program will reflect the most up-to-date presentation details, and is scheduled for posting in November.
Reducing 3SUM to Convolution-3SUM
Timothy M. Chan and Qizheng He
On the Change-Making Problem
Timothy M. Chan and Qizheng He
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique
Timothy M. Chan
Multiplicative Rank-1 Approximation using Length-Squared Sampling
Ragesh Jaiswal and Amit Kumar
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization
Kent Quanrud
Simple Label-Correcting Algorithms for Partially-Dynamic Approximate Shortest Paths in Directed Graphs
Adam Karczmarz and Jakub Łącki
Adaptive Discrete Phase Retrieval
Xian Wu, Moses Charikar and Yinyu Ye
One (more) line on the most Ancient Algorithm in History
Bruno Grenet and Ilya Volkovich
Distributed Backup Placement in One-Round and its Applications to Maximum Matching Approximation and Self-Stabilization
Leonid Barenboim and Gal Oren
Fast Fourier Sparsity Testing
Grigory Yaroslavtsev and Samson Zhou
On a Decentralized $(\Delta +1)$-Graph Coloring Algorithm
Deeparnab Chakrabarty and Paul de Supinski
Bucket Sort: A Simple Oblivious Sort
Gilad Asharov, T-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren and Elaine Shi
Distributionally Robust Max Flows
Louis Chen, Will Ma, James Orlin and David Simchi-Levi
A Short Proof of the Toughness of Delaunay Triangulations
Ahmad Biniaz
Quantum Approximate Counting, Simplified
Scott Aaronson and Patrick Rall