||This article needs additional citations for verification. (June 2012)
Narendra Krishna Karmarkar (born 1957) is an Indian mathematician, who developed Karmarkar's algorithm. He is listed as an ISI highly cited researcher.
Narendra Karmarkar was born in Gwalior to a Marathi family. Karmarkar received his B.Tech in Electrical Engineering from IIT Bombay in 1978, M.S. from the California Institute of Technology and Ph.D. in Computer Science from the University of California, Berkeley. He invented a polynomial algorithm for linear programming also known as the interior point method. The algorithm is a cornerstone in the field of Linear Programming. He published his famous result in 1984 while he was working for Bell Laboratories in New Jersey. Karmarkar was a professor at the Tata Institute of Fundamental Research in Mumbai. He is currently working on a new architecture for supercomputing. Some of the ideas are published at. Fab5 conference organised by MIT center for bits and atoms.
Karmarkar received a number of awards for his algorithm, among them:
Karmarkar's algorithm 
Karmarkar's algorithm solves linear programming problems in polynomial time. These problems are represented by "n" variables and "m" constraints. The previous method of solving these problems consisted of problem representation by an "x" sided solid with "y" vertices, where the solution was approached by traversing from vertex to vertex. Karmarkar's novel method approaches the solution by cutting through the above solid in its traversal. Consequently, complex optimization problems are solved much faster using the Karmarkar algorithm. A practical example of this efficiency is the solution to a complex problem in communications network optimization where the solution time was reduced from weeks to days. His algorithm thus enables faster business and policy decisions. Karmarkar's algorithm has stimulated the development of several other interior point methods, some of which are used in current codes for solving linear programs.
Paris Kanellakis Award 
The Association for Computing Machinery awarded him the prestigious Paris Kanellakis Award in 2000 for his work on polynomial time interior point methods for linear programming.
Galois geometry 
After working on the Interior Point Method, Karmarkar worked on a new architecture for supercomputing, based on concepts from finite geometry, especially projective geometry over finite fields.
Current investigations 
Currently, he is synthesizing these concepts with some new ideas he calls sculpturing free space (a non-linear analogue of what has popularly been described as folding the perfect corner). This approach allows him to extend this work to the physical design of machines. He is now publishing updates on his recent work, including an extended abstract. This new paradigm was presented at IVNC, Poland on 16 July 2008, and at MIT on 25 July 2008. Some of his recent work is published at ieeexplore.
External links 
- Adleman, Diffie, Hellman, Merkle, Rivest, Shamir (1996)
- Lempel, Ziv (1997)
- Bryant, Clarke, Emerson, McMillan (1998)
- Sleator, Tarjan (1999)
- Karmarkar (2000)
- Myers (2001)
- Franaszek (2002)
- Miller, Rabin, Solovay, Strassen (2003)
- Freund, Schapire (2004)
- Holzmann, Kurshan, Vardi, Wolper (2005)
- Brayton (2006)
- Buchberger (2007)
- Cortes, Vapnik (2008)
- Bellare, Rogaway (2009)
- Mehlhorn (2010)
- Samet (2011)
- Broder, Charikar, Indyk (2012)