default search action
7th SOSA 2024, Alexandria, VA, USA
- Merav Parter, Seth Pettie:
2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024. SIAM 2024, ISBN 978-1-61197-793-6 - Gary Hoppenworth:
Simple Linear-Size Additive Emulators. 1-8 - Phevos Paschalidis, Ashley Zhuang:
Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem. 9-18 - Ce Jin, Virginia Vassilevska Williams, Renfei Zhou
:
Listing 6-Cycles. 19-27 - Timothy M. Chan, Yinzhan Xu:
Simpler Reductions from Exact Triangle. 28-38 - Greg Bodwin:
An Alternate Proof of Near-Optimal Light Spanners. 39-55 - Qizheng He
Simple and Faster Algorithms for Knapsack. 56-62 - Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. 63-81 - Sven Jäger
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs. 82-96 - Pavel E. Kalugin, Maksim S. Nikolaev:
The greedy algorithm for the Shortest Common Superstring problem is a ½-approximation in terms of compression: a simple proof. 97-99 - Benjamin Moseley, Heather Newman, Kirk Pruhs:
The Public University Secretary Problem. 100-106 - Qizheng He
Improved Algorithms for Integer Complexity. 107-114 - Alexander S. Kulikov, Ivan Mihajlin:
If Edge Coloring is Hard under SETH, then SETH is False. 115-120 - Ewin Tang, Kevin Tian:
A CS guide to the quantum singular value transformation. 121-143 - Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Computations are Verifiable. 144-150 - Nikhil Balaji
USSR is in P/poly. 151-159 - Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini:
Simple and tight complexity lower bounds for solving Rabin games. 160-167 - Justin Dallant, Frederik Haagensen
Finding the saddlepoint faster than sorting. 168-178 - Shyan Akmal:
An Enumerative Perspective on Connectivity. 179-198 - Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Sorting Signed Permutations by Reversals in Nearly-Linear Time. 199-214 - Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. 215-223 - Majid Daliri, Juliana Freire, Christopher Musco, Aécio S. R. Santos, Haoxiang Zhang:
Simple Analysis of Priority Sampling. 224-229 - Vaggos Chatziafratis, Piotr Indyk:
Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. 230-243 - Sariel Har-Peled, Elfarouk Harb:
Revisiting Random Points: Combinatorial Complexity and Algorithms. 244-268 - Jinxiang Gan, Mordecai J. Golin:
Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. 269-278 - Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. 279-285 - Ahmed Abdelkader, David M. Mount:
Convex Approximation and the Hilbert Geometry. 286-298 - Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. 299-305 - Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
SSD Wear Leveling with Optimal Guarantees. 306-320 - Rajan Udwani:
When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching. 321-330 - Joakim Blikstad
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. 331-336 - Sepehr Assadi:
A Simple (1 - ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. 337-354 - Nate Veldt:
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. 355-362 - Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul:
Modern Hashing Made Simple. 363-373 - Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. 374-382 - Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza:
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. 383-395 - Chandra Chekuri, Junkai Song, Weizhong Zhang:
Contention Resolution for the ℓ-fold union of a matroid via the correlation gap. 396-405 - Clément L. Canonne, Joy Qiping Yang:
Simpler Distribution Testing with Little Memory. 406-416
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.
last updated on 2024-11-22 19:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: