جست‌وجوی استاد و پژوهشگر

• Probability
• Mathematical Physics
• Combinatorics
• +۲ مورد دیگر

Alexey Bufetov is a Professor at Leipzig University, holding an ERC Starting Grant for his research in Integrable Probability (2022-2027). Previously, he served as a W2-Professor ("Bonn Junior Fellow") at the Hausdorff Center for Mathematics (2018-2021) and as a CLE Moore Instructor at Massachusetts Institute of Technology (2015-2018). His research centers on Probability Theory , with deep connections to Mathematical Physics and Combinatorics . Key areas include integrable probability, stochastic particle systems (ASEP/TASEP), random tilings, Schur generating functions, and representation-theoretic aspects of probability. His work often bridges abstract mathematical structures with physical models from statistical mechanics. Bufetov's recent publications reveal a strong focus on integrable systems and asymptotic analysis , particularly exploring connections between Mallows measures, vertex models, and random matrix theory. His 2025 work on Aztec diamond domino tilings exemplifies his signature approach combining combinatorial structures with probabilistic methods. His primary recognition is the ERC Starting Grant "Integrable Probability" (2022-2027), supporting his cutting-edge research program. Bufetov has maintained a prolific collaborative network, frequently publishing with leading researchers including Alexei Borodin, Vadim Gorin, Leonid Petrov, and Kailun Chen. His work appears in top journals such as Advances in Mathematics , Duke Mathematical Journal , and Communications in Mathematical Physics .

Asaf Shapiraمشاهده پروفایل

استاد

• Extremal Combinatorics
• Graph Theory
• Property Testing
• +۴ مورد دیگر

Professor Asaf Shapira is a faculty member in the Department of Theoretical Mathematics at Tel Aviv University's School of Mathematical Sciences. He has been actively contributing to combinatorics and graph theory research for over a decade, with numerous publications in top journals including Journal of the ACM, Advances in Mathematics, and Geometric and Functional Analysis. Professor Shapira's research focuses on extremal combinatorics, graph theory, and property testing. His work explores fundamental questions in Ramsey theory, hypergraph theory, and probabilistic methods in combinatorics. He has made significant contributions to the study of graph regularity, removal lemmas, and extremal problems in dense and sparse graphs. His recent publications demonstrate a consistent focus on theoretical aspects of combinatorics with connections to theoretical computer science. A notable trend is his work on developing polynomial bounds for various combinatorial theorems and exploring connections between combinatorial structures and computational complexity. His research often bridges pure mathematics with theoretical computer science applications. Professor Shapira teaches advanced courses at Tel Aviv University including Extremal Graph Theory, Basic Combinatorics, and seminars on specialized topics in combinatorics. His teaching spans undergraduate and graduate levels, reflecting his commitment to educating the next generation of mathematicians.

Tibor Szabóمشاهده پروفایل

استاد

• Combinatorics
• Extremal Graph Theory
• Random Structures and Algorithms
• +۵ مورد دیگر

Tibor Szabó is a Professor in the Combinatorics and Graph Theory group at the Department of Mathematics, Freie Universität Berlin. He holds a PhD from The Ohio State University, advised by Ákos Seress. Prior to his current position, he held roles at McGill University, ETH Zürich, the Institute for Advanced Study (Princeton), and the University of Illinois (UIUC) as a J.L. Doob Research Assistant Professor. Research Interests: His work focuses on combinatorics and combinatorial optimization, including extremal problems, random structures and algorithms, pseudorandom graphs, positional games, and the combinatorics of linear programming. He explores tools from algebra, probability theory, and topology applied to combinatorics. Teaching: He teaches courses such as Algorithmic Combinatorics, Extremal Combinatorics, and runs the Combinatorics Seminar. His lecture notes include works on positional games and explicit constructions in extremal combinatorics. Students & Postdocs: Notable PhD advisees include Yamaan Attwa, Silas Rathke, Simona Boyadzhiyska, and Patrick Morris. Postdoctoral fellows include Olaf Parczyk and Anurag Bishnoi. His research has involved collaborations with over 50 co-authors. Funding & Grants: Supported by grants from the Swiss National Science Foundation (SNF) and German Research Foundation (DFG), focusing on topics like positional games and extremal graph theory.

Stefan Glockمشاهده پروفایل

استادیار

• Discrete Mathematics
• Extremal Combinatorics
• Probabilistic Combinatorics
• +۴ مورد دیگر

Professor Stefan Glock is an Assistant Professor of Discrete Mathematics at the University of Passau's Faculty of Computer Science and Mathematics, a position he has held since September 2022. Prior to this appointment, he spent three years as a Junior Fellow at the Institute for Theoretical Studies at ETH Zurich, following the completion of his doctorate at the University of Birmingham. Stefan Glock received his mathematics education at Technische Universität Ilmenau from 2009 to 2014, then pursued his PhD at the University of Birmingham, which he completed in 2018. His doctoral dissertation, "Decompositions of Graphs and Hypergraphs," was the runner-up for the Richard-Rado-Preis 2018. Professor Glock's research focuses on discrete mathematical structures, with particular emphasis on their asymptotic properties. His work spans several interconnected fields of combinatorics: Extremal Combinatorics : Investigating the maximum or minimum possible size of mathematical structures satisfying certain properties Probabilistic Combinatorics : Applying probability theory to solve combinatorial problems Graph Theory : Studying properties of graphs and networks Ramsey Theory : Examining conditions under which order must appear in large structures Design Theory : Creating arrangements of elements satisfying specific balance properties Discrete Geometry : Analyzing geometric problems with discrete structures Analysis of Professor Glock's recent publications reveals a consistent focus on solving long-standing open problems in combinatorics using innovative methods that combine probabilistic techniques with structural insights. His work often bridges theoretical mathematics with applications in theoretical computer science, particularly in the analysis of algorithms and network structures. A significant portion of his research addresses fundamental questions about graph and hypergraph decompositions, which have implications for coding theory, cryptography, and network design. Professor Glock has received notable recognition for his contributions to mathematics: Runner-up for the Richard-Rado-Preis 2018 for his dissertation "Decompositions of Graphs and Hypergraphs" Awarded funding through the prestigious DFG Emmy Noether Programme in 2024 for his research group on "the interplay of structure and randomness in mathematics" As a faculty member at the University of Passau, Professor Glock leads the Discrete Mathematics research group and actively collaborates with mathematicians worldwide. He has established a strong research program that has attracted funding for academic visitors and supports multiple research projects. His approach to mathematical problems emphasizes developing new methods that have far-reaching implications beyond the specific problems being solved. Professor Glock's research group at the University of Passau focuses on the interplay between structure and randomness in discrete mathematics. The group maintains active collaborations with leading institutions including ETH Zurich, University of Birmingham, and various research centers across Europe. Through the DFG Emmy Noether Programme funding, his group is expanding its research on combinatorial structures and their applications.

• Theoretical Computer Science
• Algorithms and Data Structures
• Computational Geometry
• +۵ مورد دیگر

Raimund Seidel is a Professor in the Department of Computer Science at Universität des Saarlandes, leading the Chair of Theoretical Computer Science. He is actively involved in research and teaching, focusing on foundational aspects of algorithms and data structures, particularly in computational geometry. His primary research interests include theoretical computer science , design and analysis of efficient algorithms , geometric data structures , randomized algorithms , and combinatorial geometry . His work addresses fundamental problems such as planar point location, convex hull computation, and efficient encoding of triangulations. He also investigates geometric algorithms under the transdichotomous model, leveraging word-level parallelism. The selected publications reflect a long-standing contribution to computational geometry and data structure theory , with a focus on randomized methods and exact complexity analysis. His research combines theoretical rigor with practical implications for algorithm design. Award or honor not found in the provided text. Prof. Seidel has advised several students, including Alexander Malkis , Ralf Osbild , Udo Adamy , Christian Sohler , and others, many of whom have gone on to academic and research careers. No explicit information about grants or funding is available in the text. He leads a research group within the Department of Computer Science at Universität des Saarlandes, mentoring current staff such as László Kozma , Giorgi Nadiradze , and Lavinia Dinu . The group maintains active research in theoretical computer science and computational geometry.

• Computational Algebra
• Finite Group Theory
• Combinatorics
• +۷ مورد دیگر

Alice Niemeyer is a Professor at the Algebra Teaching and Research Area of RWTH Aachen University , specializing in computational algebra, finite group theory, and interdisciplinary applications in civil engineering. She has co-authored over 30 publications in journals like PNAS Nexus , Linear Algebra and Its Applications , and International Journal of Solids and Structures , with recent work bridging abstract algebra and topological interlocking concrete systems. Research Interests : Finite groups, matrix decomposition algorithms, combinatorial design, and applications to sustainable construction. Key Collaborators : Cheryl Praeger, Tomasz Popiel, Wilhelm Plesken, Daniel Robertz, Reymond Akpanya. Notable Grants : Funding from the Simons Foundation for computational algebra research. Awards : No explicit awards mentioned in the provided text.

V. Arvindمشاهده پروفایل

استاد

• Computational Complexity Theory
• Structural Complexity
• Randomized Computation
• +۵ مورد دیگر

V. Arvind is a Professor in the Theoretical Computer Science faculty at the Institute of Mathematical Sciences (IMSc) , Chennai. His research is centered on computational complexity theory, with a focus on structural complexity, randomized and algebraic computation, and quantum information and computation. He explores the deep connections between theoretical computer science and mathematics. Institution: Institute of Mathematical Sciences (IMSc), Chennai School: Theoretical Computer Science Academic Rank: Professor Arvind's research interests include computational complexity, structural complexity theory, algebraic computation, derandomization, and quantum computing. He is particularly interested in the interplay between mathematical structures and computation. His work often bridges theoretical computer science with algebra, combinatorics, and logic. His recent publications, primarily expository articles in the EATCS Bulletin’s Computational Complexity Column, cover a wide range of topics such as robust oracle machines, the Alon-Roichman theorem, noncommutative arithmetic circuits, graph isomorphism, and quantum computation. These works reflect trends in foundational complexity theory, algebraic methods in computation, and the exploration of quantum models. The articles emphasize structural insights, lower bounds, and connections to mathematical disciplines. Professional Service and Editorial Roles: Associate Editor, ACM Transactions on Computation Theory Editor, EATCS Computational Complexity Column (since June 2011) Editorial Board Member, International Journal of Computer Mathematics (2009–2013) Co-organizer, ICM Satellite Conference on Algebraic and Probabilistic Aspects of Combinatorics and Computing Program Committee Member for WALCOM 2014, STACS 2012, COCOON 2009, FSTTCS (multiple years, including chair roles), CCC 2006, INDOCRYPT (2002, 2005), and others Teaching: Arvind has taught advanced courses including Computational Complexity, Algorithms, Algebra and Computation, and Discrete Mathematics, often based on foundational texts and notes from leading experts. Lecture notes from his courses have been compiled by students and collaborators. Collaborations: He has an extensive list of co-authors, including prominent researchers such as Manindra Agrawal, Eric Allender, Johannes Köbler, Meena Mahajan, Jacobo Torán, and Ramprasad Saptharishi, indicating strong collaborative research networks in complexity theory and algorithms.

Emilija Perkovicمشاهده پروفایل

استادیار

• Causal Inference
• Graphical Models
• Probabilistic Graphical Models
• +۳ مورد دیگر

