FSTTCS 2024
44th IARCS Annual Conference on
Foundations of Software Technology and Theoretical Computer Science
- Main Conference: December 16–18, 2024
- Venue: IIT Gandhinagar
44th IARCS Annual Conference on
Foundations of Software Technology and Theoretical Computer Science
Monday, December 16, 2024 | ||
0900 – 1000 |
Invited Talk 1 CHAIR: Neeldhara Misra VENUE: AB 1/103 |
|
Pankaj K Agarwal Optimal Transport: A Geometric Perspective |
||
1000 – 1030 | Break | |
1030 – 1130 |
Session A1 CHAIR: Bireswar Das VENUE: AB 1/101 |
Session B1 CHAIR: Amaldev Manuel VENUE: AB 1/102 |
Markus Bläser, Julian Dörfler and Gorav Jindal PosSLP and Sum of Squares |
Alberto Bombardelli, Laura Bozzelli, Cesar Sanchez and Stefano Tonetta Unifying Asynchronous Logics for Hyperproperties |
|
Vishwas Bhargava and Anamay Tengse Explicit Commutative ROABPs from Partial Derivatives |
Damien Busatto-Gaston, Youssouf Oualhadj, Léo Tible and Daniele Varacca Promptness and fairness in Muller LTL formulas |
|
1130 – 1145 | Break | |
1145 – 1245 |
Session A2 CHAIR: Ramprasad Saptharishi VENUE: AB 1/101 |
Session B2 (RHPL) VENUE: AB 1/102 |
Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev and Shankar Ram Vasudevan The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem |
Click here for the schedule | |
Bireswar Das, Jinia Ghosh and Anant Kumar The Isomorphism Problem of Power Graphs and a Question of Cameron |
||
1245 – 1400 | Lunch | |
1400 – 1500 |
Invited Talk 2 CHAIR: Siddharth Barman VENUE: AB 1/103 |
|
Ioannis Caragiannis Two Stories About Distortion in Social Choice |
||
1500 – 1530 | Break | |
1530 – 1700 |
Session A3 CHAIR: Bodhayan Roy VENUE: AB 1/101 |
Session B3 CHAIR: S Akshay VENUE: AB 1/102 |
Sravanthi Chede, Leroy Chew and Anil Shukla Circuits, Proofs and Propositional Model Counting |
Johan Arcile, Étienne André and Engel Lefaucheux Execution-time opacity problems in one-clock parametric timed automata |
|
Karthik Gajulapalli, Zeyong Li and Ilya Volkovich Oblivious Classes Revisited: Lower Bounds and Hierarchies |
Kyveli Doveri, Pierre Ganty and B Srivathsan A Myhill-Nerode style Characterization for Timed Automata With Integer Resets |
|
Nathaniel Harms and Artur Riazanov Better Boosting of Communication Oracles, or Not |
Bernd Finkbeiner, Felix Jahn and Julian Siber Counterfactual Explanations for MITL Violations |
|
Tuesday, December 17, 2024 | ||
0900 – 1000 |
Invited Talk 3 CHAIR: Sławomir Lasota VENUE: AB 1/103 |
|
Sebastian Siebertz Advances in Algorithmic Meta Theorems |
||
1000 – 1030 | Break | |
1030 – 1130 |
Session A4 CHAIR: Sushmita Gupta VENUE: AB 1/101 |
Session B4 CHAIR: K Narayan Kumar VENUE: AB 1/102 |
Arindam Khan, Aditya Subramanian, Tobias Widmann and Andreas Wiese On Approximation Schemes for Stabbing Rectilinear Polygons |
Dylan Bellier, Massimo Benerecetti, Fabio Mogavero and Sophie Pinchinat Plan Logic |
|
Sujoy Kumar Bhore, Sarfaraz Equbal and Rohit Gurjar Geometric Bipartite Matching is in NC |
Furio Honsell, Marina Lenisa and Ivan Scagnetto Two Views on Unification: Terms as Strategies |
|
1130 – 1145 | Break | |
1145 – 1245 |
Session A5 CHAIR: Diptarka Chakraborty VENUE: AB 1/101 |
Session B5 CHAIR: Furio Honsell VENUE: AB 1/102 |
Deeparnab Chakrabarty and Hang Liao Learning Partitions using Rank Queries |
Ali Asadi, Krishnendu Chatterjee, Raimundo Saona and Jakub Svoboda Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms |
|
L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra and Saladi Rahul Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones |
Benoit Barbot, Patricia Bouyer and Serge Haddad Beyond Decisiveness of Infinite Markov Chains |
|
1245 – 1400 | Lunch | |
1400 – 1500 |
Invited Talk 4 CHAIR: Deepak D'Souza VENUE: AB 1/103 |
|
Dmitry Chistikov Three Views on Linear Integer Arithmetic |
||
1500 – 1530 | Break | |
1530 – 1700 |
Session A6 CHAIR: Akash Kumar VENUE: AB 1/101 |
Session B6 (RHPL) |
Anand Louis, Alantha Newman and Arka Ray Improved linearly ordered colorings of hypergraphs via SDP rounding |
Click here for the schedule | |
Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg and Michal Koucky The Many Flavors of Edit Distance |
||
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan and Saket Saurabh When far is better: The Chamberlin-Courant approach to obnoxious committee selection |
||
1730 – 1830 | IARCS business meeting | |
1900 onwards | Conference Banquet | |
Wednesday, December 18, 2024 | ||
0900 – 1000 |
Invited Talk 5 CHAIR: Umang Bhaskar VENUE: AB 1/103 |
|
Uriel Feige Fair Allocations with Little Communication |
||
1000 – 1030 | Break | |
1030 – 1130 |
Session A7 CHAIR: Anirban Dasgupta VENUE: AB 1/101 |
Session B7 (RHPL) |
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C Nandy, Krishna Priya K M, Bodhayan Roy, Sasanka Roy and Abhishek Sahu Minimum Consistent Subset in Trees and Interval Graphs |
Click here for the schedule | |
Rogers Mathew, Fahad Panolan and Seshikanth Varma Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring problem |
||
1130 – 1145 | Break | |
1145 – 1245 |
Session A8 CHAIR: Pallavi Jain VENUE: AB 1/101 |
Session B8 CHAIR: Madhavan Mukund VENUE: AB 1/102 |
Nikhil Ayyadevara, Ashish Chiplunkar and Amatya Sharma A Decomposition Approach to the Weighted k-Server Problem |
Yinfeng Zhu A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group |
|
Christian Konrad, Andrew McGregor, Rik Sengupta and Cuong Than Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model |
Pierre Popoli, Jeffrey Shallit and Manon Stipulanti Additive word complexity and Walnut |
|
1245 – 1400 | Lunch | |
1400 – 1500 |
Invited Talk 6 CHAIR: Meena Mahajan VENUE: AB 1/103 |
|
Suguman Bansal Logic-Guided Reinforcement Learning |
||
1500 – 1530 | Break | |
1530 – 1700 |
Session A9 CHAIR: Manoj Gupta VENUE: AB 1/101 |
Session B9 (RHPL) |
Christian Komusiewicz and Jannik Schestag Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study |
Click here for the schedule | |
Shanthanu Rai Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields |
||
Arjan Cornelissen, Nikhil Mande and Subhasree Patro Quantum sabotage complexity |