استاد راهنما، استاد دانشگاه یا پژوهشگر مناسب برای مسیر پژوهشیتان را پیدا کنید و با او ارتباط بگیرید.
نمایش ۶۱-۷۵ از ۷٬۳۵۷ استاد راهنما
اطلاعات این پروفایلها از صفحات عمومی دانشگاهها جمعآوری شده و ممکن است بهروز نباشد.
دانشیار
Yin Tat Lee is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington, and a Senior Principal Researcher in Microsoft AI. His research spans convex optimization , convex geometry , graph algorithms , online algorithms , and differential privacy , with applications in machine learning and theoretical computer science.
دانشیار
Sophie Spirkl is an Associate Professor (with tenure) in the Department of Combinatorics and Optimization at the University of Waterloo. Previously, she held postdoctoral positions at Princeton University (as an NSF postdoc and instructor, supervised by Maria Chudnovsky) and at Rutgers University (under Jeff Kahn). She earned her PhD from Princeton University under the guidance of Maria Chudnovsky and Paul Seymour. Her research focuses on graph theory and combinatorics, with notable contributions to induced subgraphs, tree decompositions, chromatic number properties, and structural graph theory. She is a recipient of the 2023 Sloan Research Fellowship and co-founded the diamond open-access journal Innovations in Graph Theory . Education: PhD in Mathematics, Princeton University (2016–2020) Postdoctoral Fellowships: Princeton (2020–2022), Rutgers (2018–2020) Research Interests: Dr. Spirkl’s work spans multiple areas of combinatorics, including structural graph theory, extremal graph theory, and algorithmic graph theory. She has published extensively on topics such as induced subgraph obstructions, χ-boundedness, tree decompositions, and the Erdős–Hajnal conjecture. Her research often intersects with theoretical computer science, particularly in parameterized complexity and graph colorings. Awards & Recognition: 2023 Sloan Research Fellowship Contributions to the Innovations in Graph Theory journal Academic Contributions: Her articles address foundational problems in graph theory, such as the Erdős–Hajnal conjecture for C₅, logarithmic treewidth in even-hole-free graphs, and induced saturation for cycles. She collaborates with leading researchers like Maria Chudnovsky and Paul Seymour, advancing the field through rigorous combinatorial analysis. Community Engagement: She coordinates the Women in Math Directed Reading Program at Waterloo, supporting underrepresented groups in mathematics. Her spouse, Logan Crew, is a Research Assistant Professor at the same institution.
Megan Kerr serves as the Katharine and Claudine Malone '63 Professor of Mathematics at Wellesley College, where she teaches across the mathematics curriculum from calculus to advanced topics in geometry. Her academic home is within the Mathematics & Statistics Department at this prestigious women's liberal arts college. Her educational journey began as an undergraduate at Wellesley College, where she later returned as faculty, completing a full circle in her academic career. She earned her Ph.D. from the University of Pennsylvania under the supervision of Wolfgang Ziller, with research focused on Homogeneous Einstein Metrics. Professor Kerr's research centers on global differential geometry, particularly exploring the interplay between curvature constraints and large symmetry groups. She specializes in homogeneous and low-cohomogeneity spaces, investigating fundamental questions about the existence of geometric structures, their rarity or commonality, and potential obstructions. Her work bridges the analytic concept of curvature with the algebraic framework of Lie groups, and she has recently expanded into geometric analysis where topology plays a significant role. Analysis of her publication record reveals a consistent focus on homogeneous Einstein metrics across three decades, with particular attention to curvature properties, symmetry constraints, and classification problems in both positive and negative curvature settings. Her research has evolved from foundational work on symmetric spaces to more complex non-symmetric examples and specialized curvature conditions, demonstrating both depth and breadth in differential geometry. Katharine and Claudine Malone '63 Professor of Mathematics Radcliffe Institute Fellowship As an alumna of Wellesley College, Professor Kerr maintains a strong commitment to encouraging women in mathematics. She teaches a diverse range of courses including calculus, linear algebra, combinatorics, real analysis, non-Euclidean geometry, differential geometry, topology, knot theory, and matrix groups as an introduction to Lie groups. Her teaching philosophy emphasizes developing mathematical understanding and confidence that benefits students regardless of their major. Her research has taken her to international destinations including Australia, Germany, and Mexico, reflecting the global nature of her scholarly collaborations.
Andreas Rietbrock is Professor and Director of the Geophysical Institute (GPI) at the Karlsruhe Institute of Technology (KIT) , Germany, where he also serves as Dean of Studies for Geophysics . He is a leading expert in earthquake seismology, seismic tomography, and subduction zone dynamics, with a strong focus on integrating advanced observational techniques and computational methods. Education: While specific degrees are not listed in the provided text, his extensive publication record and leadership roles indicate advanced academic training in geophysics and seismology. Research Interests: His work spans a wide range of topics including: Seismic imaging of subduction zones (e.g., Nazca, Lesser Antilles) Earthquake rupture dynamics and fault mechanics Volcanic seismology and magma transport Full waveform inversion and AI-enhanced seismic analysis Distributed Acoustic Sensing (DAS) applications Induced seismicity and reservoir monitoring Research Trends: His recent publications (2022–2025) emphasize the use of dense seismic arrays, AI-based data processing, and multi-method tomography to study complex tectonic environments. Key themes include high-resolution imaging of slab structures, fluid migration in subduction zones, and the integration of DAS and machine learning for seismic monitoring. Scientific Contributions: Andreas has led major international projects such as the ANTICS Large-N deployment in Albania and the VoiLA project in the Lesser Antilles. He has published extensively in top-tier journals like Nature , Geophysical Research Letters , and Journal of Geophysical Research , with over 200 peer-reviewed articles. Teaching and Supervision: He teaches courses such as "Introduction to Geophysics II", "Seismology", and "Current Topics in Seismology and Risk". While specific student names are not listed, his role as Dean and principal investigator on numerous projects indicates active supervision of graduate students and postdocs. Labs and Teams: He leads the seismology group at GPI, coordinating large-scale deployments of seismic instruments, including ocean-bottom seismometers and fiber-optic DAS systems. His team collaborates globally with institutions in Europe, South America, and Asia.
Paul Larson is a Professor of Mathematics at Miami University. His research focuses on set theory, topology, and model theory, with particular expertise in forcing axioms, descriptive set theory, and infinitary logic. He holds a Ph.D. in Mathematics from the University of California, Berkeley. His work bridges foundational mathematical logic with applications in topology and combinatorics. Key contributions include studies on canonical models under fragments of the Axiom of Choice, polar forcings, and cardinal characteristics. Larson has collaborated extensively with leading researchers such as Saharon Shelah and Jindřich Zapletal. His publications span prestigious journals like the Annals of Pure and Applied Logic and Transactions of the American Mathematical Society. Beyond research, he contributes to the academic community through editorial work and expository writings on historical developments in determinacy theory. Education: Ph.D., Mathematics, University of California, Berkeley Research interests emphasize foundational questions in set theory with applications to topology and model theory. His recent work explores advanced forcing techniques, square principles in Pmax extensions, and combinatorial properties of cardinal invariants. Publications reflect interdisciplinary engagement, including crystal structure prediction in high-pressure chemistry and operator theory in functional analysis. Despite an extensive publication record, no specific scientific awards are documented here. His advising and grant activities remain unspecified in the provided texts. Collaborations span international institutions, reflecting his role as a central figure in contemporary set theory research.
Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.
Dr. Jean-Christophe Nave is an Associate Professor in the Department of Mathematics and Statistics at McGill University, specializing in applied mathematics, numerical analysis, and computational methods. His research focuses on numerical methods for partial differential equations, fluid mechanics, interface problems, and computer graphics. He holds a PhD from UCSB (2004) and has held academic positions at MIT and McGill since 2005. Currently, he serves on committees such as the Steering Committee of the Institut des Sciences Mathematiques and the CRM Applied Mathematics Lab. His educational background includes a PhD under Professors Xu-Dong Liu and Sanjoy Banerjee. Key research areas include level set methods, fluid-structure interaction, and invariant numerical methods. Notable works include the Correction Function Method for interface problems and the Characteristic Mapping Method for advection problems. Nave’s publications span topics like Poisson equations with discontinuous coefficients, fluid dynamics simulations, and high-order numerical schemes. He has advised numerous graduate and undergraduate students, contributing to their research in applied mathematics and computational science. His work bridges theoretical rigor and practical applications in engineering and physics. He teaches advanced courses such as Numerical Analysis I/II and Computational Methods in Applied Mathematics. His research group collaborates on projects involving fluid dynamics, elasticity, and geometric algorithms, with a focus on developing robust numerical tools for complex systems.
Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).
Adrian Lew is a Professor of Mechanical Engineering at Stanford University, specializing in computational solid mechanics and numerical algorithms. His research focuses on hydraulic fracturing simulation, embedded boundary methods, and material model design. He holds a PhD in Mechanical Engineering from Caltech (2003). His work bridges advanced numerical techniques with real-world applications in geophysics, material science, and structural engineering. Education: PhD, Mechanical Engineering, California Institute of Technology, 2003 Research Interests: Lew's group develops algorithms for time-integration embedded boundary methods and hydraulic fracturing simulations. Key areas include curvilinear crack propagation, universal meshing for complex geometries, and high-fidelity fracture mechanics. His work on variational integrators and discontinuous Galerkin methods has advanced computational efficiency in nonlinear elasticity and thermodynamics. Publications: Recent articles emphasize mesh optimization (DVRlib), fracture path instabilities, and magma chamber dynamics. His methodologies address challenges in 3D crack modeling, fluid-structure interaction, and high-order approximations in domains with singularities. Advising & Grants: Lew's research is supported by projects in computational geophysics and material science. Though no advisees are listed, his work involves collaborative teams focused on algorithmic innovation and high-performance computing.
Yehuda Ben-Zion is a Professor of Earth Sciences at the University of Southern California (USC), affiliated with the Dornsife College of Letters, Arts and Sciences. He serves as Director of the Statewide California Earthquake Center (SCEC). His expertise lies in geophysics and seismology, with a focus on earthquake mechanics, fault dynamics, and seismic hazard assessment. He holds a Ph.D. in Geophysics and Seismology from USC (1990) and a B.S. in Geology and Physics from The Hebrew University of Jerusalem (1982). Research interests include physics of earthquakes and faults, high-resolution fault zone imaging, earthquake source properties, and dynamic rupture processes. Recent work emphasizes multi-scale modeling of rupture zones, seismic velocity monitoring using anthropogenic signals (e.g., train tremors), and probabilistic seismic hazard analysis frameworks like CyberShake. He leads projects such as Quakeworx, an open-source earthquake simulation platform, and investigates fault zone architecture in regions like the San Andreas, San Jacinto, and Marmara faults. His studies address critical questions about large earthquake mechanisms, ground motion prediction, and the interplay between tectonic stress and seismicity patterns. He has pioneered the use of dense seismic arrays and machine learning to analyze seismic data, advancing understanding of fault zone processes and their implications for hazard mitigation.
John Kingston is a Professor of Linguistics and Director of the Phonetics Lab at the University of Massachusetts Amherst, where he has been since 1990. He holds a BA and MA from the University of Chicago (1976–1977) and a PhD from UC Berkeley (1985). His research focuses on the interplay between phonetics and phonology, particularly speech perception and its influence on phonological representations. He co-founded the Laboratory Phonology Conference series in 1987 and has conducted fieldwork on Otomanguean languages. His work emphasizes experimental methods to study phonological questions, including studies on vowel perception, tone systems, and cross-linguistic phonetic patterns. Kingston’s academic journey includes roles at the University of Texas, Austin (1984–1986) and Cornell University (1986–1990). His research explores how auditory processing and linguistic knowledge shape speech perception, with notable contributions to understanding tonogenesis, perceptual contrast effects, and vowel category learning in second languages. He collaborates on grants examining Ganong effects and phonological inventories, advocating for theories that bridge perceptual and structural aspects of language. His lab, the Phonetics Lab, supports experimental work on speech perception and production. Kingston is also the Honors Program Coordinator, mentoring students in linguistics and related fields. Despite no explicit awards listed, his extensive publications and conference leadership reflect his scholarly impact.
استاد آموزشی
Dr. Konstantin (Kostia) M. Zuev serves as Teaching Professor in the Computing + Mathematical Sciences Department at California Institute of Technology , where he has made significant contributions to network science and computational statistics since 2016. His dual PhDs in Mathematics (Moscow State University, 2008) and Civil Engineering (HKUST, 2009) underpin his interdisciplinary research spanning differential geometry, stochastic simulation, and network dynamics. Education PhD in Mathematics, Lomonosov Moscow State University (2008) PhD in Civil Engineering, Hong Kong University of Science & Technology (2009) His research focuses on network science , particularly course-prerequisite networks and complex financial systems , with recent work extending to network navigability in cosmological models and rare event simulation. Over his career, he has developed innovative Bayesian inference methods and geometric preferential attachment theories while maintaining active collaborations across mathematics, physics, and biomedical domains. Recent publications highlight network analysis in education ( 2023 ), hyperbolic graph theory ( 2024 ), and pandemic-informed cancer mortality studies ( 2023 ). His 15 most recent articles demonstrate methodological innovations across disciplines including statistics, physics, finance, and cosmology. Scientific recognition includes Humboldt Research Fellowship (2021) Carver Mead Seed Fund Grant (2023) ASCIT Teaching Award (2018, 2023) Northrop Grumman Teaching Excellence Prize (2019) As Graduate Option Representative for Information and Data Sciences at Caltech and faculty advisor for multiple student organizations including the Caltech Karate Club and Caltech Chess Club , he actively bridges academic rigor with community engagement through outreach initiatives like the virtual math education channel and university math circles for K-12 students.
Eamonn Keogh is a Professor in the Computer Science and Engineering Department at the University of California, Riverside. His pioneering work centers on the Matrix Profile, a transformative approach to time series data mining enabling efficient solutions for motif discovery, anomaly detection, and similarity search. His algorithms (STAMP, STOMP, SCRIMP, DAMP, SCAMP) offer exact, parameter-free, and scalable solutions across domains like seismology, bioinformatics, and industrial IoT. Research areas include: Development of ultra-fast algorithms for time series joins and motif discovery at unprecedented scales (breaking the 100 million barrier) GPU acceleration for time series mining Domain-agnostic methods for semantic segmentation and anomaly detection Novel primitives like Time Series Chains, Snippets, and Consensus Motifs His work is highly cited and recognized by industry and academia, with applications ranging from NASA's Cassini mission to detecting BGP anomalies in computer networks.
فقط ۷۵۰ نتیجه اول نمایش داده میشود. برای رسیدن به نتایج دقیقتر، جستوجو را با فیلترها محدودتر کنید.
