Latest news with #DavidZuckerman
Time of India
8 hours ago
- Science
- Time of India
Who is Indian-origin Eshan Chattopadhyay who won the prestigious Godel Prize in Maths? Why is the award so important?
Eshan Chattopadhyay , an Associate Professor of Computer Science at Cornell University , has won the 2025 Godel Prize , one of the highest honors in theoretical computer science . He received this prestigious award for solving a problem that had puzzled researchers for nearly 30 years. His breakthrough involved creating a two-source extractor that works even when both sources of randomness are weak. This discovery is a milestone not just in his career but also in the broader world of computing and Indian academia. His Ph.D. mentor was renowned computer scientist David Zuckerman at the University of Texas at Austin . Eshan Chattopadhyay: A profile of excellence Eshan grew up in India and completed his undergraduate studies at IIT Kanpur , one of the country's top engineering institutes. He went on to earn his Ph.D. at the University of Texas at Austin under the guidance of David Zuckerman. After that, he held research positions at places like UC Berkeley, Microsoft Research, and the Institute for Advanced Study in Princeton. He joined Cornell University in 2018 and became an Associate Professor in 2024. His work focuses on pseudo randomness, extractors, and computational complexity, areas that support modern data security and efficient computation. What makes the Godel Prize so prestigious? The Godel Prize is one of the most respected awards in theoretical computer science. Named after the famous logician Kurt Godel, it is jointly given by the ACM SIGACT and the European Association for Theoretical Computer Science. The award honors research that makes a lasting impact on the field. Winning this prize signals that a scientist's work has changed the way we think about computing at its most fundamental level. It marks the recipient as one of the global leaders in math and computer science. Why is Eshan Chattopadhyay's work a breakthrough? by Taboola by Taboola Sponsored Links Sponsored Links Promoted Links Promoted Links You May Like Trading CFD dengan Teknologi dan Kecepatan Lebih Baik IC Markets Mendaftar Undo Chattopadhyay solved a problem in randomness extraction , how to generate reliable random numbers using two poor sources of randomness. This kind of randomness is vital in fields like cryptography, secure communications, and data compression. For decades, experts believed it was impossible to do this under the conditions Chattopadhyay tackled. His research proved otherwise, showing that even weak inputs could produce strong randomness. It's a game-changing idea that will shape future work in both theory and real-world technology. Mentorship and legacy: The influence of David Zuckerman Chattopadhyay's work builds on the foundation laid by his advisor David Zuckerman, a leader in the study of randomness and complexity. Their partnership, which includes both academic papers and public outreach writing like 'How random is your randomness?', reflects a deep commitment to advancing computer science. Zuckerman's mentorship helped Chattopadhyay think boldly and tackle hard problems. Honors, teaching and future impact Besides the Godel Prize, Chattopadhyay has also received the Sloan Research Fellowship and the NSF CAREER Award. He is known at Cornell for teaching challenging courses and shaping young minds. He contributes regularly to top conferences like FOCS, STOC, and SODA. His research continues to push the boundaries of what's possible in computer science. Why this recognition matters globally Chattopadhyay's win is a proud moment for Indian-origin scholars and shows India's growing role in global science. While much of today's attention goes to applied AI, his achievement reminds us that fundamental theory still powers the technology we rely on every day. His work is a call to value deep thinking and bold questions in a fast-moving digital world.
Time of India
10 hours ago
- Science
- Time of India
Indian-origin professor wins Gödel Prize: Eshan Chattopadhyay and David Zuckerman awarded; breakthrough research in Computer Science
Eshan Chattopadhyay (left) and David Zuckerman (right) (Image credit: Cornell University official website & The University of Texas at Austin official website) Eshan Chattopadhyay, associate professor at Cornell University and David Zuckerman, professor of computer science at The University of Texas at Austin have been awarded the 2025 Gödel Prize. The prize was awarded for their research paper, 'Explicit Two-Source Extractors and Resilient Functions,' which presents a landmark solution to a central open problem in randomness extraction. Originally published in 2019, the paper introduced a novel method for constructing explicit two-source extractors—mathematical tools used to generate high-quality randomness from two weakly random sources. Eshan Chattopadhyay, an Indian-origin professor, completed his PhD at The University of Texas at Austin before joining Cornell University. His research focuses on pseudorandomness, circuit complexity, and communication complexity. In 2021, he received the National Science Foundation CAREER Award. Expressing his gratitude, Chattopadhyay said, 'This recognition is truly an incredible honor. The Gödel Prize has celebrated some of the most beautiful and foundational work in our field. It feels surreal—and deeply gratifying—that our paper is being placed in that category.' by Taboola by Taboola Sponsored Links Sponsored Links Promoted Links Promoted Links You May Like Buy Brass Idols - Handmade Brass Statues for Home & Gifting Luxeartisanship Buy Now Undo David Zuckerman earned his PhD from the University of California, Berkeley. He is widely recognized for his foundational contributions to pseudorandomness and computational complexity. His impact in the field was earlier recognized with the 30-Year Test of Time Award at FOCS 2021. Zuckerman on being conferred the award said, 'Previously, most research on randomness extraction focused on seeded extractors.' 'Now, our work—and the works that followed—have demonstrated major advances in two-source extractors and Ramsey graphs. I hope this attracts young talent to the field,' he added. Named after the renowned logician Kurt Gödel, the Gödel Prize is jointly awarded by ACM SIGACT and the European Association for Theoretical Computer Science. It will be formally presented at the ACM Symposium on Theory of Computing (STOC) in Prague this June.
