FSTTCS

Keyphrases

Publications

2023

Abhimanyu Choudhury, Meena Mahajan
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study. FSTTCS (2023)
Nisheeth K. Vishnoi
Algorithms in the Presence of Biased Inputs (Invited Talk). FSTTCS (2023)
Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. FSTTCS (2023)
Ulysse Léchine
Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NC. FSTTCS (2023)
Pranav Bisht, Nikhil Gupta, Ilya Volkovich
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. FSTTCS (2023)
Prasad Raghavendra
On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk). FSTTCS (2023)
Rahul Chugh, Supartha Podder, Swagato Sanyal
Decision Tree Complexity Versus Block Sensitivity and Degree. FSTTCS (2023)
Harmender Gahlawat, Meirav Zehavi
Parameterized Complexity of Incomplete Connected Fair Division. FSTTCS (2023)
Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier
Listing 4-Cycles. FSTTCS (2023)
Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche
Counter Machines with Infrequent Reversals. FSTTCS (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS (2023)
Ashwin Bhaskar, M. Praveen
Constraint LTL with Remote Access. FSTTCS (2023)
Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
Bandwidth of Timed Automata: 3 Classes. FSTTCS (2023)
Vijay V. Vazirani
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. FSTTCS (2023)
Irmak Saglam, Anne-Kathrin Schmuck
Solving Odd-Fair Parity Games. FSTTCS (2023)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar
Bounded Simultaneous Messages. FSTTCS (2023)
Dieter van Melkebeek, Nicollas M. Sdroievski
Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols. FSTTCS (2023)
Jacques Dark, Adithya Diddapur, Christian Konrad
Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting. FSTTCS (2023)
Arghya Chakraborty, Rahul Vaze
Online Facility Location with Weights and Congestion. FSTTCS (2023)
Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse
Monotone Classes Beyond VNP. FSTTCS (2023)
Chris Köcher, Georg Zetzsche
Regular Separators for VASS Coverability Languages. FSTTCS (2023)
Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan
Languages Given by Finite Automata over the Unary Alphabet. FSTTCS (2023)
Léo Henry, Blaise Genest, Alexandre Drewery
Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities. FSTTCS (2023)
Jishnu Roychoudhury, Jatin Yadav
An Optimal Algorithm for Sorting in Trees. FSTTCS (2023)
Mihir Vahanwala
Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given Neighbourhoods. FSTTCS (2023)
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. FSTTCS (2023)
Akanksha Agrawal, M. S. Ramanujan
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. FSTTCS (2023)
Sharon Shoham
From Concept Learning to SAT-Based Invariant Inference (Invited Talk). FSTTCS (2023)
Leonard J. Schulman
Computational and Information-Theoretic Questions from Causal Inference (Invited Talk). FSTTCS (2023)
Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour
Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). FSTTCS (2023)
Debajyoti Bera, SAPV Tharrmashastha
A Generalized Quantum Branching Program. FSTTCS (2023)
Dietrich Kuske
A Class of Rational Trace Relations Closed Under Composition. FSTTCS (2023)
Shaull Almagor, Daniel Assa, Udi Boker
Synchronized CTL over One-Counter Automata. FSTTCS (2023)
Alvin Yan Hong Yao, Diptarka Chakraborty
Approximate Maximum Rank Aggregation: Beyond the Worst-Case. FSTTCS (2023)
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS (2023)
Venkatesan Guruswami, Rishi Saket
Hardness of Learning Boolean Functions from Label Proportions. FSTTCS (2023)
Anupam Das, Abhishek De, Alexis Saurin
Comparing Infinitary Systems for Linear Logic with Fixed Points. FSTTCS (2023)
Aniket Murhekar, Eklavya Sharma
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. FSTTCS (2023)
Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh
Randomized and Quantum Query Complexities of Finding a King in a Tournament. FSTTCS (2023)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
Acyclic Petri and Workflow Nets with Resets. FSTTCS (2023)
Yoav Feinstein, Orna Kupferman
Monotonicity Characterizations of Regular Languages. FSTTCS (2023)
Telikepalli Kavitha, Kazuhisa Makino
Perfect Matchings and Popularity in the Many-To-Many Setting. FSTTCS (2023)
Front Matter, Table of Contents, Preface, Conference Organization. FSTTCS (2023)
Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith
Weighted One-Deterministic-Counter Automata. FSTTCS (2023)

volume 284, 2023

43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India FSTTCS 284 (2023)

2022

volume 250, 2022

42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India. FSTTCS 250 (2022)