جستجوی استاد راهنمای دانشگاهی

Leslie Valiantمشاهده پروفایل

استاد

• Complexity Theory
• Machine Learning
• Parallel Computation
• +۴ مورد دیگر

Leslie Valiant is the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics in Harvard University's School of Engineering and Applied Sciences, where he has held a faculty position since 1982. A foundational figure in theoretical computer science, his work bridges artificial and natural computational phenomena across multiple disciplines. His academic background includes education at: King's College, Cambridge Imperial College, London Ph.D. in Computer Science from Warwick University (1974) Valiant's research spans computational complexity , machine learning theory , parallel systems , and computational neuroscience . He pioneered the PAC (Probably Approximately Correct) learning framework that established computational learning theory as a rigorous field. His holographic algorithms work revealed deep connections between computational complexity and statistical physics, while his neuroidal model and evolvability theory provide computational explanations for cognitive processes and biological evolution. Current investigations focus on cortical computation primitives and knowledge infusion architectures. His publication trends show increasing integration of neuroscience with computational theory since 2010, with dominant themes in holographic computation (2006-2018), cortical modeling (2012-2018), and evolvability (2009-2017). The work consistently applies computational complexity analysis to biological and cognitive systems. Major recognitions include: Nevanlinna Prize (1986) for mathematical aspects of computer science Knuth Award (1997) for foundational algorithms contributions EATCS Award (2008) for theoretical computer science impact Turing Award (2010) for computational learning theory and complexity Fellowship in the Royal Society and National Academy of Sciences Valiant's research has been supported by NSF and international grants enabling cross-disciplinary work in computational neuroscience and evolutionary algorithms. While specific advisees aren't documented in source materials, his theoretical frameworks have shaped generations of researchers in machine learning and complexity theory. His current research group explores neuroidal architectures for cognitive computation, investigating how cortical circuits achieve robust information processing through in-circuit testing methodologies. Ongoing projects aim to identify fundamental computational primitives in neural systems and develop biologically inspired AI frameworks.

Julie Bergnerمشاهده پروفایل

استاد

• Homotopy Theory
• Algebraic Topology
• Algebraic K-Theory
• +۳ مورد دیگر

Julie Bergner is a Professor in the Department of Mathematics at the University of Virginia. She is currently on sabbatical during 2024-25 as a Visiting Fellow at Clare Hall, University of Cambridge. Her research focuses on Homotopy Theory, Algebraic Topology, Algebraic K-Theory, and Category Theory, with a particular emphasis on higher category theory and homotopical algebraic structures. University of Virginia (Professor, Department of Mathematics) University of Cambridge (Visiting Fellow at Clare Hall, 2024-25) Her work spans 2-Segal objects, model categories, Waldhausen constructions, and applications to topological field theories. She has received NSF CAREER awards for her research on equivariant topological field theories and higher cluster categories. Her recent publications explore combinatorial models, enriched categories, and homotopy limits in the context of functor calculus and higher structures. Julie Bergner contributes to mathematical exposition through articles on writing papers in the mathematical sciences and homotopy theory applications. She is actively involved in the department's topology seminar and supports collaborative learning initiatives. Her research has implications in algebraic topology, category theory, and their interdisciplinary applications.

Vijay Vaziraniمشاهده پروفایل

استاد

• Algorithmic Game Theory
• Matching Markets
• Computational Complexity
• +۶ مورد دیگر

Vijay Vazirani is a Distinguished Professor in the Department of Computer Science at the University of California, Irvine , where he directs the ACO Center @ UCI . He earned his Ph.D. in Computer Science from UC Berkeley and a S.B. from MIT. Vazirani is a Guggenheim Fellow , ACM Fellow , and 2022 INFORMS John von Neumann Theory Prize recipient. Research Areas: Algorithmic Game Theory, Matching Markets, Computational Complexity, Approximation Algorithms His groundbreaking work includes co-founding algorithmic game theory and solving a 30-year-old problem with an NC algorithm for perfect matching in planar graphs . Recent research focuses on matching-based market design, with a $500K NSF grant for advancing algorithms in matching and market equilibria. His 15 most recent papers explore topics like core imputations, stable matching lattices, and Nash bargaining solutions. Scientific Awards: Guggenheim Fellowship ACM Fellow 2022 INFORMS John von Neumann Theory Prize Vazirani advises numerous Ph.D. students and postdocs, including Tung Mai , Thorben Trobst , and Rohith Reddy Gangam . He contributes to major workshops and co-edited foundational texts like Algorithmic Game Theory and Online and Matching-Based Market Design .

Satish Raoمشاهده پروفایل

استاد

• Algorithms
• Combinatorial Optimization
• Graph Theory
• +۴ مورد دیگر

Satish Rao is a Professor in the Computer Science Division at the University of California, Berkeley. He is affiliated with the Simons Institute for the Theory of Computing and the Center for the Theoretical Foundations of Learning, Inference, Information, Intelligence, Mathematics and Microeconomics at Berkeley (CLIMB). His research focuses on algorithms, combinatorial optimization, graph theory, and theoretical computer science with applications to computational biology and machine learning. Rao has held teaching roles for courses such as CS 70 (Discrete Mathematics and Probability Theory) and CS 270 (Spring 2024). He has been recognized with prestigious awards including ACM Fellow (2013), the Delbert Ray Fulkerson Prize (2012), and the Okawa Research Grant (1999). Research Interests: Algorithm design, graph algorithms, combinatorial optimization, computational biology, and machine learning. Key Contributions: Pioneering work on metric embeddings, approximation algorithms, and network flow problems. Notable publications include foundational papers on tree metrics, distributed object location, and electrical flow-based optimization. Rao’s work bridges theoretical computer science with practical applications, including contributions to phylogeny estimation, anomaly detection, and parallel computing frameworks like the BSP model.

Timothy Rileyمشاهده پروفایل

استاد

• Geometric Group Theory
• Geometric Topology
• Algorithmic Complexity
• +۳ مورد دیگر

Timothy Riley is a Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences. His research focuses on geometric group theory, studying infinite discrete groups through geometric lenses such as Riemannian manifolds, graphs, and cell complexes. Key interests include curvature, geometric features of group presentations, and algorithmic complexity. He holds a D.Phil. from Oxford University (2002). Research spans geometric aspects of the word problem, hyperbolic groups, Dehn functions, and applications to cryptography and topology. His work integrates algebraic, topological, and computational perspectives. Notable collaborations include studies on hydra groups, Cayley graphs, and asymptotic cones. Publications emphasize geometric topology and group theory, with contributions to understanding filling invariants and geometric algorithmic properties. His office is 403 Malott Hall, and he maintains an active personal web page. No explicit awards are listed in the provided text, though he was part of news items related to teaching honors in 2024.

• Theoretical Computer Science
• Computational Geometry
• Algorithms
• +۳ مورد دیگر

Günter Rote is a Professor in the Department of Computer Science at Freie Universität Berlin, specifically within the Theoretical Computer Science group (Arbeitsgruppe Theoretische Informatik). He holds a formal academic title of Professor Dr. and is affiliated with the Faculty of Mathematics and Computer Science. His research focuses on theoretical computer science, computational geometry, algorithms, and discrete mathematics. Key research interests include geometric algorithms, optimization problems (e.g., shortest paths, traveling salesman problems), and algorithm design for parallel computing systems. His work spans topics such as systolic arrays, convex hulls, and combinatorial optimization. Rote’s contributions include foundational studies on computational geometry problems, algorithmic complexity, and practical applications in energy equity and infrastructure design. Publications highlight contributions to solving extremal equations, polygon transformations, and the quadratic assignment problem. He has been active in academic leadership, mentoring students, and contributing to computational science communities. His email is rote@inf.fu-berlin.de, and his office is located at Takustraße 9 in Berlin.

Ruilin Shiمشاهده پروفایل

استاد پژوهش

• Graph Theory
• Combinatorics
• Discrete Mathematics
• +۳ مورد دیگر

