default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th SOSA 2025: New Orleans, LA, USA
- Ioana Oriana Bercea, Rasmus Pagh:
2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025. SIAM 2025, ISBN 978-1-61197-831-5 - Sepehr Assadi, Helia Yazdanyar
:
Simple Sublinear Algorithms for (Δ + 1) Vertex Coloring via Asymmetric Palette Sparsification. 1-8 - Ojas Parekh, John Kallaugher, Nadezhda Voronova:
How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing. 9-45 - Gryphon Patlin, Jan van den Brand:
Sublinear-Time Algorithm for MST-Weight Revisited. 46-53 - Christian Janos Lebeda, Jakub Tetek:
Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space. 54-64 - Vipul Arora, Esty Kelman, Uri Meir:
On Optimal Testing of Linearity. 65-76 - William Kuszmaul:
A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations. 77-93 - Kodai Tanaka, Shun Sasaki, Kazumasa Shinagawa, Takaaki Mizuki:
Only Two Shuffles Perform Card-Based Zero-Knowledge Proof for Sudoku of Any Size. 94-107 - Petteri Kaski, Heikki Mannila, Antonis Matakos:
A Multilinear Johnson-Lindenstrauss Transform. 108-118 - Christian Janos Lebeda:
Better Gaussian Mechanism using Correlated Noise. 119-133 - Madhur Tulsiani, June Wu:
Ellipsoid fitting up to constant via empirical covariance estimation. 134-143 - Dingyu Wang:
Multi-dimensional Approximate Counting. 144-157 - Shashwat Kasliwal, Adam Polak, Pratyush Sharma:
3SUM in Preprocessed Universes: Faster and Simpler. 158-165 - Solon P. Pissis:
Optimal prefix-suffix queries with applications. 166-171 - Gerth Stølting Brodal, Casper Moldrup Rysgaard:
Pure Binary Finger Search Trees. 172-195 - Yuval Efron, Shyamal Patel, Cliff Stein:
A Simple Algorithm for Dynamic Carpooling with Recourse. 196-201 - Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Bidirectional Dijkstra's Algorithm is Instance-Optimal. 202-215 - Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser:
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path. 216-225 - Joakim Blikstad, Ta-Wei Tu:
Efficient Matroid Intersection via a Batch-Update Auction Algorithm. 226-237 - Surbhi Rajput, Ashish Chiplunkar, Rohit Vaish:
Trading Prophets: How to Trade Multiple Stocks Optimally. 238-252 - Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz:
A Simple Lower Bound for Set Agreement in Dynamic Networks. 253-262 - Yijia Chen, Yi Feng, Bundit Laekhanukit, Yanlin Liu:
Simple Combinatorial Construction of the ko (1)-Lower Bound for Approximating the Parameterized k-Clique. 263-280 - Yusuke Kobayashi, Takashi Noguchi:
Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem. 281-289 - Yuriy Biktairov, Leszek Gasieniec, Wanchote Po Jiamjitrak, Namrata, Benjamin Smith, Sebastian Wild:
Simple approximation algorithms for Polyamorous Scheduling. 290-314 - Lap Chi Lau, Robert Wang, Hong Zhou:
Spectral Sparsification by Deterministic Discrepancy Walk. 315-340 - D. Ellis Hershkowitz, Richard Z. Huang:
Simple Length-Constrained Minimum Spanning Trees. 341-349 - Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann:
Simpler Optimal Sorting from a Directed Acyclic Graph. 350-355 - Andreas Björklund, Thore Husfeldt:
Finding longer cycles via shortest colourful cycle. 356-368 - Merav Parter, Elad Tzalik:
Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults. 369-377 - Ziliang Xiong, Mingyu Xiao:
A Simplified Parameterized Algorithm for Directed Feedback Vertex Set. 378-384 - Surender Baswana, Abhyuday Pandey:
The connectivity carcass of a vertex subset in a graph: both odd and even case. 385-422 - Ittai Rubinstein:
The Quasi-probability Method and Applications for Trace Reconstruction. 423-443 - Rida Ait El Manssour, Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
A parametric version of the Hilbert Nullstellensatz. 444-451 - Lap Chi Lau, Robert Wang, Hong Zhou:
Experimental Design Using Interlacing Polynomials. 452-464 - Vikraman Arvind, Samir Datta, Salman Faris, Asif Khan:
Revisiting Tree canonization using polynomials. 465-472 - Josh Alman, Alexandr Andoni, Hengjie Zhang:
Faster Algorithms for Average-Case Orthogonal Vectors and Closes Pair Problems. 473-484 - Sujoy Bhore, Timothy M. Chan:
Dynamic Independent Set of Disks (and Hypercubes) Made Easier. 485-495 - Simon D. Fink, Ignaz Rutter, Sandhya T. P.:
A Simple Partially Embedded Planarity Test Based on Vertex-Addition. 496-508 - Gang Liu, Haitao Wang:
An Optimal Algorithm for Half-plane Hitting Set. 509-516 - Amir Abboud, Rajendra Kumar:
On Beating 2n for the Closest Vector Problem. 517-532 - Divesh Aggarwal, Thomas Espitau, Spencer Peters, Noah Stephens-Davidowitz:
Recursive lattice reduction - A framework for finding short lattice vectors. 533-573
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-02-11 23:51 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:
