Tony Tan

Tony Tan

Contact information
Email:
tantony[at]cs.technion.ac.il
Office:
411
Phone:
5534
Advisor
Selected publications
  • Tony Tan.
    On Pebble Automata for Data Languages with Decidable Emptiness Problem.
    In To appear in Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2009, LNCS, Springer-Verlag, 2009 [bibtex] [pdf]
  • Tony Tan.
    Graph Reachability and Pebble Automata over Infinite Alphabets.
    In To appear in Proceedings of the 24th IEEE Symposium on Logic in Computer Science (LICS) 2009, IEEE Computer Society, 2009 [bibtex] [pdf]
  • Michael~Kaminski and Tony~Tan.
    A Note on Two-Pebble Automata over Infinite Alphabets.
    To appear in Fundamenta Informaticae, XX(X):XXX--XXX, 20XX [bibtex] [pdf]
  • Tony Tan.
    Determinizing Two-way Alternating Pebble Automata for Data Languages.
    No. CS-2009-05, Department of Computer Science, Technion -- Israel Institute of Technology, 2009 [bibtex] [pdf]
  • Michael Kaminski and Tony Tan.
    Tree Automata over Infinite Alphabets.
    In Pillars of Computer Science, 386-423, LNCS 4800, Springer-Verlag, 2008 [bibtex] [pdf]
  • Ho-Lun Cheng and Tony Tan.
    Approximating polyhedral objects with deformable smooth surfaces.
    Computational Geometry: Theory and Applications, 39(2):104-117, 2008 [bibtex] [pdf]
  • Michael Kaminski and Tony Tan.
    Regular Expressions for Languages over Infinite Alphabets.
    Fundamenta Informaticae, 69(3):301-318, 2006 [bibtex] [pdf]
  • Ho-Lun Cheng and Tony Tan.
    Approximating Polygonal Objects by Deformable Smooth Surfaces.
    In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2005, 248-259, LNCS 3618, Springer-Verlag, 2005 [bibtex] [pdf]
  • Ho-Lun Cheng and Tony Tan.
    Subdividing Alpha Complex.
    In Proceedings of the 24th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2004, 186-197, LNCS 3328, Springer-Verlag, 2004 [bibtex] [pdf]
  • Michael Kaminski and Tony Tan.
    Regular Expressions for Languages over Infinite Alphabets.
    In Proceedings of the 10th International Conference on Computing and Combinatorics (COCOON) 2004, 171-178, LNCS 3106, Springer-Verlag, 2004 [bibtex] [pdf]