Find Academic Supervisors

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 more

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

Florian KerschbaumView profile

Professor

• Data security and privacy
• Confidentiality and integrity in data science
• Applied cryptography
• +4 more

Florian Kerschbaum is a Professor and NSERC/RBC Industrial Research Chair in Data Security at the Cheriton School of Computer Science, University of Waterloo. His research focuses on data security and privacy, applied cryptography, and confidentiality in data science. Research interests span data collection/preparation management, secure multi-party computation, homomorphic encryption, differential privacy, and machine learning robustness/privacy. His work develops cryptographic solutions for practical data management challenges in distributed systems.

• Cryptography
• Post-Quantum Cryptography
• Elliptic Curve Cryptography
• +3 more

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.

Aaron SmithView profile

Associate Professor

• Applied Probability
• Computational Statistics
• Monte Carlo Methods
• +3 more

Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.

Benjamin LandonView profile

Assistant Professor

• Probability
• Mathematical physics
• Random matrix theory
• +3 more

Benjamin Landon is an Assistant Professor in the Department of Mathematics at the University of Toronto, where he has been faculty since 2021. His office is located in the Bahen Centre for Information Technology, Room 6264. Prior to joining the University of Toronto, he was a CLE Moore Instructor at the Massachusetts Institute of Technology from 2018-2021. Education: PhD in Mathematics, Harvard University (2018). Advisor: Horng-Tzer Yau M.Sc. in Mathematics, McGill University (2013). Advisors: Vojkan Jaksic and Robert Seiringer B.Sc., McGill University (2012) Dr. Landon's research focuses on Probability and Mathematical Physics, with particular expertise in Random Matrix Theory. His work spans various aspects of spectral statistics, eigenvalue distributions, and universality phenomena in random matrix ensembles. He has made significant contributions to understanding the behavior of extremal eigenvalues, linear spectral statistics, and connections to other areas of mathematical physics such as spin glasses and the KPZ universality class. His research often involves developing novel analytical techniques to establish precise asymptotic behavior in complex random systems. Analysis of Dr. Landon's publication record reveals a strong focus on the intersection of probability theory and mathematical physics. His work consistently explores universality phenomena across different random matrix ensembles and related stochastic systems. A notable trend is his investigation of connections between random matrix theory and other areas of mathematical physics, particularly spin glass models and the KPZ equation. His research demonstrates both technical depth in establishing rigorous asymptotic results and breadth in connecting seemingly disparate areas of mathematical physics.

Olga VekslerView profile

Professor

• Computer Vision
• Machine Learning
• Deep Learning
• +6 more

Olga Veksler is a Professor at the University of Waterloo's Department of Computer Science, part of the Faculty of Mathematics. She holds a Ph.D. and M.Sc. from Cornell University (1999) and a B.A. from New York University (1995). Her research focuses on computer vision, machine learning, and discrete optimization, with notable contributions to image segmentation, graph algorithms, and deep learning integration. Her work emphasizes semantic segmentation, salient object detection, and efficient optimization techniques for graphical models. Education: Ph.D. in Computer Science, Cornell University, 1999 M.Sc. in Computer Science, Cornell University, 1999 B.A. in Computer Science, New York University, 1995 Her research explores intersections between machine learning and traditional computer vision challenges, particularly leveraging graph-based optimization and CRF models. Recent trends in her work include weakly supervised learning, sparse non-local CRF applications, and test-time adaptation strategies for salient object detection. She has pioneered methods for shape priors in multi-object segmentation and efficient graph-cut algorithms. Her advising and grant activities are foundational to her research, though specific grant details are not listed here. She maintains a lab focused on advancing computer vision through algorithmic innovation, with contributions to both theoretical frameworks and practical applications in medical imaging and scene understanding.

• Sublinear-time algorithms
• Error-correcting codes
• Computational complexity
• +3 more

Elena Grigorescu is a Professor at the University of Waterloo, Department of Computer Science. She holds a Ph.D. from the Massachusetts Institute of Technology (2010), an M.S. from MIT (2006), and a B.A. from Bard College (2004). Her research focuses on sublinear-time algorithms, error-correcting codes, computational complexity, and learning theory. She explores foundational aspects of algorithms with constraints on time/space, privacy-preserving computation, and applications in graph theory and optimization. Her work includes advancements in spanner algorithms for network design, differential privacy in sublinear-time settings, and learning-augmented approaches for online optimization. Recent publications address trace reconstruction, privacy-utility trade-offs, and combinatorial optimization techniques. Grigorescu is actively involved in conferences like APPROX/RANDOM and IEEE Foundations of Computer Science, contributing to algorithmic theory and practical implementations. Her research emphasizes theoretical rigor while addressing real-world challenges in data analysis and distributed systems. No awards or formal advisees are explicitly listed in the provided information.

• Number Theory
• Arithmetic Geometry
• Shimura Varieties
• +5 more

Eyal Z. Goren is a Professor in the Department of Mathematics and Statistics at McGill University. His research focuses on arithmetic geometry, including studies of Shimura varieties, modular forms, complex multiplication, expander graphs, arithmetic dynamics, and mathematical cryptography. He is affiliated with the Centre Interuniversitaire en Calcul Mathématique Algébrique (CICMA), a Montreal-based group in number theory. Goren’s work bridges pure mathematics and applications in cryptography, with notable contributions to the theory of supersingular elliptic curves and cryptographic hash functions derived from expander graphs. Education : PhD in Mathematics from the Hebrew University of Jerusalem (1996), advised by Ehud De Shalit. Teaching : Teaches advanced courses such as Higher Algebra I/II, Algebra 1/2/3/4, Number Theory, and specialized topics like Unlikely Intersections. Affiliations : Active member of CICMA and the CRM (Centre de Recherches Mathématiques), collaborating on seminars and research initiatives. Research Interests : Goren’s work emphasizes the interplay between number theory and geometry, with recent focus on p-adic dynamics, canonical subgroups, and Faltings heights. His studies on Picard modular forms and Shimura varieties explore geometric structures in positive characteristic and their arithmetic implications. Publications : Over 40 articles in leading journals, including Inventiones Mathematicae , Compositio Mathematica , and Journal für die reine und angewandte Mathematik . His book Lectures on Hilbert Modular Varieties and Modular Forms is a key resource in the field. Grants and Collaboration : Engaged in collaborative projects on expander graphs, post-quantum cryptography, and the geometry of abelian varieties with complex multiplication. His research is supported by grants from the NSERC and other agencies.

Ismail Ben AyedView profile

Associate Professor

• Computer vision
• Optimization
• Medical image analysis
• +1 more

Ismail Ben Ayed is an Associate Professor at École de technologie supérieure (ETS) in Montreal, Canada, holding the ETS Research Chair on Artificial Intelligence in Medical Imaging. His research bridges computer vision, optimization, and medical image analysis to develop advanced algorithms for clinical applications, with particular focus on cardiac and neurological imaging. His research program centers on medical image segmentation using novel optimization techniques, graph-based methods, and deep learning models. He pioneers approaches for handling volumetric bias, shape compactness, and distribution matching in MRI and cardiac imaging, directly addressing clinical challenges in spine labeling, ventricle segmentation, and tumor detection. His work emphasizes mathematical rigor combined with practical medical relevance. Analysis of his 15 most recent publications (2014-2017) reveals dominant themes in medical image segmentation (80% of works), particularly for cardiac MRI (35%) and neurological applications (25%). Key methodological contributions include distributed optimization frameworks (20%), advanced graph cut techniques (30%), and deep learning architectures (25%), published consistently in top-tier venues including CVPR, MICCAI, and TPAMI. His scientific recognition includes: MICCAI travel award (2017) Outstanding Reviewer Award at CVPR (2015) GE innovation award (2010) He actively mentors researchers as evidenced by his recruitment of PhD students and postdocs, with research supported by the ETS Research Chair and multiple patents. His service includes chairing MICCAI 2017/2015 and IPTA 2017, plus continuous program committee roles at CVPR, ICCV, and MICCAI since 2011. Leading the ETS Research Chair on AI in Medical Imaging, he directs a collaborative team working on clinical translation of computer vision techniques. Current projects focus on cardiac motion analysis, brain tumor segmentation, and spine labeling systems with direct applications in radiology workflows.

Daniel M. RoyView profile

Professor

• Machine Learning
• Statistics
• Probabilistic Programming
• +7 more

Daniel M. Roy is a Professor at the University of Toronto with cross-appointments in the Departments of Computer Science and Electrical and Computer Engineering. He serves as Associate Chair, Statistics, and is a Research Director at the Vector Institute and a CIFAR Canada AI Chair. His research focuses on foundational principles of prediction, inference, and decision-making under uncertainty, spanning machine learning, statistics, mathematical logic, applied probability, and computer science. He has contributed to learning theory, statistical network analysis, probabilistic programming, and Bayesian nonparametric statistics. Education: Ph.D. in Computer Science from MIT (2011), advised by Leslie Kaelbling. Postdoctoral fellowships at the University of Cambridge (Newton International Fellow and Research Fellow). His research explores information theories of learning , online learning , and nonstandard foundations for decision theory . Recent work includes best paper awards at ICML 2024 and advancements in probabilistic programming systems like Church. His publications address problems in generalization bounds, causal bandits, neural network theory, and exchangeable random structures. Scientific Awards include the MIT/EECS George M. Sprowls Doctoral Dissertation Award and the ICML 2024 Best Paper Award. He advises students and postdocs across statistics, computer science, and machine learning, with alumni now holding positions at institutions like Princeton, Imperial College London, and the University of Chicago.

Gourab RayView profile

Associate Professor

• Probability Theory
• Statistical Physics
• Stochastic Processes
• +3 more

Gourab Ray is an Associate Professor in the Department of Mathematics and Statistics at the University of Victoria, Faculty of Science. He holds a PhD from the University of British Columbia, Vancouver. His research focuses on the intersection of probability theory, geometry, and mathematical physics, particularly large-scale patterns in stochastic models inspired by physics. Key areas include random planar maps, random walks, lattice spin models, dimer models, Gaussian free field properties, and Liouville quantum gravity. Recent work emphasizes establishing Gaussian free field-like behaviors in dimer models across various graphs and surfaces. He teaches courses such as MATH 236: Introduction to Real Analysis and MATH 555: Topics in Probability. His publications span leading journals including Inventiones Mathematicae , Annals of Probability , and Probability Theory and Related Fields . Notable contributions include studies on unimodular hyperbolic triangulations, half-planar map classifications, and conformal invariance in dimer models. No specific awards are listed for Dr. Ray, though his work has been recognized in peer-reviewed venues. He actively contributes to academic service, including roles on graduate committees and research collaborations. His research group engages with theoretical and applied aspects of probability theory, often bridging discrete and continuous mathematical frameworks.

Shahrokh ValaeeView profile

Professor

• Wireless Networks
• Signal Processing
• Vehicular Networks
• +4 more

Shahrokh Valaee is a Professor and Associate Chair for Undergraduate Studies in the Edward S. Rogers Sr. Department of Electrical and Computer Engineering at the University of Toronto, part of the Faculty of Applied Science and Engineering. He founded and directs the Wireless and Internet Research Laboratory (WIRLab). Education: BSc and MSc in Electrical Engineering from University of Tehran PhD in Electrical Engineering from McGill University Research Interests: Focuses on wireless networks (vehicular/sensor networks, B5G/6G), signal processing (indoor localization, machine learning for medical imaging), and integrated sensing/communication. His work spans: Localization in GPS-denied environments Machine learning for healthcare with limited/imbalanced data Reconfigurable Intelligent Surfaces (RIS) and drone networks Publications: Recent articles (2014-2016) show strong focus on indoor localization techniques, vehicular network protocols, and network coding, with emerging trends in machine learning applications for wireless systems and healthcare. Awards: Connaught Award (2012, 2013) NSERC Discovery Accelerator Award (2010) MaRS Innovations cPOP Award (2012) IEEE Fellow (FIEEE) Engineering Institute of Canada Fellow (FEIC) Leadership: Advises graduate students at WIRLab, where research combines theory with practical implementation (GPU-based ML, Android localization). Manages projects in integrated sensing/communication, ML for health, and B5G networks. Labs/Teams: Directs WIRLab with focus on wireless signal processing, networking, and ML implementations. Current team includes postdocs and PhD students working on localization, B5G networks, and medical ML applications.

Michael MolloyView profile

Professor

• Graph Theory
• Probabilistic Method
• Random Graphs
• +2 more

Michael Molloy is a Professor in the Department of Computer Science at the University of Toronto, with a cross-appointment to the Department of Computer and Mathematical Sciences at the University of Toronto Scarborough (UTSC). He teaches courses in Discrete Mathematics and the Probabilistic Method, including CSC/MAT A67 and CSC2427/MAT1500 . Research Focus: Graph Theory, Probabilistic Methods, Random Graphs, Constraint Satisfaction Problems, and Markov Chain analysis. His work includes foundational contributions to graph coloring, such as adaptable/conflict coloring and correspondence coloring, and exploring phase transitions in random graphs. He has supervised numerous graduate students, including Lora Hrisch, Jurgen Aliaj, and Hamed Hatami, advancing combinatorial and algorithmic research. Recent publications analyze random graph processes, the freezing threshold for k-colorings, and the resolution complexity of constraint satisfaction problems. These studies intersect theoretical computer science, combinatorics, and probabilistic modeling, often revealing deep structural insights through rigorous mathematical proofs.

Benjamin Bloem-ReddyView profile

Assistant Professor

• Statistics
• Machine Learning
• Probabilistic Modeling
• +4 more

Benjamin Bloem-Reddy is an Assistant Professor of Statistics at the University of British Columbia (UBC), affiliated with the Department of Statistics within the Faculty of Science. His research focuses on probabilistic approaches in statistics and machine learning, emphasizing symmetry, causality, and model-driven scientific knowledge acquisition. Prior to UBC, he completed his PhD under Peter Orbanz at Columbia University and a postdoc with Yee Whye Teh at the University of Oxford. He holds a physics background from Stanford and Northwestern Universities. Education: PhD in Statistics, Columbia University Postdoctoral Research, CSML Group, University of Oxford Physics degrees from Stanford and Northwestern Universities Research Interests: Bloem-Reddy explores symmetry in modeling and inference, causal discovery, and integrating scientific models with statistical frameworks. His work includes developing hypothesis tests for symmetry, causal inference via cocycles, and leveraging invariance properties in neural networks. He collaborates with scientists to apply statistical methods to domain-specific problems. Awards: Best Student Poster Award at NeurIPS 2014 Workshop on Networks Teaching & Advising: He teaches courses like STAT 460/560 (Statistical Inference) and advises a vibrant research group. His students include Boyan Beronov, Kenny Chiu, and Johnny Xi. He emphasizes recruiting curious, mathematically skilled students aligned with his research themes. Grants & Funding: Supported by NSERC, CANSSI, and UBC, with computational resources from ARC at UBC.

Anthony QuasView profile

Professor

• Ergodic Theory
• Dynamical Systems
• Symbolic Dynamics
• +7 more

Anthony Quas is a Professor in the Department of Mathematics and Statistics at the University of Victoria, Canada. He holds a PhD from the University of Warwick and has held academic positions at institutions including the University of Memphis and King's College, Cambridge. His research focuses on ergodic theory and dynamical systems, with contributions to multiplicative ergodic theory, Lyapunov exponents, and symbolic dynamics. Education: B.A. in Mathematics (First Class), Cambridge University (1986–1989) Certificate of Advanced Study in Mathematics (Distinction), Cambridge University (1989–1990) PhD in Mathematics, University of Warwick (1990–1994) Research Interests: Ergodic theory and its connections to stochastic processes Lyapunov exponents and operator cocycles Symbolic dynamics and shift spaces Applications to percolation theory and information theory Publications and Grants: Over 70 peer-reviewed articles, including work on multiplicative ergodic theorems and metastable systems Recipient of NSERC and NSF grants, and former Canada Research Chair (2005–2014) Editor for Dynamical Systems: An International Journal Awards and Recognition: Tyson Medal (1990) Cambridge Smith Prize (1992) Organizer of international workshops and conferences (e.g., Banff International Research Station) Teaching and Service: Supervised multiple PhD and Master’s students Contributed to outreach initiatives like Pi in the Sky magazine Served on NSERC Grant Selection Committees and editorial boards