MANINDRA, AGRAWAL / المعلوماتية / الباحثون

المركز الدولي للبحث العلمي

الباحثون

المعلوماتية / MANINDRA, AGRAWAL

manindraiitk.ac.in

الموضع

N. Rama Rao Chair Professor
Department of Computer Science and Engineering
Indian Institute of Technology
Kanpur, India.

Honorary Professor, Indian Institute of Science Enducation and Research, Bhopal

Adjunct Professor, Chennai Mathematical Institute, Chennai

مواضيع البحث

Complexity Theory
Computational Number Theory

Peripheral interest in Cryptography, Complex Analysis and Combinatorics.

الجوائز

Humboldt Prize, 2011.
TWAS Prize in Mathematics, 2011.
Rajib Goyal Prize, 2010.
P. C. Mahalanobis Birth Centenary Award, 2009.
G. D. Birla Award for Scienti c Research, 2009.
Infosys Mathematics Prize, 2008.
Fulkerson Prize for the paper \\PRIMES is in P\", 2006.
Godel Prize for the paper \\PRIMES is in P\", 2006.
 Dr Meghnad Saha award (UGC) in Mathematical Sciences, 2003.
ICTP (Internatinal Centre for Theoretical Physics, Trieste) prize, 2003.
Shanti Swarup Bhatnagar award in Mathematical Sciences, 2003.
Distinguished Alumnus award by Indian Institute of Technology, Kanpur, 2003.
The Clay Research Award by Clay Mathematics Institute, Boston, 2002.
The Young Scientist Award by the UP Council for Science and Technology, 2000.
The Young Engineer Award by the Indian National Academy of Engineering, 1998.

Fellowships
J. C. Bose Fellowship for the period 2006-2011.
Fellow of Indian National Science Academy.
Fellow of Indian Academy of Sciences.
Fellow of Indian National Academy of Engineering.
Fellow of The National Academy of Sciences.

المنشورات

Book Chapters
1. The Isomorphism Conjecture for NP, Computability in Context: Computation and
Logic in Real World, Editors: Barry Cooper and Andrea Sorbi, World Scienti c, 2011.
2. Classifying Polynomials and Identity Testing (with R. Saptharishi), Current Trends in
Science (Platinum Jubilee Special, Indian Academy of Sciences), pages 149{162, 2009.


Journal Papers

1. The Isomorphism Conjecture for Constant Depth Reductions, Journal of Computer and Systems Sciences (special issue on Karp\'s Kyoto Prize), volume 77(1), pages 3{13, 2011.
2. PRIMES is in P (with N. Kayal and N. S axena), Annals of Mathematics, volume 160(2), pages 781{793, 2004.
3. Primality and Identity Testing via Chinese Remaindering (with S. Biswas), Journal of the ACM, volume 50(4), pages 429{443, 2003.
4. For Completeness, Sublogarithmic Space is No Space, Information Processing Letters, volume 82, pages 321{325, 2002.
5. The Satis ability Problem for Probabilistic Ordered Branching Programs (with T. Thierauf), Theory of Computing Systems, volume 34, pages 471{487, 2001.
6. Reducing the Complexity of Reductions (with E. Allender, R. Impagliazzo, T. Pitassi, and S. Rudich), Journal of Computational Complexity, volume 10, pages 117{138, 2001.
7. Characterizing Small Space and Small Depth Classes by Operators of Higher Types (with E. Allender, S. Dutta, H. Vollmer, C. Wanger), Chicago Journal on Theoretical Computer Science,
http://www.cs.uchicago.edu/research/publications/cjtcs/, 2000.
8. On TC0, AC0, and Arithmetic Circuits (with E. Allender and S. Dutta), the special issue of the Journal of Computer and System Sciences on the twelfth Conference on Computational Complexity, volume 60, pages 395{421, 2000.
9. The Formula Isomorphism Problem (with T. Thierauf), SIAM Journal on Computing, volume 30(3), pages 990{1009, 2000.
10. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem (with E. Allender and S. Rudich), the special issue of the Journal of Computer and System Sciences on the eleventh Conference on Computational Complexity, volume 57, pages 127{143, 1999.
11. DSPACE(n) ?= NSPACE(n): A Degree Theoretic Characterization, the special issue of the Journal of Computer and Systems Sciences on the tenth Structure in Complexity Theory conference, volume 54(3), pages 383{392, 1997.
12. A Note on Decision versus Search for Graph Automorphism (with V. Arvind), Information and Computation 131(2), pages 179{189, 1996.
13. NP-creative Sets: A New Class of Creative Sets in NP (with S. Biswas), Mathematical Systems Theory 29, pages 487{505, 1996.
14. Quasi-linear Truth-table Reductions to P-selective Sets (with V. Arvind), Theoretical Computer Science 158, pages 361{370, 1996.
15. Geometric Sets of Low Information Content (with V. Arvind), Theoretical Computer Science 158, pages 193{220, 1996.
16. On the Isomorphism Conjecture for Weak Reducibilities, the special issue of the Journal
of Computer and Systems Sciences on the ninth Structure in Complexity Theory conference, volume 53(2), pages 267{282, 1996.
17. Polynomial Isomorphism of 1-L-Complete Sets (with S. Biswas), the special issue of the journal of Computer and Systems Sciences on the eighth Structure in Complexity Theory conference, volume 53(2), pages 155-160, 1996.
18. On the Isomprphism Conjecture for 2DFA Reductions (with S. Venkatesh), Intl. Journal on Foundations of Computer Science 7(4), pages 339{352, 1996.

ملاحظات قانونية - إتصال

Copyright © 2013 - www.cirs.info - كل الحقوق محفوظة