Home Courses For Students Research Interests Professional Service
       
  (Main Research Area) Artificial Intelligence, Logic in Computer Science: Formal methods including rewriting techniques and symbolic computation with applications to automated reasoning and verification, functional & equational programming, and computer algebra ; design and analysis of algorithms/heuristics for and complexity of problems in automated deduction and rewriting ; fast and efficient implementations of rewriting methods for verification and equational programming.  
     
  Selected Publications  
 
New Undecidability Results for Properties of Term Rewriting Systems
  Presented at RULE Workshop, July 2008.
Complexity of Normal Form Properties and Reductions for Term Rewriting Systems
  To appear in Fundamenta Informaticae journal in 2008.
A Polynomial-time Algorithm for Uniqueness of Normal Forms of Linear Shallow Term Rewrite Systems
  (with J. Zinn)
Presented at IEEE LICS 2006 (short presentation), July 2006.
A New Decidability Technique for Ground Rewrite Systems with Applications
  (with A. Hayrapetyan)
ACM Transactions on Computational Logic, Volume 6, Number 1, January 2005, pages 102-123 Link to paper
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
  (with G. Godoy and A. Tiwari)
Annals of Pure and Applied Logic, Vol 130, Nos. 1-3, pages 33-59 (LICS special issue), December 2004.
Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems
  (with G. Godoy and A. Tiwari)
AAECC journal, Vol 15, No. 1, pages 13-36, June 2004.
On the Confluence of Linear Shallow Rewrite Systems
  (with G. Godoy and A. Tiwari)
Proceedings of the Symposium on Theoretical Aspects of Computer Science, Feb. 2003.
Algorithms and Reductions for Rewriting Problems, II.
  Information Processing Letters Vol. 84, No. 4, November 2002, pp. 227-233.
Algorithms and Reductions for Rewriting Problems
  (with M. Rusinowitch and D. Lugiez)
Fundamenta Informaticae, Vol. 46, No. 3, May 2001, pp. 257-276.
Preliminary version: Proceedings of the International Conference on Rewriting Techniques and Applications (RTA), Springer-Verlag LNCS 1379, 1998.
LRR: A Laboratory for Rapid Term Rewriting
  (with S.A. Senanayake)
Proceedings of the International Conference on Rewriting Techniques and Applications (RTA), Springer-Verlag LNCS, July 1999.
RPO Constraint Solving is in NP
  (with P. Narendran and M. Rusinowitch)
Proceedings of the International Conference on Computer Science Logic (CSL), Springer-Verlag LNCS, 1999.
Uniqueness of Normal Forms for Nonlinear Rewriting Systems: Root Overlaps,
  Proceedings of the International Symposium on Fundamentals of Computation Theory (FCT), Springer-Verlag LNCS 1279, 1997.
Unicity and Modularity of Confluence of Term Rewriting Systems,
  submitted for publication.
Preliminary version: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) 1995.
A Theory of Using History for Equational Systems with Applications,
  Journal of the ACM, Vol. 42, No. 5, September 1995, pp. 984-1020.
Preliminary version: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 1991.
Tight Bounds for AC Matching Problems,
  (with I.V. Ramakrishnan)
Information and Computation, Vol, 101, No. 1, pp 33-69, November 1992.
Strings, Trees and Patterns,
  Information Processing Letters, Vol. 41, pp. 157-161, March 1992.

 

 
     
  Data and Information Retrieval and Analysis: Search engines; data and text mining; storage and access methods for very large databases, including temporal/spatial/text/image databases, with applications to scientific databases, geographic and medical information systems; storage and access methods for keyword-based information retrieval.  
     
  Parallel computing: Parallel I/O, simulation of interconnection networks, parallel algorithms and implementations, applications of graph theory to parallel computing  
       
  Security and Analysis of recursive algorithms: verification of protocols, divide-and-conquer algorithms, recurrences, summations, dynamic programming algorithms.    
       
  Selected Publications    
 
Improving Results for Proving Undecidability of Checking Cryptographic Protocols.
  (with Z. Liang)
In Proc. of ARES 2008: 1067-1074, March 2008.
Secrecy Checking of Protocols: Solution of an Open Problem
  (with Z. Liang)
Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis, July 2007.
A Semantic Free-text Summarization System Using Ontology Knowledge,
  (with P. Chen and Wei Lu)
Proc. Document Understanding Conference, April 2007.
A Query-based Medical Information Summarization System Using Ontology Knowledge,
  (with P. Chen)
Proc. 19th International Symposium on Computer-Based Medical Systems, June 2006.
Efficient Declustering Techniques for keyword-based Information Retrieval,
  (with S. Behl)
Proc. 15th International Conference on Parallel and Distributed Systems, Sept. 2002.
K-tree/forest: Efficient Indexes for Boolean Queries
  (with S. Behl)
25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 2002.
Tight Bounds for Prefetching and Buffer Management of Parallel I/O Systems,
(with P. Varman)
IEEE Transactions on Parallel and Distributed Computing Vol. 10, No. 12, pp. 1262-1275, December 1999.
Preliminary Version: Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS), Springer-Verlag LNCS 1996.
An Efficient Multiversion Access Structure,
(with P. Varman)
IEEE Transactions on Knowledge and Data Engineering, Vol. 9, Number 3, May/June 1997, pp. 391-410.
On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio,
(with S. Huang, H. Liu)
Information Processing Letters, Vol. 63, 1997, pp. 123-129.
General Techniques for Analyzing Recursive Algorithms with Applications,
SIAM Journal of Computing, Vol. 26, April 1997, pp. 568-581.
A New Combinatorial Approach to Optimal Embeddings of Rectangles,
(with S. Huang, H. Liu)
Algorithmica, Vol. 16, July 1996, pp. 161-180.
Preliminary version: Proceedings of the IEEE International Parallel Processing Symposium (IPPS) 1994.
A general method and a master theorem for divide-and-conquer recurrences with applications,
Journal of Algorithms, Vol. 16, No. 1, January 1994, pp. 67-79.