Strategies for Securing Early Career Awards with Hajiaghayi, Roth, Rubinstein & Saha

カートのアイテムが多すぎます

ご購入は五十タイトルがカートに入っている場合のみです。

カートに追加できませんでした。

しばらく経ってから再度お試しください。

ウィッシュリストに追加できませんでした。

しばらく経ってから再度お試しください。

ほしい物リストの削除に失敗しました。

しばらく経ってから再度お試しください。

ポッドキャストのフォローに失敗しました

ポッドキャストのフォロー解除に失敗しました

Strategies for Securing Early Career Awards with Hajiaghayi, Roth, Rubinstein & Saha

無料で聴く

ポッドキャストの詳細を見る

このコンテンツについて

We are pleased to invite you to a LIVE distinguished YouTube panel discussion on Strategies for Securing Early Career Awards📅 Date: Wed, January 22⏰ Time: 2 PM ETWe are thrilled to announce a distinguished panel discussion on early career awards in computer science, featuring insights from renowned experts who have achieved significant recognition in their fields. This session will focus on strategies for securing prestigious honors like NSF CAREER, ONR YIP, AFOSR YIP, Sloan Fellowships, Microsoft Faculty Fellowships, Packard Fellowships, PECASE, and more.Our Distinguished Panelists:____________________________Mohammad Hajiaghayi (University of Maryland)Dr. Hajiaghayi is the Jack and Rita G. Minker Professor of Computer Science at the University of Maryland and a Guggenheim Fellow, Blavatnik Honoree, ACM Fellow, IEEE Fellow. His research spans algorithms, game theory, and big graph analysis. With over 300 publications and numerous patents, he is an expert in algorithms and game theory. He has received awards including the EATCS Nerode Prize and NSF CAREER and ONR Young Investigator Award.Aaron Roth (University of Pennsylvania)Dr. Roth is a Professor of Computer and Information Science at Penn, specializing in algorithmic fairness, algorithmic game theory, uncertainty quantification in machine learning, and privacy. He has received multiple awards including an NSF CAREER Award, a Sloan Fellowship, the Presidential Early Career Award for Scientists and Engineers (PECASE), and the Hans Sigrist prize. He has been the PC chair for COLT and for EC. He is the co-author of the Algorithmic Foundations of Differential Privacy and The Ethical Algorithm. Aviad Rubinstein (Stanford University)Dr. Rubinstein is an Assistant Professor at Stanford University, focusing on algorithmic game theory and algorithms broadly. He is the recipient of the Kalai Prize and ACM Doctoral Dissertation Award, and relevant to this panel Packard Fellowship and NSF CAREER award. He is a co-author of many research papers and a book of Algorithms for Toddlers. Barna Saha (University of California, San Diego)Dr. Saha is the Harry E. Gruber Endowed Chair Professor of Computer Science at UCSD, and serves as the Director of the National NSF TRIPODS Institute for Emerging CORE Methods in Data Science (EnCORE). Her research focuses on Theoretical Computer Science specifically on fine-grained complexity and developing fast algorithms for problems in data science. Among her many accolades include the Presidential Early Career Award for Scientists and Engineers (PECASE), a Sloan Research Fellowship, a Young Alumni Award from the Indian Institute of Technology Kanpur and an NSF CAREER Award. Why Attend?____________________________Learn the key strategies to craft compelling award applications.Gain insights into what selection committees look for.Understand how these awards can shape early career trajectories in academia, industry, and beyond.Discover practical tips from accomplished awardees.Join the Conversation____________________________Mark your calendar and join us for this live session to gain valuable knowledge and ask questions directly to our esteemed panelists.🔗 Watch Live at this YouTube VideoWe look forward to seeing you there!#EarlyCareerAwards, #AcademicExcellence, #academicawards, #CareerDevelopment, #NSFCAREER, #SloanFellowships, #PackardFellowships, #PECASE, #AcademicAwards, #GameTheory, #Algorithms, #DataScience