Anupam Das - RankMe

66 papers A* 5A 3B 18C 2Journal 33Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The proof theory and semantics of second-order (intuitionistic) tense logic. CoRR Justus Becker, Anupam Das, Sonia Marin, Paaras Padhiar
2026	J	`jnl`	Wider systems for linear logic with fixed points: proof theory and complexity. CoRR Anupam Das, Tikhon Pshenitsyn
2025	A	`conf`	Algebras for Automata: Reasoning with Regularity (Invited Talk). STACS Anupam Das
2025	J	`jnl`	An algebraic theory of ω-regular languages, via μν-expressions. CoRR Anupam Das, Abhishek De
2025	J	`jnl`	Computational expressivity of (circular) proofs with fixed points. Log. Methods Comput. Sci. Gianluca Curzi, Anupam Das
2025	B	`conf`	Cyclic System for an Algebraic Theory of Alternating Parity Automata. TABLEAUX Anupam Das, Abhishek De
2025	J	`jnl`	Cyclic system for an algebraic theory of alternating parity automata. CoRR Anupam Das, Abhishek De
2025	J	`jnl`	Proof complexity of positive branching programs. Log. Methods Comput. Sci. Anupam Das, Avgerinos Delkos
2025	J	`jnl`	Prover-Adversary games for systems over (non-deterministic) branching programs. CoRR Anupam Das, Avgerinos Delkos
2025	B	`conf`	Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages, with Fixed Points. MFCS Anupam Das, Abhishek De
2025	J	`jnl`	Undecidability of theories of semirings with fixed points. CoRR Anupam Das, Abhishek De, Stepan L. Kuznetsov
2024	—	`conf`	A Proof Theory of (ømega-)Context-Free Languages, via Non-wellfounded Proofs. IJCAR (2) Anupam Das, Abhishek De
2024	J	`jnl`	A proof theory of (omega-)context-free languages, via non-wellfounded proofs. CoRR Anupam Das, Abhishek De
2024	J	`jnl`	A proof theory of right-linear (omega-)grammars via cyclic proofs. CoRR Anupam Das, Abhishek De
2024	A*	`conf`	A proof theory of right-linear (ω-)grammars via cyclic proofs. LICS Anupam Das, Abhishek De
2024	B	`conf`	Intuitionistic Gödel-Löb Logic, à la Simpson: Labelled Systems and Birelational Semantics. CSL Anupam Das, Iris van der Giessen, Sonia Marin
2024	J	`jnl`	On the complexity of normalization for the planar λ-calculus. CoRR Anupam Das, Damiano Mazza, Lê Thành Dung Nguyên, Noam Zeilberger
2024	J	`jnl`	Proof Representations: From Theory to Applications (Dagstuhl Seminar 24341). Dagstuhl Reports Anupam Das, Elaine Pimentel, Lutz Straßburger, Robin Martinot
2023	—	`conf`	Comparing Infinitary Systems for Linear Logic with Fixed Points. FSTTCS Anupam Das, Abhishek De, Alexis Saurin
2023	A*	`conf`	Computational expressivity of (circular) proofs with fixed points. LICS Gianluca Curzi, Anupam Das
2023	J	`jnl`	Computational expressivity of (circular) proofs with fixed points. CoRR Gianluca Curzi, Anupam Das
2023	J	`jnl`	Cyclic Hypersequent System for Transitive Closure Logic. J. Autom. Reason. Anupam Das, Marianna Girlando
2023	B	`conf`	Cyclic Proofs for Arithmetical Inductive Definitions. FSCD Anupam Das, Lukas Melgaard
2023	J	`jnl`	Enumerating Independent Linear Inferences. Log. Methods Comput. Sci. Anupam Das, Alex A. Rice
2023	J	`jnl`	Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics. CoRR Anupam Das, Iris van der Giessen, Sonia Marin
2023	B	`conf`	Non-Uniform Complexity via Non-Wellfounded Proofs. CSL Gianluca Curzi, Anupam Das
2023	B	`conf`	On Intuitionistic Diamonds (and Lack Thereof). TABLEAUX Anupam Das, Sonia Marin
2022	A*	`conf`	Cyclic Implicit Complexity. LICS Gianluca Curzi, Anupam Das
2022	A	`conf`	Cyclic Proofs, Hypersequents, and Transitive Closure Logic. IJCAR Anupam Das, Marianna Girlando
2022	J	`jnl`	Cyclic Proofs, Hypersequents, and Transitive Closure Logic. CoRR Anupam Das, Marianna Girlando
2022	B	`conf`	Decision Problems for Linear Logic with Least and Greatest Fixed Points. FSCD Anupam Das, Abhishek De, Alexis Saurin
2022	B	`conf`	Modal logic and the polynomial hierarchy: from QBFs to K and back. AiML Anupam Das, Sonia Marin
2022	J	`jnl`	Non-uniform complexity via non-wellfounded proofs. CoRR Gianluca Curzi, Anupam Das
2022	C	`conf`	Proof Complexity of Monotone Branching Programs. CiE Anupam Das, Avgerinos Delkos
2021	B	`ed.`	Automated Reasoning with Analytic Tableaux and Related Methods - 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6-9, 2021, Proceedings TABLEAUX Anupam Das, Sara Negri
2021	J	`jnl`	Cyclic Implicit Complexity. CoRR Gianluca Curzi, Anupam Das
2021	J	`jnl`	Enumerating Independent Linear Inferences. CoRR Anupam Das, Alex A. Rice
2021	B	`conf`	New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial. FSCD Anupam Das, Alex A. Rice
2021	B	`conf`	On the Logical Strength of Confluence and Normalisation for Cyclic Proofs. FSCD Anupam Das
2021	J	`jnl`	Proof complexity of positive branching programs. CoRR Anupam Das, Avgerinos Delkos
2020	J	`jnl`	A Functional (Monadic) Second-Order Theory of Infinite Trees. Log. Methods Comput. Sci. Anupam Das, Colin Riba
2020	J	`jnl`	A circular version of Gödel's T and its abstraction complexity. CoRR Anupam Das
2020	J	`jnl`	Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs. CoRR Cameron Calk, Anupam Das, Tim Waring
2020	J	`jnl`	From QBFs to MALL and Back via Focussing. J. Autom. Reason. Anupam Das
2020	J	`jnl`	On the logical complexity of cyclic arithmetic. Log. Methods Comput. Sci. Anupam Das
2020	B	`conf`	Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. CSL Sam Buss, Anupam Das, Alexander Knop
2019	J	`jnl`	A Functional (Monadic) Second-Order Theory of Infinite Trees. CoRR Anupam Das, Colin Riba
2019	J	`jnl`	From QBFs to MALL and back via focussing: fragments of multiplicative additive linear logic for each level of the polynomial hierarchy. CoRR Anupam Das
2019	J	`jnl`	Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR Sam Buss, Anupam Das, Alexander Knop
2018	B	`conf`	A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. CSL Anupam Das, Isabel Oitavem
2018	A	`conf`	Focussing, MALL and the Polynomial Hierarchy. IJCAR Anupam Das
2018	B	`conf`	Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. LPAR Anupam Das, Amina Doumane, Damien Pous
2018	B	`conf`	Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). CSL Anupam Das, Damien Pous
2018	J	`jnl`	On the logical complexity of cyclic arithmetic. CoRR Anupam Das
2017	B	`conf`	A Cut-Free Cyclic Proof System for Kleene Algebra. TABLEAUX Anupam Das, Damien Pous
2016	B	`conf`	Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. CSL Patrick Baillot, Anupam Das
2016	A*	`conf`	From positive and intuitionistic bounded arithmetic to monotone proof complexity. LICS Anupam Das
2016	J	`jnl`	On linear rewriting systems for Boolean logic and some applications to proof theory. Log. Methods Comput. Sci. Anupam Das, Lutz Straßburger
2015	A*	`conf`	A Complete Axiomatization of MSO on Infinite Trees. LICS Anupam Das, Colin Riba
2015	—	`conf`	No complete linear term rewriting system for propositional logic. RTA Anupam Das, Lutz Straßburger
2015	J	`jnl`	On Nested Sequents for Constructive Modal Logics. Log. Methods Comput. Sci. Ryuta Arisaka, Anupam Das, Lutz Straßburger
2015	J	`jnl`	On the relative proof complexity of deep inference via atomic flows. Log. Methods Comput. Sci. Anupam Das
2014	—	`conf`	On the pigeonhole and related principles in deep inference and monotone systems. CSL-LICS Anupam Das
2013	—	`conf`	Rewriting with Linear Inferences in Propositional Logic. RTA Anupam Das
2012	C	`conf`	Complexity of Deep Inference via Atomic Flows. CiE Anupam Das
2011	B	`conf`	On the Proof Complexity of Cut-Free Bounded Deep Inference. TABLEAUX Anupam Das