| * | 2000 |
|---|
| 16 | | Partha Niyogi,
Narendra Karmarkar:
An Approach to Data Reduction and Clustering with Theoretical Guarantees.
ICML 2000: 679-686 |
| 1998 |
|---|
| 15 | | Narendra Karmarkar,
Yagati N. Lakshman:
On Approximate GCDs of Univariate Polynomials.
J. Symb. Comput. 26(6): 653-666 (1998) |
| 1996 |
|---|
| 14 | EE | Narendra Karmarkar,
Yagati N. Lakshman:
Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials.
ISSAC 1996: 35-39 |
| 1993 |
|---|
| 13 | | 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): 284-293 (1993) |
| 1992 |
|---|
| 12 | | 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: 406-420 |
| 11 | | Anil P. Kamath,
Narendra Karmarkar,
K. G. Ramakrishnan,
Mauricio G. C. Resende:
A continuous approach to inductive inference.
Math. Program. 57: 215-238 (1992) |
| 1991 |
|---|
| 10 | EE | Narendra Karmarkar:
A new parallel architecture for sparse matrix computation based on finite projective geometries.
SC 1991: 358-369 |
| 9 | | Narendra Karmarkar,
K. G. Ramakrishnan:
Computational results of an interior point algorithm for large scale linear programming.
Math. Program. 52: 555-586 (1991) |
| 8 | | Narendra Karmarkar,
Mauricio G. C. Resende,
K. G. Ramakrishnan:
An interior point algorithm to solve computationally difficult set covering problems.
Math. Program. 52: 597-618 (1991) |
| 1990 |
|---|
| 7 | | 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: 333-349 |
| 6 | | Narendra Karmarkar:
An Interior-Point Approach to NP-Complete Problems.
IPCO 1990: 351-366 |
| 1989 |
|---|
| 5 | EE | Ilan Adler,
Narendra Karmarkar,
Mauricio G. C. Resende,
Geraldo Veiga:
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.
INFORMS Journal on Computing 1(2): 84-106 (1989) |
| 1984 |
|---|
| 4 | | Narendra Karmarkar:
A New Polynomial-Time Algorithm for Linear Programming
STOC 1984: 302-311 |
| 3 | | Narendra Karmarkar:
A new polynomial-time algorithm for linear programming.
Combinatorica 4(4): 373-396 (1984) |
| 1982 |
|---|
| 2 | | Narendra Karmarkar:
Probabilistic Analysis of Some Bin-Packing Problems
FOCS 1982: 107-111 |
| 1 | | Narendra Karmarkar,
Richard M. Karp:
An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem
FOCS 1982: 312-320 |
