Dmitri Strukov is a Professor at the University of California, Santa Barbara in the Department of Electrical and Computer Engineering. His work spans material science, electrical engineering, and computer science, focusing on novel computing paradigms using emerging memory devices. Education: PhD in Electrical and Computer Engineering from SUNY Stony Brook, MS in Applied Physics and Mathematics from Moscow Institute of Physics and Technology. Research Interests include neuromorphic computing , non-volatile memory applications , and mixed-signal circuits for machine learning and hardware security. His group develops memristive crossbar arrays and 3D NAND flash for energy-efficient systems. Scientific Leadership features Fellow of IEEE and Distinguished Lecturer roles. His work has been recognized with best paper awards at ASPLOS’19 and Computing Frontiers’13. Students: Mentored PhD graduates in neurocomputing, security, and memristor design including Z. Fahimi, S. Larimian, M.R. Mahmoodi, and X. Guo. Grants: Funded by AFOSR, ARO, DARPA, NSF, and industry leaders like Google and Samsung. Labs: Utilizes UCSB’s nanofabrication center and advanced tools for memristor characterization.
Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.
Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.
Yin Tat Lee is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington, and a Senior Principal Researcher in Microsoft AI. His research spans convex optimization , convex geometry , graph algorithms , online algorithms , and differential privacy , with applications in machine learning and theoretical computer science.
Jun-Kun Wang is an Assistant Professor at the University of California, San Diego (UCSD), with a joint appointment in the Department of Electrical and Computer Engineering and the Halicioğlu Data Science Institute. He joined UCSD in July 2023, previously serving as a postdoc at Yale University. His research focuses on optimization, sampling, and machine learning, emphasizing acceleration techniques and theoretical guarantees. He explores connections between optimization and areas like no-regret learning, sampling, and hypothesis testing. Education: PhD in Computer Science from Georgia Tech (advised by Jacob Abernethy), M.S. in Communication Engineering and B.S. in Electrical Engineering from National Taiwan University. Research Interests: Acceleration in optimization and sampling, trustworthy machine learning, momentum methods, and algorithmic convex optimization. His work bridges theoretical foundations and practical applications, with publications in top-tier venues like COLT, ICML, ICLR, and NeurIPS. Teaching: Courses include ECE 174 (Linear/Nonlinear Optimization), ECE 273 (Convex Optimization), and DSC 211 (Optimization). His lectures cover topics such as gradient descent, duality theory, mirror descent, and non-convex optimization. Lab/Team: Leads the Optimization and Machine Learning Group, advising PhD students Can Chen and Maria-Eleni Sfyraki, and MS student Yi Liu. His group focuses on theoretical and applied aspects of optimization algorithms.
Dr. Angela Siegel is an Assistant Professor and Assistant Dean, Academic Outreach in the Faculty of Computer Science at Dalhousie University, Halifax, Canada. She is actively involved in both academic leadership and research. Education: Ph.D. in Mathematics (Combinatorial Game Theory), Dalhousie University, 2011 M.Sc. in Mathematics, Dalhousie University, 2005 B.Sc. in Mathematics & Marine Geophysics, 1997 Her research focuses on combinatorial game theory, graph theory, discrete mathematics, and number theory, with a strong emphasis on computer science education and inclusive teaching . She investigates the challenges students face when transitioning into computer science programs, aiming to improve pedagogical approaches and support systems. Her work bridges theoretical mathematics and practical educational innovation. The recent publications highlight a dual focus: theoretical contributions to combinatorial games (e.g., partizan games, placement games, geography variants) and applied research in computing education, particularly student transition and inclusive practices. Her interdisciplinary work spans mathematics, computer science, and educational theory. Scientific Awards: Dr. Siegel has supervised and collaborated with students and researchers on topics including student transition into higher education computing, LEGO-based pedagogy, and workplace readiness. While no specific grants are listed, her repeated presentations and publications suggest active research funding and scholarly engagement. She has contributed to major conference proceedings and book volumes such as Games of No Chance . She is associated with research teams focused on combinatorial games and computer science education innovation, often collaborating with scholars like Richard Nowakowski, Neil McKay, and Mark Zarb. Her work in inclusive teaching and student support reflects a commitment to building accessible and equitable learning environments in computing.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.
Prof. Dr.-Ing. Rüdiger Daub serves as Professor and Chair of Production Engineering and Energy Storage Systems at the Technical University of Munich (TUM), operating within the Department of Mechanical Engineering. His leadership encompasses research direction, academic supervision, and strategic development of battery production technologies at TUM's Garching campus (Boltzmannstr. 15), with active industry collaborations driving innovation in sustainable manufacturing. Daub's research program pioneers advanced production methodologies for lithium-ion and solid-state batteries, focusing on electrode manufacturing, electrolyte filling, and cell assembly processes. His work investigates critical parameter interdependencies affecting battery safety and performance, developing inline monitoring systems and digital twin technologies for real-time process optimization. Key contributions include moisture control in electrode production, electrochemo-mechanical characterization of solid-state systems, and robotics solutions for deformable object assembly, all integrated with machine learning for quality assurance in industrial settings. Analysis of his 2023-2025 publications reveals a dominant research trajectory toward solving production bottlenecks in next-generation energy storage. The work demonstrates increasing integration of computational modeling with empirical validation, particularly in solid-state battery manufacturing and high-voltage electrolyte systems. A notable trend is the cross-pollination of robotics, computer vision, and uncertainty quantification techniques to address complex assembly challenges and distribution shifts in quality monitoring, reflecting industry's urgent need for adaptable, data-driven production systems. Leading TUM's specialized laboratories for battery cell production, Daub's team maintains comprehensive facilities for electrode calendering, electrolyte filling, and cell assembly with integrated tracking and tracing capabilities. The research infrastructure supports collaborative projects with automotive OEMs and battery manufacturers to develop scalable production processes, emphasizing environmental sustainability through water-based electrode production and footprint optimization. Current initiatives focus on digital factory modeling and prelithiation technologies for next-generation battery systems.
Michal Kolesár is a Professor in the Department of Economics at Princeton University , holding this position since July 2020. Previously, he served as Assistant Professor (2014-2020) with dual appointments in Economics and the Woodrow Wilson School (2018-2020), and as Visiting Assistant Professor at MIT (2016-2017). His research focuses on econometrics , particularly causal inference , instrumental variables , nonparametric regression , and robust statistical methods . His work addresses fundamental challenges in high-dimensional data analysis, treatment effect heterogeneity, and finite-sample inference validity. Current projects include developing bias-aware methods for regularized regression and analyzing dynamic causal effects in nonlinear systems. Kolesár's recent publications reveal a strong emphasis on methodological rigor with practical applications. His work spans instrumental variable techniques (addressing contamination bias, weak identification), regression discontinuity designs (discrete running variables, measurement error), and high-dimensional inference (sparsity fragility, honest confidence intervals). Key recurring themes include finite-sample optimality, coverage probability guarantees, and robustness to model misspecification. Fellow of the International Association for Applied Econometrics (2023) Journal of Econometrics best associate editor award (2023) Sloan Research Fellowship (2019) NSF grants for high-dimensional data inference (2021-2025) and nonparametric regression (2016-2019) Graduate Economics Club teaching awards (2017, 2018) As an educator, Kolesár teaches advanced econometrics courses at both undergraduate (ECO 312, ECO 313) and graduate levels (ECO 517, ECO 519, ECO 539b). He serves as Co-editor of the Journal of Business & Economic Statistics (2024-2027) and sits on editorial boards of Econometrica , American Economic Journal: Applied Economics , and others. His professional activities include extensive peer review for top journals and organization of major econometrics conferences including the 2026 Econometric Society Winter Meeting.
Chandra Chekuri is the Paul and Cynthia Saylor Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign, situated within the Grainger College of Engineering. He has been actively contributing to theoretical computer science for over two decades, with significant leadership roles including serving as Editor-in-Chief of the prestigious SIAM Journal on Computing since May 2025. His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras in 1993, followed by a Ph.D. in Computer Science from Stanford University in 1998. Prior to joining UIUC, he spent eight years as a Member of Technical Staff at Bell Labs, Lucent Technologies. Chekuri's research focuses on theoretical computer science with particular emphasis on the design and analysis of algorithms, discrete and combinatorial optimization, approximation algorithms, mathematical programming, and graph theory. His work explores fundamental connections between discrete structures and optimization problems, with applications spanning network design, data analysis, and computational complexity. His recent publications demonstrate a continued focus on hypergraph algorithms, submodular function optimization, and graph partitioning problems, showing how theoretical insights can yield practical algorithmic improvements. His approach often combines continuous relaxations with discrete rounding techniques to develop approximation algorithms for NP-hard problems. As Editor-in-Chief of SIAM Journal on Computing, Chekuri leads one of theoretical computer science's most respected publications, which covers analysis and design of algorithms, algorithmic game theory, computational complexity, and other mathematical aspects of computer science. His editorial leadership follows previous service as Associate Editor for several major journals including SIAM Journal on Computing, Mathematics of Operations Research, and Mathematical Programming. ACM Fellow (January 2024) Scott Fisher Teaching Award (for year 2022-23) from CS Department Chekuri has advised numerous PhD students to completion, including Kent Quanrud, Vivek Madan, Shalmoli Gupta, and Chao Xu, with several currently in progress such as Tanvi Bajpai, ElFarouk Harb, Rhea Jain, and Weihao Zhu. His teaching portfolio includes graduate courses on Randomized Algorithms, Approximation Algorithms, Algorithms for Big Data, and Combinatorial Optimization. He has served as Director of the Graduate Program in the Department of Computer Science from May 2014 to August 2017, demonstrating significant administrative leadership within the department.
James Bremer is a Professor in the Department of Mathematics and holds a cross-appointment in the Department of Computer and Mathematical Sciences at the University of Toronto's Scarborough campus. His research focuses on developing efficient numerical algorithms for solving elliptic boundary value problems, integral equations, and special function transforms.
Chaitanya Swamy is a Professor and University Research Chair in the Department of Combinatorics & Optimization at the University of Waterloo, Canada. His primary affiliation is within the Faculty of Mathematics, and he holds positions in both the Department of Combinatorics & Optimization and the School of Computer Science. He obtained his Ph.D. in Computer Science from Cornell University under the supervision of David Shmoys, followed by postdoctoral research at Caltech's Center for the Mathematics of Information. Swamy’s research focuses on algorithms, particularly in combinatorial optimization, approximation algorithms, algorithmic game theory, stochastic optimization, network design, scheduling, and online algorithms. His work spans theoretical contributions and practical applications, including algorithm design for facility location, network routing, and mechanism design. He has contributed to foundational results in approximation algorithms, such as the development of primal-dual methods and LP-rounding techniques. Swamy has held significant editorial roles, including as an associate editor for Discrete Optimization and SIAM Journal on Computing . He has organized major conferences like CanaDAM 2021 and sessions at ISMP 2018. His teaching record includes courses on combinatorial optimization, scheduling, and algorithmic game theory. He has advised numerous Ph.D. and Master’s students, many of whom have gone on to prestigious academic and industry positions. Swamy’s research has been recognized through awards for his students, including the University of Waterloo Alumni Gold Medal. He actively contributes to the academic community through committee work for conferences like STOC, APPROX, and SODA, and his publications reflect a deep engagement with both theoretical and applied aspects of algorithms and optimization.
Benedikt Bünz is an Assistant Professor of Computer Science at New York University's Courant Institute of Mathematical Sciences. He is also a co-founder and chief scientist of Espresso Systems, where he applies his research expertise to real-world blockchain solutions. His academic work bridges theoretical cryptography with practical blockchain implementations, focusing on enhancing privacy, security, and usability of decentralized systems. Dr. Bünz's research centers around applied cryptography, consensus mechanisms, and game theory as they relate to cryptocurrencies. His work spans zero-knowledge proofs, verifiable delay functions, secure multi-party computation, and privacy-preserving protocols. He has made significant contributions to Bulletproofs, a zero-knowledge proof system deployed on blockchains like Monero, and pioneered research in verifiable delay functions which are now part of Ethereum 2.0's design. His recent work focuses on recursive proof systems, accumulation schemes, and efficient verification techniques for blockchain scalability. His publication record shows a consistent progression from foundational cryptographic primitives to practical blockchain implementations. Recent work demonstrates increasing sophistication in recursive proof systems (ProtoStar, HyperPlonk), novel accumulation techniques (ARC, DewTwo), and foundational work on randomness generation (VDFs). His research consistently bridges theoretical cryptography with real-world blockchain applications, resulting in protocols that are both theoretically sound and practically implementable across multiple blockchain platforms. Dr. Bünz actively contributes to the academic community through teaching and mentorship. He teaches courses on cryptography of blockchains and computer security at NYU, providing students with hands-on experience in blockchain security and cryptographic protocols. His industry engagement through Espresso Systems demonstrates his commitment to translating academic research into practical solutions for the blockchain ecosystem.
Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.
