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.
Alexandre Bouchard-Côté is a 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 computational statistics, Bayesian methods, and Monte Carlo techniques, with applications in evolutionary biology, cancer genomics, and computational linguistics. Education : PhD in Computer Science (with Designated Emphasis in Statistics) from UC Berkeley (2010), BSc in Mathematics and Computer Science from McGill University (2005). Affiliations : Director of the Blang probabilistic programming project and leader of the Bouncy Particle Sampler research group. Research Interests : Bouchard-Côté develops scalable Bayesian computational methods, including non-reversible Monte Carlo algorithms like the Bouncy Particle Sampler, and applies these to problems in cancer phylogenetics, evolutionary dynamics, and historical linguistics. His work emphasizes bridging theoretical foundations with practical tools for data science. Publications Trends : Recent work spans distributed sampling frameworks (e.g., Pigeons.jl), variational phylogenetic inference, and cancer clonal evolution modeling. His articles often address algorithmic scalability and interdisciplinary applications in biology and astronomy. Awards : CRM-SSC Prize in Statistics (2024) PIMS-UBC Mathematical Sciences Young Faculty Award (2018) Tweedie New Researcher Award (2016) Advising & Grants : Supervises graduate students (e.g., Son Luu, Nikola Surjanovic) and leads funded projects on distributed MCMC and cancer genomics. Collaborates with institutions like the Simons Foundation and the Canadian Statistical Sciences Institute (CANSSI). Labs/Teams : Core member of the UBC Statistical Machine Learning group, contributing to open-source tools like Blang and the Bouncy Particle Sampler implementation.
Kimon Fountoulakis is an Associate Professor at the University of Waterloo. His research focuses on Machine Learning on Graphs and Numerical Optimization, with a strong emphasis on algorithmic methods for graph-structured data. He holds a Ph.D. from The University of Edinburgh (2015), an M.Sc. from The University of Edinburgh (2010), and a B.Sc. from Athens University of Economics and Business (2009). His work spans theoretical foundations and practical applications in graph algorithms, optimization, and machine learning. Research interests include graph neural networks, local graph clustering algorithms, and algorithmic reasoning. His contributions address challenges in graph representation learning, message-passing architectures, and scalable optimization methods. Notable themes in his publications include improving counting abilities of vision-language models, analyzing graph convolutions, and developing flow-based clustering techniques with statistical guarantees. His work often bridges theory and practice, with applications in network analysis, pandemic containment strategies, and high-performance computing. While no specific grants or awards are listed, his research demonstrates significant contributions to graph-based machine learning and optimization. He maintains a research group at the University of Waterloo, with a focus on developing open-source tools and frameworks for graph algorithms. His lab’s work emphasizes local graph clustering methods and their scalability in real-world networks.
Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.
Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.
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.
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.
Manish Verma is Professor of Operations Management and Associate Dean, Graduate Studies at the DeGroote School of Business, McMaster University. His academic journey began with an MBA and PhD in Business Administration with Operations Management/Management Science specialization from Desautels Faculty of Management at McGill University. Dr. Verma's research focuses on multimodal transportation of dangerous goods, risk assessment, network design and planning in transportation, humanitarian logistics, green supply chain management, and disruption/resilience in transportation systems. His current research engagements center on safety and security issues in freight transportation and humanitarian logistics, funded by NSERC and SSHRC grants. He has been frequently approached by media to comment on railroad accidents involving dangerous goods. An analysis of his recent publications reveals a strong emphasis on hazardous materials transportation risk management, with significant contributions to rail-truck intermodal systems, hazmat risk modeling using value-at-risk methodologies, and emergency response planning for transportation networks. His work bridges theoretical operations research with practical transportation safety applications. $245K research grant for rail safety research from Government of Canada As an educator, Dr. Verma has taught courses including Predictive Analytics for Managers, Network Design Issues in Freight Transportation, and Management Science Research Issues. His scholarly impact is evidenced by publications in leading journals such as Transportation Research Part E, European Journal of Operational Research, and Safety Science. He actively contributes to real-world transportation safety through media commentary and research that informs policy decisions regarding dangerous goods transportation.
Minsu Kim is a CIFAR AI Safety Post-doc Fellow at KAIST and Mila, collaborating with Prof. Yoshua Bengio, Prof. Sungjin Ahn, and Prof. Sungsoo Ahn. His work bridges System 2 Deep Learning, Bayesian posterior inference, and combinatorial optimization. Ph.D., Industrial Engineering, KAIST (2025) M.S., Electrical Engineering, KAIST (2022) B.S., Mathematics and Computer Science (Dual Degree), KAIST (2020) Kim's research focuses on enabling AI systems to measure uncertainty, represent causality, and perform sequential reasoning for safety-guaranteed planning. His methodology integrates GFlowNets and diffusion models with off-policy amortized inference, targeting applications in scientific discovery , hardware design optimization , and large language model alignment . Recent work explores Bayesian posterior inference through GFlowNets, aiming to unify deep learning with probabilistic reasoning. His 15 most recent publications (2025–2024) reveal a trend of combining combinatorial optimization with generative models for tasks like molecular graph discovery, vehicle routing, and neural architecture search. He also investigates diffusion samplers for Bayesian inverse problems and symmetry-based neural methods (Sym-NCO) to enhance sample efficiency. Jang Yeong Sil Fellowship (2025) KAIST Presidential Best Ph.D. Thesis Award (2025) Qualcomm Innovation Fellowship (2023) DesignCon Best Paper Awards (2021–2022) Kim's collaborations span KAIST's Industrial Engineering department and Mila's AI research groups. He actively contributes to academic peer review for top conferences (NeurIPS, ICML, ICLR) and journals (IEEE TNNLS, TPAMI), emphasizing the intersection of AI safety , uncertainty quantification , and systemic reasoning .
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.
Olivia Di Matteo serves as an Assistant Professor in the Department of Electrical and Computer Engineering within UBC's Faculty of Applied Science, leading the Quantum Software and Algorithms Research (QSAR) group since her January 2022 appointment. Her academic foundation includes a BSc from Lakehead University and MSc/PhD in Physics (Quantum Information) from the University of Waterloo, completed in 2019. Dr. Di Matteo's research centers on quantum software engineering , with pioneering work in quantum compilation , circuit optimization , and debugging tools . She champions open-source quantum frameworks and develops accessible educational resources to democratize quantum computing. Analysis of her 15 most recent publications (2021-2025) reveals dominant trends in quantum programming infrastructure, particularly circuit analysis (33%), bug classification (20%), and qubit network optimization (15%), with strong emphasis on practical software tooling over theoretical physics. No scientific awards were documented in the source materials. She advises graduate students in the QSAR group while contributing to open-source quantum ecosystems through projects like PennyLane and The Ionizer transpiler, and teaches courses including CPEN 400Q (Gate-model quantum computing) and ELEC 221 (Signals and Systems). The QSAR group operates at the intersection of quantum software development and education, focusing on making quantum programming accessible through visual tools, real-time debugging environments, and hardware-agnostic compilation techniques.
Kaiyang Liu is an Assistant Professor at the Department of Computer Science, Memorial University of Newfoundland. He holds a Ph.D. from Central South University (2019) and was a Postdoctoral Fellow at the University of Victoria, Canada. His research focuses on distributed cloud/edge computing, data center networks, and distributed machine learning, emphasizing optimization for data-intensive services. He is an IEEE Senior Member and has received prestigious awards, including the NSERC Discovery Grants and IEEE TCCLD Outstanding Ph.D. Thesis Award. Education: Ph.D. in Information Science and Technology, Central South University (2014–2019) M.Sc. in Information Science and Technology, Central South University (2012–2014) B.Eng. in Information Science and Technology, Central South University (2008–2012) Research Assistant at the University of Victoria (2016–2018) Research Interests: Kaiyang’s work bridges AI and cloud computing, exploring optimization strategies for next-generation systems. Key areas include learning-based congestion control, energy-efficient resource management, and scalable distributed storage solutions. His research has been published in top-tier journals like IEEE Transactions on Parallel and Distributed Systems and conferences such as IEEE ICDCS. Awards & Grants: NSERC Discovery Grants & Discovery Launch Supplement (2024) IEEE TCCLD Outstanding Ph.D. Thesis Award (2020) CSC-UVic Fellowship (2016–2018) Teaching: He teaches courses on Computer Networks, Advanced Computer Networks, and Operating Systems at Memorial University and previously at the University of Victoria. Labs & Teams: His research group focuses on Space Edge Computing, leveraging LEO satellites for resilient, low-latency networks. Ongoing projects include optimizing distributed systems for AI workloads and satellite-based data centers.
Piotr Zwiernik is an Associate Professor in the Department of Statistical Sciences at the University of Toronto's Faculty of Arts and Science, with a cross-appointment in the Department of Mathematics. Currently on leave from the University of Toronto, he is based in Barcelona following his return in July 2025. His academic journey includes a PhD in Statistics from the University of Warwick (2011), research positions at prestigious institutions including Mittag Leffler Institute, IPAM, TU Eindhoven, UC Berkeley, and the University of Genoa, and an Assistant Professorship at Universitat Pompeu Fabra in Barcelona (2016-2021). His research spans the intersection of statistics, mathematics, and computational methods, with particular emphasis on graphical models, covariance matrix estimation, convex analysis, tensors, and algebraic and combinatorial methods in statistics. Zwiernik's work demonstrates a consistent focus on high-dimensional statistics, mathematical statistics, and elegant theoretical frameworks that bridge abstract mathematics with practical statistical applications. His recent publications reveal a deepening exploration of tensor analysis, algebraic statistics, and the geometric properties of statistical models. Zwiernik serves as an associate editor for leading journals including Biometrika, Scandinavian Journal of Statistics, and Algebraic Statistics. His research program includes the development of the GOLAZO R package for asymmetric regularization of log-likelihood in Gaussian graphical models. As an academic leader, he has served as Associate Chair for Research in his department and actively participates in numerous international conferences and workshops, reflecting his significant standing in the statistical community. His recent publications show a strong trend toward algebraic and geometric approaches to statistical problems, with increasing focus on tensor methods, positivity constraints in statistical models, and the theoretical foundations of graphical models. The work demonstrates remarkable continuity in exploring the mathematical structures underlying statistical models while adapting to emerging challenges in high-dimensional data analysis. Zwiernik is committed to mathematical accessibility and education, guided by Federico Ardila's four axioms which emphasize equitable distribution of mathematical potential, joyful mathematical experiences, mathematics as a malleable tool, and treating every student with dignity and respect. He actively seeks PhD students with strong mathematical backgrounds for research at UPF or the Institute of Mathematics of UPC.
Dr. Mahesh Tripunitara is a Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, serving as Associate Chair for Undergraduate Studies. He holds a PhD (2005) and Master's (1995) in Computer Science from Purdue University, along with a BSc (1993) in Computer Science from Dalhousie University. His research focuses on information security, authorization mechanisms, cryptographic key management, and hardware security, with industry experience at Motorola's R&D labs and Silicon Valley. His work spans theoretical advancements like access control policy analysis and practical applications such as secure payments systems and IoT device reliability. Notable awards include the Best Student Paper at Usenix Security 2013 and Best Paper at ACM SACMAT 2013. He actively serves on program committees for major security conferences including CCS, CODASPY, and SACMAT. Recent publications highlight innovations in cellular security (SUCI-Catchers defense), role-mining optimization, and blockchain smart contract auditing. Teaching includes advanced algorithm design courses (ECE 406/606) and digital computation (BME 121). His research emphasizes balancing security rigor with usability in authorization systems and hardware protection mechanisms.
Tamon Stephen is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. His research focuses on operations research, with an emphasis on combinatorial optimization, algorithms, discrete geometry, and computational biology. He holds a Ph.D. in Mathematics from the University of Michigan (2002). His work often bridges theoretical and computational aspects, addressing interdisciplinary applications. Stephen is affiliated with the Centre for Operations Research and Decision Sciences (CORDS) and has contributed to software tools for hypergraph transversals and colorful linear programming. He has taught courses such as Math 208W (Introduction to Operations Research) and has advised projects in metabolic network analysis and scheduling optimization. His office is located at the Surrey campus (SRYC 2886). Key research collaborations include studies on firefighter scheduling, nurse rostering, and metabolic pathway analysis. His methodologies often leverage algorithm design, polytope theory, and discrete mathematics. Stephen actively participates in academic service, organizing seminars and contributing to conferences such as the West Coast Optimization Meeting. His work emphasizes practical applications of theoretical results, with a focus on solving real-world optimization challenges.
