Find Academic Supervisors

Jeffrey S. RosenthalView profile

Professor

• Probability theory
• Stochastic processes
• Markov chain Monte Carlo
• +4 more

Jeffrey S. Rosenthal is a Professor in the Department of Statistical Sciences at the University of Toronto, Faculty of Arts and Science. He holds a PhD in Mathematics from Harvard University and a BSc from the University of Toronto. PhD, Mathematics, Harvard University BSc, University of Toronto His research centers on probability theory , stochastic processes , and statistical computation , with a particular focus on Markov chain Monte Carlo (MCMC) algorithms . His work spans theoretical foundations and practical applications, including random walks on groups and interdisciplinary modeling. He is also known for his public engagement in statistics through bestselling books and media appearances. The recent publications reflect a sustained focus on the theoretical underpinnings and convergence properties of MCMC methods, including adaptive and non-reversible algorithms. His work also extends into data science applications, such as analyzing streaks in online chess and the long-term impact of the COVID-19 pandemic on mortality. The keywords span probability, statistics, computational mathematics, and machine learning, indicating a blend of theoretical rigor and applied relevance. Scientific Awards and Honors: CRM-SSC Prize in Statistics COPSS Presidents' Award SSC Gold Medal Fellow of the Royal Society of Canada Fellow of the Institute of Mathematical Statistics Alumnus of Influence, University College Pierre Robillard Award SSC Student Research Presentation Award Savage Award Finalist Academic Supervision and Grants: Professor Rosenthal has supervised a large and diverse group of students, including numerous PhD candidates, MSc students, and post-doctoral fellows, many of whom have gone on to successful academic careers. His research is supported by ongoing publications and collaborations, indicating active grant funding and a vibrant research program. He maintains a well-documented research team and provides extensive resources for students and collaborators. Research Teams and Labs: He leads an active research group in probability and computational statistics, with a documented team of current and past post-doctoral fellows, PhD students, and research assistants. The group maintains a collaborative environment, as evidenced by joint publications and team photos, and focuses on advanced topics in MCMC theory and applications.

• Theoretical Computer Science
• Algorithms
• Parameterized Complexity
• +5 more

Yang Liu is a computer scientist specializing in theoretical computer science, particularly in the design and analysis of parameterized and exact algorithms. He has been affiliated with institutions such as Texas A&M University and has collaborated extensively with researchers like Jianer Chen and Songjian Lu. His work primarily focuses on NP-hard graph problems, including feedback vertex set, multiway cut, matching, and packing, where he has contributed improved fixed-parameter tractable algorithms and kernelization techniques. His research lies at the intersection of algorithms, complexity theory, and combinatorics. Key areas include: Fixed-parameter tractability (FPT) Kernelization and measure-and-conquer methods Graph partitioning and structural graph theory Randomized and deterministic exact algorithms Algebraic methods in polynomial testing His publications in top journals such as Journal of the ACM , Algorithmica , and Theoretical Computer Science demonstrate a consistent contribution to foundational algorithmic research. The article trends show a strong focus on solving hard combinatorial problems through novel algorithmic frameworks, often improving time complexity or kernel bounds. Notable scientific contributions include: A landmark 2008 JACM paper proving that the Directed Feedback Vertex Set problem is fixed-parameter tractable. Improvements in kernel sizes for feedback vertex and packing problems. Applications of color-coding and iterative expansion in 3D-matching. While no explicit information about advisees or grants is available, his long-term collaboration network suggests a role in mentoring and team-based research. He has not been associated with any lab or research center in the provided data.

Russell ImpagliazzoView profile

Professor

• Computational Complexity
• Cryptography
• Randomness in Computation
• +5 more

