Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/approx/approx2022.bht:"
download as .bib file
@inproceedings{DBLP:conf/approx/ApersGL22,
author = {Simon Apers and
Pawel Gawrychowski and
Troy Lee},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Finding the {KT} Partition of a Weighted Graph in Near-Linear Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {32:1--32:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.32},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.32},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ApersGL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ArvindCM22,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Black-Box Identity Testing of Noncommutative Rational Formulas of
Inversion Height Two in Deterministic Quasipolynomial Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.23},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.23},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ArvindCM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AssadiN22,
author = {Sepehr Assadi and
Hoai{-}An Nguyen},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Asymptotically Optimal Bounds for Estimating H-Index in Sublinear
Time with Applications to Subgraph Counting},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {48:1--48:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.48},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.48},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AssadiN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BansalLV22,
author = {Nikhil Bansal and
Aditi Laddha and
Santosh S. Vempala},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {A Unified Approach to Discrepancy Minimization},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {1:1--1:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.1},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.1},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BansalLV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhargavaGKS22,
author = {Vishwas Bhargava and
Ankit Garg and
Neeraj Kayal and
Chandan Saha},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate
Case},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {21:1--21:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.21},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.21},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BhargavaGKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BienkowskiBBM22,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Jan Marcinkowski},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Online Facility Location with Linear Delay},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {45:1--45:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.45},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.45},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BienkowskiBBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BiswasELRM22,
author = {Amartya Shankha Biswas and
Talya Eden and
Quanquan C. Liu and
Ronitt Rubinfeld and
Slobodan Mitrovic},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Massively Parallel Algorithms for Small Subgraph Counting},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {39:1--39:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.39},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.39},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BiswasELRM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlancaCP22,
author = {Antonio Blanca and
Sarah Cannon and
Will Perkins},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Fast and Perfect Sampling of Subgraphs and Polymer Systems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.4},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.4},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlancaCP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlancaG22,
author = {Antonio Blanca and
Reza Gheissari},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster
Dynamics},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {24:1--24:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.24},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.24},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlancaG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BorodinMR22,
author = {Allan Borodin and
Calum MacRury and
Akash Rakheja},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Prophet Matching in the Probe-Commit Model},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {46:1--46:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.46},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.46},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BorodinMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BoylandHPSV22,
author = {Joanna Boyland and
Michael Hwang and
Tarun Prasad and
Noah Singer and
Santhoshini Velusamy},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {On Sketching Approximations for Symmetric Boolean CSPs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {38:1--38:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.38},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.38},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BoylandHPSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChakrabortyFGMS22,
author = {Sourav Chakraborty and
Eldar Fischer and
Arijit Ghosh and
Gopinath Mishra and
Sayantan Sen},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {27:1--27:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.27},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.27},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChakrabortyFGMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChouGSSV22,
author = {Chi{-}Ning Chou and
Alexander Golovnev and
Amirbehshad Shahrasbi and
Madhu Sudan and
Santhoshini Velusamy},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Sketching Approximability of (Weak) Monarchy Predicates},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {35:1--35:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.35},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.35},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChouGSSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DasS22,
author = {Debarati Das and
Barna Saha},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Approximating {LCS} and Alignment Distance over Multiple Sequences},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {54:1--54:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.54},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.54},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DasS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DengZ22,
author = {Shichuan Deng and
Qianfan Zhang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Ordered k-Median with Outliers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {34:1--34:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.34},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.34},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DengZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzKK22,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Relative Survivable Network Design},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {41:1--41:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.41},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.41},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DuursmaGGLW22,
author = {Iwan M. Duursma and
Ryan Gabrys and
Venkatesan Guruswami and
Ting{-}Chun Lin and
Hsin{-}Po Wang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Accelerating Polarization via Alphabet Extension},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.17},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.17},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DuursmaGGLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ElkinT22,
author = {Michael Elkin and
Chhaya Trehan},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {(1+{\(\epsilon\)})-Approximate Shortest Paths in Dynamic Streams},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {51:1--51:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.51},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.51},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ElkinT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EsperetHK22,
author = {Louis Esperet and
Nathaniel Harms and
Andrey Kupavskii},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Sketching Distances in Monotone Graph Classes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {18:1--18:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.18},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.18},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/EsperetHK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeldmanS22,
author = {Moran Feldman and
Ariel Szarf},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Maximum Matching Sans Maximal Matching: {A} New Approach for Finding
Maximum Matchings in the Data Stream Model},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {33:1--33:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.33},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.33},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/FeldmanS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FengGW22,
author = {Weiming Feng and
Heng Guo and
Jiaheng Wang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Improved Bounds for Randomly Colouring Simple Hypergraphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.25},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.25},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/FengGW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FriedrichIKMZ22,
author = {Tobias Friedrich and
Davis Issac and
Nikhil Kumar and
Nadym Mallek and
Ziena Zeif},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in
Treewidth-2 Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {55:1--55:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.55},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.55},
timestamp = {Mon, 19 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/FriedrichIKMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Fukunaga22,
author = {Takuro Fukunaga},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Integrality Gap of Time-Indexed Linear Programming Relaxation for
Coflow Scheduling},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {36:1--36:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.36},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.36},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Fukunaga22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GabrysGRW22,
author = {Ryan Gabrys and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro and
Ke Wu},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {8:1--8:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.8},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.8},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/GabrysGRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GaitondeHKLZ22,
author = {Jason Gaitonde and
Max Hopkins and
Tali Kaufman and
Shachar Lovett and
Ruizhe Zhang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Eigenstripping, Spectral Decay, and Edge-Expansion on Posets},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {16:1--16:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.16},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.16},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GaitondeHKLZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GaoMP22,
author = {Pu Gao and
Calum MacRury and
Pawel Pralat},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random
Graph Process},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {29:1--29:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.29},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.29},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GaoMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Ghoshal22,
author = {Suprovat Ghoshal},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {The Biased Homogeneous r-Lin Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {47:1--47:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.47},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.47},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Ghoshal22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GhoshalL22,
author = {Suprovat Ghoshal and
Anand Louis},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Approximating CSPs with Outliers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {43:1--43:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.43},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.43},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GhoshalL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GirishMRZ22,
author = {Uma Girish and
Kunal Mittal and
Ran Raz and
Wei Zhan},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Polynomial Bounds on Parallel Repetition for All 3-Player Games with
Binary Inputs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.6},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GirishMRZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GoosJ22,
author = {Mika G{\"{o}}{\"{o}}s and
Siddhartha Jain},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Communication Complexity of Collision},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {19:1--19:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.19},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.19},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GoosJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiKM22,
author = {Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Bypassing the {XOR} Trick: Stronger Certificates for Hypergraph Clique
Number},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {42:1--42:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.42},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.42},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiLW22,
author = {Venkatesan Guruswami and
Xin Lyu and
Xiuhan Wang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {20:1--20:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.20},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.20},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuruswamiLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HatamiHPTZ22,
author = {Hamed Hatami and
Pooya Hatami and
William Pires and
Ran Tao and
Rosie Zhao},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Lower Bound Methods for Sign-Rank and Their Limitations},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {22:1--22:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.22},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.22},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/HatamiHPTZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HuangIV22,
author = {Xuangui Huang and
Peter Ivanov and
Emanuele Viola},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Affine Extractors and AC0-Parity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.9},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.9},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/HuangIV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/IbrahimpurPSVW22,
author = {Sharat Ibrahimpur and
Manish Purohit and
Zoya Svitkina and
Erik Vee and
Joshua R. Wang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Caching with Reserves},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {52:1--52:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.52},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.52},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/IbrahimpurPSVW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KalevT22,
author = {Itay Kalev and
Amnon Ta{-}Shma},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Unbalanced Expanders from Multiplicity Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.12},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.12},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KalevT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KarlinerT22,
author = {Dan Karliner and
Amnon Ta{-}Shma},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Improved Local Testing for Multiplicity Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {11:1--11:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.11},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.11},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KarlinerT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KaufmanM22,
author = {Tali Kaufman and
David Mass},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Double Balanced Sets in High Dimensional Expanders},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {3:1--3:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.3},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.3},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KaufmanM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KaufmanO22,
author = {Tali Kaufman and
Izhar Oppenheim},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {High Dimensional Expansion Implies Amplified Local Testability},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {5:1--5:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.5},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.5},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/KaufmanO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KediaOR22,
author = {Hridesh Kedia and
Shunhao Oh and
Dana Randall},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Local Stochastic Algorithms for Alignment in Self-Organizing Particle
Systems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {14:1--14:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.14},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.14},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KediaOR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KiwiSS22,
author = {Marcos Kiwi and
Markus Schepers and
John Sylvester},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Cover and Hitting Times of Hyperbolic Random Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {30:1--30:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.30},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.30},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KiwiSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KlimmK22,
author = {Max Klimm and
Martin Knaack},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Maximizing a Submodular Function with Bounded Curvature Under an Unknown
Knapsack Constraint},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {49:1--49:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.49},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.49},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KlimmK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LeePV22,
author = {Chin Ho Lee and
Edward Pyne and
Salil P. Vadhan},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Fourier Growth of Regular Branching Programs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {2:1--2:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.2},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.2},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LeePV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LiLWZ22,
author = {Yi Li and
Honghao Lin and
David P. Woodruff and
Yuheng Zhang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Streaming Algorithms with Large Approximation Factors},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {13:1--13:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.13},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.13},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LiLWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MahabadiWZ22,
author = {Sepideh Mahabadi and
David P. Woodruff and
Samson Zhou},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Adaptive Sketches for Robust Regression with Importance Sampling},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {31:1--31:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.31},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.31},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/MahabadiWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ManorM22,
author = {Yahel Manor and
Or Meir},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Lifting with Inner Functions of Polynomial Discrepancy},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {26:1--26:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.26},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.26},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ManorM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MehtaR22,
author = {Hermish Mehta and
Daniel Reichman},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Local Treewidth of Random and Noisy Graphs with Applications to Stopping
Contagion in Networks},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {7:1--7:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.7},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.7},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/MehtaR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MortersSW22,
author = {Peter M{\"{o}}rters and
Christian Sohler and
Stefan Walzer},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {A Sublinear Local Access Implementation for the Chinese Restaurant
Process},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {28:1--28:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.28},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.28},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/MortersSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/NaiduS22,
author = {Kheeran K. Naidu and
Vihan Shah},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Space Optimal Vertex Cover in Dynamic Streams},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {53:1--53:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.53},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.53},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/NaiduS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/QiuS22,
author = {Frederick Qiu and
Sahil Singla},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Submodular Dominance and Applications},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {44:1--44:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.44},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.44},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/QiuS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SchwartzZ22,
author = {Roy Schwartz and
Roded Zats},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Fair Correlation Clustering in General Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {37:1--37:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.37},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.37},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/SchwartzZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Skorski22,
author = {Maciej Skorski},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Tight Chernoff-Like Bounds Under Limited Independence},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {15:1--15:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.15},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.15},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Skorski22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SongZ22,
author = {Zhao Song and
Ruizhe Zhang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Hyperbolic Concentration, Anti-Concentration, and Discrepancy},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.10},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.10},
timestamp = {Thu, 29 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/SongZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SpielmanZ22,
author = {Daniel A. Spielman and
Peng Zhang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Hardness Results for Weaver's Discrepancy Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {40:1--40:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.40},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.40},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/SpielmanZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Stankovic22,
author = {Aleksa Stankovic},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Some Results on Approximability of Minimum Sum Vertex Cover},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {50:1--50:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.50},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.50},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Stankovic22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2022,
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-249-5},
isbn = {978-3-95977-249-5},
timestamp = {Sat, 17 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2022.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-26 00:35 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:
