- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| c10 |      | Narendra Karmarkar: Beyond Convexity: New Perspectives in Computational Optimization. SEAL 2010: 1-23 |
| 2000 | ||
| c9 |  | Partha Niyogi, Narendra Karmarkar: An Approach to Data Reduction and Clustering with Theoretical Guarantees. ICML 2000: 679-686 |
| 1998 | ||
| j7 | | Narendra Karmarkar, Yagati N. Lakshman: On Approximate GCDs of Univariate Polynomials. J. Symb. Comput. 26(6): 653-666 (1998) |
| 1996 | ||
| c8 | | Narendra Karmarkar, Yagati N. Lakshman: Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. ISSAC 1996: 35-39 |
| 1993 | ||
| j6 | | 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 | ||
| j5 | | Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende: A continuous approach to inductive inference. Math. Program. 57: 215-238 (1992) |
| c7 | | 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 |
| 1991 | ||
| j4 | | Narendra Karmarkar, K. G. Ramakrishnan: Computational results of an interior point algorithm for large scale linear programming. Math. Program. 52: 555-586 (1991) |
| j3 | | 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) |
| c6 | | Narendra Karmarkar: A new parallel architecture for sparse matrix computation based on finite projective geometries. SC 1991: 358-369 |
| 1990 | ||
| c5 | | 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 |
| c4 | | |
| 1989 | ||
| j2 | | 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 | ||
| j1 | | Narendra Karmarkar: A new polynomial-time algorithm for linear programming. Combinatorica 4(4): 373-396 (1984) |
| c3 | | |
| 1982 | ||
| c2 | | |
| c1 | | Narendra Karmarkar, Richard M. Karp: An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem. FOCS 1982: 312-320 |
Data released under the ODC-BY 1.0 license — See also our legal information page