Prakash Ramanan

According to our database, Prakash Ramanan authored at least 16 papers between 1990 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

Six Pass MapReduce Implementation of Strassen's Algorithm for Matrix Multiplication.

Prakash Ramanan

Proceedings of the 5th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2018

2017

MapReduce Implementation of Strassen's Algorithm for Matrix Multiplication.

Minhao Deng, Prakash Ramanan

Proceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2017

2016

Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplication.

Prakash Ramanan, Ashita Nagar

Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2016

2012

Rewriting XPath queries using materialized XPath views.

Prakash Ramanan

J. Comput. Syst. Sci., 2012

2011

Memory lower bounds for XPath evaluation over XML streams.

Prakash Ramanan

J. Comput. Syst. Sci., 2011

2009

Worst-case optimal algorithm for XPath evaluation over XML streams.

Prakash Ramanan

J. Comput. Syst. Sci., 2009

2008

Efficient provenance storage.

Adriane Chapman, H. V. Jagadish, Prakash Ramanan

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

2007

Holistic Join for Generalized Tree Patterns.

Prakash Ramanan

Inf. Syst., 2007

2005

Evaluating an XPath Query on a Streaming XML Document.

Prakash Ramanan

Proceedings of the Advances in Data Management 2005, 2005

2003

Covering Indexes for XML Queries: Bisimulation - Simulation = Negation.

Prakash Ramanan

Proceedings of 29th International Conference on Very Large Data Bases, 2003

2002

Efficient algorithms for minimizing tree pattern queries.

Prakash Ramanan

Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002

2001

Conditions for lossless join.

Prakash Ramanan

Int. J. Comput. Math., 2001

1997

Tight Ω(<i>n</i> lg <i>n</i>) lower bound for finding a longest increasing subsequence.

Prakash Ramanan

Int. J. Comput. Math., 1997

1995

On lower bounds for constructing heaps.

Prakash Ramanan, Tsz Pang Ngan

Int. J. Comput. Math., 1995

1991

Euclidean shortest path in the presence of obstacles.

Yong-Mao Chen, Prakash Ramanan

Networks, 1991

1990

An efficient algorithm for a special case of the set partition problem.

Alan Jackson, Prakash Ramanan

Int. J. Comput. Math., 1990