default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNarendra Karmarkar
Person information
- award (2000): Paris Kanellakis Award
- award (1988): Fulkerson Prize
- award (1984): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[i1]Narendra Karmarkar:
Towards a Broader View of Theory of Computing. CoRR abs/1412.3335 (2014)- 2010
- [c11]Narendra Karmarkar:
Beyond Convexity: New Perspectives in Computational Optimization. SEAL 2010: 1-23
2000 – 2009
- 2000
- [c10]Partha Niyogi, Narendra Karmarkar:
An Approach to Data Reduction and Clustering with Theoretical Guarantees. ICML 2000: 679-686
1990 – 1999
- 1998
- [j9]Narendra Karmarkar, Yagati N. Lakshman:
On Approximate GCDs of Univariate Polynomials. J. Symb. Comput. 26(6): 653-666 (1998) - 1996
- [c9]Narendra Karmarkar, Yagati N. Lakshman:
Approximate Polynomial Greatest Common Divisors and Nearest Singular Polynomials. ISSAC 1996: 35-39 - 1993
- [j8]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
- [j7]Anil P. Kamath, Narendra Karmarkar:
A continuous method for computing bounds in integer quadratic optimization problems. J. Glob. Optim. 2(3): 229-241 (1992) - [j6]Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende:
A continuous approach to inductive inference. Math. Program. 57: 215-238 (1992) - [c8]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
- [j5]Narendra Karmarkar, K. G. Ramakrishnan:
Computational results of an interior point algorithm for large scale linear programming. Math. Program. 52: 555-586 (1991) - [j4]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) - [c7]K. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath:
An Approximate Dual Projective Algorithm for Solving Assignment Problems. Network Flows And Matching 1991: 431-451 - [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]Narendra Karmarkar:
An Interior-Point Approach to NP-Complete Problems. IPCO 1990: 351-366
1980 – 1989
- 1989
- [j3]Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga:
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. INFORMS J. Comput. 1(2): 84-106 (1989) - [j2]Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar:
An implementation of Karmarkar's algorithm for linear programming. Math. Program. 44(1-3): 297-335 (1989) - 1984
- [j1]Narendra Karmarkar:
A new polynomial-time algorithm for linear programming. Comb. 4(4): 373-396 (1984) - [c3]Narendra Karmarkar:
A New Polynomial-Time Algorithm for Linear Programming. STOC 1984: 302-311 - 1982
- [c2]Narendra Karmarkar:
Probabilistic Analysis of Some Bin-Packing Problems. FOCS 1982: 107-111 - [c1]Narendra Karmarkar, Richard M. Karp:
An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem. FOCS 1982: 312-320
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-04 21:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
