Prakash V. Ramanan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

1994

A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation ProblemPrakash V. Ramanan. SICOMP, 23(4):834-851, 1994.

1992

Testing the Optimality of Alphabetic TreesPrakash V. Ramanan. TCS, 93(2):279-301, 1992.

1991

A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation ProblemPrakash V. Ramanan. soda 1991: 281-290

1989

Lower Bounds for Maximal and Convex Layers ProblemsSanjiv Kapoor, Prakash V. Ramanan. algorithmica, 4(4):447-459, 1989.

Average-Case Analysis of the Smart Next Fit AlgorithmPrakash V. Ramanan. ipl, 31(5):221-225, 1989.

Average-Case Analysis of the Modified Harmonic AlgorithmPrakash V. Ramanan, Kazuhiro Tsuga. algorithmica, 4(4):519-533, 1989.

On-Line Bin Packing in Linear TimePrakash V. Ramanan, Donna J. Brown, C. C. Lee, D. T. Lee. jal, 10(3):305-326, 1989.

1987

Obtaining Lower Bounds Using Artificial ComponentsPrakash V. Ramanan. ipl, 24(4):243-246, 1987.

1986

Average-Case Analysis of the Modified Marmonic AlgorithmPrakash V. Ramanan, Kazuhiro Tsuga. fsttcs 1986: 177-192

1985

Permutation Representation of k-Ary TreesPrakash V. Ramanan, C. L. Liu. TCS, 38:83-98, 1985.

1984

New Algorithms for SelectionPrakash V. Ramanan, Laurent Hyafil. jal, 5(4):557-578, 1984.

Pushdown Permuter Characterization TheoremPrakash V. Ramanan. SICOMP, 13(1):167-169, 1984.

Topics in Combinatorial AlgorithmsPrakash V. Ramanan. PhD thesis, University of Illinois Urbana-Champaign, USA, 1984. [doi]

A Personnel Assignment ProblemPrakash V. Ramanan, Jitender S. Deogun, C. L. Liu. jal, 5(1):132-144, 1984.

1983

A Counterexample to Shyamasundar s Characterization of Pushdown PermutersPrakash V. Ramanan. TCS, 23:103-105, 1983.

Sign in or sign up to see more results.

runs on WebDSL