Russell Impagliazzo is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD). He has held positions as Assistant Professor, Associate Professor, and Professor at UCSD since 1991 and was a Visiting Professor at the Institute for Advanced Study (Princeton) from 2007 to 2012. His academic journey includes a BA in Mathematics from Wesleyan University and a PhD in Mathematics from UC Berkeley. His research focuses on computational complexity theory , with key contributions to: Randomness in computation Cryptography (e.g., pseudorandom generators) Circuit lower bounds Proof complexity (e.g., polynomial calculus, resolution) Structural complexity (e.g., average-case hardness) Optimization heuristics (e.g., local search) The trends in his publications include foundational work on derandomization, hardness amplification, and algebraic proof systems. His papers often bridge theoretical computer science with mathematics, particularly in analyzing the limits of computational models. Scientific awards and honors include: NSF Young Investigator Sloan Fellow Fulbright Scholar Guggenheim Fellow Simons Investigator Best Paper Award (Computational Complexity Conference) Best Paper Award (STOC) Outstanding Paper Award (SIAM) He actively advises students and has contributed to grants and programs such as the Simons Institute’s Fine-Grained Complexity and Algorithms and the Meta-Complexity program at the Simons Lab in Spring 2023.

James KayView profile

Lecturer

• Wireless Sensor Networks
• Aerospace Systems Engineering
• Control Systems
• +2 more

James Kay is a Lecturer in the Department of Electrical and Biomedical Engineering at the University of Vermont's College of Engineering and Mathematical Sciences. With over 30 years of aerospace engineering experience, particularly at United Technologies, he specializes in electrical engineering and biomedical engineering applications. Ph.D. in Electrical Engineering from The University of Vermont Bachelor's degree in Electrical Engineering from MIT Research interests focus on wireless sensor networks, aerospace systems engineering, and energy efficiency. His work explores automata-based control mechanisms, quality of service optimization, and scalable network architectures. Publications highlight contributions to sensor network cluster control (2007-2008), channel access derandomization (2006), and QoS analysis (2004). Key themes include system scalability, energy efficiency, and network reliability. Notable collaborations include work with T. Calderwood, S. Burgess, E. van Ballegoij, and J. Frolik. His expertise bridges theoretical research with practical aerospace engineering implementations.

Pranabendu MisraView profile

Assistant Professor

• Algorithms and their applications
• Graph Theory
• Parameterized Complexity
• +10 more

Pranabendu Misra is an Assistant Professor in the Department of Computer Science at Chennai Mathematical Institute (CMI), India. He previously held postdoctoral positions at the Max Planck Institute for Informatics, Germany, and the University of Bergen, Norway. His research is centered in theoretical computer science with strong contributions to algorithms and complexity. Current Affiliation: Assistant Professor, Department of Computer Science, Chennai Mathematical Institute, India Previous Positions: Postdoctoral Fellow, Max Planck Institute for Informatics; Researcher, University of Bergen Education: PhD from Institute of Mathematical Sciences (IMSc), Chennai, advised by Prof. Saket Saurabh; M.Sc. and B.Sc. from CMI in Computer Science and Mathematics Pranabendu's research interests span a broad spectrum of algorithmic theory, including Graph Theory , Parameterized Complexity , Approximation Algorithms , Matroids , Algebraic Methods , Derandomization , Algorithmic Game Theory , Streaming and Dynamic Graphs , and increasingly, AI/ML and Deep Learning . His work combines deep theoretical analysis with practical algorithmic insights. His recent publications in top-tier venues like SODA, STOC, ICALP, and EC reveal a strong trend toward developing meta-theorems, kernelization techniques, and FPT approximation algorithms for fundamental graph problems such as vertex cover, feedback vertex set, connectivity augmentation, and disjoint paths. He also explores fair division in algorithmic game theory and fault-tolerant network design. His scientific honors include: Google India Research Award (2022) SERB Startup Research Grant (2022) Fujitsu Research Grant (2023) Pranabendu actively contributes to academic advising and teaching, offering courses such as Advanced Machine Learning , Approximation Algorithms , and Parameterized Algorithms . He has collaborated extensively with leading researchers including Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi, and Kurt Mehlhorn. While specific grant details are limited, his funded projects suggest strong support for research in algorithms and AI/ML. He teaches at CMI and has previously taught at the Max Planck Institute. He is affiliated with a vibrant research group focusing on algorithms and complexity, working on both foundational and applied algorithmic problems. His recent interest in AI/ML indicates an expanding research scope bridging theoretical guarantees with modern machine learning applications.

• Distributed Algorithms
• Quantum Computing
• Graph Theory
• +2 more

Henrik Lievonen is a Doctoral Researcher at Aalto University's Department of Computer Science. His work focuses on distributed algorithms and their connections to mathematics, computer science theory, and quantum computing. University: Aalto University Role: Researcher in distributed algorithms and quantum computing Research interests center on distributed systems, quantum advantage analysis, and algorithmic complexity in graph problems. Key areas include LOCAL model constraints, quantum derandomization, and theoretical limits of distributed quantum computing. Scientific Awards: Nokia Scholarship 2024 (Nokia Foundation)

• Evolutionary Algorithms
• Optimization
• Multi-Objective Optimization
• +3 more

Ofer M. Shir is a faculty member affiliated with Tel-Hai College and MIGAL - Galilee Research Institute in Israel. His primary research focuses on evolutionary algorithms, multi-objective optimization, and their applications in quantum control, machine learning, and computational science. He has collaborated extensively with institutions and researchers globally, contributing to advancements in optimization theory and practical problem-solving through evolutionary computation. Shir's work spans theoretical foundations, such as covariance-Hessian relations in evolution strategies, to applied domains like quantum control experiments and algorithmic-guided discovery of viral epitopes. He has developed and benchmarked algorithms like the CMA-ES and SMS-EMOA, emphasizing their performance in complex, real-world scenarios. His contributions also include methodologies for sequential experimentation and improving model accuracy through techniques like batch normalization. Shir has published extensively in top-tier venues such as IEEE Transactions on Evolutionary Computation, Genetic Programming and Evolvable Machines, and the GECCO conference series. His research bridges theoretical computer science with practical applications, impacting fields from bioinformatics to engineering.

Alexandre TolstenkoView profile

Assistant Professor

• Artificial Intelligence
• Algorithms
• Smartcontracts
• +7 more

Alexandre Tolstenko is an Assistant Professor in the Computer Science & Innovation program within the Division of Information Technology & Sciences at Champlain College. He joined the institution in 2022 after a successful 15+ year career in the software industry. His educational background includes a BS in Computer Engineering from UNICAMP and an MS in Computer Science from UFPI, both institutions in Brazil. Dr. Tolstenko specializes in artificial intelligence, algorithms, smart contracts, blockchain technology, and game development. His research shows a strong focus on big data clustering algorithms, particularly DENCLUE variants and MapReduce frameworks. His work spans academic research and practical industry applications, with publications covering density-based clustering methods, sentiment analysis, natural language processing, and security topics. His research publications demonstrate a progression from fundamental clustering algorithms to practical applications in big data analytics, with recent work focusing on distributed computing frameworks for handling large-scale data problems. The publications also show interdisciplinary work connecting computer science with applications in digital forensics, Arabic language processing, and faculty hiring systems. Unity Awards Finalist 2012 Best paper award on SAE Aerodesign 2014 Best paper award on international Coloproctology journal 2017 Featured Startup on Innovativa Brazil 2018 With over 250 million product downloads across his industry career, Dr. Tolstenko brings substantial practical experience to his academic role, having served as developer, architect, and CTO in startup environments. His industry work includes implementing multiplayer networking for racing games, developing blockchain technology for NFT platforms, and porting game engines across multiple platforms. He maintains active research and development through his personal website, GitHub repositories, and the InfiniBrains blog, focusing on game development resources and emerging technologies.

William HozaView profile

Assistant Professor

• Computational Complexity Theory
• Pseudorandom Generators
• Derandomization of Algorithms
• +3 more

William Hoza is an Assistant Professor in the Department of Computer Science at the University of Chicago, affiliated with the UChicago CS Theory Group. His research focuses on computational complexity theory, particularly pseudorandom generators, derandomization of space-bounded computation, and circuit complexity. He earned a Ph.D. in Computer Science from the University of Texas at Austin (2021) and a B.S. from the California Institute of Technology (2016). Hoza advises two PhD students, including Zelin Lv (co-advised with Aaron Potechin). He has taught courses such as Introduction to Complexity Theory, Pseudorandomness, and Circuit Complexity. His academic journey includes a postdoctoral fellowship at UC Berkeley's Simons Institute. Hoza's work bridges theoretical computer science and practical algorithm design, with contributions to derandomization techniques and pseudorandom generator constructions. Key contributions include research on hitting sets, branching programs, and the limitations of pseudorandom generators. His publications span venues like FOCS, STOC, and ITCS, addressing foundational questions in computational complexity.

Yishu ZengView profile

Assistant Professor

• Microeconomic Theory
• Information Economics
• Game Theory
• +3 more

Yishu Zeng is an Assistant Professor in the Department of Economics at York University, affiliated with the Faculty of Liberal Arts & Professional Studies. Her research focuses on microeconomic theory, information economics, and game theory, particularly examining strategic information transmission and the impact of information intermediaries on market outcomes. She holds a PhD in Economics from the University of Michigan and a PhD in Mathematics from the National University of Singapore. Her work explores policy design and regulatory frameworks through an informational lens, developing tools to simplify the analysis of optimal information policies and equilibria in diverse economic contexts.

Pierre McKenzieView profile

Associate Professor

• Finite Automata
• Boolean Circuit
• Formal Language
• +3 more

Pierre McKenzie is an Associate Professor in the Department of Computer Science and Operations Research at the University of Montreal, part of the Faculty of Arts and Sciences. He is a member of the LITQ (Laboratoire d'informatique théorique et quantique). His research focuses on computational complexity theory, finite automata, Boolean circuits, formal languages, and logic. He has advised numerous graduate and master's students, including Hugo Côté, Nathan Grosshans, and Michael Blondin. His work has been supported by grants from the Natural Sciences and Engineering Research Council of Canada (CRSNG), particularly in projects like 'Lower bounds and derandomizations for branching programs' (2018–2026). Research Interests: Computational complexity hierarchy separations Branching programs and circuit lower bounds Automata theory and its connections to circuit complexity Algorithmic and complexity aspects of counter systems Key Projects: Lower bounds and derandomizations for branching programs (Lead researcher, 2018–2026) THE COMPUTATIONAL COMPLEXITY OF POLYNOMIAL TIME PROBLEMS (Lead researcher, 2012–2019) Labs/Teams: Active member of LITQ, contributing to theoretical computer science research.

Laurent FeuilloleyView profile

Researcher

• Distributed Computing
• Graph Theory
• Algorithms
• +4 more

Laurent Feuilloley is a junior CNRS researcher (Chargé de recherche) at LIRIS, Université de Lyon 1 since 2022. He previously held postdoctoral positions at LIRIS, Universidad de Chile, and LIP6 at Sorbonne Université. His research focuses on Distributed Computing , Graph Theory , and Local Certification , with applications in Fault-Tolerant Systems and Algorithm Engineering . He collaborates extensively with researchers like Nicolas Bousquet, Franck Petit, and José Correa. Education: PhD in Computer Science (2018) at IRIF, Université Paris Diderot, supervised by Pierre Fraigniaud. Research: Works on graph algorithms, certification, and robustness in dynamic networks, with a focus on maximal independent sets and self-stabilizing systems. Scientific Contributions: His publications include lower bounds for local certification, robustness refinements in dynamic networks, and space complexity for leader election algorithms. He has received multiple Best Paper Awards at SAND 2023 and SSS 2022 Best Student Paper at OPODIS 2021 Best Reviewer Award at DISC 2020 Advising: Currently supervising Sébastien Zeitoun's PhD (co-advised with Nicolas Bousquet and Éric Duchêne) and Antonin Kiladjian's M1 internship (with Théo Pierron). He has also advised Guillermo Dinamarca's master thesis in 2019-2020.

Shuichi HiraharaView profile

Associate Professor

• Computational Complexity Theory
• Meta-complexity
• Average-case Complexity
• +4 more

Shuichi Hirahara is an Associate Professor at the National Institute of Informatics (NII), Japan, within the Principles of Informatics Research Division. He holds a Ph.D. from the University of Tokyo and has held research positions at the University of Warwick and Nagoya University. His work lies at the intersection of theoretical computer science and cryptography, focusing on foundational questions in computational complexity. Educational Background: Ph.D. in Computer Science, Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo (2016–2019) His research centers on meta-complexity , a field probing the complexity of problems about computational complexity itself, such as the Minimum Circuit Size Problem (MCSP). He investigates average-case complexity , Kolmogorov complexity , and circuit minimization , aiming to understand the limits of efficient computation and to establish secure cryptographic foundations. His work often reveals unexpected hardness results and bridges worst-case and average-case complexity. The recent publications highlight a strong trend toward using meta-complexity to understand cryptographic primitives such as one-way functions and to unify hardness conjectures like the Planted Clique problem. His results have significant implications for proving the security of cryptography based on average-case hardness. Scientific Awards: Young Scientists' Award from MEXT (2024) Yamato Scientific Award (2024) Microsoft Informatics Research Award (2024) Complexity Result of the Year 2022 Funai Research Encouragement Award (2022) Machtey Award (FOCS 2018) Academic Encouragement Award (IEICE, 2019) Hirahara has been actively involved in research funding and academic service. He is the principal investigator of a JSPS Challenging Research (Pioneering) grant on average-time NP-completeness and has participated in several JST and JSPS projects on complexity theory and quantum algorithms. He serves on the program committees of major conferences including STOC, FOCS, and CCC. He is a frequent invited speaker at international workshops and seminars, contributing to the global discourse on computational complexity and cryptography. While no formal advisees are listed, his leadership in research projects suggests an active mentoring role. Labs and Research Teams: He is affiliated with the Informatics Principles Research Division at NII, a leading center for theoretical informatics in Japan. His work is highly collaborative, involving researchers from institutions like JST, University of Tokyo, and international partners.

• Algorithmic Coding Theory
• Pseudorandomness
• Complexity of Approximate Optimization
• +2 more

Venkatesan Guruswami serves as a Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science, where he drives pioneering research in theoretical computer science with global impact. His core research domains encompass: Algorithmic Coding Theory (specializing in list decoding and explicit code constructions) Pseudorandomness (focusing on derandomization and explicit pseudorandom generators) Complexity of Approximate Optimization (establishing hardness thresholds for NP-hard problems) His transformative contributions were honored with the ACM Fellow designation in 2017, joining other distinguished accolades: ACM Doctoral Dissertation Award for his MIT thesis on list decoding (2002) NSF CAREER Award recognizing early-career leadership (2003) Alfred P. Sloan Research Fellowship for exceptional scholarly promise (2005) As an active researcher, he shapes theoretical foundations while mentoring emerging scholars and influencing cryptographic and communication systems through rigorous mathematical frameworks.

Danny HuckeView profile

Researcher

• Data Compression
• Grammar-Based Compression
• Empirical Entropy
• +3 more

Danny Hucke is a researcher affiliated with the University of Siegen, Department of Electrical Engineering and Computer Science. His work focuses on advanced data compression techniques, algorithmic complexity, and formal verification of streaming systems. Education: PhD in Grammar-based compression for strings and trees (University of Siegen, 2019) Research Interests: Driven by challenges in grammar-based compression, empirical entropy metrics, and formal language processing in streaming environments, his research bridges theoretical computer science and practical algorithm design. Key areas include: Data Compression for Trees and Strings Sliding-Window Algorithms Circuit Complexity Algorithmic Entropy Analysis Scientific Contributions: His work has been recognized with a Best Paper Award at SPIRE 2016. Publications span top-tier venues like IEEE Transactions on Information Theory , ACM TOCT , and conferences including ICALP, STACS, and LATIN. Contact: Department of Electrical Engineering and Computer Science, University of Siegen, Hölderlinstrasse 3, D-57076 Siegen. Email: hucke@eti.uni-siegen.de . Phone: +49-271-740-3415. Office: Room H-A 7104. Collaborations: Conducted research within the group of Prof. Markus Lohrey, collaborating extensively with Moses Ganardi, Louisa Seelbach, and Eric Nöth.