 | 1994 |
|---|
| 14 |       | Prakash V. Ramanan:
A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation Problem.
SIAM J. Comput. 23(4): 834-851 (1994) |
| 1992 |
|---|
| 13 | | Prakash V. Ramanan:
Testing the Optimality of Alphabetic Trees.
Theor. Comput. Sci. 93(2): 279-301 (1992) |
| 1991 |
|---|
| 12 | | Prakash V. Ramanan:
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem.
SODA 1991: 281-290 |
| 1989 |
|---|
| 11 | | Sanjiv Kapoor,
Prakash V. Ramanan:
Lower Bounds for Maximal and Convex Layers Problems.
Algorithmica 4(4): 447-459 (1989) |
| 10 | | Prakash V. Ramanan,
Kazuhiro Tsuga:
Average-Case Analysis of the Modified Harmonic Algorithm.
Algorithmica 4(4): 519-533 (1989) |
| 9 | | Prakash V. Ramanan:
Average-Case Analysis of the Smart Next Fit Algorithm.
Inf. Process. Lett. 31(5): 221-225 (1989) |
| 8 | | Prakash V. Ramanan,
Donna J. Brown,
C. C. Lee,
D. T. Lee:
On-Line Bin Packing in Linear Time.
J. Algorithms 10(3): 305-326 (1989) |
| 1987 |
|---|
| 7 | | Prakash V. Ramanan:
Obtaining Lower Bounds Using Artificial Components.
Inf. Process. Lett. 24(4): 243-246 (1987) |
| 1986 |
|---|
| 6 |  | Prakash V. Ramanan,
Kazuhiro Tsuga:
Average-Case Analysis of the Modified Marmonic Algorithm.
FSTTCS 1986: 177-192 |
| 1985 |
|---|
| 5 | | Prakash V. Ramanan,
C. L. Liu:
Permutation Representation of k-Ary Trees.
Theor. Comput. Sci. 38: 83-98 (1985) |
| 1984 |
|---|
| 4 | | Prakash V. Ramanan,
Jitender S. Deogun,
C. L. Liu:
A Personnel Assignment Problem.
J. Algorithms 5(1): 132-144 (1984) |
| 3 | | Prakash V. Ramanan,
Laurent Hyafil:
New Algorithms for Selection.
J. Algorithms 5(4): 557-578 (1984) |
| 2 | | Prakash V. Ramanan:
Pushdown Permuter Characterization Theorem.
SIAM J. Comput. 13(1): 167-169 (1984) |
| 1983 |
|---|
| 1 | | Prakash V. Ramanan:
A Counterexample to Shyamasundar's Characterization of Pushdown Permuters.
Theor. Comput. Sci. 23: 103-105 (1983) |
