42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 1-792, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{dawar_et_al:LIPIcs.FSTTCS.2022, title = {{LIPIcs, Volume 250, FSTTCS 2022, Complete Volume}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {1--792}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022}, URN = {urn:nbn:de:0030-drops-173910}, doi = {10.4230/LIPIcs.FSTTCS.2022}, annote = {Keywords: LIPIcs, Volume 250, FSTTCS 2022, Complete Volume} }
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dawar_et_al:LIPIcs.FSTTCS.2022.0, author = {Dawar, Anuj and Guruswami, Venkatesan}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.0}, URN = {urn:nbn:de:0030-drops-173928}, doi = {10.4230/LIPIcs.FSTTCS.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Anupam Gupta. Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk). In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gupta:LIPIcs.FSTTCS.2022.1, author = {Gupta, Anupam}, title = {{Algorithms for Uncertain Environments: Going Beyond the Worst-Case}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.1}, URN = {urn:nbn:de:0030-drops-173933}, doi = {10.4230/LIPIcs.FSTTCS.2022.1}, annote = {Keywords: Optimization under Uncertainty, Online Algorithms, Beyond Worst Case Analysis} }
Rahul Santhanam. Why MCSP Is a More Important Problem Than SAT (Invited Talk). In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{santhanam:LIPIcs.FSTTCS.2022.2, author = {Santhanam, Rahul}, title = {{Why MCSP Is a More Important Problem Than SAT}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.2}, URN = {urn:nbn:de:0030-drops-173943}, doi = {10.4230/LIPIcs.FSTTCS.2022.2}, annote = {Keywords: Minimum Circuit Size Problem, Satisfiability, Cryptography, Learning, Approximation} }
Patricia Bouyer, Mickael Randour, and Pierre Vandenhove. The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 3:1-3:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bouyer_et_al:LIPIcs.FSTTCS.2022.3, author = {Bouyer, Patricia and Randour, Mickael and Vandenhove, Pierre}, title = {{The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {3:1--3:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.3}, URN = {urn:nbn:de:0030-drops-173957}, doi = {10.4230/LIPIcs.FSTTCS.2022.3}, annote = {Keywords: two-player games on graphs, finite-memory strategies, chromatic memory, parity automata, \omega-regularity} }
Irit Dinur. Expanders in Higher Dimensions (Invited Talk). In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, p. 4:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dinur:LIPIcs.FSTTCS.2022.4, author = {Dinur, Irit}, title = {{Expanders in Higher Dimensions}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {4:1--4:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.4}, URN = {urn:nbn:de:0030-drops-173967}, doi = {10.4230/LIPIcs.FSTTCS.2022.4}, annote = {Keywords: Expanders} }
Jasine Babu, R. Krithika, and Deepak Rajendraprasad. Packing Arc-Disjoint 4-Cycles in Oriented Graphs. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{babu_et_al:LIPIcs.FSTTCS.2022.5, author = {Babu, Jasine and Krithika, R. and Rajendraprasad, Deepak}, title = {{Packing Arc-Disjoint 4-Cycles in Oriented Graphs}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.5}, URN = {urn:nbn:de:0030-drops-173979}, doi = {10.4230/LIPIcs.FSTTCS.2022.5}, annote = {Keywords: arc-disjoint cycles, bipartite digraphs, oriented graphs, parameterized complexity} }
Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, and Chao Xu. Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{beideman_et_al:LIPIcs.FSTTCS.2022.6, author = {Beideman, Calvin and Chandrasekaran, Karthekeyan and Chekuri, Chandra and Xu, Chao}, title = {{Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.6}, URN = {urn:nbn:de:0030-drops-173986}, doi = {10.4230/LIPIcs.FSTTCS.2022.6}, annote = {Keywords: Submodular Functions, Hypergraphs, Approximation, Representation} }
Gianfranco Bilardi and Lorenzo De Stefani. The DAG Visit Approach for Pebbling and I/O Lower Bounds. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 7:1-7:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilardi_et_al:LIPIcs.FSTTCS.2022.7, author = {Bilardi, Gianfranco and De Stefani, Lorenzo}, title = {{The DAG Visit Approach for Pebbling and I/O Lower Bounds}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {7:1--7:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.7}, URN = {urn:nbn:de:0030-drops-173999}, doi = {10.4230/LIPIcs.FSTTCS.2022.7}, annote = {Keywords: Pebbling, Directed Acyclic Graph, Pebbling number, I/O complexity} }
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar. Counting and Sampling from Substructures Using Linear Algebraic Queries. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 8:1-8:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bishnu_et_al:LIPIcs.FSTTCS.2022.8, author = {Bishnu, Arijit and Ghosh, Arijit and Mishra, Gopinath and Paraashar, Manaswi}, title = {{Counting and Sampling from Substructures Using Linear Algebraic Queries}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {8:1--8:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.8}, URN = {urn:nbn:de:0030-drops-174009}, doi = {10.4230/LIPIcs.FSTTCS.2022.8}, annote = {Keywords: Query complexity, Bilinear form, Uniform sampling, Weighted graphs} }
Pranav Bisht and Nitin Saxena. Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bisht_et_al:LIPIcs.FSTTCS.2022.9, author = {Bisht, Pranav and Saxena, Nitin}, title = {{Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.9}, URN = {urn:nbn:de:0030-drops-174012}, doi = {10.4230/LIPIcs.FSTTCS.2022.9}, annote = {Keywords: Multivariate polynomial factorization, derandomization, sparse polynomials, symmetric polynomials, factor-sparsity, convex polytopes} }
Pranav Bisht and Ilya Volkovich. On Solving Sparse Polynomial Factorization Related Problems. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 10:1-10:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bisht_et_al:LIPIcs.FSTTCS.2022.10, author = {Bisht, Pranav and Volkovich, Ilya}, title = {{On Solving Sparse Polynomial Factorization Related Problems}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {10:1--10:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.10}, URN = {urn:nbn:de:0030-drops-174023}, doi = {10.4230/LIPIcs.FSTTCS.2022.10}, annote = {Keywords: Sparse Polynomials, Identity Testing, Derandomization, Factor-Sparsity, Multivariate Polynomial Factorization} }
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, and Jakub Svoboda. Complexity of Spatial Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chatterjee_et_al:LIPIcs.FSTTCS.2022.11, author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Jecker, Isma\"{e}l and Svoboda, Jakub}, title = {{Complexity of Spatial Games}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.11}, URN = {urn:nbn:de:0030-drops-174038}, doi = {10.4230/LIPIcs.FSTTCS.2022.11}, annote = {Keywords: spatial games, computational complexity, prisoner’s dilemma, dynamical systems} }
Arkadev Chattopadhyay, Utsab Ghosal, and Partha Mukhopadhyay. Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 12:1-12:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chattopadhyay_et_al:LIPIcs.FSTTCS.2022.12, author = {Chattopadhyay, Arkadev and Ghosal, Utsab and Mukhopadhyay, Partha}, title = {{Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {12:1--12:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.12}, URN = {urn:nbn:de:0030-drops-174045}, doi = {10.4230/LIPIcs.FSTTCS.2022.12}, annote = {Keywords: Algebraic Complexity, Discrepancy, Lower Bounds, Monotone Computations} }
Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, and Hee-Kap Ahn. Inscribing or Circumscribing a Histogon to a Convex Polygon. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chung_et_al:LIPIcs.FSTTCS.2022.13, author = {Chung, Jaehoon and Bae, Sang Won and Shin, Chan-Su and Yoon, Sang Duk and Ahn, Hee-Kap}, title = {{Inscribing or Circumscribing a Histogon to a Convex Polygon}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.13}, URN = {urn:nbn:de:0030-drops-174054}, doi = {10.4230/LIPIcs.FSTTCS.2022.13}, annote = {Keywords: Shape simplification, Shape analysis, Histogon, Convex polygon} }
Joshua Cook. More Verifier Efficient Interactive Protocols for Bounded Space. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cook:LIPIcs.FSTTCS.2022.14, author = {Cook, Joshua}, title = {{More Verifier Efficient Interactive Protocols for Bounded Space}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.14}, URN = {urn:nbn:de:0030-drops-174067}, doi = {10.4230/LIPIcs.FSTTCS.2022.14}, annote = {Keywords: Interactive Proofs, Verifier Time, Randomized Space, Nondeterministic Space, Fine Grain Complexity} }
Arjan Cornelissen, Nikhil S. Mande, and Subhasree Patro. Improved Quantum Query Upper Bounds Based on Classical Decision Trees. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 15:1-15:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cornelissen_et_al:LIPIcs.FSTTCS.2022.15, author = {Cornelissen, Arjan and Mande, Nikhil S. and Patro, Subhasree}, title = {{Improved Quantum Query Upper Bounds Based on Classical Decision Trees}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {15:1--15:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.15}, URN = {urn:nbn:de:0030-drops-174071}, doi = {10.4230/LIPIcs.FSTTCS.2022.15}, annote = {Keywords: Quantum Query Complexity, Decision Trees, Decision Tree Rank} }
Radu Curticapean, Nutan Limaye, and Srikanth Srinivasan. On the VNP-Hardness of Some Monomial Symmetric Polynomials. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{curticapean_et_al:LIPIcs.FSTTCS.2022.16, author = {Curticapean, Radu and Limaye, Nutan and Srinivasan, Srikanth}, title = {{On the VNP-Hardness of Some Monomial Symmetric Polynomials}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.16}, URN = {urn:nbn:de:0030-drops-174081}, doi = {10.4230/LIPIcs.FSTTCS.2022.16}, annote = {Keywords: algebraic complexity, symmetric polynomial, permanent, Sidon set} }
Minati De, Saksham Jain, Sarat Varma Kallepalli, and Satyam Singh. Online Piercing of Geometric Objects. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{de_et_al:LIPIcs.FSTTCS.2022.17, author = {De, Minati and Jain, Saksham and Kallepalli, Sarat Varma and Singh, Satyam}, title = {{Online Piercing of Geometric Objects}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.17}, URN = {urn:nbn:de:0030-drops-174090}, doi = {10.4230/LIPIcs.FSTTCS.2022.17}, annote = {Keywords: piercing set problem, online algorithm, competitive ratio, unit covering problem, geometric objects} }
Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, and Alex Pahlow. Half-Guarding Weakly-Visible Polygons and Terrains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{duraisamy_et_al:LIPIcs.FSTTCS.2022.18, author = {Duraisamy, Nandhana and Hillberg, Hannah Miller and Jallu, Ramesh K. and Krohn, Erik and Maheshwari, Anil and Nandy, Subhas C. and Pahlow, Alex}, title = {{Half-Guarding Weakly-Visible Polygons and Terrains}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.18}, URN = {urn:nbn:de:0030-drops-174103}, doi = {10.4230/LIPIcs.FSTTCS.2022.18}, annote = {Keywords: Art Gallery Problem, Approximation Algorithm, NP-Hardness, Monotone Polygons, Half-Guards} }
Rohith Reddy Gangam, Tung Mai, Nitya Raju, and Vijay V. Vazirani. A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 19:1-19:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gangam_et_al:LIPIcs.FSTTCS.2022.19, author = {Gangam, Rohith Reddy and Mai, Tung and Raju, Nitya and Vazirani, Vijay V.}, title = {{A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {19:1--19:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.19}, URN = {urn:nbn:de:0030-drops-174114}, doi = {10.4230/LIPIcs.FSTTCS.2022.19}, annote = {Keywords: stable matching, robust solutions, finite distributive lattice, Birkhoff’s Representation Theorem} }
Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, and Vladimir Lysikov. Degree-Restricted Strength Decompositions and Algebraic Branching Programs. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gesmundo_et_al:LIPIcs.FSTTCS.2022.20, author = {Gesmundo, Fulvio and Ghosal, Purnata and Ikenmeyer, Christian and Lysikov, Vladimir}, title = {{Degree-Restricted Strength Decompositions and Algebraic Branching Programs}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.20}, URN = {urn:nbn:de:0030-drops-174127}, doi = {10.4230/LIPIcs.FSTTCS.2022.20}, annote = {Keywords: Lower bounds, Slice rank, Strength of polynomials, Algebraic branching programs} }
Utkarsh Joshi, Saladi Rahul, and Josson Joe Thoppil. A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 21:1-21:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{joshi_et_al:LIPIcs.FSTTCS.2022.21, author = {Joshi, Utkarsh and Rahul, Saladi and Thoppil, Josson Joe}, title = {{A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {21:1--21:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.21}, URN = {urn:nbn:de:0030-drops-174139}, doi = {10.4230/LIPIcs.FSTTCS.2022.21}, annote = {Keywords: Geometric intersection graphs, Max cut, Vertical ray shooting} }
Telikepalli Kavitha. Stable Matchings with One-Sided Ties and Approximate Popularity. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kavitha:LIPIcs.FSTTCS.2022.22, author = {Kavitha, Telikepalli}, title = {{Stable Matchings with One-Sided Ties and Approximate Popularity}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.22}, URN = {urn:nbn:de:0030-drops-174144}, doi = {10.4230/LIPIcs.FSTTCS.2022.22}, annote = {Keywords: Bipartite graphs, Maximum matchings, Unpopularity factor} }
Arindam Khan, Eklavya Sharma, and K. V. N. Sreenivas. Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 23:1-23:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{khan_et_al:LIPIcs.FSTTCS.2022.23, author = {Khan, Arindam and Sharma, Eklavya and Sreenivas, K. V. N.}, title = {{Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {23:1--23:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.23}, URN = {urn:nbn:de:0030-drops-174151}, doi = {10.4230/LIPIcs.FSTTCS.2022.23}, annote = {Keywords: Bin packing, rectangle packing, multidimensional packing, approximation algorithms} }
Pascal Koiran and Subhayan Saha. Black Box Absolute Reconstruction for Sums of Powers of Linear Forms. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 24:1-24:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{koiran_et_al:LIPIcs.FSTTCS.2022.24, author = {Koiran, Pascal and Saha, Subhayan}, title = {{Black Box Absolute Reconstruction for Sums of Powers of Linear Forms}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {24:1--24:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.24}, URN = {urn:nbn:de:0030-drops-174163}, doi = {10.4230/LIPIcs.FSTTCS.2022.24}, annote = {Keywords: reconstruction algorithms, tensor decomposition, sums of powers of linear forms, simultaneous diagonalisation, algebraic algorithm, black box} }
Oded Lachish, Felix Reidl, and Chhaya Trehan. When You Come at the King You Best Not Miss. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 25:1-25:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lachish_et_al:LIPIcs.FSTTCS.2022.25, author = {Lachish, Oded and Reidl, Felix and Trehan, Chhaya}, title = {{When You Come at the King You Best Not Miss}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {25:1--25:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.25}, URN = {urn:nbn:de:0030-drops-174177}, doi = {10.4230/LIPIcs.FSTTCS.2022.25}, annote = {Keywords: Digraphs, tournaments, kings, query complexity} }
Ramita Maharjan and Thomas Watson. Complexity of Fault Tolerant Query Complexity. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 26:1-26:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{maharjan_et_al:LIPIcs.FSTTCS.2022.26, author = {Maharjan, Ramita and Watson, Thomas}, title = {{Complexity of Fault Tolerant Query Complexity}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {26:1--26:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.26}, URN = {urn:nbn:de:0030-drops-174185}, doi = {10.4230/LIPIcs.FSTTCS.2022.26}, annote = {Keywords: Fault, Tolerant, Query, Complexity} }
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, and Gaurav Viramgami. Romeo and Juliet Meeting in Forest like Regions. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 27:1-27:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{misra_et_al:LIPIcs.FSTTCS.2022.27, author = {Misra, Neeldhara and Mulpuri, Manas and Tale, Prafullkumar and Viramgami, Gaurav}, title = {{Romeo and Juliet Meeting in Forest like Regions}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {27:1--27:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.27}, URN = {urn:nbn:de:0030-drops-174194}, doi = {10.4230/LIPIcs.FSTTCS.2022.27}, annote = {Keywords: Games on Graphs, Dynamic Separators, W\lbrack1\rbrack-hardness, Structural Parametersization, Treewidth} }
Vijay V. Vazirani. New Characterizations of Core Imputations of Matching and b-Matching Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 28:1-28:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vazirani:LIPIcs.FSTTCS.2022.28, author = {Vazirani, Vijay V.}, title = {{New Characterizations of Core Imputations of Matching and b-Matching Games}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {28:1--28:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.28}, URN = {urn:nbn:de:0030-drops-174207}, doi = {10.4230/LIPIcs.FSTTCS.2022.28}, annote = {Keywords: LP-duality theory, cooperative game theory, core of a game, assignment game, general graph matching game, bipartite b-matching game} }
Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, and Ðorđe Žikelić. Algorithms and Hardness Results for Computing Cores of Markov Chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 29:1-29:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ahmadi_et_al:LIPIcs.FSTTCS.2022.29, author = {Ahmadi, Ali and Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Meggendorfer, Tobias and Safavi, Roodabeh and \v{Z}ikeli\'{c}, Ðor{\d}e}, title = {{Algorithms and Hardness Results for Computing Cores of Markov Chains}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {29:1--29:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.29}, URN = {urn:nbn:de:0030-drops-174216}, doi = {10.4230/LIPIcs.FSTTCS.2022.29}, annote = {Keywords: Markov Chains, Cores, Complexity} }
Guy Avni and Suman Sadhukhan. Computing Threshold Budgets in Discrete-Bidding Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 30:1-30:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{avni_et_al:LIPIcs.FSTTCS.2022.30, author = {Avni, Guy and Sadhukhan, Suman}, title = {{Computing Threshold Budgets in Discrete-Bidding Games}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {30:1--30:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.30}, URN = {urn:nbn:de:0030-drops-174222}, doi = {10.4230/LIPIcs.FSTTCS.2022.30}, annote = {Keywords: Discrete bidding games, Richman games, parity games, reachability games} }
Dylan Bellier, Sophie Pinchinat, and François Schwarzentruber. Dependency Matrices for Multiplayer Strategic Dependencies. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 31:1-31:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bellier_et_al:LIPIcs.FSTTCS.2022.31, author = {Bellier, Dylan and Pinchinat, Sophie and Schwarzentruber, Fran\c{c}ois}, title = {{Dependency Matrices for Multiplayer Strategic Dependencies}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {31:1--31:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.31}, URN = {urn:nbn:de:0030-drops-174230}, doi = {10.4230/LIPIcs.FSTTCS.2022.31}, annote = {Keywords: Temporal dependency, Delay games, Strategic reasoning, Temporal logic} }
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur. Semilinear Representations for Series-Parallel Atomic Congestion Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 32:1-32:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bertrand_et_al:LIPIcs.FSTTCS.2022.32, author = {Bertrand, Nathalie and Markey, Nicolas and Sadhukhan, Suman and Sankur, Ocan}, title = {{Semilinear Representations for Series-Parallel Atomic Congestion Games}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {32:1--32:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.32}, URN = {urn:nbn:de:0030-drops-174243}, doi = {10.4230/LIPIcs.FSTTCS.2022.32}, annote = {Keywords: congestion games, Nash equilibria, Presburger arithmetic, semilinear sets, price of anarchy} }
Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux. Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 33:1-33:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bordais_et_al:LIPIcs.FSTTCS.2022.33, author = {Bordais, Benjamin and Bouyer, Patricia and Le Roux, St\'{e}phane}, title = {{Playing (Almost-)Optimally in Concurrent B\"{u}chi and Co-B\"{u}chi Games}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {33:1--33:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.33}, URN = {urn:nbn:de:0030-drops-174258}, doi = {10.4230/LIPIcs.FSTTCS.2022.33}, annote = {Keywords: Concurrent Games, Optimal Strategies, B\"{u}chi Objective, co-B\"{u}chi Objective} }
Olivier Carton. Ambiguity Through the Lens of Measure Theory. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{carton:LIPIcs.FSTTCS.2022.34, author = {Carton, Olivier}, title = {{Ambiguity Through the Lens of Measure Theory}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.34}, URN = {urn:nbn:de:0030-drops-174269}, doi = {10.4230/LIPIcs.FSTTCS.2022.34}, annote = {Keywords: ambiguity, B\"{u}chi automata, measure theory} }
Abhishek De, Farzad Jafarrahmani, and Alexis Saurin. Phase Semantics for Linear Logic with Least and Greatest Fixed Points. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 35:1-35:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{de_et_al:LIPIcs.FSTTCS.2022.35, author = {De, Abhishek and Jafarrahmani, Farzad and Saurin, Alexis}, title = {{Phase Semantics for Linear Logic with Least and Greatest Fixed Points}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {35:1--35:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.35}, URN = {urn:nbn:de:0030-drops-174272}, doi = {10.4230/LIPIcs.FSTTCS.2022.35}, annote = {Keywords: Linear logic, fixed points, phase semantics, closure ordinals, cut elimination} }
Rüdiger Ehlers and Sven Schewe. Natural Colors of Infinite Words. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 36:1-36:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ehlers_et_al:LIPIcs.FSTTCS.2022.36, author = {Ehlers, R\"{u}diger and Schewe, Sven}, title = {{Natural Colors of Infinite Words}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {36:1--36:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.36}, URN = {urn:nbn:de:0030-drops-174280}, doi = {10.4230/LIPIcs.FSTTCS.2022.36}, annote = {Keywords: parity automata, automata over infinite words, \omega-regular languages} }
Bernd Finkbeiner and Noemi Passing. Synthesizing Dominant Strategies for Liveness. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 37:1-37:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{finkbeiner_et_al:LIPIcs.FSTTCS.2022.37, author = {Finkbeiner, Bernd and Passing, Noemi}, title = {{Synthesizing Dominant Strategies for Liveness}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {37:1--37:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.37}, URN = {urn:nbn:de:0030-drops-174298}, doi = {10.4230/LIPIcs.FSTTCS.2022.37}, annote = {Keywords: Dominant Strategies, Compositional Synthesis, Reactive Synthesis} }
Moses Ganardi, Louis Jachiet, Markus Lohrey, and Thomas Schwentick. Low-Latency Sliding Window Algorithms for Formal Languages. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 38:1-38:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ganardi_et_al:LIPIcs.FSTTCS.2022.38, author = {Ganardi, Moses and Jachiet, Louis and Lohrey, Markus and Schwentick, Thomas}, title = {{Low-Latency Sliding Window Algorithms for Formal Languages}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {38:1--38:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.38}, URN = {urn:nbn:de:0030-drops-174301}, doi = {10.4230/LIPIcs.FSTTCS.2022.38}, annote = {Keywords: Streaming algorithms, regular languages, context-free languages} }
Mohit Garg and Suneel Sarswat. The Design and Regulation of Exchanges: A Formal Approach. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 39:1-39:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{garg_et_al:LIPIcs.FSTTCS.2022.39, author = {Garg, Mohit and Sarswat, Suneel}, title = {{The Design and Regulation of Exchanges: A Formal Approach}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {39:1--39:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.39}, URN = {urn:nbn:de:0030-drops-174318}, doi = {10.4230/LIPIcs.FSTTCS.2022.39}, annote = {Keywords: Double Auctions, Formal Specification and Verification, Financial Markets} }
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann. Parikh Automata over Infinite Words. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 40:1-40:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{guha_et_al:LIPIcs.FSTTCS.2022.40, author = {Guha, Shibashis and Jecker, Isma\"{e}l and Lehtinen, Karoliina and Zimmermann, Martin}, title = {{Parikh Automata over Infinite Words}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {40:1--40:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.40}, URN = {urn:nbn:de:0030-drops-174327}, doi = {10.4230/LIPIcs.FSTTCS.2022.40}, annote = {Keywords: Parikh automata, \omega-automata, Infinite Games} }
Florent Koechlin. New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 41:1-41:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{koechlin:LIPIcs.FSTTCS.2022.41, author = {Koechlin, Florent}, title = {{New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {41:1--41:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.41}, URN = {urn:nbn:de:0030-drops-174331}, doi = {10.4230/LIPIcs.FSTTCS.2022.41}, annote = {Keywords: Inherent ambiguity, Infinite ambiguity, Ambiguity, Generating series, Context-free languages, Bounded languages} }
Orna Kupferman and Ofer Leshkowitz. Synthesis of Privacy-Preserving Systems. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 42:1-42:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kupferman_et_al:LIPIcs.FSTTCS.2022.42, author = {Kupferman, Orna and Leshkowitz, Ofer}, title = {{Synthesis of Privacy-Preserving Systems}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {42:1--42:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.42}, URN = {urn:nbn:de:0030-drops-174342}, doi = {10.4230/LIPIcs.FSTTCS.2022.42}, annote = {Keywords: Synthesis, Privacy, LTL, Games} }
Thomas Place and Marc Zeitoun. A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 43:1-43:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{place_et_al:LIPIcs.FSTTCS.2022.43, author = {Place, Thomas and Zeitoun, Marc}, title = {{A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {43:1--43:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.43}, URN = {urn:nbn:de:0030-drops-174356}, doi = {10.4230/LIPIcs.FSTTCS.2022.43}, annote = {Keywords: Automata, Separation, Covering, Concatenation hierarchies, Group languages} }
K. S. Thejaswini, Pierre Ohlmann, and Marcin Jurdziński. A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 44:1-44:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{thejaswini_et_al:LIPIcs.FSTTCS.2022.44, author = {Thejaswini, K. S. and Ohlmann, Pierre and Jurdzi\'{n}ski, Marcin}, title = {{A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {44:1--44:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.44}, URN = {urn:nbn:de:0030-drops-174365}, doi = {10.4230/LIPIcs.FSTTCS.2022.44}, annote = {Keywords: Parity games, Attractor decomposition, Quasipolynomial Algorithms, Universal trees} }
Feedback for Dagstuhl Publishing