Find Academic Supervisors

Rocco ServedioView profile

Professor

• Computational Complexity Theory
• Computational Learning Theory
• Property Testing
• +3 more

Rocco Servedio is a Professor in the Department of Computer Science at Columbia University, where he leads research in theoretical computer science with a focus on computational complexity theory, learning theory, and the role of randomness in computation. He previously served as Chair of the Computer Science Department from 2018 to 2021. He holds a Ph.D., MS, and AB in Mathematics from Harvard University. His research interests include property testing, computational learning theory, and algorithmic lower bounds. He has contributed to foundational work in areas like junta testing, trace reconstruction, and convexity testing. Servedio has held leadership roles in major conferences such as STOC, CCC, and COLT, and has mentored students through courses like Unconditional Lower Bounds and Derandomization . Education: Ph.D. in Computer Science, Harvard University MS in Computer Science, Harvard University AB in Mathematics, Harvard University His research bridges theoretical computer science and applied mathematics, with recent work exploring the intersection of Gaussian processes, convex geometry, and algorithmic efficiency. Servedio's contributions to the field are exemplified through his involvement in high-impact conferences and his leadership in advancing fundamental computational theories.

• Theoretical Fluid Dynamics
• Asymptotic Methods
• Climate Dynamics
• +4 more

Oliver Bühler is a Professor of Mathematics and Atmosphere/Ocean Science at New York University. His research focuses on theoretical fluid dynamics, particularly asymptotic methods applied to geophysical fluid systems. He holds a Ph.D. in Applied Mathematics from the University of Cambridge (1996), an M.S. in Aerospace Engineering from the University of Michigan (1990), and a B.S. in Physical Engineering from Technical University Berlin (1988). Education: Ph.D., Applied Mathematics, University of Cambridge, 1996 M.S., Aerospace Engineering, University of Michigan, 1990 B.S., Physical Engineering, Technical University Berlin, 1988 His research interests include nonlinear wave-vortex interactions, climate dynamics, and applications of fluid dynamics to quantum mechanics and particle diffusion. He authored a seminal textbook on waves and mean flows and has contributed to high-impact studies in Physics of Fluids and Journal of Fluid Mechanics . While no awards or grants are explicitly listed, his work is part of the Center for Atmosphere Ocean Science at NYU.

Chris RogersView profile

Professor

• Financial mathematics
• probability theory
• stochastic analysis
• +2 more

Chris Rogers is a Professor of Statistical Science within the Department of Pure Mathematics and Mathematical Statistics (DPMMS) at the University of Cambridge, actively contributing to research at the intersection of probability theory, stochastic analysis, and financial applications. His academic profile reflects deep engagement with mathematical finance and theoretical probability through publications and departmental affiliations. His research spans financial mathematics, probability theory, stochastic analysis, statistics, and mathematical economics, with emphasis on rigorous mathematical frameworks for financial markets. Key themes include option pricing mechanisms, stochastic process modeling, and geometric probability applications, often addressing real-world financial instruments like Asian options and S&P500 index behaviors through advanced probabilistic techniques. Analysis of his 15 most recent publications (2016-2018) reveals consistent focus on stochastic calculus applications in finance, particularly Lévy processes, diffusion models, and optimal stopping problems. His work bridges theoretical probability with quantitative finance, demonstrating expertise in translating complex stochastic phenomena into financial modeling solutions across asset pricing, risk assessment, and market analysis domains. No scientific awards were documented in the provided source material. Information regarding PhD/Master's student supervision, research grants, or collaborative teams was not specified in the available texts, indicating absence of such details in the source documentation.

Mika GöösView profile

Assistant Professor

• Computational Complexity
• Communication Complexity
• Theoretical Computer Science
• +3 more

Mika Göös is a Tenure Track Assistant Professor at EPFL in the School of Computer and Communication Sciences, Department of Computer Science. Previously, he held postdoctoral positions at Stanford, Princeton IAS, and Harvard. He earned his PhD from the University of Toronto under Toniann Pitassi, an MSc from the University of Oxford, and a BSc from Aalto University. Education PhD: University of Toronto MSc: University of Oxford BSc: Aalto University His research focuses on computational and communication complexity, exploring fundamental limits of algorithms and their applications in cryptography, circuit design, and distributed computing. He co-developed lifting theorems connecting query complexity to communication complexity and investigates lower bounds in randomized algorithms, TFNP problems, and monotone circuits. Recent work emphasizes quantum communication advantages, direct sum theorems, and hardness condensation. His 15 most recent publications span topics like k-Hamming distance, parity decision trees, depth-3 circuits, and separations in TFNP classes. Scientific awards include the Machtey Award (2015), Best Paper at DISC (2012), EATCS Distinguished Dissertation Award (2017), and Best Paper at FOCS (2020). He has advised numerous PhD and MSc students, including Weiqiang Yuan, Ziyi Guan, and Alexandros Hollender. Currently, he leads a team comprising PhD students (Guan, Imbach, Riazanov, Sofronova, Yuan), postdocs (Nathaniel Harms), and scientists (Dmitry Sokolov). His work has appeared in top venues like STOC, FOCS, CCC, and ITCS, often with recorded talks and published in journals such as JACM and SICOMP.

Ben LiangView profile

Professor

• Networked Systems
• Mobile Communications
• Distributed Machine Learning
• +4 more

Professor Ben Liang is a faculty member at the Department of Electrical and Computer Engineering , University of Toronto, holding the L. Lau Chair . He has served on editorial boards of IEEE Transactions on Mobile Computing , IEEE Transactions on Wireless Communications , and Wiley Security and Communication Networks . His research focuses on networked systems , mobile communications , and distributed machine learning , with applications in wireless network virtualization, edge computing, and resource optimization. He explores stochastic scheduling , computation-communication co-design , and multi-resource fair allocation . Key publication trends: Wireless federated learning (2024-2025) Network virtualization and MIMO systems (2022-2025) Online distributed optimization (2023-2025) Stochastic resource management (2020-2024) Scientific Awards: Fellow of IEEE Best Paper Award, ACM MSWiM 2013 INFOCOM 2010 Finalist Ontario ERA Award 2007 IFIP Networking 2005 Best Paper Intel Foundation Graduate Fellowship 2000 Polytechnic University valedictorian 1997 Affiliated with IEEE , ACM , and Tau Beta Pi , he teaches courses like ECE368: Probabilistic Reasoning and ECE421: Machine Learning , emphasizing stochastic networks and random processes .

Standa ŽivnýView profile

Professor

• Theoretical Computer Science
• Discrete Mathematics
• Algorithms
• +10 more

Standa Živný is a Professor of Computer Science at the University of Oxford and a Fellow and Tutor at Merton College. He has been a faculty member at Oxford since 2013 and was promoted to full professor in 2021. His research spans theoretical computer science and discrete mathematics, with a focus on algorithms, computational complexity, and constraint satisfaction problems (CSPs) in various forms, including optimisation, counting, and approximation. His research interests include the power and limitations of convex relaxations, sparsification, submodularity, and the algebraic and logical foundations of tractability in combinatorial problems. He has made significant contributions to understanding when and why certain problems can or cannot be efficiently solved using linear programming and other algorithmic paradigms. The recent trends in his publications show a deep engagement with approximation algorithms, hardness results, sparsification techniques, and the complexity of counting and promise problems. His work often lies at the intersection of algebra, logic, and optimisation, demonstrating the power of interdisciplinary approaches in theoretical computer science. ERC Consolidator Grant (NAASP, 2022–2027) ERC Starting Grant (PowAlgDO, 2017–2022) Royal Society University Research Fellowship (2013–2021) He actively supervises a large cohort of postdoctoral researchers and students, including PhD candidates, master’s, and undergraduate students. His leadership extends to academic service, where he serves as Editor-in-Chief of the SIAM Journal on Discrete Mathematics and holds editorial and committee positions in major journals and funding bodies. He has organised numerous workshops and research programmes at institutions such as Dagstuhl, the Isaac Newton Institute, and AIM. He is involved in major research initiatives, including a Simons Programme on symmetry in computation and an American Institute of Mathematics SQuARE on relaxations for promise CSPs.

Franceli CibrianView profile

Assistant Professor

• Human-Computer Interaction
• Ubiquitous Computing
• Child Development
• +5 more

Dr. Franceli Cibrian is an Assistant Professor in the Department of Electrical Engineering and Computer Science at Chapman University's Fowler School of Engineering. Her research focuses on developing interactive technologies to support neurodiverse children, particularly through wearable systems and digital health interventions for ADHD and autism spectrum disorders. Education: Ph.D. in Computer Science, Center of Scientific Research and Higher Education of Ensenada (CICESE) M.S. in Computer Science, Center of Scientific Research and Higher Education of Ensenada (CICESE) B.S. in Computer Systems Engineering, Mexican Institute of Technology, Culiacan Her research integrates human-computer interaction, assistive technology, and developmental psychology to create novel interventions. Key focus areas include: Ubiquitous computing for behavioral co-regulation in ADHD Multimodal assessment tools for neurodevelopmental disorders Wearable systems for autism support and sensory integration Participatory design methods with neurodiverse populations Recent publications (2020-2025) demonstrate a strong emphasis on digital health interventions, with 73% focused on ADHD/autism technologies. Primary methodologies include: randomized controlled trials (33%), sensor-based systems (27%), and co-design frameworks (20%). Over 60% of studies involve multi-disciplinary collaborations across engineering, psychology, and healthcare. Dr. Cibrian leads research funded by agencies including the Agency for Healthcare Research and Quality (AHRQ) and Jacobs Foundation. Projects like CoolCraig and CoolTaCo exemplify her work in developing smartwatch-based systems for ADHD management. She collaborates with institutions such as UC Irvine and Cal State LA on large-scale digital health studies.

• Probability Theory
• Interacting Particle Systems
• Percolation Theory
• +3 more

Réka Szabó is an Assistant Professor at the Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, University of Groningen, Netherlands, since October 2022. Her academic trajectory includes a postdoctoral fellowship at Université Paris-Dauphine (2019–2022) and a Ph.D. in Mathematics (2015–2019) at the University of Groningen under Daniel Valesin. Education: B.Sc. in Mathematics, Budapest University of Technology and Economics (2008–2011) M.Sc. in Applied Mathematics, Budapest University of Technology and Economics (2011–2015) M.Sc. in Computer Science, University of Trento and Eötvös Lóránd University (2012–2014) Ph.D. in Mathematics, University of Groningen (2015–2019) Réka’s research focuses on Interacting Particle Systems and Percolation Theory , with significant contributions to understanding phase transitions, critical behavior, and stochastic dynamics in models like the Contact Process, Oriented Percolation, and Bootstrap Percolation. Her work combines rigorous mathematical analysis with applications to statistical physics and complex networks. She is actively involved in academic service, including organizing the Workshop On Randomness and Discrete Structures (WORDS 2025) and co-organizing the Probability and Statistics Seminar in Groningen. Réka teaches advanced courses such as Stochastic Processes, Interacting Particle Systems, and Mathematics and its Environment.

John D. NortonView profile

Professor

• History and Philosophy of Physics
• General Relativity
• Special Relativity
• +16 more

John D. Norton is a Distinguished Professor in the Department of History and Philosophy of Science (HPS) at the University of Pittsburgh, where he has been a faculty member since 1983. He served as Chair of the department from 2000 to 2005 and as Director of the Center for Philosophy of Science from 2005 to 2016. His work bridges the history and philosophy of physics, with deep engagement in Einstein’s relativity, quantum theory, statistical mechanics, and foundational issues in scientific reasoning. His educational background includes a PhD in the School of History and Philosophy of Science from the University of New South Wales (1982) and a Bachelor of Engineering in Chemical Engineering from the same institution (1974). Before transitioning to philosophy, he worked as a technologist at the Shell Oil Refinery in Sydney. Norton is renowned for his development of the material theory of induction , which challenges formalist approaches by asserting that inductive inferences are warranted by domain-specific facts rather than universal logical rules. He has also made significant contributions to the philosophy of spacetime, particularly through his analysis of the hole argument , and has published extensively on thought experiments, causation, and the thermodynamics of computation. His recent publications (2021–2025) reflect a sustained focus on induction, spacetime ontology, and the limits of thermodynamic reversibility and information processing. Key themes include the critique of Bayesianism, the historical development of thermodynamics, and the philosophical implications of time travel models in general relativity. His two major books— The Material Theory of Induction (2021) and its sequel The Large-Scale Structure of Inductive Inference (2024)—form a comprehensive philosophical framework for understanding scientific reasoning beyond formal logic. Co-Founder and Executive Committee Member, philsci-archive.pitt.edu Editor for Philosophy of Physics (Space and Time, General Physics), Stanford Encyclopedia of Philosophy Contributing Editor, Archive for History of Exact Science (1996–present) Associate/Co-Editor, Studies in History and Philosophy of Modern Physics Contributing Editor, Collected Papers of Albert Einstein , Volumes 3 and 4 Norton has advised numerous graduate students and has been instrumental in shaping the academic landscape of philosophy of science through editorial leadership and archival initiatives. His teaching includes graduate seminars on confirmation theory and the popular undergraduate course Einstein for Everyone , for which he maintains a freely available online textbook.

Alexandros KontogiannisView profile

Research Fellow

• Fluid Dynamics
• Applied Mathematics
• Bayesian Inference
• +10 more

Alexandros Kontogiannis is a research fellow at the University of Cambridge, Department of Engineering, specializing in fluid dynamics and applied mathematics. His work combines Bayesian inference, machine learning, and physics-informed algorithms to solve inverse problems in magnetic resonance velocimetry (MRV) and fluid-structure interaction. EPSRC National Fellow in Fluid Dynamics Member of Energy, Fluids and Turbomachinery Division Research Focus: Development of digital twin frameworks that integrate MRV data with Navier-Stokes equations to reconstruct flowfields, infer rheological parameters in non-Newtonian fluids, and estimate hidden quantities like pressure and wall shear stress. Key innovations include: Physics-informed compressed sensing for sparse MRV data Simultaneous boundary shape and flowfield estimation Bayesian turbulence model parameter learning Scientific Awards: ASME Fluids Engineering Division Graduate Student Scholar (2021) Technical Chamber of Greece (TEE) Award (2018) Limmat Foundation Academic Excellence (2017) Mentzelopoulos Scholarship for international studies (2017) Greek State Scholarships Foundation Award (2012) Key Contributions: Algorithms for 3D flow reconstruction with adaptive discretization, viscous signed distance field regularization, and multi-objective aerodynamic shape optimization. His methodologies enable 27x reductions in MRI scanning time while maintaining diagnostic accuracy.

Hugo PaquetView profile

Researcher

• Probabilistic Programming
• Categorical Semantics
• Game Semantics
• +4 more

Hugo Paquet is a Researcher at INRIA Paris and a member of the ANTIQUE team at École Normale Supérieure , PSL University. He completed a PhD in Computer Science (2015–2019) at the University of Cambridge under Glynn Winskel , focusing on concurrent game semantics for probabilistic programming. His postdoctoral work includes positions at LIPN, Paris (2022–2024, funded by a Marie Skłodowska-Curie Award) and University of Oxford (2020–2022). He has contributed to conferences including LICS , ESOP , FSCD , and POPL . Education : PhD in Computer Science (University of Cambridge, 2019) Research Interests : Probabilistic programming (semantics, inference algorithms, nonparametric models), categorical semantics (game semantics, concurrency models, adjunctions), combinatorial species, and 2-dimensional categories. Teaching : Category Theory (2023–2024), Bayesian Statistical Probabilistic Programming (2021–2022), Lambda-calculus and Types (2020–2021), and small-group teaching at Cambridge (Logic, Discrete Mathematics, Semantics). Awards : Marie Skłodowska-Curie Award under the Paris Region Fellowship Programme Labs : INRIA Paris, ANTIQUE team (2024–present)

Nofar CarmeliView profile

Researcher

• Database Query Optimization
• Fine-Grained Complexity
• Enumeration Complexity
• +2 more

Nofar Carmeli is a researcher at Inria , affiliated with the Boreal joint project-team (LIRMM, Inria, University of Montpellier, CNRS) in Montpellier, France. Her work focuses on theoretical aspects of database query optimization, particularly through the lenses of fine-grained complexity and enumeration complexity. PhD from Technion (2015-2020), advised by Prof. Benny Kimelfeld Postdoctoral Researcher at ENS Paris (2021-2022) and Inria's Valda project-team Holds the Schmidt Postdoctoral Award (2021-2022) Her research explores optimal algorithms for database query answering, including direct access to ranked answers, quantile computation, and handling of conjunctive queries with self-joins or negation. She investigates how structural properties of queries and data constraints like functional dependencies affect computational complexity. Key contributions include: Establishing tractability boundaries for direct access to conjunctive queries Developing efficient algorithms for minimal triangulation enumeration Advancing probabilistic database representations for infinite domains Creating explainable opinion graph frameworks for review summarization Scientific awards: Google PhD Fellowship (2019) Schmidt Postdoctoral Award (2021-2022) PODS Best Student Paper (2019) She has served on program committees for STACS (2025), PODS (2023-2025), and ICDT (2022-2024), and contributed to open-access research dissemination through Arxiv and dblp.

• Simulation
• Computational Probability
• Queueing Theory
• +2 more

Peter W. Glynn is the Thomas Ford Professor in the Department of Management Science and Engineering (MS&E) at Stanford University's School of Engineering, and also holds a courtesy appointment in the Department of Electrical Engineering. Additionally, he serves as a Senior Fellow of the Hong Kong Institute for Advanced Study at City University of Hong Kong. His distinguished career spans over four decades, with significant contributions to the fields of simulation, computational probability, and stochastic modeling. Professor Glynn received his Ph.D. in Operations Research from Stanford University in 1982 and his B.S. with Honors in Mathematics from Carleton University in 1978. His academic journey began at the University of Wisconsin at Madison (1982-1987) before returning to Stanford, where he has held various leadership positions including Deputy Chair of MS&E (1999-2005), Director of Stanford's Institute for Computational and Mathematical Engineering (2006-2010), and Chair of MS&E (2011-2015). His research interests focus on simulation , computational probability , queueing theory , statistical inference for stochastic processes , and stochastic modeling . Professor Glynn's work has developed algorithms widely used across the field of Monte Carlo simulation, with applications in financial risk management, service systems engineering, logistics, and retail operations. His recent publications demonstrate continued innovation in areas such as numerical methods for stochastic systems, rare-event simulation, and analysis of queueing systems under various traffic conditions, showing a strong trajectory of advancing both theoretical foundations and practical applications. Professor Glynn's scholarly contributions have been recognized with numerous prestigious awards, including: Fellow of INFORMS (2007) Fellow of the Institute of Mathematical Statistics (1998) John von Neumann Theory Prize from INFORMS (2010) Member of the US National Academy of Engineering (2012) Lifetime Professional Achievement Award, INFORMS Simulation Society (2021) Philip McCord Morse Lecturer, INFORMS (2020) Throughout his career, Professor Glynn has mentored numerous doctoral students whose research has made significant contributions to operations research and related fields. His editorial service has been extensive, including founding Editor-in-Chief of Stochastic Systems and service on the editorial boards of leading journals in operations research, probability, and statistics. His professional service extends to numerous advisory boards and committees at national and international levels, reflecting his standing as a leader in his field.

• Applied Geometry
• Discrete Differential Geometry
• Numerical Analysis
• +3 more

Max Wardetzky is a Professor at the Institute for Numerical and Applied Mathematics within the Faculty of Mathematics and Computer Science at the University of Göttingen, Germany. His office is located at Lotzestraße 16-18, 37083 Göttingen, and he can be reached via email at wardetzky@math.uni-goettingen.de or by phone at +49 551 39 26778. Professor Wardetzky leads the Discrete Differential Geometry Lab at the University of Göttingen, where he conducts research at the intersection of mathematics, computer science, and geometry processing. His work bridges theoretical foundations with practical applications in computer graphics and scientific computing. His primary research interests include: Applied Geometry Discrete Differential Geometry Numerical Analysis Geometry Processing Physical Simulation Computer Graphics Professor Wardetzky's extensive publication record demonstrates significant contributions to the field of discrete differential geometry and its applications. His work shows a consistent focus on developing mathematically rigorous yet computationally efficient methods for geometric problems. Key trends in his research include the development of discrete analogues of smooth geometric objects, the study of convergence properties between discrete and continuous models, and the application of these methods to problems in computer graphics and physical simulation. Professor Wardetzky has made substantial contributions to the theoretical foundations of discrete differential geometry while maintaining strong connections to practical applications. His work on discrete Laplacians, curvature approximations, and geometric flows has influenced both theoretical mathematics and practical geometry processing algorithms.

Christa CuchieroView profile

Professor

• Mathematical Finance
• Stochastic Processes
• Risk Management
• +6 more

Christa Cuchiero is a Professor at the Department of Statistics and Operations Research , University of Vienna , and an elected member of the Austrian Young Academy (Junge Akademie) since 2020. Her research bridges rigorous mathematics and cutting-edge applications in finance, machine learning, and stochastic analysis. Education: Christa earned her M.Sc. in 2006 from TU Wien with a thesis on affine interest-rate models, her Ph.D. in 2011 from ETH Zürich on affine and polynomial processes, and completed her Habilitation at the University of Vienna in 2018 on high-dimensional finance beyond classical paradigms. Research Interests: Her work centers on affine and polynomial processes , stochastic portfolio theory , signature methods , and infinite-dimensional stochastic analysis . Recent projects explore signature-based neural SDEs for option calibration, measure-valued diffusions for energy markets, and universal approximation properties of signature transforms. Awards & Recognition: Among her accolades are the FWF START Award 2019 , the Bruti-Liberati Visiting Fellowship 2018 , the ETH Medal 2012 for an outstanding Ph.D. dissertation, and the Prix de l’Institut Europlace de Finance 2017 for the best paper in finance. Contact: christa.cuchiero@univie.ac.at , Kolingasse 14-16, 05.47, 1090 Wien, Austria.