The following pages link to Prakash V. Ramanan (Q1171385):
Displaying 20 items.
- (Q439965) (redirect page) (← links)
- Rewriting XPath queries using materialized XPath views (Q439966) (← links)
- Memory lower bounds for XPath evaluation over XML streams (Q657920) (← links)
- Worst-case optimal algorithm for XPath evaluation over XML streams (Q1034104) (← links)
- Obtaining lower bounds using artificial components (Q1107991) (← links)
- Average-case analysis of the smart next fit algorithm (Q1120280) (← links)
- A counterexample to Shyamasundar's characterization of pushdown permuters (Q1171386) (← links)
- Testing the optimality of alphabetic trees (Q1186607) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- Average-case analysis of the modified harmonic algorithm (Q1825655) (← links)
- Conditions for lossless join (Q2776788) (← links)
- (Q3026343) (← links)
- (Q3138963) (← links)
- New algorithms for selection (Q3219780) (← links)
- An efficient algorithm for a special case of the set partition problem (Q3477962) (← links)
- Pushdown Permuter Characterization Theorem (Q3681935) (← links)
- Euclidean shortest path in the presence of obstacles (Q3971576) (← links)
- A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem (Q4305360) (← links)
- Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence (Q4375395) (← links)
- An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem (Q4895834) (← links)
