Narendra Karmarkar

Indian mathematician

Why Is Narendra Karmarkar Influential?

According to Wikipedia, Narendra Krishna Karmarkar is an Indian mathematician. Karmarkar developed Karmarkar's algorithm. He is listed as an ISI highly cited researcher. He invented one of the first provably polynomial time algorithms for linear programming, which is generally referred to as an interior point method. The algorithm is a cornerstone in the field of Linear Programming. He published his famous result in 1984 while he was working for Bell Laboratories in New Jersey.

Narendra Karmarkar's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

A new polynomial-time algorithm for linear programming (1984) (3878)
A new polynomial-time algorithm for linear programming (1984) (1555)
An efficient approximation scheme for the one-dimensional bin-packing problem (1982) (503)
An implementation of Karmarkar's algorithm for linear programming (1989) (384)
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm (1989) (138)
A continuous approach to inductive inference (1992) (125)
Approximate polynomial greatest common divisors and nearest singular polynomials (1996) (124)
On Approximate GCDs of Univariate Polynomials (1998) (108)
A Monte-Carlo Algorithm for Estimating the Permanent (1993) (99)
Computational results of an interior point algorithm for large scale linear programming (1991) (97)
Computational experience with an interior point algorithm on the satisfiability problem (1990) (91)
An interior point algorithm to solve computationally difficult set covering problems (1991) (81)
PROBABILISTIC ANALYSIS OF OPTIMUM PARTITIONING (1986) (72)
Probabilistic analysis of some bin-packing problems (1982) (41)
An Interior-Point Approach to NP-Complete Problems (1990) (35)
Power series variants of Karmarkar-type algorithms (1989) (30)
An interior point approach to Boolean vector function synthesis (1993) (29)
A continuous method for computing bounds in integer quadratic optimization problems (1992) (25)
An Approximate Dual Projective Algorithm for Solving Assignment Problems (1991) (25)
A continuous approach to compute upper bounds in quadratic maximization problems with integer constraints (1992) (20)
A new parallel architecture for sparse matrix computation based on finite projective geometries (1991) (18)
An O(nL) Iteration Algorithm for Computing Bounds in Quadratic Optimization Problems (1993) (15)
Computational and Complexity Results for an Interior Point Algorithm on Multicommodity Flow Problems (Extended Abstract) (1994) (8)
An Approach to Data Reduction and Clustering with Theoretical Guarantees (2000) (8)
An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems (1992) (5)
An Interior Point Approach to the Maximum Independent Set Problem in Dense Random Graphs (1999) (4)
Coping with np-complete problems (1983) (4)
Interior-point methods in optimization (1992) (4)
A projective geometry architecture for scientific computation (1992) (2)
Solution of P-matrix Linear Complementarity Problems Using a Potential Reduction Algorithm. Siam an Implementation of Karmarkar's Algorithm for Linear Programming. Mathematical Programming, 44:297{335, 1989. 2] F. Alizadeh. Optimization over Positive Semi-deenite Cone: Interior-point Methods and Com (1996) (2)
Effect of lead acetate on erythrocyte morphology in rats. (1990) (2)
Beyond Convexity: New Perspectives in Computational Optimization (2010) (1)
A novel approach to overcome bandwidth limitations of parallel computers based on cmos, Part-1 : General concepts (2009) (1)
ESTIMATING THE WORK IN INTEGER PARTITIONING (0)
ANew Parallel Architecture for S arse Matrix 1' Computation Based on Finite Projec ive Geometries (1991) (0)
Towards a Broader View of Theory of Computing (2014) (0)
Primal-dual Power Series Algorithm (1990) (0)
Primal-dual Power Series Algorithm (1990) (0)
United States Patent ( 19 ) Bayer et al . 54 METHOD AND APPARATUS FOR OPTIMIZING SYSTEM OPERATIONAL PARAMETERS (2017) (0)
Vacuum nanoelectronics devices from the perspective of optimization theory (2008) (0)

This paper list is powered by the following services:

Other Resources About Narendra Karmarkar

en.wikipedia.org

What Schools Are Affiliated With Narendra Karmarkar?

Narendra Karmarkar is affiliated with the following schools:

University of California, Berkeley

California Institute of Technology

IIT Bombay

Narendra Karmarkar's AcademicInfluence.com Rankings

Computer Science