default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID45th FSTTCS 2025: Goa, India
- C. Aiswarya
, Ruta Mehta, Subhajit Roy:
45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2025, BITS Pilani, K K Birla Goa Campus, India, December 17-19, 2025. LIPIcs 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-406-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xx
- Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hecko, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Ramanathan Thinniyam Srinivasan:
Quantum Circuit Verification - A Potential Roadmap (Invited Talk). 1:1-1:8 - Georg Zetzsche:
Unboundedness Problems for Formal Languages (Invited Talk). 2:1-2:10 - Scott Aaronson, Sabee Grewal, Vishnu Iyer, Simon C. Marshall, Ronak Ramachandran:
PDQMA = DQMA = NEXP: QMA with Hidden Variables and Non-Collapsing Measurements. 3:1-3:17 - Rosemary Adejoh, Andreas Jakoby, Sneha Mohanty, Christian Schindelhauer:
How Pinball Wizards Simulate a Turing Machine. 4:1-4:18 - Bharat Adsul, Nehul Jain:
Distributed Games with a Central Decision Maker. 5:1-5:18 - Arif Ali AP, Jasine Babu, Deepa Sara John:
A Correct by Construction Fault Tolerant Voter for Input Selection of a Control System. 6:1-6:20 - Erika Andersson, Akshay Bansal, James T. Peat, Jamie Sikora, Jiawei Wu:
Quantum Protocols for Rabin Oblivious Transfer. 7:1-7:18 - Étienne André, Swen Jacobs, Shyam Lal Karra, Ocan Sankur:
Parameterized Verification of Timed Networks with Clock Invariants. 8:1-8:19 - Ali Asadi, Léonard Brice, Krishnendu Chatterjee, K. S. Thejaswini:
ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games. 9:1-9:17 - Rylo Ashmore, Sophie Pinchinat:
Cat Herding Game Played on Infinite Trees. 10:1-10:15 - Haricharan Balasundaram, J. B. Krishnashree, Girija Limaye, Meghana Nasre:
Stability Notions for Hospital Residents with Sizes. 11:1-11:18 - Ayaan Bedi, Karoliina Lehtinen:
Explorability in Pushdown Automata. 12:1-12:18 - Dietmar Berwanger, Laurent Doyen, Thomas Soullard:
Synthesising Full-Information Protocols. 13:1-13:18 - Ashwin Bhaskar, M. Praveen:
Regulating Synchronous Data Exchange to Meet Control Flow and Data Specifications. 14:1-14:19 - Umang Bhaskar, Yeshwant Pandit:
Extending EFX Allocations to Further Multi-Graph Classes. 15:1-15:18 - Laurent Bienvenu, Hugo Gimbert, Subin Pulari:
The Agafonov and Schnorr-Stimm Theorems for Probabilistic Automata. 16:1-16:15 - Antonio Blanca, Zhezheng Song:
Cutoff for the Swendsen-Wang Dynamics on the Complete Graph. 17:1-17:21 - Marius Bozga, Radu Iosif, Florian Zuleger:
Iterating Non-Aggregative Structure Compositions. 18:1-18:18 - Deeparnab Chakrabarty, Jonathan Conroy, Ankita Sarkar:
Clustering in Varying Metrics. 19:1-19:21 - Marek Chalupa, Thomas A. Henzinger, Ana Oliveira da Costa:
Flavors of Quantifiers in Hyperlogics. 20:1-20:18 - Yi-Jun Chang, Yanyu Chen, Gopinath Mishra:
Overlay Network Construction: Improved Overall and Node-Wise Message Complexity. 21:1-21:21 - Prerona Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, Amit Sinhababu:
IPS Lower Bounds for Formulas and Sum of ROABPs. 22:1-22:21 - Archit Chauhan, Samir Datta, M. Praveen:
Parallel Complexity of Depth-First-Search and Maximal Path in Restricted Graph Classes. 23:1-23:21 - Joey Chen, Bjørn Kjos-Hanssen, Ivan Koswara, Linus Richter, Frank Stephan:
Languages of Words of Low Automatic Complexity Are Hard to Compute. 24:1-24:19 - Abhimanyu Choudhury, Meena Mahajan:
On the Interplay of Cube Learning and Dependency Schemes in {QCDCL} Proof Systems. 25:1-25:19 - Anuj Dawar, Aidan T. Evans:
Characterizing NC¹ with Typed Monoids. 26:1-26:19 - Dipan Dey, Telikepalli Kavitha:
Fault-Tolerant Approximate Distance Oracles with a Source Set. 27:1-27:15 - Alejandro Díaz-Caro, Octavio Malherbe:
Beyond Monads and Biproducts: A Uniform Interpretation of Parallelism in Intuitionistic Logic. 28:1-28:17 - Ajaykrishnan E. S, Daniel Lokshtanov:
Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division. 29:1-29:16 - Thomas Erlebach, Naveen Garg, Sukriti Gupta, Amitabh Trehan:
Approximating Optimal Broadcast of Files in a Hose-Model Network. 30:1-30:19 - Mathew C. Francis, Veena Prabhakaran:
Token Sliding Independent Set Reconfiguration on Block Graphs. 31:1-31:19 - Rohith Reddy Gangam, Shayan Taherijam, Vijay V. Vazirani:
Fair Rent Division: New Budget and Rent Constraints. 32:1-32:21 - Gilles Geeraerts, Frédéric Herbreteau, Jean-François Raskin, Alexis Reynouard:
A Zone-Based Algorithm for Timed Parity Games. 33:1-33:18 - Elena Grigorescu, Vatsal Jha, Eric Samperton:
On the Hardness of Approximating Distances of Quantum Codes. 34:1-34:18 - Shibashis Guha, Anirban Majumdar, Prince Mathew, A. V. Sreejith:
Scalable Learning of One-Counter Automata via State-Merging Algorithms. 35:1-35:19 - Ziad Ismaili Alaoui, Nikhil S. Mande:
Hardness of Finding Kings and Strong Kings. 36:1-36:12 - Dale Jacobs, John Jeang, Vladimir Podolskii, Morgan E. Prior, Ilya Volkovich:
Communication Complexity of Equality and Error-Correcting Codes. 37:1-37:19 - Pallavi Jain, Palash Jha, Shubham Solanki:
Fairness and Efficiency in Two-Sided Matching Markets. 38:1-38:17 - Satyabrata Jana, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants. 39:1-39:20 - Sina Kalantarzadeh, Nikhil Kumar:
Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs. 40:1-40:19 - Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui:
Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions. 41:1-41:19 - Donghyun Lim, Martin Ziegler:
Degrees of Second and Higher-Order Polynomials. 42:1-42:20 - Yashaswini Mathur, Prafullkumar Tale:
A Finer View of the Parameterized Landscape of Labeled Graph Contractions. 43:1-43:19 - Aniket Mishra, Abhishek Bichhawat:
Fall-Through Semantics for Mitigating Timing-Based Side Channel Leaks. 44:1-44:18 - Neeldhara Misra, Saraswati Girish Nanoti:
A Characterization of Spartan Graphs and New Lower Bounds for Eternal Vertex Cover. 45:1-45:17 - Chaitanya Nalam, Thatchaphol Saranurak:
Finding Small Dijoins in Transitive Closure Time. 46:1-46:11 - Ian Orzel, Srikanth Srinivasan, Sébastien Tavenas, Amir Yehudayoff:
The Algebraic Cost of a Boolean Sum. 47:1-47:13 - Om Prakash, Vikram Sharma:
On the Roots of Independence Polynomial: Quantifying the Gap. 48:1-48:18 - C. Ramya, Pratik Shastri:
On the Hardness of Order Finding and Equivalence Testing for ROABPs. 49:1-49:13 - Liam Roditty, Ariel Sapir:
Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms. 50:1-50:22 - G. V. Sumukha Bharadwaj, S. Raja:
Randomized Black-Box PIT for Small Depth +-Regular Non-Commutative Circuits. 51:1-51:16 - Amrita Suresh, Nobuko Yoshida:
Unreliability in Practical Subclasses of Communicating Systems. 52:1-52:22
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-12-23 00:48 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:
