Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Narendra Karmarkar
@article{DBLP:journals/corr/Karmarkar14,
author = {Narendra Karmarkar},
title = {Towards a Broader View of Theory of Computing},
journal = {CoRR},
volume = {abs/1412.3335},
year = {2014},
url = {http://arxiv.org/abs/1412.3335},
eprinttype = {arXiv},
eprint = {1412.3335},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Karmarkar14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/seal/Karmarkar10,
author = {Narendra Karmarkar},
editor = {Kalyanmoy Deb and
Arnab Bhattacharya and
Nirupam Chakraborti and
Partha Chakroborty and
Swagatam Das and
Joydeep Dutta and
Santosh K. Gupta and
Ashu Jain and
Varun Aggarwal and
J{\"{u}}rgen Branke and
Sushil J. Louis and
Kay Chen Tan},
title = {Beyond Convexity: New Perspectives in Computational Optimization},
booktitle = {Simulated Evolution and Learning - 8th International Conference, {SEAL}
2010, Kanpur, India, December 1-4, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6457},
pages = {1--23},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17298-4\_1},
doi = {10.1007/978-3-642-17298-4\_1},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/seal/Karmarkar10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/NiyogiK00,
author = {Partha Niyogi and
Narendra Karmarkar},
editor = {Pat Langley},
title = {An Approach to Data Reduction and Clustering with Theoretical Guarantees},
booktitle = {Proceedings of the Seventeenth International Conference on Machine
Learning {(ICML} 2000), Stanford University, Stanford, CA, USA, June
29 - July 2, 2000},
pages = {679--686},
publisher = {Morgan Kaufmann},
year = {2000},
timestamp = {Sun, 21 Feb 2010 20:54:50 +0100},
biburl = {https://dblp.org/rec/conf/icml/NiyogiK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/KarmarkarL98,
author = {Narendra Karmarkar and
Yagati N. Lakshman},
title = {On Approximate GCDs of Univariate Polynomials},
journal = {J. Symb. Comput.},
volume = {26},
number = {6},
pages = {653--666},
year = {1998},
url = {https://doi.org/10.1006/jsco.1998.0232},
doi = {10.1006/JSCO.1998.0232},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/KarmarkarL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/KarmarkarL96,
author = {Narendra Karmarkar and
Yagati N. Lakshman},
editor = {Erwin Engeler and
Bob F. Caviness and
Yagati N. Lakshman},
title = {Approximate Polynomial Greatest Common Divisors and Nearest Singular
Polynomials},
booktitle = {Proceedings of the 1996 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '96, Zurich, Switzerland, July 24-26, 1996},
pages = {35--39},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/236869.236892},
doi = {10.1145/236869.236892},
timestamp = {Tue, 29 Aug 2023 20:47:14 +0200},
biburl = {https://dblp.org/rec/conf/issac/KarmarkarL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarmarkarKLLL93,
author = {Narendra Karmarkar and
Richard M. Karp and
Richard J. Lipton and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Michael Luby},
title = {A Monte-Carlo Algorithm for Estimating the Permanent},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {2},
pages = {284--293},
year = {1993},
url = {https://doi.org/10.1137/0222021},
doi = {10.1137/0222021},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KarmarkarKLLL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/KamathK92,
author = {Anil P. Kamath and
Narendra Karmarkar},
title = {A continuous method for computing bounds in integer quadratic optimization
problems},
journal = {J. Glob. Optim.},
volume = {2},
number = {3},
pages = {229--241},
year = {1992},
url = {https://doi.org/10.1007/BF00171827},
doi = {10.1007/BF00171827},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/KamathK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KamathKRR92,
author = {Anil P. Kamath and
Narendra Karmarkar and
K. G. Ramakrishnan and
Mauricio G. C. Resende},
title = {A continuous approach to inductive inference},
journal = {Math. Program.},
volume = {57},
pages = {215--238},
year = {1992},
url = {https://doi.org/10.1007/BF01581082},
doi = {10.1007/BF01581082},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KamathKRR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KarmarkarT92,
author = {Narendra Karmarkar and
S. A. Thakur},
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {An Interior Point Approach to a Tensor Optimization Problem with Application
to Upper Bounds in Integer Quadratic Optimization Problems},
booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
pages = {406--420},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 07:38:51 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KarmarkarT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KarmarkarR91,
author = {Narendra Karmarkar and
K. G. Ramakrishnan},
title = {Computational results of an interior point algorithm for large scale
linear programming},
journal = {Math. Program.},
volume = {52},
pages = {555--586},
year = {1991},
url = {https://doi.org/10.1007/BF01582905},
doi = {10.1007/BF01582905},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KarmarkarR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KarmarkarRR91,
author = {Narendra Karmarkar and
Mauricio G. C. Resende and
K. G. Ramakrishnan},
title = {An interior point algorithm to solve computationally difficult set
covering problems},
journal = {Math. Program.},
volume = {52},
pages = {597--618},
year = {1991},
url = {https://doi.org/10.1007/BF01582907},
doi = {10.1007/BF01582907},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KarmarkarRR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/RamakrishnanKK91,
author = {K. G. Ramakrishnan and
Narendra Karmarkar and
Anil P. Kamath},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {An Approximate Dual Projective Algorithm for Solving Assignment Problems},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {431--451},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/17},
doi = {10.1090/DIMACS/012/17},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/RamakrishnanKK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sc/Karmarkar91,
author = {Narendra Karmarkar},
editor = {Joanne L. Martin},
title = {A new parallel architecture for sparse matrix computation based on
finite projective geometries},
booktitle = {Proceedings Supercomputing '91, Albuquerque, NM, USA, November 18-22,
1991},
pages = {358--369},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/125826.126029},
doi = {10.1145/125826.126029},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/sc/Karmarkar91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KamathKRR90,
author = {Anil P. Kamath and
Narendra Karmarkar and
K. G. Ramakrishnan and
Mauricio G. C. Resende},
editor = {Ravi Kannan and
William R. Pulleyblank},
title = {Computational Experience with an Interior Point Algorithm on the Satisfiability
Problem},
booktitle = {Proceedings of the 1st Integer Programming and Combinatorial Optimization
Conference, Waterloo, Ontorio, Canada, May 28-30 1990},
pages = {333--349},
publisher = {University of Waterloo Press},
year = {1990},
timestamp = {Mon, 22 Nov 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/KamathKRR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Karmarkar90,
author = {Narendra Karmarkar},
editor = {Ravi Kannan and
William R. Pulleyblank},
title = {An Interior-Point Approach to NP-Complete Problems},
booktitle = {Proceedings of the 1st Integer Programming and Combinatorial Optimization
Conference, Waterloo, Ontorio, Canada, May 28-30 1990},
pages = {351--366},
publisher = {University of Waterloo Press},
year = {1990},
timestamp = {Wed, 09 Oct 2002 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Karmarkar90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AdlerKRV89,
author = {Ilan Adler and
Narendra Karmarkar and
Mauricio G. C. Resende and
Geraldo Veiga},
title = {Data Structures and Programming Techniques for the Implementation
of Karmarkar's Algorithm},
journal = {{INFORMS} J. Comput.},
volume = {1},
number = {2},
pages = {84--106},
year = {1989},
url = {https://doi.org/10.1287/ijoc.1.2.84},
doi = {10.1287/IJOC.1.2.84},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/AdlerKRV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AdlerRVK89,
author = {Ilan Adler and
Mauricio G. C. Resende and
Geraldo Veiga and
Narendra Karmarkar},
title = {An implementation of Karmarkar's algorithm for linear programming},
journal = {Math. Program.},
volume = {44},
number = {1-3},
pages = {297--335},
year = {1989},
url = {https://doi.org/10.1007/BF01587095},
doi = {10.1007/BF01587095},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/AdlerRVK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Karmarkar84,
author = {Narendra Karmarkar},
title = {A new polynomial-time algorithm for linear programming},
journal = {Comb.},
volume = {4},
number = {4},
pages = {373--396},
year = {1984},
url = {https://doi.org/10.1007/BF02579150},
doi = {10.1007/BF02579150},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Karmarkar84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Karmarkar84,
author = {Narendra Karmarkar},
editor = {Richard A. DeMillo},
title = {A New Polynomial-Time Algorithm for Linear Programming},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {302--311},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808695},
doi = {10.1145/800057.808695},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Karmarkar84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Karmarkar82,
author = {Narendra Karmarkar},
title = {Probabilistic Analysis of Some Bin-Packing Problems},
booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
Illinois, USA, 3-5 November 1982},
pages = {107--111},
publisher = {{IEEE} Computer Society},
year = {1982},
url = {https://doi.org/10.1109/SFCS.1982.37},
doi = {10.1109/SFCS.1982.37},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Karmarkar82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KarmarkarK82,
author = {Narendra Karmarkar and
Richard M. Karp},
title = {An Efficient Approximation Scheme for the One-Dimensional Bin-Packing
Problem},
booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
Illinois, USA, 3-5 November 1982},
pages = {312--320},
publisher = {{IEEE} Computer Society},
year = {1982},
url = {https://doi.org/10.1109/SFCS.1982.61},
doi = {10.1109/SFCS.1982.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KarmarkarK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22:44 CEST 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:
