George J. Mailath is the Walter H. Annenberg Professor in the Social Sciences and Professor of Economics at the University of Pennsylvania, and an Honorary Professor at the Research School of Economics, Australian National University. He specializes in microeconomics, noncooperative game theory, repeated games, and the theory of reputations. His research explores pricing strategies, evolutionary game theory, and social norms. Mailath is a Fellow of prestigious institutions including the American Academy of Arts & Sciences and the Econometric Society. He served on the Econometric Society Council (2013-2015, 2020-2023), Game Theory Society Council (2005-2011), and co-founded Theoretical Economics . His editorial roles include editorships at Econometrica , Review of Economic Studies , and others. His 2019 book Modeling Strategic Behavior provides graduate-level insights into game theory and mechanism design. Mailath’s articles focus on strategic interactions, reputation effects, and dynamic game theory. Notable works include analyses of trust in risk-sharing mechanisms and coalition-proof strategies under frictions. His research emphasizes long-term strategic behavior and institutional design.
David Jao is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research focuses on post-quantum cryptography, particularly leveraging isogenies of supersingular elliptic curves for secure cryptographic protocols. He is renowned for co-developing the Supersingular Isogeny Key Encapsulation (SIKE) protocol, a leading candidate for post-quantum cryptography standards. His work spans theoretical foundations and practical implementations, including optimizing isogeny-based systems for embedded devices and ARM processors. Research interests include isogeny-based cryptosystems, elliptic curve cryptography, zero-knowledge proofs, and cryptographic security against quantum attacks. He explores applications of expander graphs and Ramanujan graphs in cryptography, alongside algorithmic improvements for cryptographic protocols such as SIDH (Supersingular Isogeny Diffie-Hellman). Key contributions include advancements in key compression techniques for SIKE, side-channel attack mitigation, and formalizing security models for post-quantum key exchange. His publications analyze cryptographic hardness assumptions, such as the discrete logarithm problem in finite groups and the semidirect product structure in isogeny-based systems. Jao’s work bridges theoretical mathematics and applied cryptography, with a focus on ensuring practical security in next-generation cryptographic systems. His research addresses challenges in quantum-resistant authentication, key establishment, and digital signatures, often emphasizing efficiency and resistance to both classical and quantum attacks.
Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.
Marina Blanton is an Associate Professor in the Department of Computer Science and Engineering at the University at Buffalo, and Faculty Director of Women in Science and Engineering within the School of Engineering and Applied Sciences. She holds a PhD in Computer Science from Purdue University (2007), along with multiple advanced degrees in Computer Science and Electrical Engineering from prestigious institutions in the US and Russia. Her research focuses on applied cryptography, information security, and privacy-preserving computation and outsourcing. She has pioneered work on secure multi-party computation protocols, privacy-preserving biometric authentication, and secure data analytics across distributed systems. Her contributions include foundational frameworks like PICCO, a compiler for private distributed computation, and advancements in protocols for genomic data analysis and floating-point secure computation. Blanton has been recognized with numerous awards, including IEEE and ACM Senior Membership (2016/2015), the ACM CCS Test of Time Award (2015), and the AFOSR Young Investigator Award (2013). Her research has been supported by grants such as NSF SaTC awards and AFOSR funding. Her work emphasizes practical implementations of secure computation, with applications in healthcare, biometrics, and distributed data systems. She has advised numerous students and contributed to educational initiatives promoting women in STEM through her leadership roles.
Björn Brandenburg is a researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany. His work focuses on real-time systems, scheduling algorithms, and operating system design, with a particular emphasis on predictable resource allocation and performance guarantees in multiprocessor and cyber-physical environments. His research interests include real-time response-time analysis (e.g., PROSA ), locking protocols for multiprocessor systems, side-channel mitigation in cloud environments, and the verification of real-time scheduling policies. He has contributed to foundational studies on deadline failure probabilities, self-suspending tasks, and predictable real-time Linux implementations. Scientific awards include recognition for outstanding papers on TimerShield (2017) Offline Equivalence (2017) . His work intersects with practical systems like LITMUSRT and ROS 2, aiming to bridge theoretical guarantees with real-world applications in safety-critical and distributed real-time systems.
Pardis Emami-Naeini is an Assistant Professor of Computer Science at Duke University, with joint appointments in the Sanford School of Public Policy and the Department of Electrical and Computer Engineering. She serves as the Director of the Duke Interdisciplinary Security, Privacy, and Interaction Research (InSPIre) lab and is a Duke Science and Technology Scholar. Her interdisciplinary work bridges computer science, public policy, and electrical engineering, with a focus on developing usable privacy and security solutions that empower individuals from diverse sociodemographic backgrounds. Dr. Emami-Naeini earned her Ph.D. in Computer Science from Carnegie Mellon University in 2020, followed by postdoctoral research at the University of Washington (2020-2022). Her research sits at the intersection of security, privacy, and human-computer interaction, with particular expertise in IoT security, technology-enabled abuse, reproductive health privacy, and smart city security. She has published extensively at flagship venues including IEEE S&P, CHI, CSCW, and SOUPS, with her work covered by major media outlets such as Wired and The Wall Street Journal. Her recent publications reveal a clear trajectory toward examining the human dimensions of security and privacy in emerging technologies, from LLM chatbots for mental health to social robots and period-tracking apps in the post-Roe v. Wade landscape. Her work consistently emphasizes the need for privacy-aware design that accounts for diverse user needs and contexts, particularly for vulnerable populations. Google Systems and ML Research Gift Award (2025) Google AI Research Scholar Program Award (2024) Top 5% Instructor in Duke Trinity College (2024) ORAU Ralph E. Powe Junior Faculty Enhancement Award (2023) Duke Science and Technology Scholar (2022) IEEE S&P paper highlighted in IEEE Security and Privacy Magazine (2021) CyLab Presidential Fellowship (2019) Dr. Emami-Naeini actively mentors several Ph.D. students including Jabari Kwesi, Jessie Cao, and Hiba Laabadli, as well as undergraduate and master's students. Her research has influenced key organizations including the National Institute of Standards and Technology (NIST), Consumer Reports, and the World Economic Forum in creating usable security and privacy labels for smart devices. She serves on numerous program committees including USENIX Security and CHI, and has participated in NSF grant review panels, demonstrating her growing leadership in the security and privacy community. Her InSPIre lab conducts user-centered research to uncover security and privacy needs of diverse stakeholders, with a particular focus on marginalized communities. The lab's work spans multiple domains including intimate partner violence, reproductive health, virtual reality, and smart cities, always with a strong emphasis on translating research findings into practical tools and policy recommendations.
Jan de Gier is a Professor at the School of Mathematics and Statistics, The University of Melbourne . He is also the Founding Director of MATRIX , Australia’s residential research institute in the mathematical sciences, and a former Deputy Director and Chief Investigator in the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS) . Additionally, he co-founded the Australian and New Zealand Association for Mathematical Physics (ANZAMP) in 2011 and served as its inaugural Chair. His research focuses on solvable lattice models at the intersection of mathematical physics and statistical mechanics . Key areas include the application of quantum integrability , algebraic structures like the Yang-Baxter equation, Hecke algebras, and quantum groups, as well as analytical methods such as complex analysis and elliptic curves. His work bridges pure and applied mathematics through connections between enumerative combinatorics , representation theory , and real-world phenomena like traffic flow modeling via exclusion processes . The 15 most recent articles reflect his expertise in integrable systems , non-equilibrium statistical mechanics , and algebraic combinatorics . Topics span Macdonald polynomials , stochastic duality , quantum spin chains , and traffic modeling , with methodologies involving matrix product forms , exact solutions , and critical phenomena analysis. He has contributed to editorial efforts through the AustMS Gazette and MATRIX Annals, and has been involved in public science communication via opinion pieces on mathematics funding and applications. His work emphasizes the importance of fundamental research in driving technological innovation, as highlighted in media articles discussing pi calculation , zero-knowledge proofs , and mathematics education .
Stanislaw Jarecki is an Associate Professor of Computer Science at the Donald Bren School of Information and Computer Sciences (ICS) at the University of California, Irvine (UCI). He joined UCI in 2003 after earning his Ph.D. in Computer Science from MIT in 2001 under Prof. Shafi Goldwasser. His research focuses on applied and distributed cryptography, with significant contributions to threshold cryptography, secure computation, and password-authenticated key exchange (PAKE) protocols such as OPAQUE, which secures 2 billion WhatsApp users. He also worked at Intertrust’s StarLab and Stanford’s applied cryptography group under Prof. Dan Boneh. Education: Ph.D., Massachusetts Institute of Technology, 2001. Research Interests: Distributed cryptography, secure multi-party computation, privacy-preserving protocols, threshold security, blockchain applications, and efficient cryptographic primitives. His work emphasizes practical solutions for real-world systems, including protocols resilient to server compromises and scalable encryption methods. Awards: 2023 IACR Fellow for contributions to distributed cryptography and efficient secure computation. Advising and Grants: Jarecki’s research has been supported by grants including NSF SaTC programs. He advises students on cryptographic protocol design and security mechanisms. His work on OPAQUE and CHIC protocols exemplifies his focus on bridging theoretical cryptography with practical implementation. Labs/Teams: Leads a research group focused on applied cryptography and security within ICS at UCI, collaborating on projects like secure computation, privacy-preserving data processing, and cryptographic protocol development.
Floris van Doorn is a Professor at the Mathematical Institute of the University of Bonn where he leads the Formalized Mathematics group. His research focuses on making it viable to formalize research mathematics in proof assistants that can check the correctness of such proofs. He primarily works with the Lean Theorem Prover and is a maintainer of its mathematical library (mathlib). University of Bonn: Professor (2023-present) University of Paris-Saclay: Postdoc with Patrick Massot (2021-2023) University of Pittsburgh: Postdoc with Tom Hales (2018-2021) Carnegie Mellon University: PhD under Jeremy Avigad and Steve Awodey (2013-2018) Van Doorn's research interests center on formalized mathematics, tools and automation for formalization, and homotopy type theory. He has made significant contributions to several major formalization projects including the Carleson project (proving Carleson's theorem), the sphere eversion project (formalizing Gromov's h-principle), the Flypitch project (formalizing the independence of the continuum hypothesis), and the Spectral sequences project. His work demonstrates that proof assistants can handle complex areas of mathematics beyond algebra, including differential topology and analysis. His recent publications show a consistent focus on advancing formalized mathematics, with his most recent work formalizing the Gagliardo-Nirenberg-Sobolev inequality and continuing the Carleson project. His publications span theoretical foundations of type theory, practical applications of formalization, and educational resources for learning proof assistants. Skolem award (2025) for the paper 'The Lean Theorem Prover (System Description)' Van Doorn actively mentors students and collaborators, with Maria, Michael, and Arend recently joining his formalization group in Bonn. He has taught various courses on formalized mathematics and proof assistants at the University of Bonn, University of Pittsburgh, and Carnegie Mellon University. His educational efforts include developing learning resources such as the Natural Number Game and the online book 'Mathematics in Lean.' He also maintains an active presence in the Lean community through the Formalized Mathematics group and collaborative projects like the Carleson project, which invites participation from those familiar with Lean.
Rosemary Monahan is a Professor in the Department of Computer Science at Maynooth University and an affiliate of the Hamilton Institute. She holds BSc and MSc degrees from University College Dublin and a PhD from Dublin City University. As Maynooth University's institutional lead for ADAPT (SFI Research Centre for AI-Driven Digital Content Technology), she focuses on advancing software dependability through formal methods and AI integration. Her research interests include safety-critical systems, dependable software, formal verification, and computational thinking education. She co-founded the VerifyThis competition series and leads projects such as MAIVV (Modular AI Verification and Visualisation) funded by SFI, and VALU3S (Verification and Validation of Automated Systems) funded by Horizon 2020. She has secured over €2.5M in EU funding for the Erasmus Mundus programs in dependable software systems. Monahan’s educational contributions include pioneering computational thinking resources (CoCoA and InSPECT projects) and teaching modules on software verification and rigorous software processes. She supervises PhD students in data science and advanced networks and collaborates with institutions like INRIA, Microsoft Research, and Amazon Web Services. Her professional roles include editorships in journals like Science of Computer Programming and leadership in conferences like iFM and FMICS. She actively promotes gender equality in computing through initiatives like INGENIC and TechMate toolkits.
Crystal Noel is an Assistant Professor at Duke University in the Pratt School of Engineering and Trinity College of Arts & Sciences , with appointments in both the Department of Electrical and Computer Engineering and Physics since 2022. She is also a Member of the Duke Quantum Center since 2024. Ph.D. in Electrical and Computer Engineering from University of California, Berkeley (2019) B.S. in Massachusetts Institute of Technology (2013) Her research focuses on quantum computing and simulation with trapped ions , integrated photonics for scalable trapped ion systems , and electric-field noise from surfaces . Recent work includes developing non-invasive mid-circuit measurement techniques, sympathetic cooling for ion chains, and cross-platform quantum state comparison. She has secured significant grants from National Science Foundation , Rochester Institute of Technology , and Defense Advanced Research Projects Agency for quantum co-design and networking projects. Her lab ( Noel Lab ) explores scalable quantum computing architectures and surface noise mitigation. She teaches courses ranging from foundational Fields and Waves: Fundamentals of Information Propagation to advanced topics in Quantum Engineering with Atoms and Advanced Topics in Electrical and Computer Engineering .
Alfredo Capozucca is a full permanent Researcher at the Department of Computer Science (DCS) within the Faculty of Science, Technology and Medicine (FSTM) at the University of Luxembourg. He holds a PhD in Computer Science from the University of Luxembourg (2010) and an M.S. from the National University of Rosario, Argentina (2003). His research focuses on modern software engineering methods, dependable systems, and computing education, with an emphasis on formal verification and sustainable computing practices. Capozucca has contributed to the design of courses at undergraduate and master's levels, including serving as Deputy Programme Director for the BSc in Computer Science from 2021-2024. His work bridges theoretical foundations with practical applications in education and industry. Research interests prominently include AI in education (e.g., ChatGPT's role in formal specification writing), formal verification techniques, and the integration of DevOps philosophies into academic curricula. He has authored numerous papers on topics ranging from security policy analysis to energy-efficient transactional models. Capozucca's contributions extend to open-source projects and tool development, such as the Messir UML requirements engineering tool. His teaching spans software engineering fundamentals, dependability, and modern DevOps practices, reflecting a commitment to aligning education with industry needs. Key professional roles include R&D engineer positions (2004-2006) and leadership in educational program design. His research infrastructure is based at the Maison du Nombre facility in Luxembourg. While no specific grants or awards are listed, his extensive publication record and teaching contributions highlight sustained academic engagement.
Gabriela V. Cohen Freue is an Associate Professor in the Department of Statistics at the University of British Columbia (UBC), Vancouver Campus, and holds a Canada Research Chair (CRC Tier 2). She leads an interdisciplinary research program focusing on developing robust statistical methodologies for analyzing high-dimensional data in genomics and proteomics, with applications in medical sciences. Her work addresses challenges such as outliers, collinearity, and measurement errors, with applications in biomarker discovery for diseases like multiple sclerosis, cardiovascular disorders, and asthma. Her academic journey includes collaborations across disciplines, including with the BC Cancer Agency, PROOF Centre of Excellence, and iCAPTURE. She has pioneered methods like the Penalized Elastic Net S-Estimator (PENSE) and contributed to proteomic data analysis tools such as the Protein Group Code Algorithm (PGCA). She also co-developed the MDQC quality control method for microarrays. Research interests include robust regression, biomarker development, and statistical methods for big data. Her team includes postdocs, PhD, and MSc students, with a focus on training in both statistical rigor and interdisciplinary collaboration. Notable grants include a CANSSI Collaborative Research Team Project (CRT) award for robust causal inference and prediction modeling. Teaching responsibilities span statistical consulting, high-dimensional biological data analysis, and generalized linear models. She emphasizes active learning and real-world problem-solving in her courses. Her lab’s work is supported by grants from the Data Science Institute (DSI) and collaborations with institutions like the PROOF Centre. Alumni of her group hold positions in academia (e.g., George Mason University) and industry (e.g., Merck, BC Cancer Research Centre).
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
Rishab Goyal is an Assistant Professor in the Computer Sciences Department at the University of Wisconsin-Madison , affiliated with the School of Computer, Data & Information Sciences . His research spans Cryptography , Computer Security , and Theoretical Computer Science , with a focus on post-quantum cryptography , lattice-based systems , and the policy implications of advanced cryptography . Research interests include secure systems with advanced capabilities and cryptographic proof systems. Teaching graduate and undergraduate courses in cryptography and theoretical computer science. His work on functional encryption , traitor tracing , and obfuscation has been published in top venues like CRYPTO, STOC, and FOCS. He has served on program committees for EUROCRYPT, TCC, PKC, FOCS, and ASIACRYPT. Scientific Awards : Invited to STOC 2018 special issue in SIAM Journal on Computing. Rishab collaborates with PhD students including Jiaqi Cheng , Abtin Afshar , and Saikumar Yadugiri , and hosts visiting researchers from institutions like GMU and IIT Madras.