Ruilin Shi serves as the William W. Elliott Assistant Research Professor in the Department of Mathematics at Duke University. Their office is located at 120 Science Drive, Durham, NC. Education: Ph.D. from Georgia Institute of Technology (2025) Dr. Shi specializes in combinatorial mathematics with particular focus on extremal graph theory and planar Turán problems . Their research investigates maximum edge counts in planar graphs avoiding specific substructures, particularly cycles of various lengths. This work bridges theoretical computer science and pure mathematics, contributing to fundamental understanding of graph limitations under planarity constraints. Recent publications demonstrate expertise in determining precise bounds for planar Turán numbers, with significant results for 7-cycles and general cycle graphs. Their work connects circuit graphs, near triangulations, and connectivity properties to solve longstanding conjectures in the field. No scientific awards are currently documented in the available information. For Fall 2025, Dr. Shi is teaching multiple sections of MATRICES AND VECTOR SPACES (MATH 218D and MATH 718D) across different time slots and locations including Physics 154, Physics 235, and LSRC A247. No laboratory or research team information is specified in the available documentation.

Artur Czumajمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Randomized Algorithms
• +۹ مورد دیگر

Artur Czumaj is a Professor in the Department of Computer Science at the University of Warwick and serves as the Director of the Centre for Discrete Mathematics and its Applications (DIMAP). He is a member of the Division of Theory and Foundations (FoCS) and holds affiliations with the Alan Turing Institute, the Warwick Data Science Institute (WDSI), and the Warwick Centre for Doctoral Training in Mathematics of Real-world Systems (MathSys). Previously, he served as Head of Department and President of the European Association for Theoretical Computer Science (EATCS) from 2020 to 2024. His research lies at the core of theoretical computer science, focusing on the design and analysis of algorithms, particularly randomized, sublinear, parallel, and distributed algorithms. His work spans graph theory, combinatorics, computational geometry, algorithmic game theory, and property testing. He has led major research initiatives funded by EPSRC, IBM, the Royal Society, and Weizmann-UK grants. The trends in his recent publications highlight a strong emphasis on sublinear algorithms, dynamic graph algorithms, and property testing, with recurring themes in randomized methods, graph processing, and efficient data structures. His work bridges foundational theory with applications in data summarization, network analysis, and computational geometry. EPSRC grants: EP/D063191/1, EP/G064679/1, EP/G069034/1, EP/J021814/1, EP/N011163/1, EP/V01305X/1, EPSRC studentship IBM Faculty Award Royal Society International Exchanges Scheme Weizmann-UK Making Connections Grants on combinatorial and algorithmic primitives and the interplay between algorithms and randomness Peter Davies received the 2020 Warwick Faculty of Science Thesis Prize under his supervision Artur Czumaj has supervised numerous PhD students, including Anna Adamaszek, Michal Adamaszek, Sam Coy, Peter Davies, Michail Fasoulakis, Jan Hladky, Wang Xin, and Hairong Zhao. His research has been supported by sustained grant funding, reflecting his leadership in theoretical computer science. He has organized major workshops at Dagstuhl, Oberwolfach, Simons Institute, and the University of Warwick, and has served on the steering committees of HALG and as PC Chair for SODA 2018 and ICALP 2020. He is actively involved in organizing key research events, including the Simons Institute Special Semester on Sublinear Algorithms (2024), the Workshop on Sublinear Graph Simplification (2024), and the Computational Complexity Conference (CCC 2023) at Warwick. He also co-organizes the Warwick-Weizmann workshops and the IGAFIT Algorithmic Postdocs Workshop, fostering international collaboration in algorithms research.

• Tropical Geometry
• Cluster Algebras
• Combinatorics
• +۵ مورد دیگر

David E Speyer is a Professor in the Department of Mathematics at the University of Michigan . His research focuses on algebraic problems with combinatorial flavors , particularly in tropical geometry , cluster algebras , and geometry of Lie groups . He has supervised multiple PhD students, including Shelby Cox, Will Dana, and John Wiltshire-Gordon, and collaborated on projects with undergraduates like Grant Barkley and Benjamin Branman. Education: PhD in Mathematics from UC Berkeley under Bernd Sturmfels; undergraduate at Harvard. Research: Key areas include tropical geometry , cluster algebras , and flag manifolds . His work often bridges combinatorics, algebraic geometry, and representation theory. Publications: Over 40 papers, including breakthroughs in cluster algebras , affine weak order , and braid variety cluster structures . Awards: Clay Research Fellow (2005-2010). Teaching: Coordinates courses like Math 593 (graduate algebra) and Math 214 , with a focus on inquiry-based learning .

Ron Peledمشاهده پروفایل

استاد

• Probability Theory
• Statistical Physics
• Mathematical Physics
• +۷ مورد دیگر

Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.

Samuel Johnstonمشاهده پروفایل

مدرس

• Probability
• Stochastic Processes
• Free Probability
• +۷ مورد دیگر

Samuel Johnston is a Lecturer in Probability Theory at the Department of Mathematics, King's College London, affiliated with the Faculty of Natural, Mathematical & Engineering Sciences. He joined King's in 2022 after postdoctoral roles at the University of Bath, University of Graz, and University College Dublin. MMath, University of Oxford (2014) PhD in Probability, University of Bath (2017) Johnston's research spans probability theory, with a focus on stochastic processes involving branching, coalescence, and fragmentation. He actively explores free probability, random matrices, integrable combinatorics, and combinatorial approaches to the Jacobian conjecture. His work intersects with statistical physics and asymptotic geometric analysis. Recent publications highlight coalescent structures in heavy-tailed branching processes, integrable probability models, free probability via entropic transport, and convexity in high dimensions. Keywords include universality classes, Berry-Esseen bounds, and fragmentation-scaling limits. Samuel has not been mentioned to have received specific scientific awards or honors. He advises PhD students Rohan Shiatis (2023-) and Neil Mukerji (2024-). Collaborations span institutions in the UK, USA, Mexico, Austria, and Poland, with invited talks at global conferences including Xiangtan University, Imperial College London, and UCLA.

• Probability Theory
• Random Discrete Structures
• Random Trees
• +۶ مورد دیگر

Igor Kortchemski is a CNRS researcher at the Department of Mathematics and Applications (DMA) at École Normale Supérieure, Paris, and a lecturer in the Department of Applied Mathematics at École Polytechnique. His primary research focuses on the continuous limits of random discrete models, particularly examining how discrete combinatorial structures converge to continuous objects under appropriate scaling. His educational background includes a PhD in Mathematics (2012) under Jean-François Le Gall at École Normale Supérieure and a Habilitation à diriger des recherches (HDR) in Mathematics (2016). Kortchemski's research spans several interconnected areas: Random trees and Galton-Watson processes with heavy-tailed distributions Random planar maps and their geometric properties Growth-fragmentation processes and their connections to Lévy processes Scaling limits of combinatorial structures and their continuous counterparts His publication record shows a consistent focus on the geometric properties of random discrete structures, with recent work (2023-2025) exploring uniform attachment processes with freezing, critical tree phenomena, and the mesoscopic geometry of sparse random maps. His research often involves sophisticated probabilistic analysis combined with combinatorial insights. Scientific recognition includes: prix de thèse solennel Perrissin-Pirasset / Schneider de la chancellerie des Universités de Paris (2012) Kortchemski actively contributes to academic service: Examiner for the minor math exam at École Polytechnique (FUF) since 2023 Member of the mathematics jury for ENS International Selection (2023) Member of the jury for the external mathematics competitive examination (Agrégation) since 2021 Member of the jury for the Arts and Economic and Social Sciences Bank (B/L) mathematics exams (2015-2018) He mentors the next generation of researchers as co-director of Antoine Aurillard's and Vanessa Dan's theses (both since 2023), and previously directed Etienne Bellin's (2020-2023) and Paul Thevenin's (2017-2020) theses.

Abdellah Sebbarمشاهده پروفایل

استاد

• Number Theory
• Algebraic Geometry
• Arithmetic Geometry
• +۷ مورد دیگر

Abdellah Sebbar is a Full Professor in the Department of Mathematics and Statistics at the University of Ottawa. He holds a PhD from Stony Brook University (1993-1997) and prior degrees from Rabat and Strasbourg. His research focuses on number theory, algebraic geometry, and modular forms, with specialties in elliptic curves, moonshine theory, and quantum groups. He has authored over 40 publications, including works on Schwarzian equations and equivariant functions. His career includes roles as CRM-ISM Postdoctoral Fellow (1997-1999), CMS Instructor (1999-2001), and Associate Professor (2004-2013) before attaining his current rank. He advises graduate students and collaborates on projects involving modular subgroups and automorphic forms. Education: 1992: BSc in Pure Mathematics, Rabat 1992-1993: DEA (Master's), Strasbourg 1993-1997: PhD in Mathematics, Stony Brook (Fulbright Scholar) Research Interests: Modular forms and functions Elliptic curves and surfaces Discrete groups and moonshine Quantum groups and mathematical physics Schwarzian differential equations Professional Timeline: 2013–Present: Full Professor, UOttawa 2004–2013: Associate Professor, UOttawa 2001–2004: Assistant Professor, UOttawa His recent work emphasizes applications of Schwarzian equations to modular forms and automorphic differential equations. Collaborative efforts with Hicham Saber and others explore equivariant functions and vector-valued modular forms. He has supervised multiple PhD/MSc students, including co-supervision with Damien Roy.

Tatiana Smirnova-Nagnibedaمشاهده پروفایل

دانشیار

• Combinatorial Group Theory
• Geometric Group Theory
• Asymptotic Group Theory
• +۵ مورد دیگر

Tatiana Smirnova-Nagnibeda is an Associate Professor in the Mathematics Section at the University of Geneva, where she obtained her PhD before holding positions at ETH Zurich and KTH Stockholm. She returned to UNIGE where she has established herself as a leading researcher in geometric and combinatorial group theory. Her research focuses on combinatorial, asymptotic and geometric group theory, as well as probabilities on groups and graphs. She has made significant contributions to the understanding of branch groups, self-similar groups, Schreier graphs, and spectral properties of group actions. Her work often bridges algebra, probability, and geometry, revealing deep connections between these areas through the study of Thompson's groups, Grigorchuk's group, and other important group constructions. Her recent publications demonstrate a consistent focus on subgroup structure in various classes of groups, spectral properties of Schreier and Cayley graphs, and connections to dynamical systems. She frequently collaborates with researchers from around the world, particularly with Rostislav Grigorchuk, and has mentored numerous doctoral students who have gone on to successful academic careers. Managing Editor for Groups, Geometry, and Dynamics Editor for L'Enseignement Mathématique Organizer of GAGTA conferences (2022, 2024) Organizer of specialized workshops on high-dimensional expanders (2015, 2016) She leads an active research group comprising postdoctoral fellows and doctoral students working on various aspects of group theory and its applications. Her teaching includes advanced courses on graph theory, random walks on groups, spectral theory of graphs, and amenability at the University of Geneva.

Anton Petruninمشاهده پروفایل

استاد

• Geometry
• Alexandrov Geometry
• Metric Geometry
• +۶ مورد دیگر

Anton Petrunin is a Professor in the Department of Mathematics at The Pennsylvania State University, affiliated with the Eberly College of Science. He holds a Ph.D. from the University of Illinois at Urbana-Champaign (1995). His research focuses on Geometry, particularly Alexandrov geometry, metric geometry, differential geometry, and their applications. He is known for contributions to curvature bounds, isometric embeddings, and geometric analysis. Teaching: Petrunin instructs courses such as MATH 471 (Geometry for Teachers) and actively engages in mathematical outreach, including organizing the Tournament of Towns, an international mathematics competition for school students. He emphasizes problem-solving and rigorous foundations in his pedagogy. Publications: Petrunin has authored influential books, including Alexandrov Geometry: Foundations , Pure Metric Geometry , and Euclidean Plane and Its Relatives . His work bridges theoretical advancements with accessible educational materials. Contributions: Beyond academia, he advocates for open-access research and self-publishing in mathematics. His GitHub repository reflects his commitment to sharing educational resources and collaborative projects in metric geometry and topology.