Tony Tan

According to our database, Tony Tan authored at least 40 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the Complexity of k-DQBF.

Long-Hin Fung, Tony Tan

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022

On two-variable guarded fragment logic with expressive local Presburger constraints.

Chia-Hsuan Lu, Tony Tan

CoRR, 2022

Reducing NEXP-complete problems to DQBF.

Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan

Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

2021

A simple combinatorial proof for the small model property of two-variable logic.

Yanger Ma, Tony Tan

Inf. Process. Lett., 2021

Subsequence versus substring constraints in sequence pattern languages.

Steven Engels, Tony Tan, Jan Van den Bussche

Acta Informatica, 2021

Towards a more efficient approach for the satisfiability of two-variable logic.

Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics.

Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Two Variable Logic with Ultimately Periodic Counting.

Michael Benedikt, Egor V. Kostylev, Tony Tan

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Two-variable logic revisited.

Yanger Ma, Tony Tan

CoRR, 2019

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

A note on first-order spectra with binary relations.

Eryk Kopczynski, Tony Tan

Log. Methods Comput. Sci., 2018

2017

Register automata with linear arithmetic.

Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Parallel Evaluation of Multi-Semi-Joins.

Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren

Proc. VLDB Endow., 2016

2015

On the Variable Hierarchy of First-Order Spectra.

Eryk Kopczynski, Tony Tan

ACM Trans. Comput. Log., 2015

Regular Graphs and the Spectra of Two-Variable Logic with Counting.

Eryk Kopczynski, Tony Tan

SIAM J. Comput., 2015

Regular expressions for data words.

Leonid Libkin, Tony Tan, Domagoj Vrgoc

J. Comput. Syst. Sci., 2015

Distributed Streaming with Finite Memory.

Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan

Proceedings of the 18th International Conference on Database Theory, 2015

Gumbo: Guarded Fragment Queries over Big Data.

Jonny Daenen, Frank Neven, Tony Tan

Proceedings of the 18th International Conference on Extending Database Technology, 2015

2014

Extending two-variable logic on data trees with order on data values and its automata.

Tony Tan

ACM Trans. Comput. Log., 2014

Regular Expressions for Querying Data graphs.

Tony Tan, Domagoj Vrgoc

Int. J. Found. Comput. Sci., 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

A note on the variable hierarchy of first-order spectra.

Eryk Kopczynski, Tony Tan

CoRR, 2014

2013

Graph Reachability and Pebble Automata over Infinite Alphabets.

Tony Tan

ACM Trans. Comput. Log., 2013

Regular Expressions with Binding over Data Words for Querying Graph Databases.

Leonid Libkin, Tony Tan, Domagoj Vrgoc

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Efficient reasoning about data trees via integer linear programming.

Claire David, Leonid Libkin, Tony Tan

ACM Trans. Database Syst., 2012

Automata for two-variable logic over trees with ordered data values

Tony Tan

CoRR, 2012

An Automata Model for Trees with Ordered Data Values.

Tony Tan

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Feasible Automata for Two-Variable Logic with Successor on Data Words.

Ahmet Kara, Thomas Schwentick, Tony Tan

Proceedings of the Language and Automata Theory and Applications, 2012

On the complexity of query answering over incomplete XML documents.

Amélie Gheerbrant, Leonid Libkin, Tony Tan

Proceedings of the 15th International Conference on Database Theory, 2012

2011

A Formalism for Graph Databases and its Model of Computation.

Juan L. Reutter, Tony Tan

Proceedings of the 5th Alberto Mendelzon International Workshop on Foundations of Data Management, 2011

2010

On pebble automata for data languages with decidable emptiness problem.

Tony Tan

J. Comput. Syst. Sci., 2010

A Note on Two-pebble Automata Over Infinite Alphabets.

Michael Kaminski, Tony Tan

Fundam. Informaticae, 2010

Extending Büchi Automata with Constraints on Data Values

Ahmet Kara, Tony Tan

CoRR, 2010

On the Satisfiability of Two-Variable Logic over Data Words.

Claire David, Leonid Libkin, Tony Tan

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Pebble automata for data languages: separation, decidability, and undecidability.

Tony Tan

PhD thesis, 2009

2008

Approximating polyhedral objects with deformable smooth surfaces.

Ho-Lun Cheng, Tony Tan

Comput. Geom., 2008

Tree Automata over Infinite Alphabets.

Michael Kaminski, Tony Tan

Proceedings of the Pillars of Computer Science, 2008

2006

Regular Expressions for Languages over Infinite Alphabets.

Michael Kaminski, Tony Tan

Fundam. Informaticae, 2006

2005

Approximating Polygonal Objects by Deformable Smooth Surfaces.

Ho-Lun Cheng, Tony Tan

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Subdividing Alpha Complex.

Ho-Lun Cheng, Tony Tan

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004