The SCEAS System
Navigation Menu

Search the dblp DataBase


Narendra Karmarkar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Narendra Karmarkar
    Probabilistic Analysis of Some Bin-Packing Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:107-111 [Conf]
  2. Narendra Karmarkar, Richard M. Karp
    An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:312-320 [Conf]
  3. Partha Niyogi, Narendra Karmarkar
    An Approach to Data Reduction and Clustering with Theoretical Guarantees. [Citation Graph (0, 0)][DBLP]
    ICML, 2000, pp:679-686 [Conf]
  4. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
    Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:333-349 [Conf]
  5. Narendra Karmarkar
    An Interior-Point Approach to NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:351-366 [Conf]
  6. Narendra Karmarkar, S. A. Thakur
    An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:406-420 [Conf]
  7. Narendra Karmarkar, Yagati N. Lakshman
    Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:35-39 [Conf]
  8. Narendra Karmarkar
    A new parallel architecture for sparse matrix computation based on finite projective geometries. [Citation Graph (0, 0)][DBLP]
    SC, 1991, pp:358-369 [Conf]
  9. Narendra Karmarkar
    A New Polynomial-Time Algorithm for Linear Programming [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:302-311 [Conf]
  10. Narendra Karmarkar
    A new polynomial-time algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:373-396 [Journal]
  11. Narendra Karmarkar, Yagati N. Lakshman
    On Approximate GCDs of Univariate Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:26, n:6, pp:653-666 [Journal]
  12. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
    A continuous approach to inductive inference. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:215-238 [Journal]
  13. Narendra Karmarkar, K. G. Ramakrishnan
    Computational results of an interior point algorithm for large scale linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:555-586 [Journal]
  14. Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan
    An interior point algorithm to solve computationally difficult set covering problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:597-618 [Journal]
  15. Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
    A Monte-Carlo Algorithm for Estimating the Permanent. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:284-293 [Journal]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002