Subdividing Alpha Complex. - Ho-Lun Cheng; Tony Tan (FSTTCS, 2004)

Approximating Polygonal Objects by Deformable Smooth Surfaces. - Ho-Lun Cheng; Tony Tan (MFCS, 2005)

Regular Expressions for Languages over Infinite Alphabets. - Michael Kaminski; Tony Tan (Fundam. Informaticae, 2006)

Tree Automata over Infinite Alphabets. - Michael Kaminski; Tony Tan (Pillars of Computer Science, 2008)

Approximating polyhedral objects with deformable smooth surfaces. - Ho-Lun Cheng; Tony Tan (Comput. Geom., 2008)

Pebble automata for data languages: separation, decidability, and undecidability. - Tony Tan (2009)

On the Satisfiability of Two-Variable Logic over Data Words. - Claire David; Leonid Libkin; Tony Tan (LPAR (Yogyakarta), 2010)

Extending Büchi Automata with Constraints on Data Values - Ahmet Kara 002; Tony Tan (CoRR, 2010)

A Note on Two-pebble Automata Over Infinite Alphabets. - Michael Kaminski; Tony Tan (Fundam. Informaticae, 2010)

On pebble automata for data languages with decidable emptiness problem. - Tony Tan (J. Comput. Syst. Sci., 2010)

A Formalism for Graph Databases and its Model of Computation. - Juan L. Reutter; Tony Tan (AMW, 2011)

On the complexity of query answering over incomplete XML documents. - Amélie Gheerbrant; Leonid Libkin; Tony Tan (ICDT, 2012)

Feasible Automata for Two-Variable Logic with Successor on Data Words. - Ahmet Kara 002; Thomas Schwentick; Tony Tan (LATA, 2012)

An Automata Model for Trees with Ordered Data Values. - Tony Tan (LICS, 2012)

Automata for two-variable logic over trees with ordered data values - Tony Tan (CoRR, 2012)

Efficient reasoning about data trees via integer linear programming. - Claire David; Leonid Libkin; Tony Tan (ACM Trans. Database Syst., 2012)

Regular Expressions with Binding over Data Words for Querying Graph Databases. - Leonid Libkin; Tony Tan; Domagoj Vrgoc (Developments in Language Theory, 2013)

Graph Reachability and Pebble Automata over Infinite Alphabets. - Tony Tan (ACM Trans. Comput. Log., 2013)

A note on the variable hierarchy of first-order spectra. - Eryk Kopczynski; Tony Tan (CoRR, 2014)

Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference. - Tony Tan; Jan Van den Bussche; Xiaowang Zhang (CoRR, 2014)

Regular Expressions for Querying Data graphs. - Tony Tan; Domagoj Vrgoc (Int. J. Found. Comput. Sci., 2014)

Extending two-variable logic on data trees with order on data values and its automata. - Tony Tan (ACM Trans. Comput. Log., 2014)

Gumbo: Guarded Fragment Queries over Big Data. - Jonny Daenen; Frank Neven; Tony Tan (EDBT, 2015)

Distributed Streaming with Finite Memory. - Frank Neven; Nicole Schweikardt; Frédéric Servais; Tony Tan (ICDT, 2015)

Regular expressions for data words. - Leonid Libkin; Tony Tan; Domagoj Vrgoc (J. Comput. Syst. Sci., 2015)

Regular Graphs and the Spectra of Two-Variable Logic with Counting. - Eryk Kopczynski; Tony Tan (SIAM J. Comput., 2015)

On the Variable Hierarchy of First-Order Spectra. - Eryk Kopczynski; Tony Tan (ACM Trans. Comput. Log., 2015)

Parallel Evaluation of Multi-Semi-Joins. - Jonny Daenen; Frank Neven; Tony Tan; Stijn Vansummeren (Proc. VLDB Endow., 2016)

Register automata with linear arithmetic. - Yu-Fang Chen 001; Ondrej Lengál; Tony Tan; Zhilin Wu (LICS, 2017)

A note on first-order spectra with binary relations. - Eryk Kopczynski; Tony Tan (Log. Methods Comput. Sci., 2018)

Finite-State Map-Reduce Computation and Relational Algebra Queries. - Frank Neven; Nicole Schweikardt; Frédéric Servais; Tony Tan (ACM Trans. Comput. Log., 2018)

Two-variable logic revisited. - Yanger Ma; Tony Tan (CoRR, 2019)

On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. - Bartosz Bednarczyk; Maja Orlowska; Anna Pacanowska; Tony Tan (FSTTCS, 2021)

Towards a more efficient approach for the satisfiability of two-variable logic. - Ting-Wei Lin; Chia-Hsuan Lu; Tony Tan (LICS, 2021)

Subsequence versus substring constraints in sequence pattern languages. - Steven Engels; Tony Tan; Jan Van den Bussche (Acta Informatica, 2021)

A simple combinatorial proof for the small model property of two-variable logic. - Yanger Ma; Tony Tan (Inf. Process. Lett., 2021)

Reducing NEXP-complete problems to DQBF. - Fa-Hsun Chen; Shen-Chang Huang; Yu-Cheng Lu; Tony Tan (FMCAD, 2022)

On the Complexity of k-DQBF. - Long-Hin Fung; Tony Tan (SAT, 2023)

Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract). - Louwe Kuijer; Tony Tan; Frank Wolter; Michael Zakharyaschev (Description Logics, 2024)

2-DQBF Solving and Certification via Property-Directed Reachability Analysis. - Long-Hin Fung; Che Cheng; Yu-Wei Fan; Tony Tan; Jie-Hong Roland Jiang (FMCAD, 2024)

Decidability of Graph Neural Networks via Logical Characterizations. - Michael Benedikt; Chia-Hsuan Lu; Boris Motik; Tony Tan (ICALP, 2024)

On two-variable guarded fragment logic with expressive local Presburger constraints. - Chia-Hsuan Lu; Tony Tan (Log. Methods Comput. Sci., 2024)

Two Variable Logic with Ultimately Periodic Counting. - Michael Benedikt; Egor V. Kostylev; Tony Tan (SIAM J. Comput., 2024)

Future Human - Consciousness, Cognition and the Role of Human Insight in an AI Future - Tony Tan (Future Human, 2025)

Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas. - Che Cheng; Long-Hin Fung; Jie-Hong Roland Jiang; Friedrich Slivovsky; Tony Tan (SAT, 2025)

Separation and Definability in Fragments of Two-Variable First-Order Logic with Counting. - Louwe Kuijer; Tony Tan; Frank Wolter; Michael Zakharyaschev (CoRR, 2025)

Analysis of logics with arithmetic. - Michael Benedikt; Chia-Hsuan Lu; Tony Tan (CoRR, 2025)