Narendra Karmarkar

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