default search action
3rd SOSA 2020: Salt Lake City, UT, USA
- Martin Farach-Colton, Inge Li Gørtz:
3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020. SIAM 2020, ISBN 978-1-61197-601-4 - Front Matter. 1-2
- Timothy M. Chan, Qizheng He:
Reducing 3SUM to Convolution-3SUM. 1-7 - Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. 8-14 - Bruno Grenet, Ilya Volkovich:
One (more) line on the most Ancient Algorithm in History. 15-17 - Ragesh Jaiswal, Amit Kumar:
Multiplicative Rank-1 Approximation using Length-Squared Sampling. 18-23 - Scott Aaronson, Patrick Rall:
Quantum Approximate Counting, Simplified. 24-32 - Timothy M. Chan:
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. 33-37 - Timothy M. Chan, Qizheng He:
On the Change-Making Problem. 38-42 - Ahmad Biniaz:
A Short Proof of the Toughness of Delaunay Triangulations. 43-46 - Moses Charikar, Xian Wu, Yinyu Ye:
Adaptive Discrete Phase Retrieval. 47-56 - Grigory Yaroslavtsev, Samson Zhou:
Fast Fourier Sparsity Testing. 57-68 - Kent Quanrud:
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. 69-80 - Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi:
Distributionally Robust Max Flows. 81-90 - Deeparnab Chakrabarty, Paul de Supinski:
On a Decentralized (Δ+1)-Graph Coloring Algorithm. 91-98 - Leonid Barenboim, Gal Oren:
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. 99-105 - Adam Karczmarz, Jakub Lacki:
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. 106-120
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.