The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

K. G. Ramakrishnan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rainer Gawlick, Charles R. Kalmanek, K. G. Ramakrishnan
    On-Line Routing for Permanent Virtural Circuits. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1995, pp:278-288 [Conf]
  2. Ashish Goel, K. G. Ramakrishnan, Deepak Kataria, Dimitris Logothetis
    Efficient Computation of Delay-sensitive Routes from One Source to All Destinations. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:854-858 [Conf]
  3. Gang Liu, K. G. Ramakrishnan
    A*prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:743-749 [Conf]
  4. Debasis Mitra, John A. Morrison, K. G. Ramakrishnan
    ATM Network Design and Optimization: A Multirate Loss Network Framework. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1996, pp:994-1003 [Conf]
  5. Debasis Mitra, John A. Morrison, K. G. Ramakrishnan
    Virtual Private Networks: Joint Resource Allocation and Routing Design. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:480-490 [Conf]
  6. Aravind Srinivasan, K. G. Ramakrishnan, Krishnan Kumaran, Murali Aravamudan, Shamim A. Naqvi
    Optimal Design of Signaling Networks for Internet Telephony. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:707-716 [Conf]
  7. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
    Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:333-349 [Conf]
  8. K. G. Ramakrishnan, Manoel A. Rodrigues
    Optimal routing in shortest-path data networks. [Citation Graph (0, 0)][DBLP]
    Bell Labs Technical Journal, 2001, v:6, n:1, pp:117-138 [Journal]
  9. Rainer Gawlick, Charles R. Kalmanek, K. G. Ramakrishnan
    On-line routing for permanent virtual circuits. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 1996, v:19, n:3, pp:235-244 [Journal]
  10. K. G. Ramakrishnan
    Solving Two-Commodity Transportation Problems with Coupling Constraints. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:736-757 [Journal]
  11. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
    A continuous approach to inductive inference. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:215-238 [Journal]
  12. Narendra Karmarkar, K. G. Ramakrishnan
    Computational results of an interior point algorithm for large scale linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:555-586 [Journal]
  13. Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan
    An interior point algorithm to solve computationally difficult set covering problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:597-618 [Journal]
  14. Debasis Mitra, John A. Morrison, K. G. Ramakrishnan
    Optimization and Design of Network Routing Using Refined Asymptotic Approximations. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1999, v:36, n:1-4, pp:267-288 [Journal]
  15. Debasis Mitra, Isi Mitrani, K. G. Ramakrishnan, Judith B. Seery, Alan Weiss
    A Unified Set of Proposals for Control and Design of High Speed Data Networks. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 1991, v:9, n:1-2, pp:215-234 [Journal]
  16. Debasis Mitra, John A. Morrison, K. G. Ramakrishnan
    ATM network design and optimization: a multirate loss network framework. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1996, v:4, n:4, pp:531-543 [Journal]

Search in 0.002secs, Finished in 0.002secs
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