The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tony Tan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Kaminski, Tony Tan
    Regular Expressions for Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:171-178 [Conf]
  2. Ho-Lun Cheng, Tony Tan
    Subdividing Alpha Complex. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:186-197 [Conf]
  3. Ho-Lun Cheng, Tony Tan
    Approximating Polygonal Objects by Deformable Smooth Surfaces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:248-259 [Conf]
  4. Michael Kaminski, Tony Tan
    Regular Expressions for Languages over Infinite Alphabets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:69, n:3, pp:301-318 [Journal]

  5. Tree Automata over Infinite Alphabets. [Citation Graph (, )][DBLP]


  6. Graph Reachability and Pebble Automata over Infinite Alphabets. [Citation Graph (, )][DBLP]


  7. On Pebble Automata for Data Languages with Decidable Emptiness Problem. [Citation Graph (, )][DBLP]


  8. Approximating polyhedral objects with deformable smooth surfaces. [Citation Graph (, )][DBLP]


Search in 0.070secs, Finished in 0.070secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002