Yahoo Search Busca da Web

Resultado da Busca

  1. Manindra Agrawal (born 20 May 1966) is an Indian computer scientist and professor at the Department of Computer Science and Engineering at the Indian Institute of Technology, Kanpur. He was the recipient of the first Infosys Prize for Mathematics, the Godel Prize in 2006; and the Shanti Swarup Bhatnagar Award in Mathematical Sciences ...

  2. 4 de jul. de 2021 · Prof. Manindra Agrawal was born on 20th May 1966 at Allahabad, Uttar Pradesh. He received his B.Tech. and Ph.D. in Computer Science and Engineering from IIT Kanpur in 1986 and 1991, respectively. He later worked as a fellow at the School of Mathematics, SPIC Science Foundation, Chennai from 1993 to 1995, and a Humboldt Fellow at the ...

  3. Manindra Agrawal (Allahabad, Índia, 20 de maio de 1966) é um professor do departamento de Ciência da Computação e engenheiro e decano de Geração e Planejamento de Recursos (DRPG) no Instituto Indiano de Tecnologia, Kanpur. Foi o primeiro a receber o prêmio científico indiano intitulado Infosys Prize. [1]

  4. Manindra Agrawal is a computer scientist and mathematician at IIT Kanpur. He is the co-author of the best-selling book A Proof of the Pudding and the vice president of the Indian Academy of Sciences.

  5. MANINDRA AGRAWAL, Professor Department of Computer Science and Engineering Indian Institute of Technology Kanpur 208016, INDIA Academic Degrees B. Tech in Computer Science and Engineering, IIT Kanpur, 1986. Ph.D. in Computer Science, IIT Kanpur, 1991. Employment [1/18{present] Professor, Department of Computer Science and Engineering, IIT Kanpur.

    • 126KB
    • 8
  6. Designed the first efficient and deterministic algorithm for testing if a number is prime. Padma Shri, 2013. Dr. Manindra Agrawal, IIT Kanpur, computational complexity theory, computational number theory & algebra.

  7. 185. 2003. Proving lower bounds via pseudo-random generators. M Agrawal. FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …. , 2005. 165. 2005. Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits.