| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alexander S. Kulikov, Ivan Mihajlin |
If Edge Coloring is Hard under SETH, then SETH is False.  |
SOSA  |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Junkai Song, Weizhong Zhang |
Contention Resolution for the ℓ-fold union of a matroid via the correlation gap. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono |
A General Technique for Searching in Implicit Sets via Function Inversion. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ewin Tang, Kevin Tian |
A CS guide to the quantum singular value transformation. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Armbruster, Lars Rohwedder, Andreas Wiese |
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmed Abdelkader, David M. Mount |
Convex Approximation and the Hilbert Geometry. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary Hoppenworth |
Simple Linear-Size Additive Emulators. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajan Udwani |
When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Phevos Paschalidis, Ashley Zhuang |
Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinxiang Gan, Mordecai J. Golin |
Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nate Veldt |
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma 0002, Sebastian Wild |
Finding the saddlepoint faster than sorting. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul |
Modern Hashing Made Simple. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini |
Simple and tight complexity lower bounds for solving Rabin games. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ce Jin 0001, Virginia Vassilevska Williams, Renfei Zhou |
Listing 6-Cycles. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Yinzhan Xu |
Simpler Reductions from Exact Triangle. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Uma Girish, Ran Raz, Wei Zhan |
Quantum Logspace Computations are Verifiable. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Jäger 0001, Philipp Warode |
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Vaggos Chatziafratis, Piotr Indyk |
Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski 0001 |
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar |
SSD Wear Leveling with Optimal Guarantees. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Moseley, Heather Newman, Kirk Pruhs |
The Public University Secretary Problem. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Qizheng He |
Improved Algorithms for Integer Complexity. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Bartlomiej Dudek 0001, Pawel Gawrychowski, Tatiana Starikovskaya |
Sorting Signed Permutations by Reversals in Nearly-Linear Time. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Qizheng He, Zhean Xu |
Simple and Faster Algorithms for Knapsack. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Merav Parter, Seth Pettie (eds.) |
2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024 |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Elfarouk Harb |
Revisiting Random Points: Combinatorial Complexity and Algorithms. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty |
Insertion-Only Dynamic Connectivity in General Disk Graphs. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Balaji, Samir Datta |
USSR is in P/poly. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick |
Minimum-cost paths for electric cars. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi |
A Simple (1 - ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Bodwin |
An Alternate Proof of Near-Optimal Light Spanners. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shyan Akmal |
An Enumerative Perspective on Connectivity. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément L. Canonne, Joy Qiping Yang |
Simpler Distribution Testing with Little Memory. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Majid Daliri, Juliana Freire, Christopher Musco, Aécio S. R. Santos, Haoxiang Zhang 0003 |
Simple Analysis of Priority Sampling. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton S. Souza |
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. |
SOSA |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer |
Simple Set Sketching. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Mömke, Hang Zhou 0001 |
Capacitated Vehicle Routing in Graphic Metrics. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Meghal Gupta, Naren Sarayu Manoj |
An Optimal Algorithm for Certifying Monotone Functions. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman |
Voting algorithms for unique games on complete graphs. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Binghui Peng, Aviad Rubinstein |
Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window). |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Tom Gur, Igor Shinkar |
Derandomization of Cell Sampling. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth Sheth |
Proximity Search in the Greedy Tree. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmett Breen, Renee Mirka, Zichen Wang, David P. Williamson |
Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem in Graphs. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Weiming Feng 0001, Heng Guo 0001, Mark Jerrum, Jiaheng Wang 0002 |
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Daniel M. Kane, Ankit Pensia |
Gaussian Mean Testing Made Simple. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Vihan Shah |
Tight Bounds for Vertex Connectivity in Dynamic Streams. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Li Chen 0028, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva |
A Simple Framework for Finding Balanced Sparse Cuts via APSP. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi |
On the Fine-Grained Complexity of Approximating k-Center in Sparse Graphs. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski 0001 |
Simpler and faster algorithms for detours in planar digraphs. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shyam Narayanan, Jakub Tetek |
Estimating the Effective Support Size in Constant Query Complexity. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Prathamesh Dharangutte, Christopher Musco |
A Tight Analysis of Hutchinson's Diagonal Estimator. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Alman |
Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup Tables. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Rozhon, Bernhard Haeupler, Christoph Grunau |
A Simple Deterministic Distributed Low-Diameter Clustering. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Pingan Cheng |
An Optimal Lower Bound for Simplex Range Reporting. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Volkan Cevher, Georgios Piliouras, Ryann Sim, Stratis Skoulakis |
Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Santiago, Ivan Sergeev, Rico Zenklusen |
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An EPTAS for Budgeted Matroid Independent Set. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Kurt Mehlhorn (eds.) |
2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023 |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yubing Cui, Viswanath Nagarajan |
Minimum Cost Adaptive Submodular Cover. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid 0001, Jan Studený, Jukka Suomela, Jara Uitto |
Sinkless Orientation Made Simple. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucas Gretta, Eric Price 0001 |
An Improved Online Reduction from PAC Learning to Mistake-Bounded Learning. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002 |
Approximate minimum cuts and their enumeration. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006 |
A Local Search-Based Approach for Set Covering. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. Tarjan, Uri Zwick |
Optimal resizable arrays. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Braun, Thomas Kesselheim |
Simplified Prophet Inequalities for Combinatorial Auctions. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Shyam Narayanan, Jakub Tetek |
Sampling an Edge in Sublinear Time Exactly and Optimally. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Holm, Eva Rotenberg, Alice Ryhl |
Splay Top Trees. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dor Katzelnick, Roy Schwartz 0002 |
A Simple Algorithm for Submodular Minimum Linear Ordering. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Anegg, Laura Vargas Koch, Rico Zenklusen |
A Simple Combinatorial Algorithm for Robust Matroid Center. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gergely Kál Csáji, Tamás Király, Yu Yokoi |
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Larcher, Robert Meier, Angelika Steger |
A Simple Optimal Algorithm for the 2-Arm Bandit Problem. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Anish Mukherjee 0001, Erik Jan van Leeuwen |
The Parameterized Complexity of the Survivable Network Design Problem. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Omri Ben-Eliezer, Talya Eden, Krzysztof Onak |
Adversarially Robust Streaming via Dense-Sparse Trade-offs. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jessica K. Thompson, Ojas Parekh, Kunal Marwaha |
An explicit vector algorithm for high-girth MaxCut. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Debarati Das 0001, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément L. Canonne, Hongyi Lyu |
Uniformity Testing in the Shuffle Model: Simpler, Better, Faster. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhiruk Lahiri, Ilan Newman, Nithin Varma |
Parameterized Convexity Testing. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Sanjeev Khanna, Huan Li 0002, Hesam Nikpey |
Nearly Tight Bounds for Discrete Search under Outlier Noise. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Finding Relevant Points for Nearest-Neighbor Classification. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pasin Manurangsi |
Tight Bounds for Differentially Private Anonymized Histograms. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward Pyne, Salil P. Vadhan |
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Wojciech Janczewski |
Simpler Adjacency Labeling for Planar Graphs with B-Trees. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Haotian Jiang, Victor Reis |
A Tighter Relation Between Hereditary Discrepancy and Determinant Lower Bound. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Bouillaguet, Claire Delaplace, Monika Trimoska |
A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F2. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Mateusz Rzepecki |
Faster Exponential Algorithm for Permutation Pattern Matching. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan O'Donnell, Ramgopal Venkateswaran |
The Quantum Union Bound made easy. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber 0001 |
Topological Art in Simple Galleries. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kwangjun Ahn, Suvrit Sra |
Understanding Nesterov's Acceleration via Proximal Point Method. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Curticapean, Mingji Xia |
Parameterizing the Permanent: Hardness for fixed excluded minors. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hu Fu 0001, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang 0002 |
Oblivious Online Contention Resolution Schemes. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Linda Cai, Clayton Thomas |
The Short-Side Advantage in Random Matching Markets. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xinrui Jia 0001, Lars Rohwedder, Kshiteej Sheth, Ola Svensson |
Towards Non-Uniform k-Center with Constant Types of Radii. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Grandoni 0001, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad |
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Timothy M. Chan (eds.) |
5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022 |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Anagnostides, Ioannis Panageas |
Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitao Wang 0001 |
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. |
SOSA |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license