Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:conf/sosa:"
download as .bib file
@inproceedings{DBLP:conf/sosa/AbdelkaderM24,
author = {Ahmed Abdelkader and
David M. Mount},
editor = {Merav Parter and
Seth Pettie},
title = {Convex Approximation and the Hilbert Geometry},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {286--298},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.26},
doi = {10.1137/1.9781611977936.26},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/AbdelkaderM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Akmal24,
author = {Shyan Akmal},
editor = {Merav Parter and
Seth Pettie},
title = {An Enumerative Perspective on Connectivity},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {179--198},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.18},
doi = {10.1137/1.9781611977936.18},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Akmal24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ArmbrusterRW24,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
editor = {Merav Parter and
Seth Pettie},
title = {Simpler constant factor approximation algorithms for weighted flow
time - now for any \emph{p}-norm},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {63--81},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.7},
doi = {10.1137/1.9781611977936.7},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ArmbrusterRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AronovCDI24,
author = {Boris Aronov and
Jean Cardinal and
Justin Dallant and
John Iacono},
editor = {Merav Parter and
Seth Pettie},
title = {A General Technique for Searching in Implicit Sets via Function Inversion},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {215--223},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.20},
doi = {10.1137/1.9781611977936.20},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/AronovCDI24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Assadi24,
author = {Sepehr Assadi},
editor = {Merav Parter and
Seth Pettie},
title = {A Simple {(1} - \emph{{\(\epsilon\)}})-Approximation Semi-Streaming
Algorithm for Maximum (Weighted) Matching},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {337--354},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.31},
doi = {10.1137/1.9781611977936.31},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Assadi24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BalajiD24,
author = {Nikhil Balaji and
Samir Datta},
editor = {Merav Parter and
Seth Pettie},
title = {{USSR} is in P/poly},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {151--159},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.15},
doi = {10.1137/1.9781611977936.15},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BalajiD24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BenderFKK24,
author = {Michael A. Bender and
Mart{\'{\i}}n Farach{-}Colton and
John Kuszmaul and
William Kuszmaul},
editor = {Merav Parter and
Seth Pettie},
title = {Modern Hashing Made Simple},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {363--373},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.33},
doi = {10.1137/1.9781611977936.33},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BenderFKK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BlikstadSVW24,
author = {Joakim Blikstad and
Ola Svensson and
Radu Vintan and
David Wajc},
editor = {Merav Parter and
Seth Pettie},
title = {Simple and Asymptotically Optimal Online Bipartite Edge Coloring},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {331--336},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.30},
doi = {10.1137/1.9781611977936.30},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BlikstadSVW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Bodwin24,
author = {Greg Bodwin},
editor = {Merav Parter and
Seth Pettie},
title = {An Alternate Proof of Near-Optimal Light Spanners},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {39--55},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.5},
doi = {10.1137/1.9781611977936.5},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Bodwin24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CanonneY24,
author = {Cl{\'{e}}ment L. Canonne and
Joy Qiping Yang},
editor = {Merav Parter and
Seth Pettie},
title = {Simpler Distribution Testing with Little Memory},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {406--416},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.37},
doi = {10.1137/1.9781611977936.37},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/CanonneY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CasaresPPST24,
author = {Antonio Casares and
Marcin Pilipczuk and
Michal Pilipczuk and
U{\'{e}}verton S. Souza and
K. S. Thejaswini},
editor = {Merav Parter and
Seth Pettie},
title = {Simple and tight complexity lower bounds for solving Rabin games},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {160--167},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.16},
doi = {10.1137/1.9781611977936.16},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/CasaresPPST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ChanX24,
author = {Timothy M. Chan and
Yinzhan Xu},
editor = {Merav Parter and
Seth Pettie},
title = {Simpler Reductions from Exact Triangle},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {28--38},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.4},
doi = {10.1137/1.9781611977936.4},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ChanX24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ChatziafratisI24,
author = {Vaggos Chatziafratis and
Piotr Indyk},
editor = {Merav Parter and
Seth Pettie},
title = {Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets,
Terminals {\&} Top-k Nearest Neighbors},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {230--243},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.22},
doi = {10.1137/1.9781611977936.22},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ChatziafratisI24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ChekuriSZ24,
author = {Chandra Chekuri and
Junkai Song and
Weizhong Zhang},
editor = {Merav Parter and
Seth Pettie},
title = {Contention Resolution for the \emph{{\(\mathscr{l}\)}}-fold union
of a matroid via the correlation gap},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {396--405},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.36},
doi = {10.1137/1.9781611977936.36},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ChekuriSZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DaliriFMSZ24,
author = {Majid Daliri and
Juliana Freire and
Christopher Musco and
A{\'{e}}cio S. R. Santos and
Haoxiang Zhang},
editor = {Merav Parter and
Seth Pettie},
title = {Simple Analysis of Priority Sampling},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {224--229},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.21},
doi = {10.1137/1.9781611977936.21},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/DaliriFMSZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DallantHJKW24,
author = {Justin Dallant and
Frederik Haagensen and
Riko Jacob and
L{\'{a}}szl{\'{o}} Kozma and
Sebastian Wild},
editor = {Merav Parter and
Seth Pettie},
title = {Finding the saddlepoint faster than sorting},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {168--178},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.17},
doi = {10.1137/1.9781611977936.17},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/DallantHJKW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DorfmanKTTZ24,
author = {Dani Dorfman and
Haim Kaplan and
Robert E. Tarjan and
Mikkel Thorup and
Uri Zwick},
editor = {Merav Parter and
Seth Pettie},
title = {Minimum-cost paths for electric cars},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {374--382},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.34},
doi = {10.1137/1.9781611977936.34},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/DorfmanKTTZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DudekGS24,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
editor = {Merav Parter and
Seth Pettie},
title = {Sorting Signed Permutations by Reversals in Nearly-Linear Time},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {199--214},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.19},
doi = {10.1137/1.9781611977936.19},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/DudekGS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GanG24,
author = {Jinxiang Gan and
Mordecai J. Golin},
editor = {Merav Parter and
Seth Pettie},
title = {Fully Dynamic \emph{k}-Center in Low Dimensions via Approximate Furthest
Neighbors},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {269--278},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.24},
doi = {10.1137/1.9781611977936.24},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GanG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GirishRZ24,
author = {Uma Girish and
Ran Raz and
Wei Zhan},
editor = {Merav Parter and
Seth Pettie},
title = {Quantum Logspace Computations are Verifiable},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {144--150},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.14},
doi = {10.1137/1.9781611977936.14},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GirishRZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/HarPeledH24,
author = {Sariel Har{-}Peled and
Elfarouk Harb},
editor = {Merav Parter and
Seth Pettie},
title = {Revisiting Random Points: Combinatorial Complexity and Algorithms},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {244--268},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.23},
doi = {10.1137/1.9781611977936.23},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/HarPeledH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/He24,
author = {Qizheng He},
editor = {Merav Parter and
Seth Pettie},
title = {Improved Algorithms for Integer Complexity},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {107--114},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.11},
doi = {10.1137/1.9781611977936.11},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/He24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/HeX24,
author = {Qizheng He and
Zhean Xu},
editor = {Merav Parter and
Seth Pettie},
title = {Simple and Faster Algorithms for Knapsack},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {56--62},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.6},
doi = {10.1137/1.9781611977936.6},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/HeX24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Hoppenworth24,
author = {Gary Hoppenworth},
editor = {Merav Parter and
Seth Pettie},
title = {Simple Linear-Size Additive Emulators},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {1--8},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.1},
doi = {10.1137/1.9781611977936.1},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Hoppenworth24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/JagerW24,
author = {Sven J{\"{a}}ger and
Philipp Warode},
editor = {Merav Parter and
Seth Pettie},
title = {Simple Approximation Algorithms for Minimizing the Total Weighted
Completion Time of Precedence-Constrained Jobs},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {82--96},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.8},
doi = {10.1137/1.9781611977936.8},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/JagerW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/JinWZ24,
author = {Ce Jin and
Virginia Vassilevska Williams and
Renfei Zhou},
editor = {Merav Parter and
Seth Pettie},
title = {Listing 6-Cycles},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {19--27},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.3},
doi = {10.1137/1.9781611977936.3},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/JinWZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KaluginN24,
author = {Pavel E. Kalugin and
Maksim S. Nikolaev},
editor = {Merav Parter and
Seth Pettie},
title = {The greedy algorithm for the Shortest Common Superstring problem is
a {\textonehalf}-approximation in terms of compression: a simple proof},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {97--99},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.9},
doi = {10.1137/1.9781611977936.9},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/KaluginN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KaplanKKMR24,
author = {Haim Kaplan and
Katharina Klost and
Kristin Knorr and
Wolfgang Mulzer and
Liam Roditty},
editor = {Merav Parter and
Seth Pettie},
title = {Insertion-Only Dynamic Connectivity in General Disk Graphs},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {299--305},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.27},
doi = {10.1137/1.9781611977936.27},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/KaplanKKMR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KowalikLMPS24,
author = {Lukasz Kowalik and
Alexandra Lassota and
Konrad Majewski and
Michal Pilipczuk and
Marek Sokolowski},
editor = {Merav Parter and
Seth Pettie},
title = {Detecting Points in Integer Cones of Polytopes is Double-Exponentially
Hard},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {279--285},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.25},
doi = {10.1137/1.9781611977936.25},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/KowalikLMPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KulikovM24,
author = {Alexander S. Kulikov and
Ivan Mihajlin},
editor = {Merav Parter and
Seth Pettie},
title = {If Edge Coloring is Hard under SETH, then {SETH} is False},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {115--120},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.12},
doi = {10.1137/1.9781611977936.12},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/KulikovM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/LangeNY24,
author = {Tomer Lange and
Joseph (Seffi) Naor and
Gala Yadgar},
editor = {Merav Parter and
Seth Pettie},
title = {{SSD} Wear Leveling with Optimal Guarantees},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {306--320},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.28},
doi = {10.1137/1.9781611977936.28},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/LangeNY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/MoseleyNP24,
author = {Benjamin Moseley and
Heather Newman and
Kirk Pruhs},
editor = {Merav Parter and
Seth Pettie},
title = {The Public University Secretary Problem},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {100--106},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.10},
doi = {10.1137/1.9781611977936.10},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/MoseleyNP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/PaschalidisZ24,
author = {Phevos Paschalidis and
Ashley Zhuang},
editor = {Merav Parter and
Seth Pettie},
title = {Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {9--18},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.2},
doi = {10.1137/1.9781611977936.2},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/PaschalidisZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/SMPS24,
author = {{Karthik {C. S.}} and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
U{\'{e}}verton S. Souza},
editor = {Merav Parter and
Seth Pettie},
title = {Conditional lower bounds for sparse parameterized 2-CSP: {A} streamlined
proof},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {383--395},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.35},
doi = {10.1137/1.9781611977936.35},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/SMPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/TangT24,
author = {Ewin Tang and
Kevin Tian},
editor = {Merav Parter and
Seth Pettie},
title = {A {CS} guide to the quantum singular value transformation},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {121--143},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.13},
doi = {10.1137/1.9781611977936.13},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/TangT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Udwani24,
author = {Rajan Udwani},
editor = {Merav Parter and
Seth Pettie},
title = {When Stochastic Rewards Reduce to Deterministic Rewards in Online
Bipartite Matching},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {321--330},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.29},
doi = {10.1137/1.9781611977936.29},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Udwani24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Veldt24,
author = {Nate Veldt},
editor = {Merav Parter and
Seth Pettie},
title = {Growing a Random Maximal Independent Set Produces a 2-approximate
Vertex Cover},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {355--362},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.32},
doi = {10.1137/1.9781611977936.32},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Veldt24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sosa/2024,
editor = {Merav Parter and
Seth Pettie},
title = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936},
doi = {10.1137/1.9781611977936},
isbn = {978-1-61197-793-6},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/2024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/00010J023,
author = {Weiming Feng and
Heng Guo and
Mark Jerrum and
Jiaheng Wang},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A simple polynomial-time approximation algorithm for the total variation
distance between two product distributions},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {343--347},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch30},
doi = {10.1137/1.9781611977585.CH30},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/00010J023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/0001L023,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Local Search-Based Approach for Set Covering},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {1--11},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch1},
doi = {10.1137/1.9781611977585.CH1},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/0001L023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AbboudCLM23,
author = {Amir Abboud and
Vincent Cohen{-}Addad and
Euiwoong Lee and
Pasin Manurangsi},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {On the Fine-Grained Complexity of Approximating \emph{k}-Center in
Sparse Graphs},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {145--155},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch14},
doi = {10.1137/1.9781611977585.CH14},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AbboudCLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AfshaniC23,
author = {Peyman Afshani and
Pingan Cheng},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {An Optimal Lower Bound for Simplex Range Reporting},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {272--277},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch25},
doi = {10.1137/1.9781611977585.CH25},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AfshaniC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Alman23,
author = {Josh Alman},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite
Fields using Lookup Tables},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {137--144},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch13},
doi = {10.1137/1.9781611977585.CH13},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Alman23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AneggKZ23,
author = {Georg Anegg and
Laura Vargas Koch and
Rico Zenklusen},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Simple Combinatorial Algorithm for Robust Matroid Center},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {96--102},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch9},
doi = {10.1137/1.9781611977585.CH9},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AneggKZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AradKS23,
author = {Ilan Doron Arad and
Ariel Kulik and
Hadas Shachnai},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {An {EPTAS} for Budgeted Matroid Independent Set},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {69--83},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch7},
doi = {10.1137/1.9781611977585.CH7},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AradKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AssadiS23,
author = {Sepehr Assadi and
Vihan Shah},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Tight Bounds for Vertex Connectivity in Dynamic Streams},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {213--227},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch20},
doi = {10.1137/1.9781611977585.CH20},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AssadiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BalliuKKLOPPR0S23,
author = {Alkida Balliu and
Janne H. Korhonen and
Fabian Kuhn and
Henrik Lievonen and
Dennis Olivetti and
Shreyas Pai and
Ami Paz and
Joel Rybicki and
Stefan Schmid and
Jan Studen{\'{y}} and
Jukka Suomela and
Jara Uitto},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Sinkless Orientation Made Simple},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {175--191},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch17},
doi = {10.1137/1.9781611977585.CH17},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/BalliuKKLOPPR0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BeidemanC023,
author = {Calvin Beideman and
Karthekeyan Chandrasekaran and
Weihang Wang},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Approximate minimum cuts and their enumeration},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {36--41},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch4},
doi = {10.1137/1.9781611977585.CH4},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/BeidemanC023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BraunK23,
author = {Alexander Braun and
Thomas Kesselheim},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Simplified Prophet Inequalities for Combinatorial Auctions},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {381--389},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch35},
doi = {10.1137/1.9781611977585.CH35},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/BraunK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BreenMWW23,
author = {Emmett Breen and
Renee Mirka and
Zichen Wang and
David P. Williamson},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Revisiting Garg's 2-Approximation Algorithm for the \emph{k}-MST Problem
in Graphs},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {56--68},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch6},
doi = {10.1137/1.9781611977585.CH6},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/BreenMWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CevherPSS23,
author = {Volkan Cevher and
Georgios Piliouras and
Ryann Sim and
Stratis Skoulakis},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Min-Max Optimization Made Simple: Approximating the Proximal Point
Method via Contraction Maps},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {192--206},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch18},
doi = {10.1137/1.9781611977585.CH18},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/CevherPSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ChenKGS23,
author = {Li Chen and
Rasmus Kyng and
Maximilian Probst Gutenberg and
Sushant Sachdeva},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Simple Framework for Finding Balanced Sparse Cuts via {APSP}},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {42--55},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch5},
doi = {10.1137/1.9781611977585.CH5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/ChenKGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ChubetPSS23,
author = {Oliver A. Chubet and
Parth Parikh and
Donald R. Sheehy and
Siddharth Sheth},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Proximity Search in the Greedy Tree},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {332--342},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch29},
doi = {10.1137/1.9781611977585.CH29},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/ChubetPSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CsajiKY23,
author = {Gergely K{\'{a}}l Cs{\'{a}}ji and
Tam{\'{a}}s Kir{\'{a}}ly and
Yu Yokoi},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Approximation Algorithms for Matroidal and Cardinal Generalizations
of Stable Matching},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {103--113},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch10},
doi = {10.1137/1.9781611977585.CH10},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/CsajiKY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CuiN23,
author = {Yubing Cui and
Viswanath Nagarajan},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Minimum Cost Adaptive Submodular Cover},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {12--27},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch2},
doi = {10.1137/1.9781611977585.CH2},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/CuiN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DharangutteM23,
author = {Prathamesh Dharangutte and
Christopher Musco},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Tight Analysis of Hutchinson's Diagonal Estimator},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {353--364},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch32},
doi = {10.1137/1.9781611977585.CH32},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/DharangutteM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DiakonikolasKP23,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Ankit Pensia},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Gaussian Mean Testing Made Simple},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {348--352},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch31},
doi = {10.1137/1.9781611977585.CH31},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/DiakonikolasKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/EdenNT23,
author = {Talya Eden and
Shyam Narayanan and
Jakub Tetek},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Sampling an Edge in Sublinear Time Exactly and Optimally},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {253--260},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch23},
doi = {10.1137/1.9781611977585.CH23},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/EdenNT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GolovnevGS23,
author = {Alexander Golovnev and
Tom Gur and
Igor Shinkar},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Derandomization of Cell Sampling},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {278--284},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch26},
doi = {10.1137/1.9781611977585.CH26},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/GolovnevGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Gretta023,
author = {Lucas Gretta and
Eric Price},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {An Improved Online Reduction from {PAC} Learning to Mistake-Bounded
Learning},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {373--380},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch34},
doi = {10.1137/1.9781611977585.CH34},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Gretta023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GuptaM23,
author = {Meghal Gupta and
Naren Sarayu Manoj},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {An Optimal Algorithm for Certifying Monotone Functions},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {207--212},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch19},
doi = {10.1137/1.9781611977585.CH19},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/GuptaM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/HatzelMPS23,
author = {Meike Hatzel and
Konrad Majewski and
Michal Pilipczuk and
Marek Sokolowski},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Simpler and faster algorithms for detours in planar digraphs},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {156--165},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch15},
doi = {10.1137/1.9781611977585.CH15},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/HatzelMPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/HolmRR23,
author = {Jacob Holm and
Eva Rotenberg and
Alice Ryhl},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Splay Top Trees},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {305--331},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch28},
doi = {10.1137/1.9781611977585.CH28},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/HolmRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/HouenPW23,
author = {Jakob B{\ae}k Tejs Houen and
Rasmus Pagh and
Stefan Walzer},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Simple Set Sketching},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {228--241},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch21},
doi = {10.1137/1.9781611977585.CH21},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/HouenPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Katzelnick023,
author = {Dor Katzelnick and
Roy Schwartz},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Simple Algorithm for Submodular Minimum Linear Ordering},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {28--35},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch3},
doi = {10.1137/1.9781611977585.CH3},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Katzelnick023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/LarcherMS23,
author = {Maxime Larcher and
Robert Meier and
Angelika Steger},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Simple Optimal Algorithm for the 2-Arm Bandit Problem},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {365--372},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch33},
doi = {10.1137/1.9781611977585.CH33},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/LarcherMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/MeotMMN23,
author = {Antoine M{\'{e}}ot and
Arnaud de Mesmay and
Moritz M{\"{u}}hlenthaler and
Alantha Newman},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Voting algorithms for unique games on complete graphs},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {124--136},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch12},
doi = {10.1137/1.9781611977585.CH12},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/MeotMMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Momke023,
author = {Tobias M{\"{o}}mke and
Hang Zhou},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Capacitated Vehicle Routing in Graphic Metrics},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {114--123},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch11},
doi = {10.1137/1.9781611977585.CH11},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Momke023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/NarayananT23,
author = {Shyam Narayanan and
Jakub Tetek},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Estimating the Effective Support Size in Constant Query Complexity},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {242--252},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch22},
doi = {10.1137/1.9781611977585.CH22},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/NarayananT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/PengR23,
author = {Binghui Peng and
Aviad Rubinstein},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Fully-dynamic-to-incremental reductions with known deletion order
(e.g. sliding window)},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {261--271},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch24},
doi = {10.1137/1.9781611977585.CH24},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/PengR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/RozhonHG23,
author = {V{\'{a}}clav Rozhon and
Bernhard Haeupler and
Christoph Grunau},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Simple Deterministic Distributed Low-Diameter Clustering},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {166--174},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch16},
doi = {10.1137/1.9781611977585.CH16},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/RozhonHG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/SantiagoSZ23,
author = {Richard Santiago and
Ivan Sergeev and
Rico Zenklusen},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Simple Random Order Contention Resolution for Graphic Matroids with
Almost no Prior Information},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {84--95},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch8},
doi = {10.1137/1.9781611977585.CH8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/SantiagoSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/TarjanZ23,
author = {Robert E. Tarjan and
Uri Zwick},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Optimal resizable arrays},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {285--304},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch27},
doi = {10.1137/1.9781611977585.CH27},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/TarjanZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sosa/2023,
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585},
doi = {10.1137/1.9781611977585},
isbn = {978-1-61197-758-5},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/0001KGW22,
author = {Debarati Das and
Evangelos Kipouridis and
Maximilian Probst Gutenberg and
Christian Wulff{-}Nilsen},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {1--11},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.1},
doi = {10.1137/1.9781611977066.1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/0001KGW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/0001RSS22,
author = {Xinrui Jia and
Lars Rohwedder and
Kshiteej Sheth and
Ola Svensson},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Towards Non-Uniform \emph{k}-Center with Constant Types of Radii},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {228--237},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.16},
doi = {10.1137/1.9781611977066.16},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/0001RSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/0001SSU22,
author = {Fabrizio Grandoni and
Chris Schwiegelshohn and
Shay Solomon and
Amitai Uzrad},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Maintaining an {EDCS} in General Graphs: Simpler, Density-Sensitive
and with Worst-Case Time Bounds},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {12--23},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.2},
doi = {10.1137/1.9781611977066.2},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/0001SSU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AhnS22,
author = {Kwangjun Ahn and
Suvrit Sra},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Understanding Nesterov's Acceleration via Proximal Point Method},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {117--130},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.9},
doi = {10.1137/1.9781611977066.9},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/AhnS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AnagnostidesP22,
author = {Ioannis Anagnostides and
Ioannis Panageas},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Frequency-Domain Representation of First-Order Methods: {A} Simple
and Robust Framework of Analysis},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {131--160},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.10},
doi = {10.1137/1.9781611977066.10},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/AnagnostidesP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Ben-EliezerEO22,
author = {Omri Ben{-}Eliezer and
Talya Eden and
Krzysztof Onak},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Adversarially Robust Streaming via Dense-Sparse Trade-offs},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {214--227},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.15},
doi = {10.1137/1.9781611977066.15},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Ben-EliezerEO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BertschingerMMS22,
author = {Daniel Bertschinger and
Nicolas El Maalouly and
Tillmann Miltzow and
Patrick Schnider and
Simon Weber},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Topological Art in Simple Galleries},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {87--116},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.8},
doi = {10.1137/1.9781611977066.8},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BertschingerMMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BouillaguetDT22,
author = {Charles Bouillaguet and
Claire Delaplace and
Monika Trimoska},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {A Simple Deterministic Algorithm for Systems of Quadratic Polynomials
over F\({}_{\mbox{2}}\)},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {285--296},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.22},
doi = {10.1137/1.9781611977066.22},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BouillaguetDT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CaiT22,
author = {Linda Cai and
Clayton Thomas},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {The Short-Side Advantage in Random Matching Markets},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {257--267},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.19},
doi = {10.1137/1.9781611977066.19},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/CaiT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CanonneL22,
author = {Cl{\'{e}}ment L. Canonne and
Hongyi Lyu},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Uniformity Testing in the Shuffle Model: Simpler, Better, Faster},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {182--202},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.13},
doi = {10.1137/1.9781611977066.13},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/CanonneL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CurticapeanX22,
author = {Radu Curticapean and
Mingji Xia},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Parameterizing the Permanent: Hardness for fixed excluded minors},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {297--307},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.23},
doi = {10.1137/1.9781611977066.23},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/CurticapeanX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DeKLN22,
author = {Anindya De and
Sanjeev Khanna and
Huan Li and
Hesam Nikpey},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Nearly Tight Bounds for Discrete Search under Outlier Noise},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {161--173},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.11},
doi = {10.1137/1.9781611977066.11},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/DeKLN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Eppstein22,
author = {David Eppstein},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Finding Relevant Points for Nearest-Neighbor Classification},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {68--78},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.6},
doi = {10.1137/1.9781611977066.6},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Eppstein22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Feldmann0L22,
author = {Andreas Emil Feldmann and
Anish Mukherjee and
Erik Jan van Leeuwen},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {The Parameterized Complexity of the Survivable Network Design Problem},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {37--56},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.4},
doi = {10.1137/1.9781611977066.4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Feldmann0L22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/FuLTTWW022,
author = {Hu Fu and
Pinyan Lu and
Zhihao Gavin Tang and
Abner Turkieltaub and
Hongxun Wu and
Jinzhao Wu and
Qianfan Zhang},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Oblivious Online Contention Resolution Schemes},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {268--278},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.20},
doi = {10.1137/1.9781611977066.20},
timestamp = {Mon, 30 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/FuLTTWW022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GawrychowskiJ22,
author = {Pawel Gawrychowski and
Wojciech Janczewski},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Simpler Adjacency Labeling for Planar Graphs with B-Trees},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {24--36},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.3},
doi = {10.1137/1.9781611977066.3},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GawrychowskiJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GawrychowskiR22,
author = {Pawel Gawrychowski and
Mateusz Rzepecki},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Faster Exponential Algorithm for Permutation Pattern Matching},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {279--284},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.21},
doi = {10.1137/1.9781611977066.21},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GawrychowskiR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/IbrahimpurS22,
author = {Sharat Ibrahimpur and
Chaitanya Swamy},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {A Simple Approximation Algorithm for Vector Scheduling and Applications
to Stochastic Min-Norm Load Balancing},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {247--256},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.18},
doi = {10.1137/1.9781611977066.18},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/IbrahimpurS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/JiangR22,
author = {Haotian Jiang and
Victor Reis},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {A Tighter Relation Between Hereditary Discrepancy and Determinant
Lower Bound},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {308--313},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.24},
doi = {10.1137/1.9781611977066.24},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/JiangR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/LahiriNV22,
author = {Abhiruk Lahiri and
Ilan Newman and
Nithin Varma},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Parameterized Convexity Testing},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {174--181},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.12},
doi = {10.1137/1.9781611977066.12},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/LahiriNV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Manurangsi22,
author = {Pasin Manurangsi},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Tight Bounds for Differentially Private Anonymized Histograms},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {203--213},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.14},
doi = {10.1137/1.9781611977066.14},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Manurangsi22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ODonnellV22,
author = {Ryan O'Donnell and
Ramgopal Venkateswaran},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {The Quantum Union Bound made easy},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {314--320},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.25},
doi = {10.1137/1.9781611977066.25},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ODonnellV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/PyneV22,
author = {Edward Pyne and
Salil P. Vadhan},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Deterministic Approximation of Random Walks via Queries in Graphs
of Unbounded Size},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {57--67},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.5},
doi = {10.1137/1.9781611977066.5},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/PyneV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ThompsonPM22,
author = {Jessica K. Thompson and
Ojas Parekh and
Kunal Marwaha},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {An explicit vector algorithm for high-girth MaxCut},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {238--246},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.17},
doi = {10.1137/1.9781611977066.17},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ThompsonPM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Wang22,
author = {Haitao Wang},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {A Simple Algorithm for Computing the Zone of a Line in an Arrangement
of Lines},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {79--86},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.7},
doi = {10.1137/1.9781611977066.7},
timestamp = {Wed, 20 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Wang22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/X22,
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Front Matter},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {i--v},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.fm},
doi = {10.1137/1.9781611977066.FM},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/X22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sosa/2022,
editor = {Karl Bringmann and
Timothy M. Chan},
title = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066},
doi = {10.1137/1.9781611977066},
isbn = {978-1-61197-706-6},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AneggAZ21,
author = {Georg Anegg and
Haris Angelidakis and
Rico Zenklusen},
editor = {Hung Viet Le and
Valerie King},
title = {Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching
and the F{\"{u}}redi, Kahn, and Seymour Conjecture},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {196--203},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.22},
doi = {10.1137/1.9781611976496.22},
timestamp = {Wed, 17 Mar 2021 13:30:03 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AneggAZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AssadiD21,
author = {Sepehr Assadi and
Aditi Dudeja},
editor = {Hung Viet Le and
Valerie King},
title = {A Simple Semi-Streaming Algorithm for Global Minimum Cuts},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {172--180},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.19},
doi = {10.1137/1.9781611976496.19},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AssadiD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AssadiLT21,
author = {Sepehr Assadi and
S. Cliff Liu and
Robert E. Tarjan},
editor = {Hung Viet Le and
Valerie King},
title = {An Auction Algorithm for Bipartite Matching in Streaming and Massively
Parallel Computation Models},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {165--171},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.18},
doi = {10.1137/1.9781611976496.18},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AssadiLT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AxiotisBBJNTW21,
author = {Kyriakos Axiotis and
Arturs Backurs and
Karl Bringmann and
Ce Jin and
Vasileios Nakos and
Christos Tzamos and
Hongxun Wu},
editor = {Hung Viet Le and
Valerie King},
title = {Fast and Simple Modular Subset Sum},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {57--67},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.6},
doi = {10.1137/1.9781611976496.6},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/AxiotisBBJNTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BerndtJK21,
author = {Sebastian Berndt and
Klaus Jansen and
Kim{-}Manuel Klein},
editor = {Hung Viet Le and
Valerie King},
title = {New Bounds for the Vertices of the Integer Hull},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {25--36},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.3},
doi = {10.1137/1.9781611976496.3},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BerndtJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BiedlLNRS21,
author = {Therese Biedl and
Anna Lubiw and
Anurag Murty Naredla and
Peter Dominik Ralbovsky and
Graeme Stroud},
editor = {Hung Viet Le and
Valerie King},
title = {Dispersion for Intervals: {A} Geometric Approach},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {37--44},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.4},
doi = {10.1137/1.9781611976496.4},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BiedlLNRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BostanM21,
author = {Alin Bostan and
Ryuhei Mori},
editor = {Hung Viet Le and
Valerie King},
title = {A Simple and Fast Algorithm for Computing the \emph{N}-th Term of
a Linearly Recurrent Sequence},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {118--132},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.14},
doi = {10.1137/1.9781611976496.14},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/BostanM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Brand21,
author = {Jan van den Brand},
editor = {Hung Viet Le and
Valerie King},
title = {Unifying Matrix Data Structures: Simplifying and Speeding up Iterative
Algorithms},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {1--13},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.1},
doi = {10.1137/1.9781611976496.1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Brand21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Brodal21,
author = {Gerth St{\o}lting Brodal},
editor = {Hung Viet Le and
Valerie King},
title = {Soft Sequence Heaps},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {14--24},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.2},
doi = {10.1137/1.9781611976496.2},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Brodal21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Cao21,
author = {Yixin Cao},
editor = {Hung Viet Le and
Valerie King},
title = {Recognizing (Unit) Interval Graphs by Zigzag Graph Searches},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {92--106},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.11},
doi = {10.1137/1.9781611976496.11},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/Cao21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CardinalI21,
author = {Jean Cardinal and
John Iacono},
editor = {Hung Viet Le and
Valerie King},
title = {Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {45--56},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.5},
doi = {10.1137/1.9781611976496.5},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/CardinalI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CharikarL21,
author = {Moses Charikar and
Paul Liu},
editor = {Hung Viet Le and
Valerie King},
title = {Improved Algorithms for Edge Colouring in the W-Streaming Model},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {181--183},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.20},
doi = {10.1137/1.9781611976496.20},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/CharikarL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CoupetteL21,
author = {Corinna Coupette and
Christoph Lenzen},
editor = {Hung Viet Le and
Valerie King},
title = {A Breezing Proof of the {KMW} Bound},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {184--195},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.21},
doi = {10.1137/1.9781611976496.21},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/CoupetteL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/EdenFFS21,
author = {Alon Eden and
Michal Feldman and
Amos Fiat and
Kineret Segal},
editor = {Hung Viet Le and
Valerie King},
title = {An Economics-Based Analysis of {RANKING} for Online Bipartite Matching},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {107--110},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.12},
doi = {10.1137/1.9781611976496.12},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/EdenFFS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GawrychowskiMW21,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Hung Viet Le and
Valerie King},
title = {A Note on a Recent Algorithm for Minimum Cut},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {74--79},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.8},
doi = {10.1137/1.9781611976496.8},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GawrychowskiMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GibneyHT21,
author = {Daniel Gibney and
Gary Hoppenworth and
Sharma V. Thankachan},
editor = {Hung Viet Le and
Valerie King},
title = {Simple Reductions from Formula-SAT to Pattern Matching on Labeled
Graphs and Subtree Isomorphism},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {232--242},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.26},
doi = {10.1137/1.9781611976496.26},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/GibneyHT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GuptaK21,
author = {Manoj Gupta and
Shahbaz Khan},
editor = {Hung Viet Le and
Valerie King},
title = {Simple dynamic algorithms for Maximal Independent Set, Maximum Flow
and Maximum Matching},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {86--91},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.10},
doi = {10.1137/1.9781611976496.10},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/GuptaK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KapralovMT21,
author = {Michael Kapralov and
Gilbert Maystre and
Jakab Tardos},
editor = {Hung Viet Le and
Valerie King},
title = {Communication Efficient Coresets for Maximum Matching},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {156--164},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.17},
doi = {10.1137/1.9781611976496.17},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/KapralovMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KargerW21,
author = {David R. Karger and
David P. Williamson},
editor = {Hung Viet Le and
Valerie King},
title = {Recursive Random Contraction Revisited},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {68--73},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.7},
doi = {10.1137/1.9781611976496.7},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/KargerW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KuszmaulL21,
author = {William Kuszmaul and
Charles E. Leiserson},
editor = {Hung Viet Le and
Valerie King},
title = {Floors and Ceilings in Divide-and-Conquer Recurrences},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {133--141},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.15},
doi = {10.1137/1.9781611976496.15},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/KuszmaulL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/LarsenSS21,
author = {Kasper Green Larsen and
Jonathan Lindegaard Starup and
Jesper Steensgaard},
editor = {Hung Viet Le and
Valerie King},
title = {Further Unifying the Landscape of Cell Probe Lower Bounds},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {224--231},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.25},
doi = {10.1137/1.9781611976496.25},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/LarsenSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/LuRSZ21,
author = {Pinyan Lu and
Xuandi Ren and
Enze Sun and
Yubo Zhang},
editor = {Hung Viet Le and
Valerie King},
title = {Generalized Sorting with Predictions},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {111--117},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.13},
doi = {10.1137/1.9781611976496.13},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/LuRSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/MeyerMMW21,
author = {Raphael A. Meyer and
Cameron Musco and
Christopher Musco and
David P. Woodruff},
editor = {Hung Viet Le and
Valerie King},
title = {Hutch++: Optimal Stochastic Trace Estimation},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {142--155},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.16},
doi = {10.1137/1.9781611976496.16},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/MeyerMMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/PilipczukPR21,
author = {Marcin Pilipczuk and
Michal Pilipczuk and
Pawel Rzazewski},
editor = {Hung Viet Le and
Valerie King},
title = {Quasi-polynomial-time algorithm for Independent Set in \emph{P\({}_{\mbox{t}}\)}-free
graphs via shrinking the space of induced paths},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {204--209},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.23},
doi = {10.1137/1.9781611976496.23},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/PilipczukPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/SN21,
author = {{Karthik {C. S.}} and
Inbal Livni Navon},
editor = {Hung Viet Le and
Valerie King},
title = {On Hardness of Approximation of Parameterized Set Cover and Label
Cover: Threshold Graphs from Error Correcting Codes},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {210--223},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.24},
doi = {10.1137/1.9781611976496.24},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/SN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Saranurak21,
author = {Thatchaphol Saranurak},
editor = {Hung Viet Le and
Valerie King},
title = {A Simple Deterministic Algorithm for Edge Connectivity},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {80--85},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.9},
doi = {10.1137/1.9781611976496.9},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Saranurak21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/X21,
editor = {Hung Viet Le and
Valerie King},
title = {Front Matter},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.fm},
doi = {10.1137/1.9781611976496.FM},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sosa/2021,
editor = {Hung Viet Le and
Valerie King},
title = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496},
doi = {10.1137/1.9781611976496},
isbn = {978-1-61197-649-6},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AaronsonR20,
author = {Scott Aaronson and
Patrick Rall},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Quantum Approximate Counting, Simplified},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {24--32},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.5},
doi = {10.1137/1.9781611976014.5},
timestamp = {Tue, 09 Mar 2021 20:52:21 +0100},
biburl = {https://dblp.org/rec/conf/soda/AaronsonR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AsharovCNP0S20,
author = {Gilad Asharov and
T.{-}H. Hubert Chan and
Kartik Nayak and
Rafael Pass and
Ling Ren and
Elaine Shi},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Bucket Oblivious Sort: An Extremely Simple Oblivious Sort},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {8--14},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.2},
doi = {10.1137/1.9781611976014.2},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AsharovCNP0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Barenboim020,
author = {Leonid Barenboim and
Gal Oren},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Distributed Backup Placement in One Round and its Applications to
Maximum Matching Approximation and Self-Stabilization},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {99--105},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.14},
doi = {10.1137/1.9781611976014.14},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Barenboim020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Biniaz20a,
author = {Ahmad Biniaz},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {A Short Proof of the Toughness of Delaunay Triangulations},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {43--46},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.8},
doi = {10.1137/1.9781611976014.8},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Biniaz20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChakrabartyS20,
author = {Deeparnab Chakrabarty and
Paul de Supinski},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {On a Decentralized ({\(\Delta\)}+1)-Graph Coloring Algorithm},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {91--98},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.13},
doi = {10.1137/1.9781611976014.13},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChakrabartyS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Chan20,
author = {Timothy M. Chan},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {33--37},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.6},
doi = {10.1137/1.9781611976014.6},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Chan20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChanH20,
author = {Timothy M. Chan and
Qizheng He},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Reducing 3SUM to Convolution-3SUM},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {1--7},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.1},
doi = {10.1137/1.9781611976014.1},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChanH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChanH20a,
author = {Timothy M. Chan and
Qizheng He},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {On the Change-Making Problem},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {38--42},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.7},
doi = {10.1137/1.9781611976014.7},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChanH20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CharikarWY20,
author = {Moses Charikar and
Xian Wu and
Yinyu Ye},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Adaptive Discrete Phase Retrieval},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {47--56},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.9},
doi = {10.1137/1.9781611976014.9},
timestamp = {Sun, 18 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CharikarWY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenMOS20,
author = {Louis L. Chen and
Will Ma and
James B. Orlin and
David Simchi{-}Levi},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Distributionally Robust Max Flows},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {81--90},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.12},
doi = {10.1137/1.9781611976014.12},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenMOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrenetV20,
author = {Bruno Grenet and
Ilya Volkovich},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {One (more) line on the most Ancient Algorithm in History},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {15--17},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.3},
doi = {10.1137/1.9781611976014.3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GrenetV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Jaiswal020,
author = {Ragesh Jaiswal and
Amit Kumar},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Multiplicative Rank-1 Approximation using Length-Squared Sampling},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {18--23},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.4},
doi = {10.1137/1.9781611976014.4},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Jaiswal020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KarczmarzL20,
author = {Adam Karczmarz and
Jakub Lacki},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Simple Label-Correcting Algorithms for Partially Dynamic Approximate
Shortest Paths in Directed Graphs},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {106--120},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.15},
doi = {10.1137/1.9781611976014.15},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KarczmarzL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Quanrud20,
author = {Kent Quanrud},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Nearly linear time approximations for mixed packing and covering problems
without data structures or randomization},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {69--80},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.11},
doi = {10.1137/1.9781611976014.11},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Quanrud20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/X20a,
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Front Matter},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {1--2},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.fm},
doi = {10.1137/1.9781611976014.FM},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/X20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/YaroslavtsevZ20,
author = {Grigory Yaroslavtsev and
Samson Zhou},
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {Fast Fourier Sparsity Testing},
booktitle = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
pages = {57--68},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014.10},
doi = {10.1137/1.9781611976014.10},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/YaroslavtsevZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2020sosa,
editor = {Martin Farach{-}Colton and
Inge Li G{\o}rtz},
title = {3rd Symposium on Simplicity in Algorithms, {SOSA} 2020, Salt Lake
City, UT, USA, January 6-7, 2020},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976014},
doi = {10.1137/1.9781611976014},
isbn = {978-1-61197-601-4},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2020sosa.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Alman19,
author = {Josh Alman},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {An Illuminating Algorithm for the Light Bulb Problem},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {2:1--2:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.2},
doi = {10.4230/OASICS.SOSA.2019.2},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/Alman19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiB19,
author = {Sepehr Assadi and
Aaron Bernstein},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Towards a Unified Theory of Sparsification for Matching Problems},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {11:1--11:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.11},
doi = {10.4230/OASICS.SOSA.2019.11},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BarbaM19,
author = {Luis Barba and
Wolfgang Mulzer},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Asymmetric Convex Intersection Testing},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.9},
doi = {10.4230/OASICS.SOSA.2019.9},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BarbaM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChangJP19,
author = {Yi{-}Jun Chang and
Wenyu Jin and
Seth Pettie},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Simple Contention Resolution via Multiplicative Weight Updates},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {16:1--16:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.16},
doi = {10.4230/OASICS.SOSA.2019.16},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChangJP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQ019,
author = {Chandra Chekuri and
Kent Quanrud and
Chao Xu},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {{LP} Relaxation and Tree Packing for Minimum k-cuts},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.7},
doi = {10.4230/OASICS.SOSA.2019.7},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQ019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DereniowskiTUW19,
author = {Dariusz Dereniowski and
Stefan Tiegel and
Przemyslaw Uznanski and
Daniel Wolleb{-}Graf},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {A Framework for Searching in Graphs in the Presence of Errors},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {4:1--4:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.4},
doi = {10.4230/OASICS.SOSA.2019.4},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DereniowskiTUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Ducoffe19,
author = {Guillaume Ducoffe},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {A New Application of Orthogonal Range Searching for Computing Giant
Graph Diameters},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {12:1--12:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.12},
doi = {10.4230/OASICS.SOSA.2019.12},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Ducoffe19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FelsnerR19,
author = {Stefan Felsner and
G{\"{u}}nter Rote},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {On Primal-Dual Circle Representations},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.8},
doi = {10.4230/OASICS.SOSA.2019.8},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FelsnerR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FiltserKT19,
author = {Arnold Filtser and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Relaxed Voronoi: {A} Simple Framework for Terminal-Clustering Problems},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.10},
doi = {10.4230/OASICS.SOSA.2019.10},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/FiltserKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GargMT19,
author = {Jugal Garg and
Peter McGlaughlin and
Setareh Taki},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Approximating Maximin Share Allocations},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {20:1--20:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.20},
doi = {10.4230/OASICS.SOSA.2019.20},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GargMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GhaffariW19,
author = {Mohsen Ghaffari and
David Wajc},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate
Matching},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {13:1--13:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.13},
doi = {10.4230/OASICS.SOSA.2019.13},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GhaffariW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JinW19,
author = {Ce Jin and
Hongxun Wu},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for
Subset Sum},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {17:1--17:6},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.17},
doi = {10.4230/OASICS.SOSA.2019.17},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/JinW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Kaplan0ZZ19,
author = {Haim Kaplan and
L{\'{a}}szl{\'{o}} Kozma and
Or Zamir and
Uri Zwick},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Selection from Heaps, Row-Sorted Matrices, and {X+Y} Using Soft Heaps},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {5:1--5:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.5},
doi = {10.4230/OASICS.SOSA.2019.5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Kaplan0ZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KarmalkarP19,
author = {Sushrut Karmalkar and
Eric Price},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Compressed Sensing with Adversarial Sparse Noise via {L1} Regression},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {19:1--19:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.19},
doi = {10.4230/OASICS.SOSA.2019.19},
timestamp = {Mon, 25 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KarmalkarP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KotrbcikS19,
author = {Michal Kotrbc{\'{\i}}k and
Martin Skoviera},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a
Graph},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {14:1--14:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.14},
doi = {10.4230/OASICS.SOSA.2019.14},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KotrbcikS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiuT19,
author = {Sixue Liu and
Robert E. Tarjan},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Simple Concurrent Labeling Algorithms for Connected Components},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {3:1--3:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.3},
doi = {10.4230/OASICS.SOSA.2019.3},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/LiuT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiuV19,
author = {Paul Liu and
Jan Vondr{\'{a}}k},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Submodular Optimization in the MapReduce Model},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {18:1--18:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.18},
doi = {10.4230/OASICS.SOSA.2019.18},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/LiuV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Manurangsi19,
author = {Pasin Manurangsi},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel
and Improved Approximation},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {15:1--15:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.15},
doi = {10.4230/OASICS.SOSA.2019.15},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Manurangsi19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Quanrud19,
author = {Kent Quanrud},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Approximating Optimal Transport With Linear Programs},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {6:1--6:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.6},
doi = {10.4230/OASICS.SOSA.2019.6},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Quanrud19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Rote19,
author = {G{\"{u}}nter Rote},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Isotonic Regression by Dynamic Programming},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {1:1--1:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.1},
doi = {10.4230/OASICS.SOSA.2019.1},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Rote19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/X19,
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {0:i--0:x},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.0},
doi = {10.4230/OASICS.SOSA.2019.0},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/X19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2019sosa,
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-099-6},
isbn = {978-3-95977-099-6},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2019sosa.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/0001V18,
author = {Andrew McGregor and
Sofya Vorotnikova},
editor = {Raimund Seidel},
title = {A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low
Arboricity Graphs},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {14:1--14:4},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.14},
doi = {10.4230/OASICS.SOSA.2018.14},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/0001V18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AggarwalS18,
author = {Divesh Aggarwal and
Noah Stephens{-}Davidowitz},
editor = {Raimund Seidel},
title = {Just Take the Average! An Embarrassingly Simple 2n-Time Algorithm
for {SVP} (and {CVP)}},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {12:1--12:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.12},
doi = {10.4230/OASICS.SOSA.2018.12},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AggarwalS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BerenbrinkKKO18,
author = {Petra Berenbrink and
Dominik Kaaser and
Peter Kling and
Lena Otterbach},
editor = {Raimund Seidel},
title = {Simple and Efficient Leader Election},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {9:1--9:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.9},
doi = {10.4230/OASICS.SOSA.2018.9},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BerenbrinkKKO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BorodinPS18,
author = {Allan Borodin and
Denis Pankratov and
Amirali Salehi{-}Abari},
editor = {Raimund Seidel},
title = {A Simple {PTAS} for the Dual Bin Packing Problem and Advice Complexity
of Its Online Version},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {8:1--8:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.8},
doi = {10.4230/OASICS.SOSA.2018.8},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BorodinPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Cao18,
author = {Yixin Cao},
editor = {Raimund Seidel},
title = {A Naive Algorithm for Feedback Vertex Set},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {1:1--1:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.1},
doi = {10.4230/OASICS.SOSA.2018.1},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Cao18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChakrabartyK18,
author = {Deeparnab Chakrabarty and
Sanjeev Khanna},
editor = {Raimund Seidel},
title = {Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm
for Matrix Scaling},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {4:1--4:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.4},
doi = {10.4230/OASICS.SOSA.2018.4},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChakrabartyK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Chan18a,
author = {Timothy M. Chan},
editor = {Raimund Seidel},
title = {Approximation Schemes for 0-1 Knapsack},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {5:1--5:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.5},
doi = {10.4230/OASICS.SOSA.2018.5},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Chan18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriI18,
author = {Chandra Chekuri and
Mark Idleman},
editor = {Raimund Seidel},
title = {Congestion Minimization for Multipath Routing via Multiroute Flows},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {3:1--3:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.3},
doi = {10.4230/OASICS.SOSA.2018.3},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriR18,
author = {Chandra Chekuri and
Thapanapong Rukkanchanunt},
editor = {Raimund Seidel},
title = {A Note on Iterated Rounding for the Survivable Network Design Problem},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {2:1--2:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.2},
doi = {10.4230/OASICS.SOSA.2018.2},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CohenJN18,
author = {Michael B. Cohen and
T. S. Jayram and
Jelani Nelson},
editor = {Raimund Seidel},
title = {Simple Analyses of the Sparse Johnson-Lindenstrauss Transform},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {15:1--15:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.15},
doi = {10.4230/OASICS.SOSA.2018.15},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CohenJN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EdenR18,
author = {Talya Eden and
Will Rosenbaum},
editor = {Raimund Seidel},
title = {On Sampling Edges Almost Uniformly},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {7:1--7:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.7},
doi = {10.4230/OASICS.SOSA.2018.7},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EdenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenR18,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Raimund Seidel},
title = {Compact {LP} Relaxations for Allocation Problems},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {11:1--11:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.11},
doi = {10.4230/OASICS.SOSA.2018.11},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KopelowitzP18,
author = {Tsvi Kopelowitz and
Ely Porat},
editor = {Raimund Seidel},
title = {A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {10:1--10:5},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.10},
doi = {10.4230/OASICS.SOSA.2018.10},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KopelowitzP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Newman18,
author = {Alantha Newman},
editor = {Raimund Seidel},
title = {Complex Semidefinite Programming and Max-k-Cut},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {13:1--13:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.13},
doi = {10.4230/OASICS.SOSA.2018.13},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Newman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Williams18a,
author = {R. Ryan Williams},
editor = {Raimund Seidel},
title = {Counting Solutions to Polynomial Systems via Reductions},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {6:1--6:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.6},
doi = {10.4230/OASICS.SOSA.2018.6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Williams18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/X18a,
editor = {Raimund Seidel},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {0:i--0:xii},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.0},
doi = {10.4230/OASICS.SOSA.2018.0},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/X18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2018sosa,
editor = {Raimund Seidel},
title = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-064-4},
isbn = {978-3-95977-064-4},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2018sosa.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-22 12:09 CEST from data curated 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:
