Prakash V. Ramanan

Publication Activity (10 Years)

Years Active: 1983-1994
Publications (10 Years): 0

Publications

Prakash V. Ramanan
A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation Problem. SIAM J. Comput. 23 (4) (1994)
Prakash V. Ramanan
Testing the Optimality of Alphabetic Trees. Theor. Comput. Sci. 93 (2) (1992)
Prakash V. Ramanan
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem. SODA (1991)
Sanjiv Kapoor, Prakash V. Ramanan
Lower Bounds for Maximal and Convex Layers Problems. Algorithmica 4 (4) (1989)
Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee
On-Line Bin Packing in Linear Time. J. Algorithms 10 (3) (1989)
Prakash V. Ramanan, Kazuhiro Tsuga
Average-Case Analysis of the Modified Harmonic Algorithm. Algorithmica 4 (4) (1989)
Prakash V. Ramanan
Average-Case Analysis of the Smart Next Fit Algorithm. Inf. Process. Lett. 31 (5) (1989)
Prakash V. Ramanan
Obtaining Lower Bounds Using Artificial Components. Inf. Process. Lett. 24 (4) (1987)
Prakash V. Ramanan, Kazuhiro Tsuga
Average-Case Analysis of the Modified Marmonic Algorithm. FSTTCS (1986)
Prakash V. Ramanan, C. L. Liu
Permutation Representation of k-Ary Trees. Theor. Comput. Sci. 38 (1985)
Prakash V. Ramanan
Pushdown Permuter Characterization Theorem. SIAM J. Comput. 13 (1) (1984)
Prakash V. Ramanan, Jitender S. Deogun, C. L. Liu
A Personnel Assignment Problem. J. Algorithms 5 (1) (1984)
Prakash V. Ramanan, Laurent Hyafil
New Algorithms for Selection. J. Algorithms 5 (4) (1984)
Prakash V. Ramanan
A Counterexample to Shyamasundar's Characterization of Pushdown Permuters. Theor. Comput. Sci. 23 (1983)