Emilija Perkovic serves as the Dorothy Gilford Early Career Endowed Professor in Mathematical Statistics within the Department of Statistics at the University of Washington. She joined the department in Autumn 2018 as an Acting Assistant Professor and advanced to a tenure-track Assistant Professor position in Autumn 2020, establishing herself as a core faculty member in statistical methodology. Her academic foundation includes: B.Sc. in Mathematics from the University of Belgrade (2012) M.Sc. in Statistics from ETH Zürich (2014) Ph.D. in Statistics from ETH Zürich (2018) under Professor Marloes Maathuis Perkovic's research pioneers causal inference methodologies through probabilistic graphical models, focusing on intuitive frameworks for causal identification and estimation from observational data. Her work bridges theoretical statistics with practical applications, particularly in covariate adjustment techniques and Markov equivalence class analysis. She actively integrates expert knowledge to refine causal models, making complex inference accessible for real-world data challenges where experimental intervention is impossible. Her publication record reveals a concentrated evolution in causal graph theory, with recent preprints advancing adjustment criteria for diverse graph structures (MPDAGs, MAGs, ancestral graphs). Key trends include developing sound/complete identification rules, efficient estimation techniques under linearity, and minimal effect enumeration in equivalence classes—collectively enhancing robustness in observational causal analysis. Her scientific recognition includes: Best Poster Award, Semantic Statistics (SEMSTAT), Statistical Network Science Workshop (2017) While specific advising details and grant histories remain unreported in source materials, Perkovic's research trajectory indicates active mentorship through co-authored preprints with junior collaborators like Sara LaPlante and F. Richard Guo. Her Dorothy Gilford Endowed Professorship likely supports ongoing methodological innovation in causal statistics. No laboratory or team structures are explicitly referenced in her professional profile, suggesting independent or collaborator-driven research within the Statistics Department framework.

• Combinatorics
• Discrete Mathematics
• Positional Games
• +۷ مورد دیگر

Dennis Clemens is a researcher in the Institute of Mathematics at Hamburg University of Technology, where he leads and contributes to research in discrete mathematics, particularly in the Chair of Discrete Mathematics. His work centers on combinatorial game theory, extremal combinatorics, and probabilistic methods in graph theory. Research Interests: His research spans positional games (Maker-Breaker, Waiter-Client, Walker-Breaker), Ramsey theory , random graphs , and graph packing . He investigates structural properties of games on random and perturbed graphs, size-Ramsey numbers, and extremal problems in hypergraphs. Publications Trends: His recent publications (2021–2024) show a strong focus on game-theoretic models over random structures, with frequent collaborations. Key themes include fast winning strategies, universality, connectivity, and Ramsey-type problems. Scientific Awards: No specific awards mentioned in the provided texts. Advising and Grants: While no explicit list of advisees or grants is given, his role as a research leader suggests involvement in mentoring students and securing research funding, likely supported by institutions such as the Simons Foundation (acknowledged in arXiv). Labs and Teams: He is affiliated with the Discrete Mathematics group at TUHH, contributing to collaborative research in combinatorics. He participates in academic networks such as the SIAM & GAMM Chapter Hamburg and workshops on Operator Theory, indicating active engagement in the mathematical community.

Cristina G. Fernandesمشاهده پروفایل

دانشیار

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

Cristina G. Fernandes is an Associate Professor in the Department of Computer Science at the Institute of Mathematics and Statistics, University of São Paulo (IME-USP), where she conducts research in theoretical computer science, combinatorial optimization, and graph theory. She teaches advanced courses such as Advanced Data Structures and Topics in Algorithm Analysis. Her research interests include algorithms, combinatorial optimization, graph theory, approximation algorithms, data structures (persistent, retroactive, kinetic, succinct), and computational geometry. She applies theoretical methods to solve complex problems in network design, clustering, and discrete structures. The recent publications reflect a strong focus on structural and extremal graph theory, approximation algorithms, and combinatorial optimization. Key themes include tree and path packing, dominating sets, Steiner-type problems, and combinatorial properties of graphs. Her work often involves deep structural analysis and algorithmic design for NP-hard problems. Cristina G. Fernandes has not been mentioned with any specific scientific awards in the provided texts. She has supervised numerous postdoctoral researchers, PhD, MSc, and undergraduate students, many funded by FAPESP, CAPES, and CNPq. She leads significant research projects, including CAPES/MATH/STIC/CLIMAT-AMSU on energy efficiency in distributed computing and CNPq Universal projects on partitioning and connectivity. She is actively involved in academic advising and grant-funded research. She leads or participates in the Research Group in Theoretical Computer Science, Combinatorics and Combinatorial Optimization at IME-USP, fostering collaborative research in algorithms and discrete mathematics.

