Prakash V. Ramanan

Available identifiers

Publication	Date of Publication	Type
Rewriting XPath queries using materialized XPath views	2012-08-17	Paper
Memory lower bounds for XPath evaluation over XML streams	2012-01-11	Paper
Worst-case optimal algorithm for XPath evaluation over XML streams	2009-11-10	Paper
Conditions for lossless join	2002-08-14	Paper
Tight Ω(nlgn) lower bound for finding a longest increasing subsequence	1998-06-23	Paper
An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem	1997-03-03	Paper
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem	1994-09-13	Paper
https://portal.mardi4nfdi.de/entity/Q3138963	1993-10-20	Paper
Testing the optimality of alphabetic trees	1992-06-28	Paper
Euclidean shortest path in the presence of obstacles	1992-06-25	Paper
An efficient algorithm for a special case of the set partition problem	1990-01-01	Paper
Average-case analysis of the modified harmonic algorithm	1989-01-01	Paper
Average-case analysis of the smart next fit algorithm	1989-01-01	Paper
Lower bounds for maximal and convex layers problems	1989-01-01	Paper
Obtaining lower bounds using artificial components	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3026343	1986-01-01	Paper
Pushdown Permuter Characterization Theorem	1984-01-01	Paper
New algorithms for selection	1984-01-01	Paper
A counterexample to Shyamasundar's characterization of pushdown permuters	1983-01-01	Paper

This page was built for person: Prakash V. Ramanan