default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th SOSA 2026: Vancouver, BC, Canada
- Sepehr Assadi, Eva Rotenberg:
2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026. SIAM 2026, ISBN 978-1-61197-896-4 - Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson:
The Road to the Closest Point is Paved by Good Neighbors. 1-11 - Hugo A. Akitaya, Kyle Dituro, Andrei Gonczi, Matias Korman, Diane L. Souvaine, Frederick Stock, Csaba D. Tóth:
Redistricting in Triangular and Square Grids. 12-25 - Luca Castelli Aleardi, Giselle Feng, Éric Fusy:
A simple Schnyder drawing algorithm for cylindric and toroidal triangulations, with grid size O(n)×O(n). 26-42 - Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst, Tim Ophelders:
Computing the Fréchet Distance When Just One Curve is c-Packed: A Simple Almost-Tight Algorithm. 43-55 - Sebastian Haslebacher, Jonas Lill:
A Levelset Algorithm for 3D-Tarski. 56-64 - Ajaykrishnan E. S.
, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan:
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs. 65-80 - Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi:
Trading Prophets with Initial Capital. 81-90 - Rishi Gujjar, Kevin Hua, Robert Kleinberg, Frederick V. Qiu:
The k-Fold Matroid Secretary Problem. 91-99 - Zongbo Bao, Yuxuan Liu, Penghui Yao, Zekun Ye, Jialin Zhang:
Efficient Non-Adaptive Quantum Algorithms for Tolerant Junta Testing. 100-126 - Pranav Nuti, Peter Westbrook:
Static Pricing for Single Sample Multi-unit Prophet Inequalities. 127-141 - Vinayak M. Kumar:
Most Juntas Saturate the Hardcore Lemma. 142-150 - Feyza Duman Keles, Lisa Hellerstein, Kunal Marwaha, Christopher Musco, Xinchen Yang:
An Exact Algorithm for the Unanimous Vote Problem. 151-169 - Felix Zhou:
Continual Release of Densest Subgraphs: Privacy Amplification & Sublinear Space via Subsampling. 170-191 - Surendra Ghentiyala:
Efficient derandomization of differentially private counting queries. 192-215 - Gabriel Cipriani Huete, Adithya Diddapur, Pavel Dvorák, Christian Konrad:
Semi-Robust Communication Complexity of Maximum Matching. 216-228 - Pachara Sawettamalya, Huacheng Yu:
A (Very) Nearly Optimal Sketch for k-Edge Connectivity Certificates. 229-240 - Mina Dalirrooyfard, Konstantin Makarychev, Slobodan Mitrovic:
A Simple Average-case Analysis of Recursive Randomized Greedy MIS. 241-246 - Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, Suguru Tamaki:
A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT. 247-253 - Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher:
A Novel Reduction from #SAT to #2SAT Based on Symmetry: Simply Drop the Large Clauses. 254-265 - Pasin Manurangsi, Raghu Meka:
Tight Lower Bound for Multicolor Discrepancy. 266-274 - Greg Bodwin, Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
Simple Length-Constrained Expander Decompositions. 275-290 - Daniel Lokshtanov, Saket Saurabh, Jie Xue:
The Sparsification Lemma via Measure and Conquer. 291-297 - Guozhen Rong, Biao Yuan, Yongjie Yang, Zhen Zhang:
A Linear-Time Algorithm for the MCS End-Vertex Problem on Chordal Graphs: A Bonus-Driven Search Strategy. 298-311 - Jevgenijs Vihrovs:
Quantum Search on Computation Trees. 312-327 - Cornelius Brand, Radu Curticapean, Baitian Li, Kevin Pratt:
Faster Convolutions: Yates and Strassen Revisited. 328-339 - Chris Camaño, Raphael A. Meyer, Kevin Shu:
Debiasing Polynomial and Fourier Regression. 340-351 - Kevin Pratt:
A note on Ordered Ruzsa-Szemerédi graphs. 352-354 - Debarati Das, Evangelos Kipouridis, Joachim Spoerhase:
Tree Violation Distance under Constraints. 355-364 - Chirag Pabbaraju, Gregory Valiant, Rishi Verma:
A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses. 365-384 - Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak:
Reducing Shortcut and Hopset Constructions to Shallow Graphs. 385-393 - Yotam Kenneth-Mordoch, Robert Krauthgamer:
Simple Algorithms for Fully Dynamic Edge Connectivity. 394-403 - Shuyi Yan:
Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles. 404-412 - Olivier Fischer, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai:
Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs. 413-420 - Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild:
Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space. 421-430 - Solon P. Pissis:
Maximal Palindromes in MPC: Simple and Optimal. 431-437 - Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu:
A Simple Analysis of Ranking in General Graphs. 438-443 - Anupam Gupta, Marco Molinaro, Matteo Russo:
A Learning Perspective on Random-Order Covering Problems. 444-462 - Stephen Arndt, Benjamin Moseley, Kirk Pruhs, Marc Uetz:
Competitive Online Transportation Simplified. 463-471 - Vamsi Addanki, Julien Dallot, Leon Kellerhals, Maciej Pacut, Stefan Schmid:
The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof. 472-475 - Solon P. Pissis:
Text Indexing and Pattern Matching with Ephemeral Edits. 476-491 - Nate Veldt:
A Simple and Fast (3 + ε)-approximation for Constrained Correlation Clustering. 492-511 - Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen:
Unsplittable Cost Flows from Unweighted Error-Bounded Variants. 512-523 - Morteza Alimi, Niklas Dahlmeier, Tobias Mömke, Philipp Pabst, Laura Vargas Koch:
Approximating Graphic Multi-Path TSP and Graphic Ordered TSP. 524-537 - Anand Louis, Rameesh Paul:
No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs. 538-550 - Ilya Volkovich:
Yet Another Proof that BPP ⊆ PH. 551-556
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 2026-03-22 22:32 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:
