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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022, pp. 247-256, 2022, SIAM, 978-1-61197-706-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jean Cardinal, John Iacono |
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 45-56, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 232-242, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 204-209, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Alon Eden, Michal Feldman, Amos Fiat, Kineret Segal |
An Economics-Based Analysis of RANKING for Online Bipartite Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 107-110, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | William Kuszmaul, Charles E. Leiserson |
Floors and Ceilings in Divide-and-Conquer Recurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 133-141, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sepehr Assadi, Aditi Dudeja |
A Simple Semi-Streaming Algorithm for Global Minimum Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 172-180, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yixin Cao 0001 |
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 92-106, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Manoj Gupta 0002, Shahbaz Khan 0004 |
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 86-91, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Gerth Stølting Brodal |
Soft Sequence Heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 14-24, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kapralov, Gilbert Maystre, Jakab Tardos |
Communication Efficient Coresets for Maximum Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 156-164, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Shay Mozes, Oren Weimann |
A Note on a Recent Algorithm for Minimum Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 74-79, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jan van den Brand |
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 1-13, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Raphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff |
Hutch++: Optimal Stochastic Trace Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 142-155, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Moses Charikar, Paul Liu 0001 |
Improved Algorithms for Edge Colouring in the W-Streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 181-183, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Thatchaphol Saranurak |
A Simple Deterministic Algorithm for Edge Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 80-85, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Kasper Green Larsen, Jonathan Lindegaard Starup, Jesper Steensgaard |
Further Unifying the Landscape of Cell Probe Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 224-231, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![SIAM, 978-1-61197-649-6 The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 57-67, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | David R. Karger, David P. Williamson |
Recursive Random Contraction Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 68-73, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 165-171, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud |
Dispersion for Intervals: A Geometric Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 37-44, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 118-132, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang |
Generalized Sorting with Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 111-117, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 196-203, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Berndt 0001, Klaus Jansen, Kim-Manuel Klein |
New Bounds for the Vertices of the Integer Hull. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 25-36, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 210-223, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Corinna Coupette, Christoph Lenzen 0001 |
A Breezing Proof of the KMW Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 184-195, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Moses Charikar, Xian Wu, Yinyu Ye 0001 |
Adaptive Discrete Phase Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 47-56, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Adam Karczmarz, Jakub Lacki |
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 106-120, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kent Quanrud |
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 69-80, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 1-2, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Qizheng He |
Reducing 3SUM to Convolution-3SUM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 1-7, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 99-105, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan |
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 33-37, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi |
Distributionally Robust Max Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 81-90, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Grigory Yaroslavtsev, Samson Zhou |
Fast Fourier Sparsity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 57-68, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ragesh Jaiswal, Amit Kumar 0001 |
Multiplicative Rank-1 Approximation using Length-Squared Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 18-23, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Grenet, Ilya Volkovich |
One (more) line on the most Ancient Algorithm in History. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 15-17, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ahmad Biniaz |
A Short Proof of the Toughness of Delaunay Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 43-46, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 8-14, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![SIAM, 978-1-61197-601-4 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Scott Aaronson, Patrick Rall |
Quantum Approximate Counting, Simplified. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 24-32, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Qizheng He |
On the Change-Making Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 38-42, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Deeparnab Chakrabarty, Paul de Supinski |
On a Decentralized (Δ+1)-Graph Coloring Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020, pp. 91-98, 2020, SIAM, 978-1-61197-601-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Luis Barba, Wolfgang Mulzer |
Asymmetric Convex Intersection Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 9:1-9:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kent Quanrud |
Approximating Optimal Transport With Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 6:1-6:9, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi |
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 10:1-10:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Paul Liu 0001, Jan Vondrák |
Submodular Optimization in the MapReduce Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 18:1-18:10, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jugal Garg, Peter McGlaughlin, Setareh Taki |
Approximating Maximin Share Allocations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 20:1-20:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Günter Rote |
Isotonic Regression by Dynamic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 1:1-1:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Chandra Chekuri, Kent Quanrud, Chao Xu 0002 |
LP Relaxation and Tree Packing for Minimum k-cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 7:1-7:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ce Jin 0001, Hongxun Wu |
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 17:1-17:6, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Josh Alman |
An Illuminating Algorithm for the Light Bulb Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 2:1-2:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 0:i-0:x, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michal Kotrbcík, Martin Skoviera |
Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 14:1-14:9, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Felsner, Günter Rote |
On Primal-Dual Circle Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 8:1-8:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 4:1-4:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Sepehr Assadi, Aaron Bernstein |
Towards a Unified Theory of Sparsification for Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 11:1-11:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 5:1-5:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sixue Liu, Robert E. Tarjan |
Simple Concurrent Labeling Algorithms for Connected Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 3:1-3:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yi-Jun Chang, Wenyu Jin 0001, Seth Pettie |
Simple Contention Resolution via Multiplicative Weight Updates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 16:1-16:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pasin Manurangsi |
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 15:1-15:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mohsen Ghaffari 0001, David Wajc |
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 13:1-13:8, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sushrut Karmalkar, Eric Price 0001 |
Compressed Sensing with Adversarial Sparse Noise via L1 Regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 19:1-19:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Ducoffe |
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA, pp. 12:1-12:7, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-099-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Andrew McGregor 0001, Sofya Vorotnikova |
A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 14:1-14:4, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Chandra Chekuri, Thapanapong Rukkanchanunt |
A Note on Iterated Rounding for the Survivable Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 2:1-2:10, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yixin Cao 0001 |
A Naive Algorithm for Feedback Vertex Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 1:1-1:9, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Michael B. Cohen, T. S. Jayram, Jelani Nelson |
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 15:1-15:9, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 0:i-0:xii, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tsvi Kopelowitz, Ely Porat |
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 10:1-10:5, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Deeparnab Chakrabarty, Sanjeev Khanna |
Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 4:1-4:11, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | R. Ryan Williams |
Counting Solutions to Polynomial Systems via Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 6:1-6:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan |
Approximation Schemes for 0-1 Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 5:1-5:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Alantha Newman |
Complex Semidefinite Programming and Max-k-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 13:1-13:11, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4 The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
1 | Petra Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach |
Simple and Efficient Leader Election. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 9:1-9:11, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Chandra Chekuri, Mark Idleman |
Congestion Minimization for Multipath Routing via Multiroute Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 3:1-3:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 12:1-12:19, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Jansen, Lars Rohwedder |
Compact LP Relaxations for Allocation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 11:1-11:19, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 8:1-8:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Talya Eden, Will Rosenbaum |
On Sampling Edges Almost Uniformly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, pp. 7:1-7:9, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-064-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|