default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd FSTTCS 2022: Chennai, India
- Anuj Dawar
, Venkatesan Guruswami:
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India. LIPIcs 250, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-261-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Anupam Gupta:
Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk). 1:1-1:1 - Rahul Santhanam:
Why MCSP Is a More Important Problem Than SAT (Invited Talk). 2:1-2:1 - Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). 3:1-3:18 - Irit Dinur:
Expanders in Higher Dimensions (Invited Talk). 4:1-4:1 - Jasine Babu, R. Krithika, Deepak Rajendraprasad:
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. 5:1-5:16 - Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu:
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. 6:1-6:18 - Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit Approach for Pebbling and I/O Lower Bounds. 7:1-7:23 - Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Counting and Sampling from Substructures Using Linear Algebraic Queries. 8:1-8:20 - Pranav Bisht, Nitin Saxena:
Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials. 9:1-9:19 - Pranav Bisht, Ilya Volkovich:
On Solving Sparse Polynomial Factorization Related Problems. 10:1-10:22 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Complexity of Spatial Games. 11:1-11:14 - Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay:
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product. 12:1-12:20 - Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Inscribing or Circumscribing a Histogon to a Convex Polygon. 13:1-13:16 - Joshua Cook:
More Verifier Efficient Interactive Protocols for Bounded Space. 14:1-14:18 - Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. 15:1-15:22 - Radu Curticapean, Nutan Limaye, Srikanth Srinivasan:
On the VNP-Hardness of Some Monomial Symmetric Polynomials. 16:1-16:14 - Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh:
Online Piercing of Geometric Objects. 17:1-17:16 - Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow:
Half-Guarding Weakly-Visible Polygons and Terrains. 18:1-18:17 - Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani:
A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications. 19:1-19:20 - Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, Vladimir Lysikov:
Degree-Restricted Strength Decompositions and Algebraic Branching Programs. 20:1-20:15 - Utkarsh Joshi, Saladi Rahul, Josson Joe Thoppil:
A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs. 21:1-21:12 - Telikepalli Kavitha:
Stable Matchings with One-Sided Ties and Approximate Popularity. 22:1-22:17 - Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. 23:1-23:22 - Pascal Koiran, Subhayan Saha:
Black Box Absolute Reconstruction for Sums of Powers of Linear Forms. 24:1-24:17 - Oded Lachish, Felix Reidl, Chhaya Trehan:
When You Come at the King You Best Not Miss. 25:1-25:12 - Ramita Maharjan, Thomas Watson:
Complexity of Fault Tolerant Query Complexity. 26:1-26:11 - Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
Romeo and Juliet Meeting in Forest like Regions. 27:1-27:22 - Vijay V. Vazirani:
New Characterizations of Core Imputations of Matching and b-Matching Games. 28:1-28:13 - Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic:
Algorithms and Hardness Results for Computing Cores of Markov Chains. 29:1-29:20 - Guy Avni, Suman Sadhukhan:
Computing Threshold Budgets in Discrete-Bidding Games. 30:1-30:18 - Dylan Bellier, Sophie Pinchinat, François Schwarzentruber:
Dependency Matrices for Multiplayer Strategic Dependencies. 31:1-31:21 - Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur:
Semilinear Representations for Series-Parallel Atomic Congestion Games. 32:1-32:20 - Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. 33:1-33:18 - Olivier Carton:
Ambiguity Through the Lens of Measure Theory. 34:1-34:14 - Abhishek De, Farzad Jafarrahmani, Alexis Saurin:
Phase Semantics for Linear Logic with Least and Greatest Fixed Points. 35:1-35:23 - Rüdiger Ehlers, Sven Schewe:
Natural Colors of Infinite Words. 36:1-36:17 - Bernd Finkbeiner, Noemi Passing:
Synthesizing Dominant Strategies for Liveness. 37:1-37:19 - Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. 38:1-38:23 - Mohit Garg, Suneel Sarswat:
The Design and Regulation of Exchanges: A Formal Approach. 39:1-39:21 - Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
Parikh Automata over Infinite Words. 40:1-40:20 - Florent Koechlin:
New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages. 41:1-41:22 - Orna Kupferman, Ofer Leshkowitz:
Synthesis of Privacy-Preserving Systems. 42:1-42:23 - Thomas Place, Marc Zeitoun:
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. 43:1-43:22 - K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski:
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. 44:1-44:20
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-20 00:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
