| 2026 | LICS | Hypersequent Calculi Have Ackermann Complexity. | A. R. Balasubramanian, Vitor Greati, Revantha Ramanayake |
| 2026 | LICS | The Logic of Bunched Implications Is Undecidable. | Nikolaos Galatos, Peter Jipsen, Sren Brinck Knudstorp, Revantha Ramanayake |
| 2025 | TABLEAUX | Analytic Proofs for Tense Logic. | Agata Ciabattoni, Timo Lang, Revantha Ramanayake |
| 2024 | AiML | Deducibility in the Full Lambek Calculus with Weakening Is HAck-Complete. | Vitor Greati, Revantha Ramanayake |
| 2023 | LICS | Cut-Restriction: From Cuts to Analytic Cuts. | Agata Ciabattoni, Timo Lang, Revantha Ramanayake |
| 2021 | LICS | Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. | A. R. Balasubramanian, Timo Lang, Revantha Ramanayake |
| 2021 | TABLEAUX | Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq. | Rajeev Gor, Revantha Ramanayake, Ian Shillito |
| 2020 | LICS | Extended Kripke lemma and decidability for hypersequent substructural logics. | Revantha Ramanayake |
| 2019 | TABLEAUX | Bounded Sequent Calculi for Non-classical Logics via Hypersequents. | Agata Ciabattoni, Timo Lang, Revantha Ramanayake |
| 2019 | TABLEAUX | Sequentialising Nested Systems. | Elaine Pimentel, Revantha Ramanayake, Bjrn Lellmann |
| 2018 | LFCS | From Display to Labelled Proofs for Tense Logics. | Agata Ciabattoni, Tim S. Lyon, Revantha Ramanayake |
| 2017 | LPAR | Bunched Hypersequent Calculi for Distributive Substructural Logics. | Agata Ciabattoni, Revantha Ramanayake |
| 2016 | CADE | Inducing Syntactic Cut-Elimination for Indexed Nested Sequents. | Revantha Ramanayake |
| 2016 | CADE | From Axioms to Proof Rules, then add Quantifiers. | Revantha Ramanayake |
| 2013 | WoLLIC | Structural Extensions of Display Calculi: A General Recipe. | Agata Ciabattoni, Revantha Ramanayake |
| 2012 | AiML | Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents. | Rajeev Gor, Revantha Ramanayake |
| 2008 | AiML | Valentini's cut-elimination for provability logic resolved. | Rajeev Gor, Revantha Ramanayake |