The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Prakash V. Ramanan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002