default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSOSA 2022, Virtual Conference
- Karl Bringmann, Timothy M. Chan:
5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022. SIAM 2022, ISBN 978-1-61197-706-6 - Front Matter. i-v
- Debarati Das, Evangelos Kipouridis
, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. 1-11 - Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad:
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. 12-23 - Pawel Gawrychowski, Wojciech Janczewski:
Simpler Adjacency Labeling for Planar Graphs with B-Trees. 24-36 - Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen:
The Parameterized Complexity of the Survivable Network Design Problem. 37-56 - Edward Pyne, Salil P. Vadhan:
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. 57-67 - David Eppstein:
Finding Relevant Points for Nearest-Neighbor Classification. 68-78 - Haitao Wang:
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. 79-86 - Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber:
Topological Art in Simple Galleries. 87-116 - Kwangjun Ahn, Suvrit Sra:
Understanding Nesterov's Acceleration via Proximal Point Method. 117-130 - Ioannis Anagnostides, Ioannis Panageas:
Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. 131-160 - Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
Nearly Tight Bounds for Discrete Search under Outlier Noise. 161-173 - Abhiruk Lahiri, Ilan Newman, Nithin Varma:
Parameterized Convexity Testing. 174-181 - Clément L. Canonne, Hongyi Lyu:
Uniformity Testing in the Shuffle Model: Simpler, Better, Faster. 182-202 - Pasin Manurangsi:
Tight Bounds for Differentially Private Anonymized Histograms. 203-213 - Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. 214-227 - Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson:
Towards Non-Uniform k-Center with Constant Types of Radii. 228-237 - Jessica K. Thompson, Ojas Parekh, Kunal Marwaha:
An explicit vector algorithm for high-girth MaxCut. 238-246 - Sharat Ibrahimpur, Chaitanya Swamy:
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. 247-256 - Linda Cai, Clayton Thomas:
The Short-Side Advantage in Random Matching Markets. 257-267 - Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Oblivious Online Contention Resolution Schemes. 268-278 - Pawel Gawrychowski, Mateusz Rzepecki:
Faster Exponential Algorithm for Permutation Pattern Matching. 279-284 - Charles Bouillaguet, Claire Delaplace, Monika Trimoska:
A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F2. 285-296 - Radu Curticapean, Mingji Xia:
Parameterizing the Permanent: Hardness for fixed excluded minors. 297-307 - Haotian Jiang, Victor Reis:
A Tighter Relation Between Hereditary Discrepancy and Determinant Lower Bound. 308-313 - Ryan O'Donnell, Ramgopal Venkateswaran:
The Quantum Union Bound made easy. 314-320
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 2025-11-26 07: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:
