Alexandros G. Dimakis is a Professor at the University of California, Berkeley's Department of Electrical Engineering and Computer Sciences (EECS), College of Engineering. He is also Co-Director of the National AI Institute for Foundations of Machine Learning and Co-Founder of BespokeLabs.ai. PhD (2008) and Diploma (2003) in Electrical Engineering His research focuses on Generative AI , Information Theory , and Machine Learning . Recent work includes advancements in diffusion models, compressed sensing, and causal inference. His publications (150+) emphasize inverse problems, neural network verification, and generative model optimization. Recent publications highlight trends in Diffusion Models for inverse problems, Language Model Scaling , and 3D-Aware Generative Systems . Collaborative projects span biomedical applications, large-scale dataset curation (Datacomp-LM), and parameter-efficient model fine-tuning. Scientific Awards : IEEE Fellow (2022) James Massey Award (2018) NSF CAREER Award (2011) Google Research Faculty Award Best Paper awards at UAI workshops Eli Jury Dissertation Award (UC Berkeley) He advises PhD students in generative modeling, compressed sensing, and information theory. His research group collaborates with institutions like MIT, NYU, and IBM Research. Former students hold positions at Google, Amazon, and academic institutions like Purdue University.
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.
Stephen A. Vavasis is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo, part of the Faculty of Mathematics. He holds a PhD in Computer Science from Stanford University (1989) and has held academic positions at Cornell University (1989–2006) before joining Waterloo. His research focuses on continuous optimization, data science, first-order methods, scientific computing, and computational mechanics. Current teaching includes courses on convex optimization and portfolio optimization methods. He has served as Associate Dean of Computing (2017–2020) and Interim Director of Data Science graduate programs. His work is supported by NSERC grants. Notable awards include the Hertz Fellowship, Churchill Scholarship, and Guggenheim Fellowship. Vavasis's research emphasizes applications of optimization to clustering, machine learning, and fracture mechanics. His publications span convex optimization frameworks, algorithmic analysis of gradient methods, and numerical methods in mechanics. Recent work explores unifying analyses of first-order optimization algorithms and robust optimization techniques for high-dimensional data problems.
Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.
Jonathan Shihao Ji is an Associate Professor in the School of Computing at the University of Connecticut (UConn), leading the Intelligent Systems Lab. He holds a Ph.D. in Electrical and Computer Engineering from Duke University and previously served as an Associate Professor at Georgia State University and Director of the DoD Center of Excellence (CiARE). His research focuses on deep learning applications in computer vision, NLP, robotics, and high-performance computing, with over 50 publications in top venues like CVPR, NeurIPS, and IEEE journals. He has secured grants from NSF, NIH, DoD, and industry partners including VMware and Nvidia. His work emphasizes efficient algorithms for large-scale data processing, parameter-efficient model fine-tuning (e.g., VB-LoRA), and 3D perception benchmarks for UAVs (UAV3D). Notable contributions include sparse network optimization (Dep-L0), energy-based models (M-EBM), and robust defenses against adversarial attacks (Defense-VAE). He is a Senior Member of IEEE and has developed open-source tools like Parallel Word2Vec and WordRank. Recent projects include accelerating Llama2 models on FPGAs (LlamaF) and improving text-to-image synthesis via contrastive learning. His research spans theoretical advancements and practical applications, with industry collaborations in healthcare, robotics, and embedded systems.
Mathias Niepert is a Professor at the Institute for Artificial Intelligence within the Faculty of Computer Science, Electrical Engineering and Information Technology at the University of Stuttgart. His research focuses on advancing machine learning techniques with applications in scientific computing, graph neural networks, and medical imaging. He is particularly known for contributions to physics-informed neural networks, equivariant models, and graph learning frameworks. Key research areas include: Scientific Machine Learning for PDEs and molecular modeling Graph neural networks and their theoretical limitations Medical vision-language models and multimodal learning Efficient neural network architectures (transformers, FNOs) Domain knowledge integration in deep learning His work often bridges theoretical foundations with practical applications, as evidenced by extensive publications (2018–2025) on topics like adaptive message passing, equivariant networks, and medical imaging systems. He has contributed to benchmark development through initiatives like PDEBench and pioneered methods for equivariant diffusion models and molecular representation learning. His current projects emphasize: Improving generalization in Fourier Neural Operators Addressing oversmoothing in graph networks Combining physics principles with neural architectures Medical AI applications through multimodal fusion
Roy Dong is an Assistant Professor at the University of Illinois at Urbana-Champaign, affiliated with the Coordinated Science Laboratory. His research bridges Control Theory Economics Statistics Optimization to address challenges in cyber-physical systems and the Internet of Things, focusing on data manipulation, privacy, and strategic behavior in interconnected systems. His academic journey includes a Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (2017) and dual B.S. degrees in Economics and Computer Engineering from Michigan State University (2010). At Illinois, he teaches courses ranging from Control Systems to Convex Optimization , with multiple teaching excellence awards. Roy's research explores Closed-loop effects of machine learning Causality in decision systems Incentive design for strategic agents Privacy-utility tradeoff optimization Human behavior modeling with applications in smart grids, transportation networks, and semi-autonomous vehicles. His work formulates privacy-preserving mechanisms as optimization problems, balancing data utility against user privacy in dynamic systems. Article trends show expertise in Game theory for strategic data sources Energy disaggregation techniques Nonlinear basis pursuit algorithms Privacy-aware control systems with a focus on cyber-physical systems and human-in-the-loop applications. Scientific recognition includes 'Teacher Ranked as Excellent' awards (ECE 120, ECE 486, ECE 515) Contributions to smartSDH building control and CPRL compressive sensing Roy leads the Privacy-aware Control Systems research group, collaborating with institutions like UC Berkeley and Michigan State University , and directs projects funded by grants including the New USDA NIFA grant for agricultural robot autonomy .
Günter Rote is a Professor in the Department of Computer Science at Freie Universität Berlin, specifically within the Theoretical Computer Science group (Arbeitsgruppe Theoretische Informatik). He holds a formal academic title of Professor Dr. and is affiliated with the Faculty of Mathematics and Computer Science. His research focuses on theoretical computer science, computational geometry, algorithms, and discrete mathematics. Key research interests include geometric algorithms, optimization problems (e.g., shortest paths, traveling salesman problems), and algorithm design for parallel computing systems. His work spans topics such as systolic arrays, convex hulls, and combinatorial optimization. Rote’s contributions include foundational studies on computational geometry problems, algorithmic complexity, and practical applications in energy equity and infrastructure design. Publications highlight contributions to solving extremal equations, polygon transformations, and the quadratic assignment problem. He has been active in academic leadership, mentoring students, and contributing to computational science communities. His email is rote@inf.fu-berlin.de, and his office is located at Takustraße 9 in Berlin.
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 .
Ben Bloem-Reddy is an Assistant Professor in the Department of Statistics at the University of British Columbia (UBC), Vancouver Campus. His research focuses on statistical theory and applications in machine learning, particularly in causal inference, Bayesian methods, neural networks, and probabilistic models. He advises current students Quanhan (Johnny) Xi, Kenny Chiu, and Gian Carlo Diluvi. His work bridges foundational statistical theory with practical machine learning challenges, including causal discovery, model identifiability, and uncertainty quantification. Recent research explores topics such as latent variable models, generative processes, and symmetry in data and algorithms. His contributions span interdisciplinary areas like particle physics applications and information theory-based compression techniques. Ben’s research trends emphasize advancing theoretical guarantees for modern machine learning systems while addressing real-world problems. His publications frequently intersect with algebraic topology (e.g., cocycles in causal inference) and nonparametric methods. He maintains an active lab within the Department of Statistics, fostering collaborations across UBC’s academic ecosystem. No scientific awards are explicitly listed in the provided information. His advising and grant activities focus on statistical methodology development, as evidenced by his student supervision and published work. His office is located in ESB 3168, and he can be reached at benbr@stat.ubc.ca.
Hamid Krim is a Professor in the Department of Electrical and Computer Engineering at North Carolina State University. He leads the Vision, Information and Statistical Signal Theories and Applications (VISSTA) group, focusing on statistical signal/image analysis, data science, and machine learning. His prior roles include Research Scientist at MIT’s Laboratory for Information and Decision Systems and Member of Technical Staff at AT&T Bell Labs. He holds a Ph.D. in Electrical Engineering from Northeastern University, and degrees from the University of Washington and University of Southern California. Education: Ph.D., Electrical Engineering, Northeastern University (MA), 1990s Master's, Electrical Engineering, University of Washington Bachelor's, Electrical Engineering, University of Southern California and University of Washington Research Interests: Machine Learning, AI, Signal Processing, Communications, and Control Systems . His work bridges formal mathematical frameworks with applied problems, emphasizing generative AI, adversarial robustness, and subspace-driven data analysis. Recent innovations include Volterra neural networks and expansive synthesis techniques for data generation. Awards & Recognition: 2000 NSF CAREER Award 2008 IEEE Fellow 2019 IEEE SPS Sustained Impact Paper Award Multiple extended research invitations at top institutions globally Grants & Advising: Leads the VISSTA Lab, collaborating on projects like medical algorithm development (e.g., lung wheeze analysis) and hurricane activity prediction. His work spans interdisciplinary applications in healthcare, robotics, and defense systems. Labs & Teams: Director of the VISSTA Lab, fostering research in signal theory and machine intelligence. Collaborates with academia and industry on cutting-edge AI and sensor fusion technologies.
Chee-Ming Ting is an Associate Professor in the School of Information Technology at Monash University Malaysia. His expertise lies in machine learning, data science, and biomedical engineering, with a focus on signal processing, computational neuroimaging, and computer-aided detection. Previously, he held positions at King Abdullah University of Science and Technology (Research Scientist) and Universiti Teknologi Malaysia (Senior Lecturer). He has authored over 26 journal papers and 43 conference papers, and has secured research grants totaling RM2.5 million as PI/Co-PI. Education: PhD in Mathematics - Statistics, Master of Engineering in Electrical Engineering, and Bachelor of Engineering (Hons.) in Electrical & Electronics Engineering. Research interests include biomedical signal/image analysis, deep learning, spatio-temporal modeling, and neuroimaging applications for disease prediction and patient monitoring. He has supervised 9 graduate students (4 PhD, 5 Masters) and currently oversees 10 PhD candidates. Awards include the IEEE Signal Processing Society Malaysia's Research Excellence Award (2019, 2022) and several national/international innovation awards. His work contributes to UN Sustainable Development Goals related to health and technological advancement. Key projects include frameworks for neurological disease prediction using brain networks and generative adversarial networks for medical imaging enhancement.
Neil Shah is a Lead Research Scientist at Snap Inc., leading initiatives in user modeling, personalization, and trust and safety across Snapchat. His research focuses on advancing machine learning algorithms for large-scale structured data, including graph and sequential representations, with applications to recommendation systems and social platform security. PhD in Computer Science, Carnegie Mellon University (2017), advised by Christos Faloutsos B.S. in Computer Science, North Carolina State University Current research interests span: Graph Neural Networks (GNNs) for real-time inference and scalable training Cross-domain recommendation systems and generative modeling Test-time augmentation and hyperbolic geometry in representation learning Explainability methods for GNNs and fairness-aware outlier detection Recent publications highlight productionized GNN frameworks (GiGL), multimodal graph benchmarks, and novel approaches to link prediction and collaborative filtering. His work has appeared at top venues like KDD, ICLR, NeurIPS, and WWW. Scientific recognition includes: Outstanding Service Award at WSDM 2022 Best Paper Honorable Mention at CHI 2019
Lane A. Hemaspaandra (formerly Hemachandra) is a Professor at the Department of Computer Science, University of Rochester, New York. His academic career spans over three decades, with research focusing on computational complexity theory (especially structural complexity) and computational social choice theory . He holds a Ph.D. in Computer Science from Cornell University (1987) and has been recognized with prestigious awards such as the Friedrich Wilhelm Bessel Research Award from the Alexander von Humboldt Foundation and NSF Presidential Young Investigator (1989–1995). Education: B.S. in Computer Science and Mathematics & Physics, Yale University (1981) M.S. in Computer Science, Stanford University (1982) M.S. in Computer Science, Cornell University (1984) Ph.D. in Computer Science, Cornell University (1987) Hemaspaandra's research bridges theoretical computer science with political science and economics , particularly analyzing the computational complexity of election systems. His work includes foundational studies on Carroll/Dodgson voting , control complexity , and manipulative attacks in single-peaked societies. He has pioneered the use of complexity as a shield against election manipulation and control. The 15 most recent articles (2021–2024) span topics like backbone opacity , electoral control dichotomies , iterative constant-setting for complexity , and online bribery in sequential elections . These works often intersect with parameterized complexity , multi-agent systems , and game-theoretic models . Scientific Awards: AAAI Senior Member (2020–...) ACM Distinguished Scientist (2007–...) Alexander von Humboldt Foundation Renewed Research Stay (2018–2019) SIGACT Distinguished Service Prize (2013) Edward Peck Curtis Award for Undergraduate Teaching (2012) Hertz Foundation Fellowship (1982–1987) He has advised 15 Ph.D. students and postdocs, including prominent researchers like Prof. Piotr Faliszewski (AGH University) and Dr. Curtis Menton (Google). His NSF-funded projects explore complexity-theoretic approaches to election systems, and he has collaborated with institutions in Germany, Japan, and Poland.
Daniel Horsley is an Associate Professor and ARC Future Fellow at the School of Mathematical Sciences, Monash University. His research focuses on combinatorial designs and edge decomposition of graphs, with notable contributions to extremal graph theory, Zarankiewicz problems, and graph decomposition theorems. Current Role: ARC Future Fellow, Associate Professor Affiliation: School of Mathematical Sciences, Monash University Active Projects: 'The Zarankiewicz problem through linear hypergraphs and designs' (2022–2025), 'Edge decomposition of dense graphs' (2017–2022), and more Research interests span combinatorial designs, graph decomposition, and extremal combinatorics. His work emphasizes theoretical advancements in design theory, with applications in discrete mathematics and optimization. Recent articles address semi-inducibility, Zarankiewicz numbers, and embedding partial designs, reflecting his expertise in structural and extremal combinatorics. Key awards include the ARC Future Fellowship. His research outputs include over 57 publications in journals like Journal of Graph Theory , SIAM Journal on Discrete Mathematics , and European Journal of Combinatorics . Grant projects include collaborations with ARC, University of Queensland, and University of Melbourne, focusing on Steiner systems, compressed sensing, and combinatorial structure analysis. Advising PhD students and mentoring researchers in discrete mathematics and combinatorial design theory.
