| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sharat Ibrahimpur, Chaitanya Swamy |
A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing.  |
SOSA  |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, John Iacono |
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan |
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Eden, Michal Feldman, Amos Fiat, Kineret Segal |
An Economics-Based Analysis of RANKING for Online Bipartite Matching. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | William Kuszmaul, Charles E. Leiserson |
Floors and Ceilings in Divide-and-Conquer Recurrences. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Aditi Dudeja |
A Simple Semi-Streaming Algorithm for Global Minimum Cuts. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yixin Cao 0001 |
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoj Gupta 0002, Shahbaz Khan 0004 |
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal |
Soft Sequence Heaps. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kapralov, Gilbert Maystre, Jakab Tardos |
Communication Efficient Coresets for Maximum Matching. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
A Note on a Recent Algorithm for Minimum Cut. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan van den Brand |
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff |
Hutch++: Optimal Stochastic Trace Estimation. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Paul Liu 0001 |
Improved Algorithms for Edge Colouring in the W-Streaming Model. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Thatchaphol Saranurak |
A Simple Deterministic Algorithm for Edge Connectivity. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kasper Green Larsen, Jonathan Lindegaard Starup, Jesper Steensgaard |
Further Unifying the Landscape of Cell Probe Lower Bounds. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung Viet Le, Valerie King (eds.) |
4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021 |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin 0001, Vasileios Nakos, Christos Tzamos, Hongxun Wu |
Fast and Simple Modular Subset Sum. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | David R. Karger, David P. Williamson |
Recursive Random Contraction Revisited. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, S. Cliff Liu, Robert E. Tarjan |
An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud |
Dispersion for Intervals: A Geometric Approach. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alin Bostan, Ryuhei Mori |
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang |
Generalized Sorting with Predictions. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Anegg, Haris Angelidakis, Rico Zenklusen |
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Berndt 0001, Klaus Jansen, Kim-Manuel Klein |
New Bounds for the Vertices of the Integer Hull. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthik C. S., Inbal Livni Navon |
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Corinna Coupette, Christoph Lenzen 0001 |
A Breezing Proof of the KMW Bound. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Xian Wu, Yinyu Ye 0001 |
Adaptive Discrete Phase Retrieval. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Karczmarz, Jakub Lacki |
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kent Quanrud |
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Qizheng He |
Reducing 3SUM to Convolution-3SUM. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonid Barenboim, Gal Oren 0001 |
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi |
Distributionally Robust Max Flows. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Grigory Yaroslavtsev, Samson Zhou |
Fast Fourier Sparsity Testing. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ragesh Jaiswal, Amit Kumar 0001 |
Multiplicative Rank-1 Approximation using Length-Squared Sampling. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Grenet, Ilya Volkovich |
One (more) line on the most Ancient Algorithm in History. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmad Biniaz |
A Short Proof of the Toughness of Delaunay Triangulations. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren 0001, Elaine Shi |
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Inge Li Gørtz (eds.) |
3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020 |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Patrick Rall |
Quantum Approximate Counting, Simplified. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Qizheng He |
On the Change-Making Problem. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Paul de Supinski |
On a Decentralized (Δ+1)-Graph Coloring Algorithm. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Barba, Wolfgang Mulzer |
Asymmetric Convex Intersection Testing. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kent Quanrud |
Approximating Optimal Transport With Linear Programs. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi |
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Liu 0001, Jan Vondrák |
Submodular Optimization in the MapReduce Model. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jugal Garg, Peter McGlaughlin, Setareh Taki |
Approximating Maximin Share Allocations. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Günter Rote |
Isotonic Regression by Dynamic Programming. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Kent Quanrud, Chao Xu 0002 |
LP Relaxation and Tree Packing for Minimum k-cuts. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ce Jin 0001, Hongxun Wu |
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Alman |
An Illuminating Algorithm for the Light Bulb Problem. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Kotrbcík, Martin Skoviera |
Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Felsner, Günter Rote |
On Primal-Dual Circle Representations. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf |
A Framework for Searching in Graphs in the Presence of Errors. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy T. Fineman, Michael Mitzenmacher (eds.) |
2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA |
SOSA |
2019 |
DBLP BibTeX RDF |
|
| 1 | Sepehr Assadi, Aaron Bernstein |
Towards a Unified Theory of Sparsification for Matching Problems. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, László Kozma 0002, Or Zamir, Uri Zwick |
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sixue Liu, Robert E. Tarjan |
Simple Concurrent Labeling Algorithms for Connected Components. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Jun Chang, Wenyu Jin 0001, Seth Pettie |
Simple Contention Resolution via Multiplicative Weight Updates. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pasin Manurangsi |
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohsen Ghaffari 0001, David Wajc |
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushrut Karmalkar, Eric Price 0001 |
Compressed Sensing with Adversarial Sparse Noise via L1 Regression. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe |
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters. |
SOSA |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew McGregor 0001, Sofya Vorotnikova |
A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Thapanapong Rukkanchanunt |
A Note on Iterated Rounding for the Survivable Network Design Problem. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yixin Cao 0001 |
A Naive Algorithm for Feedback Vertex Set. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael B. Cohen, T. S. Jayram, Jelani Nelson |
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsvi Kopelowitz, Ely Porat |
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Sanjeev Khanna |
Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Ryan Williams |
Counting Solutions to Polynomial Systems via Reductions. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Approximation Schemes for 0-1 Knapsack. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alantha Newman |
Complex Semidefinite Programming and Max-k-Cut. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Raimund Seidel (eds.) |
1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA |
SOSA |
2018 |
DBLP BibTeX RDF |
|
| 1 | Petra Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach |
Simple and Efficient Leader Election. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Mark Idleman |
Congestion Minimization for Multipath Routing via Multiroute Flows. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Divesh Aggarwal, Noah Stephens-Davidowitz |
Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Lars Rohwedder |
Compact LP Relaxations for Allocation Problems. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Denis Pankratov, Amirali Salehi-Abari |
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Will Rosenbaum |
On Sampling Edges Almost Uniformly. |
SOSA |
2018 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license