K. G. Ramakrishnan

Author Info

Name	Affiliation	Papers
K. G. RAMAKRISHNAN	Princeton Univ, ORFE Dept, Princeton, NJ 08544 USA	29
Collaborators	Citations	PageRank
45	587	98.53
Referers	Referees	References
1114	279	203

Search Limit

1001000

Publications (29 rows)

Collaborators (45 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Scheduling Algorithms for Downlink Services in Wireless Networks: A Markov Decision Process Approach	2	0.34	2004
The structure and management of service level agreements in networks	55	3.34	2002
Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource	1	0.37	2002
A*Prune: an algorithm for finding K shortest paths subject to multiple constraints	88	4.56	2001
Efficient algorithms for location and sizing problems in network design	1	0.35	2001
Optimal routing in shortest-path data networks	24	3.94	2001
Efficient Computation Of Delay-Sensitive Routes From One Source To All Destinations	50	3.05	2001
Optimal design of signaling networks for Internet telephony	4	0.42	2000
Virtual private networks: joint resource allocation and routing design	25	3.40	1999
Optimization and design of network routing using refined asymptotic approximations	9	0.56	1999
VPN DESIGNER: A tool for design of multiservice virtual private networks	16	1.80	1998
Dynamic bandwidth allocation algorithms for high-speed data wireless networks	10	5.19	1998
Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources.	0	0.34	1998
An overview of the multimedia communications exchange (MMCX) and its performance characterization	1	0.35	1997
Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem	15	1.47	1997
ATM network design and optimization: a multirate loss network framework	65	7.94	1996
On-line routing for permanent virtual circuits	13	5.49	1996
The allocation of value for jointly provided services.	0	0.34	1995
Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming	34	5.14	1995
Lower bounds for the quadratic assignment problem	21	3.34	1994
On the expected optimal value of random assignment problems: experimental results and open questions	6	0.91	1993
A continuous approach to inductive inference	46	16.37	1992
Computational results of an interior point algorithm for large scale linear programming	21	4.49	1991
An Approximate Dual Projective Algorithm for Solving Assignment Problems.	6	1.10	1991
An interior point algorithm to solve computationally difficult set covering problems	32	7.32	1991
A unified set of proposals for control and design of high speed data networks	6	4.99	1991
Computational experience with an interior point algorithm on the satisfiability problem	31	10.12	1990
Solving Two-Commodity Transportation Problems with Coupling Constraints	1	0.37	1980
A numerically stable optimization method based on A homogeneous function	4	1.12	1976