Yassine El Maazouzمشاهده پروفایل

مدرس

• Algebraic Geometry
• Non-Archimedean Geometry
• Commutative Algebra
• +۲ مورد دیگر

Yassine El Maazouz is a Harry Bateman Postdoctoral Scholar in the Division of Physics, Mathematics and Astronomy at the California Institute of Technology (Caltech), with a faculty mentor appointment under Professor Matilde Marcolli. He holds instructor positions for graduate mathematics courses including MA132C (Topics in Algebraic Geometry) and MA140B (Probability). Previously, he completed his PhD in Statistics at UC Berkeley after studying pure and applied mathematics at École Polytechnique. Education: PhD in Statistics, UC Berkeley (2019-2023) Master's in Pure and Applied Mathematics, École Polytechnique (2016-2019) Research Interests: His work bridges algebraic/non-Archimedean geometry, commutative algebra, combinatorics, and mathematical physics. Primary investigations include: p-adic algebraic manifolds, isotropic vector gram matrices, tropical invariants, spinor-helicity varieties, and combinatorial probability models. Research consistently demonstrates innovative applications of algebraic methods to problems in theoretical physics and statistical mechanics. Publication Trends: Recent articles (2019-2025) show strong focus on: (1) Algebraic structures in high-energy physics (scattering amplitudes, Coulomb branches), (2) Computational methods for p-adic manifolds and tropical geometry, (3) Combinatorial probability models (Bernoulli polynomials, stochastic processes), and (4) Matrix algebras derived from valuation theory. Work frequently appears in top journals including SIAM Journal on Applied Algebra, Selecta Mathematica, and Combinatorics/PROBABILITY Computing. Awards: Harry Bateman Postdoctoral Scholarship (Simons Foundation) Teaching & Academic Service: At Caltech, teaches graduate courses in algebraic geometry and probability theory. Previously instructed statistics courses at UC Berkeley (2019-2022). Co-organizes the Information, Geometry & Physics Seminar featuring cutting-edge interdisciplinary research. Maintains extensive lecture notes on number theory, probability, and representation theory.

Anita Winterمشاهده پروفایل

استاد

• Probability Theory
• Stochastic Processes
• Mathematical Biology
• +۳ مورد دیگر

Prof. Dr. Anita Winter is a Professor at the University of Duisburg-Essen within the Faculty of Mathematics. Her research focuses on Probability Theory, Stochastic Processes, and their applications in areas like Mathematical Biology and Statistical Physics. She holds a prominent position in the field, with extensive contributions to branching processes, measure-valued processes, and tree-valued stochastic dynamics. Her work integrates algebraic and geometric structures with probabilistic methods, such as algebraic measure trees and pruning processes. She has published extensively in leading journals like *Stochastic Processes and their Applications* and *The Annals of Probability*. Her research often explores the interplay between population dynamics and spatial structures, including studies on coalescent processes, random graphs, and evolutionary models. Anita Winter has taught advanced courses in Probability Theory, Levy processes, and stochastic analysis across multiple semesters, reflecting her deep engagement with both research and education. Her team assistance, led by Dagmar Goetz, supports her academic activities and administrative coordination.

• Programming Languages
• Functional Programming
• Logic Programming
• +۴ مورد دیگر

