| 臺大學術典藏 |
2020-05-04T08:07:25Z |
Approximating Polygonal Objects by Deformable Smooth Surfaces.
|
Cheng, Ho-Lun; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:25Z |
Regular Expressions for Languages over Infinite Alphabets.
|
Kaminski, Michael; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:25Z |
Subdividing Alpha Complex.
|
Cheng, Ho-Lun; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:25Z |
A Note on First-Order Spectra with Binary Relations
|
Kopczynski, Eryk;Tan, Tony; Kopczynski, Eryk; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:25Z |
A Note on First-Order Spectra with Binary Relations
|
Kopczynski, Eryk;Tan, Tony; Kopczynski, Eryk; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:25Z |
Parallel Evaluation of Multi-Semi-Joins
|
TONY TAN; Vansummeren, Stijn; Tan, Tony; Neven, Frank; Daenen, Jonny; Daenen, Jonny;Neven, Frank;Tan, Tony;Vansummeren, Stijn |
| 臺大學術典藏 |
2020-05-04T08:07:25Z |
Parallel Evaluation of Multi-Semi-Joins
|
TONY TAN; Vansummeren, Stijn; Tan, Tony; Neven, Frank; Daenen, Jonny; Daenen, Jonny;Neven, Frank;Tan, Tony;Vansummeren, Stijn |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
A Note on Two-pebble Automata Over Infinite Alphabets.
|
Kaminski, Michael;Tan, Tony; Kaminski, Michael; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
A Note on Two-pebble Automata Over Infinite Alphabets.
|
Kaminski, Michael;Tan, Tony; Kaminski, Michael; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On pebble automata for data languages with decidable emptiness problem.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On pebble automata for data languages with decidable emptiness problem.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On the Satisfiability of Two-Variable Logic over Data Words.
|
David, Claire;Libkin, Leonid;Tan, Tony; David, Claire; Libkin, Leonid; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On the Satisfiability of Two-Variable Logic over Data Words.
|
David, Claire;Libkin, Leonid;Tan, Tony; David, Claire; Libkin, Leonid; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On Pebble Automata for Data Languages with Decidable Emptiness Problem.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On Pebble Automata for Data Languages with Decidable Emptiness Problem.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Approximating polyhedral objects with deformable smooth surfaces.
|
Cheng, Ho-Lun;Tan, Tony; Cheng, Ho-Lun; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Approximating polyhedral objects with deformable smooth surfaces.
|
Cheng, Ho-Lun;Tan, Tony; Cheng, Ho-Lun; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Tree Automata over Infinite Alphabets.
|
Kaminski, Michael; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Graph Reachability and Pebble Automata over Infinite Alphabets.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Graph Reachability and Pebble Automata over Infinite Alphabets.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:23Z |
On the complexity of query answering over incomplete XML documents.
|
Gheerbrant, Am?lie; Libkin, Leonid; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:23Z |
Feasible Automata for Two-Variable Logic with Successor on Data Words.
|
Kara, Ahmet; Schwentick, Thomas; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:23Z |
An Automata Model for Trees with Ordered Data Values.
|
Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:23Z |
A Formalism for Graph Databases and its Model of Computation.
|
Reutter, Juan L.;Tan, Tony; Reutter, Juan L.; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:23Z |
A Formalism for Graph Databases and its Model of Computation.
|
Reutter, Juan L.;Tan, Tony; Reutter, Juan L.; Tan, Tony; TONY TAN |
