default search action
K. G. Ramakrishnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
- [j21]Eric Bouillet, Debasis Mitra, K. G. Ramakrishnan:
The structure and management of service level agreements in networks. IEEE J. Sel. Areas Commun. 20(4): 691-699 (2002) - [j20]John A. Morrison, K. G. Ramakrishnan:
Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource. SIAM J. Appl. Math. 63(1): 222-240 (2002) - 2001
- [j19]K. G. Ramakrishnan, Manoel A. Rodrigues:
Optimal routing in shortest-path data networks. Bell Labs Tech. J. 6(1): 117-138 (2001) - [c9]Krishnan Kumaran, Aravind Srinivasan, Qiong Wang, Steven Lanning, K. G. Ramakrishnan:
Efficient algorithms for location and sizing problems in network design. GLOBECOM 2001: 2586-2590 - [c8]Gang Liu, K. G. Ramakrishnan:
A*prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints. INFOCOM 2001: 743-749 - [c7]Ashish Goel, K. G. Ramakrishnan, Deepak Kataria, Dimitris Logothetis:
Efficient Computation of Delay-sensitive Routes from One Source to All Destinations. INFOCOM 2001: 854-858 - 2000
- [c6]Aravind Srinivasan, K. G. Ramakrishnan, Krishnan Kumaran, Murali Aravamudan, Shamim A. Naqvi:
Optimal Design of Signaling Networks for Internet Telephony. INFOCOM 2000: 707-716
1990 – 1999
- 1999
- [j18]Debasis Mitra, John A. Morrison, K. G. Ramakrishnan:
Optimization and Design of Network Routing Using Refined Asymptotic Approximations. Perform. Evaluation 36-37(1-4): 267-288 (1999) - [c5]Debasis Mitra, John A. Morrison, K. G. Ramakrishnan:
Virtual Private Networks: Joint Resource Allocation and Routing Design. INFOCOM 1999: 480-490 - 1998
- [j17]Matthew Andrews, Simon C. Borst, Francis Dominique, Predrag R. Jelenkovic, Krishnan Kumaran, K. G. Ramakrishnan, Philip A. Whiting:
Dynamic bandwidth allocation algorithms for high-speed data wireless networks. Bell Labs Tech. J. 3(3): 30-49 (1998) - [j16]Debasis Mitra, John A. Morrison, K. G. Ramakrishnan:
VPN DESIGNER: A tool for design of multiservice virtual private networks. Bell Labs Tech. J. 3(4): 15-31 (1998) - [j15]Debasis Mitra, John A. Morrison, K. G. Ramakrishnan:
Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources. SIAM J. Appl. Math. 59(2): 494-513 (1998) - 1997
- [j14]Anwar Elwalid, Glen G. Freundlich, Paul M. Gerhardt, Hassan Hagirahim, K. G. Ramakrishnan, David Tse:
An overview of the multimedia communications exchange (MMCX) and its performance characterization. Bell Labs Tech. J. 2(2): 15-35 (1997) - [j13]Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende, Yong Li:
Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem. SIAM J. Optim. 7(1): 280-294 (1997) - 1996
- [j12]Rainer Gawlick, Charles R. Kalmanek, K. G. Ramakrishnan:
On-line routing for permanent virtual circuits. Comput. Commun. 19(3): 235-244 (1996) - [j11]Debasis Mitra, John A. Morrison, K. G. Ramakrishnan:
ATM network design and optimization: a multirate loss network framework. IEEE/ACM Trans. Netw. 4(4): 531-543 (1996) - [c4]Debasis Mitra, John A. Morrison, K. G. Ramakrishnan:
ATM Network Design and Optimization: A Multirate Loss Network Framework. INFOCOM 1996: 994-1003 - 1995
- [j10]Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner:
Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming. Oper. Res. 43(5): 781-791 (1995) - [j9]Peter Linhart, Roy Radner, K. G. Ramakrishnan, Richard Steinberg
:
The allocation of value for jointly provided services. Telecommun. Syst. 4(1): 151-175 (1995) - [c3]Rainer Gawlick, Charles R. Kalmanek, K. G. Ramakrishnan:
On-Line Routing for Permanent Virtural Circuits. INFOCOM 1995: 278-288 - [e1]Panos M. Pardalos, Mauricio G. C. Resende, K. G. Ramakrishnan:
Workshop on Parallel Processing of Discrete Optimization Problems, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 28-29, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 22, DIMACS/AMS 1995, ISBN 978-0-8218-0240-3 [contents] - 1994
- [j8]Yong Li, Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende:
Lower bounds for the quadratic assignment problem. Ann. Oper. Res. 50(1): 387-410 (1994) - 1993
- [j7]Panos M. Pardalos, K. G. Ramakrishnan:
On the expected optimal value of random assignment problems: Experimental results and open questions. Comput. Optim. Appl. 2(3): 261-271 (1993) - 1992
- [j6]Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende:
A continuous approach to inductive inference. Math. Program. 57: 215-238 (1992) - 1991
- [j5]Narendra Karmarkar, K. G. Ramakrishnan:
Computational results of an interior point algorithm for large scale linear programming. Math. Program. 52: 555-586 (1991) - [j4]Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan:
An interior point algorithm to solve computationally difficult set covering problems. Math. Program. 52: 597-618 (1991) - [j3]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. Queueing Syst. Theory Appl. 9(1-2): 215-234 (1991) - [c2]K. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath:
An Approximate Dual Projective Algorithm for Solving Assignment Problems. Network Flows And Matching 1991: 431-451 - 1990
- [c1]Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende:
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. IPCO 1990: 333-349
1980 – 1989
- 1980
- [j2]K. G. Ramakrishnan:
Solving Two-Commodity Transportation Problems with Coupling Constraints. J. ACM 27(4): 736-757 (1980)
1970 – 1979
- 1976
- [j1]Janusz S. Kowalik, K. G. Ramakrishnan:
A numerically stable optimization method based on A homogeneous function. Math. Program. 11(1): 50-66 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: