- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 8 |      | Tony Tan: Graph Reachability and Pebble Automata over Infinite Alphabets. LICS 2009: 157-166 |
| 7 | | Tony Tan: On Pebble Automata for Data Languages with Decidable Emptiness Problem. MFCS 2009: 712-723 |
| 2008 | ||
| 6 | | Michael Kaminski, Tony Tan: Tree Automata over Infinite Alphabets. Pillars of Computer Science 2008: 386-423 |
| 5 | | Ho-Lun Cheng, Tony Tan: Approximating polyhedral objects with deformable smooth surfaces. Comput. Geom. 39(2): 104-117 (2008) |
| 2006 | ||
| 4 | | Michael Kaminski, Tony Tan: Regular Expressions for Languages over Infinite Alphabets. Fundam. Inform. 69(3): 301-318 (2006) |
| 2005 | ||
| 3 | | Ho-Lun Cheng, Tony Tan: Approximating Polygonal Objects by Deformable Smooth Surfaces. MFCS 2005: 248-259 |
| 2004 | ||
| 2 | | Michael Kaminski, Tony Tan: Regular Expressions for Languages over Infinite Alphabets. COCOON 2004: 171-178 |
| 1 | | Ho-Lun Cheng, Tony Tan: Subdividing Alpha Complex. FSTTCS 2004: 186-197 |
| 1 | Ho-Lun Cheng | [1] [3] [5] |
| 2 | Michael Kaminski | [2] [4] [6] |