default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTony Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Chia-Hsuan Lu
, Tony Tan:
On two-variable guarded fragment logic with expressive local Presburger constraints. Log. Methods Comput. Sci. 20(3) (2024)- [j17]Michael Benedikt, Egor V. Kostylev, Tony Tan:
Two Variable Logic with Ultimately Periodic Counting. SIAM J. Comput. 53(4): 884-968 (2024) - [c23]Louwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev:
Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract). Description Logics 2024 - [c22]Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan:
Decidability of Graph Neural Networks via Logical Characterizations. ICALP 2024: 127:1-127:20 - [i18]Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan:
Decidability of Graph Neural Networks via Logical Characterizations. CoRR abs/2404.18151 (2024) - 2023
- [c21]Long-Hin Fung, Tony Tan:
On the Complexity of k-DQBF. SAT 2023: 10:1-10:15 - 2022
- [c20]Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan:
Reducing NEXP-complete problems to DQBF. FMCAD 2022: 199-204 - [i17]Chia-Hsuan Lu, Tony Tan:
On two-variable guarded fragment logic with expressive local Presburger constraints. CoRR abs/2206.13731 (2022) - [i16]Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan:
Reducing NEXP-complete problems to DQBF. CoRR abs/2208.06014 (2022) - 2021
- [j16]Steven Engels, Tony Tan, Jan Van den Bussche:
Subsequence versus substring constraints in sequence pattern languages. Acta Informatica 58(1-2): 35-56 (2021) - [j15]Yanger Ma, Tony Tan:
A simple combinatorial proof for the small model property of two-variable logic. Inf. Process. Lett. 170: 106122 (2021) - [c19]Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan:
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. FSTTCS 2021: 36:1-36:15 - [c18]Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan:
Towards a more efficient approach for the satisfiability of two-variable logic. LICS 2021: 1-13 - [i15]Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan:
Towards a more efficient approach for the satisfiability of two-variable logic. CoRR abs/2104.10621 (2021) - [i14]Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan:
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics. CoRR abs/2106.15250 (2021) - 2020
- [c17]Michael Benedikt, Egor V. Kostylev, Tony Tan:
Two Variable Logic with Ultimately Periodic Counting. ICALP 2020: 112:1-112:16 - [i13]Michael Benedikt, Egor V. Kostylev, Tony Tan:
Two variable logic with ultimately periodic counting. CoRR abs/2006.01193 (2020)
2010 – 2019
- 2019
- [i12]Yanger Ma, Tony Tan:
Two-variable logic revisited. CoRR abs/1908.07239 (2019) - 2018
- [j14]Eryk Kopczynski, Tony Tan:
A note on first-order spectra with binary relations. Log. Methods Comput. Sci. 14(2) (2018) - [j13]Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan:
Finite-State Map-Reduce Computation and Relational Algebra Queries. ACM Trans. Comput. Log. 19(2): 14:1-14:37 (2018) - 2017
- [c16]Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu:
Register automata with linear arithmetic. LICS 2017: 1-12 - [i11]Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu:
Register automata with linear arithmetic. CoRR abs/1704.03972 (2017) - [i10]Eryk Kopczynski, Tony Tan:
A note on first-order spectra with binary relations. CoRR abs/1706.08691 (2017) - 2016
- [j12]Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren:
Parallel Evaluation of Multi-Semi-Joins. Proc. VLDB Endow. 9(10): 732-743 (2016) - [i9]Jonny Daenen, Frank Neven, Tony Tan, Stijn Vansummeren:
Parallel Evaluation of Multi-Semi-Joins. CoRR abs/1605.05219 (2016) - 2015
- [j11]Leonid Libkin, Tony Tan, Domagoj Vrgoc:
Regular expressions for data words. J. Comput. Syst. Sci. 81(7): 1278-1297 (2015) - [j10]Eryk Kopczynski, Tony Tan:
Regular Graphs and the Spectra of Two-Variable Logic with Counting. SIAM J. Comput. 44(3): 786-818 (2015) - [j9]Eryk Kopczynski, Tony Tan:
On the Variable Hierarchy of First-Order Spectra. ACM Trans. Comput. Log. 16(2): 17:1-17:12 (2015) - [c15]Jonny Daenen, Frank Neven, Tony Tan:
Gumbo: Guarded Fragment Queries over Big Data. EDBT 2015: 521-524 - [c14]Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan:
Distributed Streaming with Finite Memory. ICDT 2015: 324-341 - 2014
- [j8]Tony Tan, Domagoj Vrgoc:
Regular Expressions for Querying Data graphs. Int. J. Found. Comput. Sci. 25(8): 971-986 (2014) - [j7]Tony Tan:
Extending two-variable logic on data trees with order on data values and its automata. ACM Trans. Comput. Log. 15(1): 8:1-8:39 (2014) - [i8]Eryk Kopczynski, Tony Tan:
A note on the variable hierarchy of first-order spectra. CoRR abs/1403.2225 (2014) - [i7]Tony Tan, Jan Van den Bussche, Xiaowang Zhang:
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference. CoRR abs/1406.0349 (2014) - 2013
- [j6]Tony Tan:
Graph Reachability and Pebble Automata over Infinite Alphabets. ACM Trans. Comput. Log. 14(3): 19:1-19:31 (2013) - [c13]Leonid Libkin, Tony Tan, Domagoj Vrgoc:
Regular Expressions with Binding over Data Words for Querying Graph Databases. Developments in Language Theory 2013: 325-337 - [i6]Eryk Kopczynski, Tony Tan:
Regular graphs and the spectra of two-variable logic with counting. CoRR abs/1304.0829 (2013) - 2012
- [j5]Claire David, Leonid Libkin, Tony Tan:
Efficient reasoning about data trees via integer linear programming. ACM Trans. Database Syst. 37(3): 19:1-19:28 (2012) - [c12]Amélie Gheerbrant, Leonid Libkin, Tony Tan:
On the complexity of query answering over incomplete XML documents. ICDT 2012: 169-181 - [c11]Ahmet Kara, Thomas Schwentick, Tony Tan:
Feasible Automata for Two-Variable Logic with Successor on Data Words. LATA 2012: 351-362 - [c10]Tony Tan:
An Automata Model for Trees with Ordered Data Values. LICS 2012: 586-595 - [i5]Tony Tan:
Automata for two-variable logic over trees with ordered data values. CoRR abs/1212.3251 (2012) - 2011
- [c9]Juan L. Reutter, Tony Tan:
A Formalism for Graph Databases and its Model of Computation. AMW 2011 - [c8]Claire David, Leonid Libkin, Tony Tan:
Efficient reasoning about data trees via integer linear programming. ICDT 2011: 18-29 - [i4]Ahmet Kara, Thomas Schwentick, Tony Tan:
Feasible Automata for Two-Variable Logic with Successor on Data Words. CoRR abs/1110.1221 (2011) - [i3]Tony Tan:
Graph Reachability and Pebble Automata over Infinite Alphabets. CoRR abs/1110.2776 (2011) - 2010
- [j4]Michael Kaminski, Tony Tan:
A Note on Two-pebble Automata Over Infinite Alphabets. Fundam. Informaticae 98(4): 379-390 (2010) - [j3]Tony Tan:
On pebble automata for data languages with decidable emptiness problem. J. Comput. Syst. Sci. 76(8): 778-791 (2010) - [c7]Claire David, Leonid Libkin, Tony Tan:
On the Satisfiability of Two-Variable Logic over Data Words. LPAR (Yogyakarta) 2010: 248-262 - [i2]Ahmet Kara, Tony Tan:
Extending Büchi Automata with Constraints on Data Values. CoRR abs/1012.5439 (2010)
2000 – 2009
- 2009
- [b1]Tony Tan:
Pebble automata for data languages: separation, decidability, and undecidability. Technion - Israel Institute of Technology, Israel, 2009 - [c6]Tony Tan:
Graph Reachability and Pebble Automata over Infinite Alphabets. LICS 2009: 157-166 - [c5]Tony Tan:
On Pebble Automata for Data Languages with Decidable Emptiness Problem. MFCS 2009: 712-723 - [i1]Tony Tan:
On Pebble Automata for Data Languages with Decidable Emptiness Problem. CoRR abs/0910.5844 (2009) - 2008
- [j2]Ho-Lun Cheng, Tony Tan:
Approximating polyhedral objects with deformable smooth surfaces. Comput. Geom. 39(2): 104-117 (2008) - [c4]Michael Kaminski, Tony Tan:
Tree Automata over Infinite Alphabets. Pillars of Computer Science 2008: 386-423 - 2006
- [j1]Michael Kaminski, Tony Tan:
Regular Expressions for Languages over Infinite Alphabets. Fundam. Informaticae 69(3): 301-318 (2006) - 2005
- [c3]Ho-Lun Cheng, Tony Tan:
Approximating Polygonal Objects by Deformable Smooth Surfaces. MFCS 2005: 248-259 - 2004
- [c2]Michael Kaminski, Tony Tan:
Regular Expressions for Languages over Infinite Alphabets. COCOON 2004: 171-178 - [c1]Ho-Lun Cheng, Tony Tan:
Subdividing Alpha Complex. FSTTCS 2004: 186-197
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
