Narendra Karmarkar

According to our database, Narendra Karmarkar authored at least 20 papers between 1982 and 2014.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of two.

2014

Towards a Broader View of Theory of Computing.

Narendra Karmarkar

CoRR, 2014

2010

Beyond Convexity: New Perspectives in Computational Optimization.

Narendra Karmarkar

Proceedings of the Simulated Evolution and Learning - 8th International Conference, 2010

2000

An Approach to Data Reduction and Clustering with Theoretical Guarantees.

Partha Niyogi, Narendra Karmarkar

Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29, 2000

1998

On Approximate GCDs of Univariate Polynomials.

Narendra Karmarkar, Yagati N. Lakshman

J. Symb. Comput., 1998

1996

Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials.

Narendra Karmarkar, Yagati N. Lakshman

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1993

A Monte-Carlo Algorithm for Estimating the Permanent.

Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby

SIAM J. Comput., 1993

1992

A continuous approach to inductive inference.

Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende

Math. Program., 1992

A continuous method for computing bounds in integer quadratic optimization problems.

Anil P. Kamath, Narendra Karmarkar

J. Glob. Optim., 1992

An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems.

Narendra Karmarkar, S. A. Thakur

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

An interior point algorithm to solve computationally difficult set covering problems.

Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan

Math. Program., 1991

Computational results of an interior point algorithm for large scale linear programming.

Narendra Karmarkar, K. G. Ramakrishnan

Math. Program., 1991

A new parallel architecture for sparse matrix computation based on finite projective geometries.

Narendra Karmarkar

Proceedings of the Proceedings Supercomputing '91, 1991

An Approximate Dual Projective Algorithm for Solving Assignment Problems.

K. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath

Proceedings of the Network Flows And Matching, 1991

1990

An Interior-Point Approach to NP-Complete Problems.

Narendra Karmarkar

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

Computational Experience with an Interior Point Algorithm on the Satisfiability Problem.

Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

An implementation of Karmarkar's algorithm for linear programming.

Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar

Math. Program., 1989

Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.

Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga

INFORMS J. Comput., 1989

1984

A new polynomial-time algorithm for linear programming.

Narendra Karmarkar

Comb., 1984

1982

An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem

Narendra Karmarkar, Richard M. Karp

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Probabilistic Analysis of Some Bin-Packing Problems

Narendra Karmarkar

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982