Prakash Ramanan



Professor
EECS Department
Wichita State University
Wichita, Kansas 67260-0083
USA


Office: 208 Jabara Hall
E-Mail: firstName.lastName@wichita.edu
Phone: (316) 978-3920
Fax: (316) 978-3984


Education


Research Interests

  1. Database Systems
  2. Data Integration
  3. XML
  4. Algorithms

Recent Publications

  1. P. Ramanan. A New Lower Bound Technique and its Application:
    Tight Lower Bound for a Polygon Triangulation Problem,
    SIAM J. Comput. 23 (1994), pp. 834-851.
  2. P. Ramanan. An Efficient Parallel Algorithm for the Matrix Chain Product Problem,
    SIAM J. Comput. 25 (1996), pp. 874-893.
  3. P. Ramanan. Conditions for Lossless Join ,
    Internat. J. Computer Math. 78 (2001), pp. 489-498.
  4. P. Ramanan. Efficient Algorithms for Minimizing Tree Pattern Queries ,
    ACM SIGMOD Intl. Conf. Management of Data, 2002, pp. 299-309.
  5. P. Ramanan. Covering Indexes for XML Queries: Bisimulation - Simulation = Negation ,
    Intl. Conf. Very Large Databases (VLDB), 2003, pp. 165-176.
  6. P. Ramanan. Evaluating an XPath Query on a Streaming XML Document ,
    Intl. Conf. Management of Data (COMAD), 2005, pp. 41--52.
  7. P. Ramanan. Holistic Join for Generalized Tree Patterns ,
    Information Systems 32 (2007), pp. 1018--1036.
  8. A. Chapman, H. V. Jagadish and P. Ramanan. Efficient Provenance Storage ,
    ACM SIGMOD Intl. Conf. Management of Data, 2008, pp. 993-1006.
  9. P. Ramanan. Worst-Case Optimal Algorithm for XPath Evaluation Over XML Streams ,
    J. Computer and Systems Sciences 75 (2009), pp. 465--485.
  10. P. Ramanan. Memory Lower Bounds for XPath Evaluation over XML Streams ,
    J. Computer and Systems Sciences 77 (2011), pp. 1120--1140.
  11. P. Ramanan. Rewriting XPath Queries Using Materialized XPath Views ,
    J. Computer and Systems Sciences 78 (2012), pp. 1006--1025.
  12. P. Ramanan and R. J. Papri. Best-effort Query Answering Using Sources with Binding Patterns,
    submitted.