Prakash Ramanan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2018

Six Pass MapReduce Implementation of Strassen's Algorithm for Matrix MultiplicationPrakash Ramanan. SIGMOD 2018: [doi]

2017

MapReduce Implementation of Strassen's Algorithm for Matrix MultiplicationMinhao Deng, Prakash Ramanan. SIGMOD 2017: [doi]

2016

Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplicationPrakash Ramanan, Ashita Nagar. SIGMOD 2016: 9 [doi]

2012

Rewriting XPath queries using materialized XPath viewsPrakash Ramanan. jcss, 78(4):1006-1025, 2012. [doi]

2011

Memory lower bounds for XPath evaluation over XML streamsPrakash Ramanan. jcss, 77(6):1120-1140, 2011. [doi]

2009

Worst-case optimal algorithm for XPath evaluation over XML streamsPrakash Ramanan. jcss, 75(8):465-485, 2009. [doi]

2008

Efficient provenance storageAdriane Chapman, H. V. Jagadish, Prakash Ramanan. SIGMOD 2008: 993-1006 [doi]

2007

Holistic Join for Generalized Tree PatternsPrakash Ramanan. is, 32(7):1018-1036, 2007. [doi]

2005

Evaluating an XPath Query on a Streaming XML DocumentPrakash Ramanan. comad 2005: [doi]

2003

Covering Indexes for XML Queries: Bisimulation - Simulation = NegationPrakash Ramanan. VLDB 2003: 165-176 [doi]

2002

Efficient algorithms for minimizing tree pattern queriesPrakash Ramanan. SIGMOD 2002: 299-309 [doi]

2001

Conditions for lossless joinPrakash Ramanan. ijcm, 78(4):489-498, 2001. [doi]

1997

n) lower bound for finding a longest increasing subsequencePrakash Ramanan. ijcm, 65(3-4):161-164, 1997. [doi]

1995

On lower bounds for constructing heapsPrakash Ramanan, Tsz Pang Ngan. ijcm, 56(3-4):145-150, 1995. [doi]

1991

Euclidean shortest path in the presence of obstaclesYong-Mao Chen, Prakash Ramanan. networks, 21(3):257-265, 1991. [doi]

1990

An efficient algorithm for a special case of the set partition problemAlan Jackson, Prakash Ramanan. ijcm, 34(1-2):1-8, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL