Narendra Karmarkar

Publication Activity (10 Years)

Years Active: 1982-2014
Publications (10 Years): 0

Top Topics

Computational Model

Top Venues

Publications

Narendra Karmarkar
Towards a Broader View of Theory of Computing. CoRR (2014)
Narendra Karmarkar
Beyond Convexity: New Perspectives in Computational Optimization. SEAL (2010)
Partha Niyogi, Narendra Karmarkar
An Approach to Data Reduction and Clustering with Theoretical Guarantees. ICML (2000)
Narendra Karmarkar, Yagati N. Lakshman
On Approximate GCDs of Univariate Polynomials. J. Symb. Comput. 26 (6) (1998)
Narendra Karmarkar, Yagati N. Lakshman
Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. ISSAC (1996)
Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. 22 (2) (1993)
Anil P. Kamath, Narendra Karmarkar
A continuous method for computing bounds in integer quadratic optimization problems. J. Glob. Optim. 2 (3) (1992)
Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
A continuous approach to inductive inference. Math. Program. 57 (1992)
Narendra Karmarkar, S. A. Thakur
An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems. IPCO (1992)
Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan
An interior point algorithm to solve computationally difficult set covering problems. Math. Program. 52 (1991)
K. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath
An Approximate Dual Projective Algorithm for Solving Assignment Problems. Network Flows And Matching (1991)
Narendra Karmarkar
A new parallel architecture for sparse matrix computation based on finite projective geometries. SC (1991)
Narendra Karmarkar, K. G. Ramakrishnan
Computational results of an interior point algorithm for large scale linear programming. Math. Program. 52 (1991)
Narendra Karmarkar
An Interior-Point Approach to NP-Complete Problems. IPCO (1990)
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)
Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar
An implementation of Karmarkar's algorithm for linear programming. Math. Program. 44 (1-3) (1989)
Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. INFORMS J. Comput. 1 (2) (1989)
Narendra Karmarkar
A New Polynomial-Time Algorithm for Linear Programming STOC (1984)
Narendra Karmarkar
A new polynomial-time algorithm for linear programming. Comb. 4 (4) (1984)
Narendra Karmarkar, Richard M. Karp
An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem FOCS (1982)
Narendra Karmarkar
Probabilistic Analysis of Some Bin-Packing Problems FOCS (1982)