Prakash V. Ramanan

15 papers A* 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
1994 J jnl
A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation Problem.
SIAM J. Comput.
Prakash V. Ramanan
1992 J jnl
Testing the Optimality of Alphabetic Trees.
Theor. Comput. Sci.
Prakash V. Ramanan
1991 A* conf
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem.
SODA
Prakash V. Ramanan
1989 J jnl
Average-Case Analysis of the Modified Harmonic Algorithm.
Algorithmica
Prakash V. Ramanan, Kazuhiro Tsuga
1989 J jnl
Average-Case Analysis of the Smart Next Fit Algorithm.
Inf. Process. Lett.
Prakash V. Ramanan
1989 J jnl
Lower Bounds for Maximal and Convex Layers Problems.
Algorithmica
Sanjiv Kapoor, Prakash V. Ramanan
1989 J jnl
On-Line Bin Packing in Linear Time.
J. Algorithms
Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee
1987 J jnl
Obtaining Lower Bounds Using Artificial Components.
Inf. Process. Lett.
Prakash V. Ramanan
1986 — conf
Average-Case Analysis of the Modified Marmonic Algorithm.
FSTTCS
Prakash V. Ramanan, Kazuhiro Tsuga
1985 J jnl
Permutation Representation of k-Ary Trees.
Theor. Comput. Sci.
Prakash V. Ramanan, C. L. Liu
1984 J jnl
A Personnel Assignment Problem.
J. Algorithms
Prakash V. Ramanan, Jitender S. Deogun, C. L. Liu
1984 J jnl
New Algorithms for Selection.
J. Algorithms
Prakash V. Ramanan, Laurent Hyafil
1984 J jnl
Pushdown Permuter Characterization Theorem.
SIAM J. Comput.
Prakash V. Ramanan
1984 — —
Topics in Combinatorial Algorithms
Prakash V. Ramanan
1983 J jnl
A Counterexample to Shyamasundar's Characterization of Pushdown Permuters.
Theor. Comput. Sci.
Prakash V. Ramanan