| 2026 | AAAI | Model Counting for Dependency Quantified Boolean Formulas. | Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan |
| 2026 | CSL | Analysis of Logics with Arithmetic. | Michael Benedikt, Chia-Hsuan Lu, Tony Tan |
| 2026 | TACAS | Robustness Verification of Graph Neural Networks Via Lightweight Satisfiability Testing. | Chia-Hsuan Lu, Tony Tan, Michael Benedikt |
| 2025 | LICS | Separation and Definability in Fragments of Two-Variable First-Order Logic with Counting. | Louwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev |
| 2025 | SAT | Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas. | Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan |
| 2024 | FMCAD | 2-DQBF Solving and Certification via Property-Directed Reachability Analysis. | Long-Hin Fung, Che Cheng, Yu-Wei Fan, Tony Tan, Jie-Hong Roland Jiang |
| 2024 | ICALP | Decidability of Graph Neural Networks via Logical Characterizations. | Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan |
| 2023 | SAT | On the Complexity of k-DQBF. | Long-Hin Fung, Tony Tan |
| 2022 | FMCAD | Reducing NEXP-complete problems to DQBF. | Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan |
| 2021 | LICS | Towards a more efficient approach for the satisfiability of two-variable logic. | Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan |
| 2020 | ICALP | Two Variable Logic with Ultimately Periodic Counting. | Michael Benedikt, Egor V. Kostylev, Tony Tan |
| 2017 | LICS | Register automata with linear arithmetic. | Yu-Fang Chen, Ondrej Lengl, Tony Tan, Zhilin Wu |
| 2015 | EDBT | Gumbo: Guarded Fragment Queries over Big Data. | Jonny Daenen, Frank Neven, Tony Tan |
| 2015 | ICDT | Distributed Streaming with Finite Memory. | Frank Neven, Nicole Schweikardt, Frdric Servais, Tony Tan |
| 2013 | DLT | Regular Expressions with Binding over Data Words for Querying Graph Databases. | Leonid Libkin, Tony Tan, Domagoj Vrgoc |
| 2012 | ICDT | On the complexity of query answering over incomplete XML documents. | Amlie Gheerbrant, Leonid Libkin, Tony Tan |
| 2012 | LATA | Feasible Automata for Two-Variable Logic with Successor on Data Words. | Ahmet Kara, Thomas Schwentick, Tony Tan |
| 2012 | LICS | An Automata Model for Trees with Ordered Data Values. | Tony Tan |
| 2011 | ICDT | Efficient reasoning about data trees via integer linear programming. | Claire David, Leonid Libkin, Tony Tan |
| 2010 | LPAR | On the Satisfiability of Two-Variable Logic over Data Words. | Claire David, Leonid Libkin, Tony Tan |
| 2009 | LICS | Graph Reachability and Pebble Automata over Infinite Alphabets. | Tony Tan |
| 2009 | MFCS | On Pebble Automata for Data Languages with Decidable Emptiness Problem. | Tony Tan |
| 2005 | MFCS | Approximating Polygonal Objects by Deformable Smooth Surfaces. | Ho-Lun Cheng, Tony Tan |
| 2004 | COCOON | Regular Expressions for Languages over Infinite Alphabets. | Michael Kaminski, Tony Tan |