Jan Christiansen is a Professor in the Department of Information and Communication at Flensburg University of Applied Sciences. He specializes in Programming Languages and Programming Theory, teaching in the Applied Computer Science program. His research focuses on functional logic programming, probabilistic programming, formal verification, and compiler design. His key research areas include the integration of functional logic programming into Haskell, probabilistic programming semantics, and formal methods for verifying Haskell programs in Coq. He has contributed to tools like Sloth for strictness analysis and has explored foundational aspects of encapsulated search in Curry. His work bridges functional programming, logic programming, and probabilistic models, emphasizing practical implementations and theoretical rigor. Christiansen leads the Academic Advisory Service and co-founded TechStartUp@HS-Flensburg. His recent publications span compiler plugins for embedding functional logic in Haskell, probabilistic library implementations, and monadic approaches to program verification. His research bridges academia and practical software development, with implications for both theory and industry.

Christoph Thäleمشاهده پروفایل

استاد

• Stochastic Geometry
• Geometric Probability
• Limit Theorems
• +۴ مورد دیگر

Professor Christoph Thäle is a faculty member in the Faculty of Mathematics at Ruhr-Universität Bochum . His research focuses on stochastic geometry, geometric probability, limit theorems for random structures, and applications of Malliavin calculus and Stein's method. He has supervised numerous PhD and master's students, including Tristan Schiller, Nils Heerten, and Kathrin Meier. His work bridges theoretical probability with geometric analysis, particularly in high-dimensional spaces. Research Interests: Stochastic Geometry, Convex Geometry, Limit Theorems, Random Structures in High Dimensions Team Members: Postdocs (Panagiotis Spanos, Ercan Sönmez), PhD students (Philipp Tuchel, Bahareh Yousefi), and collaborators like Anna Gusakova and Zakhar Kabluchko. Key contributions include studies on random polytopes, Poisson hyperplane tessellations, and geometric analysis in hyperbolic spaces. His recent publications (2023–2025) explore intersection probabilities, radial spanning trees, and large deviations in high-dimensional settings. Thäle's research has been supported by collaborations with institutions like the University of Duisburg-Essen and the University of Osnabrück.

• Combinatorics
• Extremal Combinatorics
• Probabilistic Combinatorics
• +۵ مورد دیگر

Alberto Espuny Díaz is a postdoctoral researcher at the Institute of Computer Science, Faculty of Mathematics and Computer Science, Universität Heidelberg, where he is part of the Theoretical Computer Science and Discrete Mathematics group led by Prof. Felix Joos, supported by a DFG-funded project. He previously held a postdoctoral position at TU Ilmenau in the Large Networks and Random Graphs group under Univ.-Prof. Dr. Yury Person. He completed his PhD at the University of Birmingham under the supervision of Daniela Kühn and Deryk Osthus. Starting in September, he will take up a position as professor agregat at Universitat de Barcelona. Research Interests: Alberto's research lies at the intersection of combinatorics and theoretical computer science. His primary focus is on extremal and probabilistic combinatorics , with significant work in random graphs , random geometric graphs , graph resilience , Hamiltonicity , spanning structures , and additive combinatorics . He investigates threshold phenomena, embedding problems, and structural properties of graphs under random perturbations. The most recent publications reveal a strong trend in analyzing the resilience and structural richness of random and perturbed graphs, particularly focusing on Hamilton cycles, spanning trees, and graph factors. His work frequently combines probabilistic methods with deep structural insights from extremal graph theory, often targeting sharp thresholds and robustness in discrete systems. Scientific Awards: Ramon Llull Prize (2024) for PhD thesis Best Pure Maths Poster Award, University of Birmingham (2019) Second Best Poster Award, LSE (2019) Third Best Poster Award, LSE (2018) Advising and Grants: While no formal students are listed, Alberto has supervised dissemination and editorial work through student journals. He is currently supported by a DFG-funded project at Heidelberg. He has been actively involved in organizing academic events and committees, including serving on the grants committee for BYMAT and organizing the Combinatorics Research Seminar in Heidelberg. Labs and Teams: He is a member of the Theoretical Computer Science and Discrete Mathematics group at Universität Heidelberg and previously worked in the Large Networks and Random Graphs group at TU Ilmenau. He is also affiliated with the Young Mathematicians community through the Real Sociedad Matemática Española and has coordinated national student events.