@Proceedings{chakrabarti_et_al:LIPIcs.APPROX/RANDOM.2022,
title = {{LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {1--1064},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022},
URN = {urn:nbn:de:0030-drops-171211},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022},
annote = {Keywords: LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume}
}
@InProceedings{chakrabarti_et_al:LIPIcs.APPROX/RANDOM.2022.0,
author = {Chakrabarti, Amit and Swamy, Chaitanya},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.0},
URN = {urn:nbn:de:0030-drops-171229},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{bansal_et_al:LIPIcs.APPROX/RANDOM.2022.1,
author = {Bansal, Nikhil and Laddha, Aditi and Vempala, Santosh},
title = {{A Unified Approach to Discrepancy Minimization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {1:1--1:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.1},
URN = {urn:nbn:de:0030-drops-171238},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.1},
annote = {Keywords: Discrepancy theory, smoothed analysis}
}
@InProceedings{lee_et_al:LIPIcs.APPROX/RANDOM.2022.2,
author = {Lee, Chin Ho and Pyne, Edward and Vadhan, Salil},
title = {{Fourier Growth of Regular Branching Programs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {2:1--2:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.2},
URN = {urn:nbn:de:0030-drops-171247},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.2},
annote = {Keywords: pseudorandomness, fourier analysis}
}
@InProceedings{kaufman_et_al:LIPIcs.APPROX/RANDOM.2022.3,
author = {Kaufman, Tali and Mass, David},
title = {{Double Balanced Sets in High Dimensional Expanders}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {3:1--3:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.3},
URN = {urn:nbn:de:0030-drops-171257},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.3},
annote = {Keywords: High dimensional expanders, Double balanced sets, Pseudorandom functions}
}
@InProceedings{blanca_et_al:LIPIcs.APPROX/RANDOM.2022.4,
author = {Blanca, Antonio and Cannon, Sarah and Perkins, Will},
title = {{Fast and Perfect Sampling of Subgraphs and Polymer Systems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.4},
URN = {urn:nbn:de:0030-drops-171261},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.4},
annote = {Keywords: Random Sampling, perfect sampling, graphlets, polymer models, spin systems, percolation}
}
@InProceedings{kaufman_et_al:LIPIcs.APPROX/RANDOM.2022.5,
author = {Kaufman, Tali and Oppenheim, Izhar},
title = {{High Dimensional Expansion Implies Amplified Local Testability}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {5:1--5:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.5},
URN = {urn:nbn:de:0030-drops-171276},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.5},
annote = {Keywords: Locally testable codes, High dimensional expanders, Amplified testing}
}
@InProceedings{girish_et_al:LIPIcs.APPROX/RANDOM.2022.6,
author = {Girish, Uma and Mittal, Kunal and Raz, Ran and Zhan, Wei},
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)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.6},
URN = {urn:nbn:de:0030-drops-171286},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.6},
annote = {Keywords: Parallel repetition, Multi-prover games, Fourier analysis}
}
@InProceedings{mehta_et_al:LIPIcs.APPROX/RANDOM.2022.7,
author = {Mehta, Hermish and Reichman, Daniel},
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)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.7},
URN = {urn:nbn:de:0030-drops-171299},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.7},
annote = {Keywords: Graph Algorithms, Random Graphs, Data Structures and Algorithms, Discrete Mathematics}
}
@InProceedings{gabrys_et_al:LIPIcs.APPROX/RANDOM.2022.8,
author = {Gabrys, Ryan and Guruswami, Venkatesan and Ribeiro, Jo\~{a}o and Wu, Ke},
title = {{Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.8},
URN = {urn:nbn:de:0030-drops-171302},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.8},
annote = {Keywords: Synchronization errors, Optimal redundancy, Explicit codes}
}
@InProceedings{huang_et_al:LIPIcs.APPROX/RANDOM.2022.9,
author = {Huang, Xuangui and Ivanov, Peter and Viola, Emanuele},
title = {{Affine Extractors and AC0-Parity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.9},
URN = {urn:nbn:de:0030-drops-171313},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.9},
annote = {Keywords: affine extractor, resilient function, constant-depth circuit, parity gate, inner product}
}
@InProceedings{song_et_al:LIPIcs.APPROX/RANDOM.2022.10,
author = {Song, Zhao and Zhang, Ruizhe},
title = {{Hyperbolic Concentration, Anti-Concentration, and Discrepancy}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.10},
URN = {urn:nbn:de:0030-drops-171324},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.10},
annote = {Keywords: Hyperbolic polynomial, Chernoff bound, Concentration, Discrepancy theory, Anti-concentration}
}
@InProceedings{karliner_et_al:LIPIcs.APPROX/RANDOM.2022.11,
author = {Karliner, Dan and Ta-Shma, Amnon},
title = {{Improved Local Testing for Multiplicity Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {11:1--11:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.11},
URN = {urn:nbn:de:0030-drops-171339},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.11},
annote = {Keywords: local testing, multiplicity codes, Reed Muller codes}
}
@InProceedings{kalev_et_al:LIPIcs.APPROX/RANDOM.2022.12,
author = {Kalev, Itay and Ta-Shma, Amnon},
title = {{Unbalanced Expanders from Multiplicity Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.12},
URN = {urn:nbn:de:0030-drops-171346},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.12},
annote = {Keywords: Condensers, Multiplicity codes, Differential equations}
}
@InProceedings{li_et_al:LIPIcs.APPROX/RANDOM.2022.13,
author = {Li, Yi and Lin, Honghao and Woodruff, David P. and Zhang, Yuheng},
title = {{Streaming Algorithms with Large Approximation Factors}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {13:1--13:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.13},
URN = {urn:nbn:de:0030-drops-171354},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.13},
annote = {Keywords: streaming algorithms, 𝓁\underlinep norm, heavy hitters, distinct elements}
}
@InProceedings{kedia_et_al:LIPIcs.APPROX/RANDOM.2022.14,
author = {Kedia, Hridesh and Oh, Shunhao and Randall, Dana},
title = {{Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.14},
URN = {urn:nbn:de:0030-drops-171367},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.14},
annote = {Keywords: Self-organizing particle systems, alignment, Markov chains, active matter}
}
@InProceedings{skorski:LIPIcs.APPROX/RANDOM.2022.15,
author = {Skorski, Maciej},
title = {{Tight Chernoff-Like Bounds Under Limited Independence}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.15},
URN = {urn:nbn:de:0030-drops-171372},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.15},
annote = {Keywords: concentration inequalities, tail bounds, limited independence, k-wise independence}
}
@InProceedings{gaitonde_et_al:LIPIcs.APPROX/RANDOM.2022.16,
author = {Gaitonde, Jason and Hopkins, Max and Kaufman, Tali and Lovett, Shachar and Zhang, Ruizhe},
title = {{Eigenstripping, Spectral Decay, and Edge-Expansion on Posets}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {16:1--16:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.16},
URN = {urn:nbn:de:0030-drops-171381},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.16},
annote = {Keywords: High-dimensional expanders, posets, eposets}
}
@InProceedings{duursma_et_al:LIPIcs.APPROX/RANDOM.2022.17,
author = {Duursma, Iwan and Gabrys, Ryan and Guruswami, Venkatesan and Lin, Ting-Chun and Wang, Hsin-Po},
title = {{Accelerating Polarization via Alphabet Extension}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.17},
URN = {urn:nbn:de:0030-drops-171393},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.17},
annote = {Keywords: polar code, scaling exponent}
}
@InProceedings{esperet_et_al:LIPIcs.APPROX/RANDOM.2022.18,
author = {Esperet, Louis and Harms, Nathaniel and Kupavskii, Andrey},
title = {{Sketching Distances in Monotone Graph Classes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {18:1--18:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.18},
URN = {urn:nbn:de:0030-drops-171406},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.18},
annote = {Keywords: adjacency labelling, informative labelling, distance sketching, adjacency sketching, communication complexity}
}
@InProceedings{goos_et_al:LIPIcs.APPROX/RANDOM.2022.19,
author = {G\"{o}\"{o}s, Mika and Jain, Siddhartha},
title = {{Communication Complexity of Collision}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {19:1--19:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.19},
URN = {urn:nbn:de:0030-drops-171415},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.19},
annote = {Keywords: Collision, Communication complexity, Lifting}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX/RANDOM.2022.20,
author = {Guruswami, Venkatesan and Lyu, Xin and Wang, Xiuhan},
title = {{Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {20:1--20:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.20},
URN = {urn:nbn:de:0030-drops-171428},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.20},
annote = {Keywords: Pseudorandomness, Explicit constructions, Low-depth circuits, Boolean function analysis, Hitting sets}
}
@InProceedings{bhargava_et_al:LIPIcs.APPROX/RANDOM.2022.21,
author = {Bhargava, Vishwas and Garg, Ankit and Kayal, Neeraj and Saha, Chandan},
title = {{Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {21:1--21:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.21},
URN = {urn:nbn:de:0030-drops-171430},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.21},
annote = {Keywords: Arithemtic Circuits, Average-case Learning, Depth 3 Arithmetic Circuits, Learning Algorithms, Learning Circuits, Circuit Reconstruction}
}
@InProceedings{hatami_et_al:LIPIcs.APPROX/RANDOM.2022.22,
author = {Hatami, Hamed and Hatami, Pooya and Pires, William and Tao, Ran and Zhao, Rosie},
title = {{Lower Bound Methods for Sign-Rank and Their Limitations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {22:1--22:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.22},
URN = {urn:nbn:de:0030-drops-171445},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.22},
annote = {Keywords: Average Margin, Communication complexity, margin complexity, monochromatic rectangle, Sign-rank, Unbounded-error communication complexity, VC-dimension}
}
@InProceedings{arvind_et_al:LIPIcs.APPROX/RANDOM.2022.23,
author = {Arvind, V. and Chatterjee, Abhranil and Mukhopadhyay, Partha},
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)},
pages = {23:1--23:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.23},
URN = {urn:nbn:de:0030-drops-171451},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.23},
annote = {Keywords: Rational Identity Testing, Black-box Derandomization, Cyclic Division Algebra, Matrix coefficient realization theory}
}
@InProceedings{blanca_et_al:LIPIcs.APPROX/RANDOM.2022.24,
author = {Blanca, Antonio and Gheissari, Reza},
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)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.24},
URN = {urn:nbn:de:0030-drops-171463},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.24},
annote = {Keywords: Potts model, random-cluster model, random graphs, Markov chains, mixing time, tree uniqueness}
}
@InProceedings{feng_et_al:LIPIcs.APPROX/RANDOM.2022.25,
author = {Feng, Weiming and Guo, Heng and Wang, Jiaheng},
title = {{Improved Bounds for Randomly Colouring Simple Hypergraphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.25},
URN = {urn:nbn:de:0030-drops-171477},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.25},
annote = {Keywords: Approximate counting, Markov chain, Mixing time, Hypergraph colouring}
}
@InProceedings{manor_et_al:LIPIcs.APPROX/RANDOM.2022.26,
author = {Manor, Yahel and Meir, Or},
title = {{Lifting with Inner Functions of Polynomial Discrepancy}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {26:1--26:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.26},
URN = {urn:nbn:de:0030-drops-171486},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.26},
annote = {Keywords: Lifting, communication complexity, query complexity, discrepancy}
}
@InProceedings{chakraborty_et_al:LIPIcs.APPROX/RANDOM.2022.27,
author = {Chakraborty, Sourav and Fischer, Eldar and Ghosh, Arijit and Mishra, Gopinath and Sen, Sayantan},
title = {{Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {27:1--27:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.27},
URN = {urn:nbn:de:0030-drops-171497},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.27},
annote = {Keywords: Distribution Testing, Tolerant Testing, Non-tolerant Testing, Sample Complexity}
}
@InProceedings{morters_et_al:LIPIcs.APPROX/RANDOM.2022.28,
author = {M\"{o}rters, Peter and Sohler, Christian and Walzer, Stefan},
title = {{A Sublinear Local Access Implementation for the Chinese Restaurant Process}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.28},
URN = {urn:nbn:de:0030-drops-171500},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.28},
annote = {Keywords: Chinese restaurant process, Dirichlet process, sublinear time algorithm, random recursive tree, random permutation, random partition, Ewens distribution, simulation, local access implementation, continuous time embedding}
}
@InProceedings{gao_et_al:LIPIcs.APPROX/RANDOM.2022.29,
author = {Gao, Pu and MacRury, Calum and Pra{\l}at, Pawe{\l}},
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)},
pages = {29:1--29:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.29},
URN = {urn:nbn:de:0030-drops-171517},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.29},
annote = {Keywords: Random graphs and processes, Online adaptive algorithms, Hamiltonian cycles, Differential equation method}
}
@InProceedings{kiwi_et_al:LIPIcs.APPROX/RANDOM.2022.30,
author = {Kiwi, Marcos and Schepers, Markus and Sylvester, John},
title = {{Cover and Hitting Times of Hyperbolic Random Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {30:1--30:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.30},
URN = {urn:nbn:de:0030-drops-171523},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.30},
annote = {Keywords: Random walk, hyperbolic random graph, cover time, hitting time, average hitting time, target time, effective resistance, Kirchhoff index}
}
@InProceedings{mahabadi_et_al:LIPIcs.APPROX/RANDOM.2022.31,
author = {Mahabadi, Sepideh and Woodruff, David P. and Zhou, Samson},
title = {{Adaptive Sketches for Robust Regression with Importance Sampling}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {31:1--31:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.31},
URN = {urn:nbn:de:0030-drops-171531},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.31},
annote = {Keywords: Streaming algorithms, stochastic optimization, importance sampling}
}
@InProceedings{apers_et_al:LIPIcs.APPROX/RANDOM.2022.32,
author = {Apers, Simon and Gawrychowski, Pawe{\l} and Lee, Troy},
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)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.32},
URN = {urn:nbn:de:0030-drops-171544},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.32},
annote = {Keywords: Graph theory}
}
@InProceedings{feldman_et_al:LIPIcs.APPROX/RANDOM.2022.33,
author = {Feldman, Moran and Szarf, Ariel},
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)},
pages = {33:1--33:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.33},
URN = {urn:nbn:de:0030-drops-171559},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.33},
annote = {Keywords: Maximum matching, semi-streaming algorithms, multi-pass algorithms}
}
@InProceedings{deng_et_al:LIPIcs.APPROX/RANDOM.2022.34,
author = {Deng, Shichuan and Zhang, Qianfan},
title = {{Ordered k-Median with Outliers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {34:1--34:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.34},
URN = {urn:nbn:de:0030-drops-171560},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.34},
annote = {Keywords: clustering, approximation algorithm, design and analysis of algorithms}
}
@InProceedings{chou_et_al:LIPIcs.APPROX/RANDOM.2022.35,
author = {Chou, Chi-Ning and Golovnev, Alexander and Shahrasbi, Amirbehshad and Sudan, Madhu and Velusamy, Santhoshini},
title = {{Sketching Approximability of (Weak) Monarchy Predicates}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {35:1--35:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.35},
URN = {urn:nbn:de:0030-drops-171573},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.35},
annote = {Keywords: sketching algorithms, approximability, linear threshold functions}
}
@InProceedings{fukunaga:LIPIcs.APPROX/RANDOM.2022.36,
author = {Fukunaga, Takuro},
title = {{Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {36:1--36:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.36},
URN = {urn:nbn:de:0030-drops-171581},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.36},
annote = {Keywords: coflow scheduling, hypergraph matching, approximation algorithm}
}
@InProceedings{schwartz_et_al:LIPIcs.APPROX/RANDOM.2022.37,
author = {Schwartz, Roy and Zats, Roded},
title = {{Fair Correlation Clustering in General Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {37:1--37:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.37},
URN = {urn:nbn:de:0030-drops-171591},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.37},
annote = {Keywords: Correlation Clustering, Approximation Algorithms, Semi-Definite Programming}
}
@InProceedings{boyland_et_al:LIPIcs.APPROX/RANDOM.2022.38,
author = {Boyland, Joanna and Hwang, Michael and Prasad, Tarun and Singer, Noah and Velusamy, Santhoshini},
title = {{On Sketching Approximations for Symmetric Boolean CSPs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {38:1--38:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.38},
URN = {urn:nbn:de:0030-drops-171604},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.38},
annote = {Keywords: Streaming algorithms, constraint satisfaction problems, approximability}
}
@InProceedings{biswas_et_al:LIPIcs.APPROX/RANDOM.2022.39,
author = {Biswas, Amartya Shankha and Eden, Talya and Liu, Quanquan C. and Rubinfeld, Ronitt and Mitrovi\'{c}, Slobodan},
title = {{Massively Parallel Algorithms for Small Subgraph Counting}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {39:1--39:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.39},
URN = {urn:nbn:de:0030-drops-171619},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.39},
annote = {Keywords: triangle counting, massively parallel computation, clique counting, approximation algorithms, subgraph counting}
}
@InProceedings{spielman_et_al:LIPIcs.APPROX/RANDOM.2022.40,
author = {Spielman, Daniel A. and Zhang, Peng},
title = {{Hardness Results for Weaver’s Discrepancy Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {40:1--40:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.40},
URN = {urn:nbn:de:0030-drops-171628},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.40},
annote = {Keywords: Discrepancy Problem, Kadison-Singer Problem, Hardness of Approximation}
}
@InProceedings{dinitz_et_al:LIPIcs.APPROX/RANDOM.2022.41,
author = {Dinitz, Michael and Koranteng, Ama and Kortsarz, Guy},
title = {{Relative Survivable Network Design}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {41:1--41:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.41},
URN = {urn:nbn:de:0030-drops-171632},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.41},
annote = {Keywords: Fault Tolerance, Network Design}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX/RANDOM.2022.42,
author = {Guruswami, Venkatesan and Kothari, Pravesh K. and Manohar, Peter},
title = {{Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {42:1--42:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.42},
URN = {urn:nbn:de:0030-drops-171642},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.42},
annote = {Keywords: Planted clique, Average-case complexity, Spectral refutation, Random matrix theory}
}
@InProceedings{ghoshal_et_al:LIPIcs.APPROX/RANDOM.2022.43,
author = {Ghoshal, Suprovat and Louis, Anand},
title = {{Approximating CSPs with Outliers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {43:1--43:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.43},
URN = {urn:nbn:de:0030-drops-171656},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.43},
annote = {Keywords: Constraint Satisfaction Problems, Strong Unique Games, Threshold Rank}
}
@InProceedings{qiu_et_al:LIPIcs.APPROX/RANDOM.2022.44,
author = {Qiu, Frederick and Singla, Sahil},
title = {{Submodular Dominance and Applications}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {44:1--44:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.44},
URN = {urn:nbn:de:0030-drops-171666},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.44},
annote = {Keywords: Submodular Optimization, Negative Dependence, Negative Association, Weak Negative Regression, Submodular Dominance, Submodular Prophet Inequality}
}
@InProceedings{bienkowski_et_al:LIPIcs.APPROX/RANDOM.2022.45,
author = {Bienkowski, Marcin and B\"{o}hm, Martin and Byrka, Jaros{\l}aw and Marcinkowski, Jan},
title = {{Online Facility Location with Linear Delay}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {45:1--45:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.45},
URN = {urn:nbn:de:0030-drops-171678},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.45},
annote = {Keywords: online facility location, network design problems, facility location with delay, JMS algorithm, competitive analysis, factor revealing LP}
}
@InProceedings{borodin_et_al:LIPIcs.APPROX/RANDOM.2022.46,
author = {Borodin, Allan and MacRury, Calum and Rakheja, Akash},
title = {{Prophet Matching in the Probe-Commit Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {46:1--46:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.46},
URN = {urn:nbn:de:0030-drops-171686},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.46},
annote = {Keywords: Stochastic probing, Online algorithms, Bipartite matching, Optimization under uncertainty}
}
@InProceedings{ghoshal:LIPIcs.APPROX/RANDOM.2022.47,
author = {Ghoshal, Suprovat},
title = {{The Biased Homogeneous r-Lin Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.47},
URN = {urn:nbn:de:0030-drops-171695},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.47},
annote = {Keywords: Biased Approximation Resistance, Constraint Satisfaction Problems}
}
@InProceedings{assadi_et_al:LIPIcs.APPROX/RANDOM.2022.48,
author = {Assadi, Sepehr and Nguyen, Hoai-An},
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)},
pages = {48:1--48:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.48},
URN = {urn:nbn:de:0030-drops-171708},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.48},
annote = {Keywords: Sublinear time algorithms, h-index, asymptotically optimal bounds, lower bounds, subgraph counting}
}
@InProceedings{klimm_et_al:LIPIcs.APPROX/RANDOM.2022.49,
author = {Klimm, Max and Knaack, Martin},
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)},
pages = {49:1--49:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.49},
URN = {urn:nbn:de:0030-drops-171711},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.49},
annote = {Keywords: submodular function, knapsack, approximation algorithm, robust optimization}
}
@InProceedings{stankovic:LIPIcs.APPROX/RANDOM.2022.50,
author = {Stankovi\'{c}, Aleksa},
title = {{Some Results on Approximability of Minimum Sum Vertex Cover}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {50:1--50:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.50},
URN = {urn:nbn:de:0030-drops-171722},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.50},
annote = {Keywords: Hardness of approximation, approximability, approximation algorithms, Label Cover, Unique Games Conjecture, Vertex Cover}
}
@InProceedings{elkin_et_al:LIPIcs.APPROX/RANDOM.2022.51,
author = {Elkin, Michael and Trehan, Chhaya},
title = {{(1+\epsilon)-Approximate Shortest Paths in Dynamic Streams}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {51:1--51:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.51},
URN = {urn:nbn:de:0030-drops-171733},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.51},
annote = {Keywords: Shortest Paths, Dynamic Streams, Approximate Distances, Spanners, Hopsets}
}
@InProceedings{ibrahimpur_et_al:LIPIcs.APPROX/RANDOM.2022.52,
author = {Ibrahimpur, Sharat and Purohit, Manish and Svitkina, Zoya and Vee, Erik and Wang, Joshua R.},
title = {{Caching with Reserves}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {52:1--52:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.52},
URN = {urn:nbn:de:0030-drops-171741},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.52},
annote = {Keywords: Approximation Algorithms, Online Algorithms, Caching}
}
@InProceedings{naidu_et_al:LIPIcs.APPROX/RANDOM.2022.53,
author = {Naidu, Kheeran K. and Shah, Vihan},
title = {{Space Optimal Vertex Cover in Dynamic Streams}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {53:1--53:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.53},
URN = {urn:nbn:de:0030-drops-171753},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.53},
annote = {Keywords: Graph Streaming Algorithms, Vertex Cover, Dynamic Streams, Approximation Algorithm}
}
@InProceedings{das_et_al:LIPIcs.APPROX/RANDOM.2022.54,
author = {Das, Debarati and Saha, Barna},
title = {{Approximating LCS and Alignment Distance over Multiple Sequences}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {54:1--54:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.54},
URN = {urn:nbn:de:0030-drops-171762},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.54},
annote = {Keywords: String Algorithms, Approximation Algorithms}
}
@InProceedings{friedrich_et_al:LIPIcs.APPROX/RANDOM.2022.55,
author = {Friedrich, Tobias and Issac, Davis and Kumar, Nikhil and Mallek, Nadym and Zeif, Ziena},
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)},
pages = {55:1--55:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.55},
URN = {urn:nbn:de:0030-drops-171774},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.55},
annote = {Keywords: Approximation Algorithms, Multicommodity Flow, Multicut}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing