Prakash V. Ramanan

According to our database, Prakash V. Ramanan authored at least 14 papers between 1983 and 1994.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1994

A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation Problem.

Prakash V. Ramanan

SIAM J. Comput., 1994

1992

Testing the Optimality of Alphabetic Trees.

Prakash V. Ramanan

Theor. Comput. Sci., 1992

1989

On-Line Bin Packing in Linear Time.

Prakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee

J. Algorithms, 1989

Average-Case Analysis of the Smart Next Fit Algorithm.

Prakash V. Ramanan

Inf. Process. Lett., 1989

Average-Case Analysis of the Modified Harmonic Algorithm.

Prakash V. Ramanan, Kazuhiro Tsuga

Algorithmica, 1989

Lower Bounds for Maximal and Convex Layers Problems.

Sanjiv Kapoor, Prakash V. Ramanan

Algorithmica, 1989

1987

Obtaining Lower Bounds Using Artificial Components.

Prakash V. Ramanan

Inf. Process. Lett., 1987

1986

Average-Case Analysis of the Modified Marmonic Algorithm.

Prakash V. Ramanan, Kazuhiro Tsuga

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

1985

Permutation Representation of k-Ary Trees.

Prakash V. Ramanan, C. L. Liu

Theor. Comput. Sci., 1985

1984

Topics in Combinatorial Algorithms

Prakash V. Ramanan

PhD thesis, 1984

Pushdown Permuter Characterization Theorem.

Prakash V. Ramanan

SIAM J. Comput., 1984

New Algorithms for Selection.

Prakash V. Ramanan, Laurent Hyafil

J. Algorithms, 1984

A Personnel Assignment Problem.

Prakash V. Ramanan, Jitender S. Deogun, C. L. Liu

J. Algorithms, 1984

1983

A Counterexample to Shyamasundar's Characterization of Pushdown Permuters.

Prakash V. Ramanan

Theor. Comput. Sci., 1983