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

Stanislav Smirnov is a Professor at the University of Geneva's Department of Mathematics since 2003 and Head of the Chebyshev Laboratory at St. Petersburg State University since 2010. He holds a Ph.D. from the California Institute of Technology (1996) and a B.Sc./M.Sc. from St. Petersburg State University (1992). His research focuses on mathematical physics, probability, complex analysis, and dynamical systems, with groundbreaking contributions to the understanding of critical phenomena in statistical physics. Key achievements include receiving the Fields Medal (2010), the highest honor in mathematics, for his work on percolation and the Ising model. He has organized major international conferences, such as the 'St. Petersburg School in Probability & Statistical Physics' (2012) and the '2D Statistical Physics Workshop' (2013). His academic career includes positions at Yale University, the Max-Planck Institute, and KTH Royal Institute of Technology. Education: Ph.D., Mathematics, California Institute of Technology (1996) B.Sc./M.Sc., Mathematics (with honors), St. Petersburg State University (1992) Awards: Fields Medal (2010) European Research Council Advanced Grants (2008, 2013) Rollo Davidson Prize (2002) Salem Prize (2001) Smirnov’s research bridges probability theory and complex analysis, with notable results on conformal invariance in two-dimensional models. His work has advanced understanding of critical exponents, percolation thresholds, and the universality of phase transitions. He advises doctoral students and collaborates internationally on projects funded by Swiss and European grants. He co-organized over 20 conferences worldwide, including plenary talks at the International Congress of Mathematicians (2006, 2010) and the World Congress in Probability and Statistics (2012). His lab fosters interdisciplinary research, linking mathematics to physics and computer science.

• Mathematical Physics
• Probability
• Complex Analysis
• +۳ مورد دیگر

Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.

• Combinatorics
• Geometric Combinatorics
• Probabilistic Combinatorics
• +۷ مورد دیگر

Professor Marta Zofia Kwiatkowska is Professor of Computing Systems and Fellow of Trinity College at the University of Oxford, where she has held a faculty position since 2007. She previously served as Professor of Computer Science at the University of Birmingham (2001–2007), Reader and Lecturer at the University of Birmingham (1994–2001), and Lecturer at the University of Leicester (1986–1994). Her academic career began as Assistant Professor at the Jagiellonian University in Kraków, Poland (1980–1988). Education: BSc/MSc in Computer Science, Jagiellonian University, Kraków MA, University of Oxford PhD, University of Leicester Research Interests: Professor Kwiatkowska spearheaded the development of probabilistic and quantitative verification methods on the international stage. Her work bridges theory and practice through the PRISM model checker—the leading software tool in probabilistic model checking—used worldwide for research and teaching. Application domains include communication and security protocols , nanotechnology designs , power management , ubiquitous computing and systems biology . She investigates automated verification , temporal logics , semantic models for concurrency , real-time systems , and biological process modelling . Current grant funding exceeds £3.7 million from EPSRC, EU and ERC, including the prestigious ERC Advanced Grant VERIWARE. Scientific Awards & Honours: Fellow of the Royal Society Fellow of the ACM Fellow of the European Association for Theoretical Computer Science (EATCS) Fellow of the British Computer Society (BCS) Fellow of the Polish Society of Arts & Sciences Abroad ERC Advanced Grant VERIWARE (€2.046 M, 2010–2015) Top Cited Article Award, Theoretical Computer Science (2005–2010) Best Paper Award, QEST 2006 Doctoral Supervision & Grants: Professor Kwiatkowska actively supervises doctoral students (D.Phil. at Oxford) and post-doctoral researchers. She welcomes applications in areas aligned with her research interests, detailed here . Current students include Charlie Griffin, Daqian Shao, Matthew Yuan and Minghao Liu; past students and researchers number over twenty, many now in faculty or industry leadership roles. Laboratory & Teams: She leads the Oxford Quantitative Verification group within the Department of Computer Science. Ongoing projects include FUN2MODEL, ELSA, FAIR and the flagship PRISM probabilistic model checker. The group maintains strong collaborations with biological, robotics and engineering teams worldwide.

• Automated verification
• Probabilistic model checking
• Temporal logics
• +۳ مورد دیگر

Béla Bollobás is a renowned mathematician affiliated with the University of Memphis as the Jabie Hardin Chair of Excellence in Combinatorics and the University of Cambridge as a Fellow of Trinity College and Honorary Professor at the Centre for Mathematical Sciences. His work spans combinatorics, probability theory, and graph theory, with significant contributions to percolation and random graphs. Dr. Rer. Nat. (Budapest, 1967) Ph.D. (Cambridge, 1972) Sc.D. (Cambridge, 1984) Bollobás pioneered extremal graph theory, random graphs, and probabilistic combinatorics. He introduced novel graph polynomials and advanced bootstrap percolation models, impacting both theoretical mathematics and statistical physics. His research includes inhomogeneous random graphs and cellular automata in random environments. His selected publications reveal a focus on percolation thresholds, graph invariants, and stochastic processes. Notably, he derived sharp thresholds for bootstrap percolation and defined critical probabilities for Voronoi percolation. Senior Whitehead Prize (2007) Fellow of the Royal Society (2011) Foreign Member, Hungarian Academy of Sciences (1990) Foreign Member, Polish Academy of Sciences (2013) Honorary Doctorate, Adam Mickiewicz University (2013) Szechenyi Prize (2017) Bollobás has supervised over 50 Ph.D. students and authored over 450 publications, including 10 books. He co-founded the journal Combinatorics, Probability and Computing and served on eight editorial boards. He organized numerous conferences, including Bill Tutte and Paul Erdős events.

• Extremal Graph Theory
• Random Graphs
• Probabilistic Combinatorics
• +۳ مورد دیگر

Stanislav Smirnov is a Professor at the University of Geneva and holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. A leading figure in mathematical physics, he works on probability, complex analysis, and dynamical systems, with significant contributions to conformal invariance in statistical mechanics models.

• Mathematical Physics
• Probability
• Complex Analysis
• +۳ مورد دیگر

Mihyun Kang is a Professor in the Institute of Discrete Mathematics at Graz University of Technology (TU Graz), leading the Combinatorics Group. She holds significant academic positions and has been recognized with a Heisenberg Fellowship (German Research Foundation) and a Friedrich Wilhelm Bessel Research Award (Alexander von Humboldt Foundation). Her research focuses on combinatorics, discrete probability, and algorithms, with a specialization in random graph theory. She contributes to editorial boards, including Random Structures & Algorithms . Her research interests emphasize high-dimensional graphs, percolation processes, and structural properties of random graphs. She explores topics such as phase transitions, graph enumeration, and algorithmic applications in combinatorial problems. Her work bridges theoretical foundations with practical applications in algorithm design and probabilistic modeling. Dr. Kang’s scientific achievements include pioneering studies on hypergraphs, bootstrap percolation, and the evolution of random graph processes. Her recent publications highlight advancements in understanding graph components, connectivity thresholds, and universality phenomena in random structures. She collaborates widely, contributing to conferences and international initiatives like the SFB “Discrete random structures: enumeration and scaling limits.” Her professional activities include advising doctoral students and supervising research projects at TU Graz. She leads the Combinatorics Group, which hosts the Graz Combinatorics Seminar and actively engages in academic outreach. Her contributions extend to textbook authorship, including Diskrete Mathematik für die Informatik , and she maintains an active presence in discrete mathematics education and research.

• Combinatorics
• Discrete Probability
• Algorithms
• +۳ مورد دیگر

Emmanuel Breuillard is a Professor of Pure Mathematics at the University of Oxford. Previously, he held positions as Sadleirian Professor at the University of Cambridge (2017-2021), Professor at Université Paris-Sud (2008-2017), and Associate Hadamard Professor at École Polytechnique (2006-2008). His academic journey includes a PhD from Université Paris-Sud and Yale University, supervised by Frédéric Paulin and Gregory Margulis, and a Master in Mathematics from Cambridge. PhD: Université Paris-Sud (2004), supervised by Frédéric Paulin; Yale University, supervised by Gregory Margulis Master: University of Cambridge (2000) Ecole Normale Superieure (1997-1999) His research spans Combinatorics , Geometric Group Theory , Ergodic Theory , and Number Theory , focusing on approximate groups, expansion in finite simple groups, and Diophantine geometry. His recent work analyzes Elekes-Szabo problems in projective geometries. He has authored 50+ publications in prestigious journals, addressing topics like random polynomials, C*-simplicity, and uniform independence in linear groups. Fellow of the Royal Society (2024) ERC Consolidator Grant (2014-2019) Prix Charles-Louis de Freycinet (2013) European Mathematical Society Prize (2012) ERC Starting Grant (2008-2013) Cours Péccot, Collège de France (2006)

• Combinatorics
• Geometric Group Theory
• Ergodic Theory
• +۱ مورد دیگر

Felix Otto is a Professor and Director at the Max Planck Institute for Mathematics in the Sciences (Leipzig, Germany) since 2010. Previously, he held Full Professorships at the University of Bonn (1999–2010) and the University of California, Santa Barbara (1998–1999). His research focuses on applied mathematics, including micromagnetics, coarsening dynamics, stochastic homogenization, and hydrodynamic limits. He has received prestigious awards such as the Gottfried Wilhelm Leibniz Prize (2006) and the Max Planck Research Prize (2001). Education: 1993 PhD in Mathematics (advisor S. Luckhaus), University of Bonn 1990 Diploma in Mathematics (advisor G. Dziuk), University of Bonn Research interests emphasize the interplay between analysis, probability, and physics, particularly in understanding complex systems through rigorous mathematical methods. His work on gradient flows and optimal transport has led to foundational contributions in applied mathematics. Awards: Collatz Prize (2007) Membership in Berlin-Brandenburg Academy (2014) Leopoldina Academy (2008) Professional activities include roles as Editor of Archive for Rational Mechanics and Analysis and advisory roles at institutions like the Weierstrass Institute and Fondation Mathématique Jacques Hadamard.

• Micromagnetics
• Coarsening
• Stochastic Homogenization
• +۳ مورد دیگر

H. Vincent Poor is a distinguished academic currently serving as the Dean of Princeton University's School of Engineering and Applied Science and the Michael Henry Strater University Professor of Electrical Engineering. He also holds a Visiting Professor position at Imperial College London's Electrical & Electronic Engineering department. B.E.E. and M.S. in Electrical Engineering from Auburn University M.A. and Ph.D. in EECS from Princeton University His research spans signal processing, information theory, and wireless systems, with a focus on robust techniques, stochastic analysis, and quantum communication. His work has driven advancements in MMSE detection, finite-blocklength coding, and quickest detection theory. He has advised 37 doctoral and 57 postdoctoral researchers, many of whom hold prominent roles globally. His recent publications highlight innovations in communication theory, quantum channels, and detection algorithms. These include foundational work on MMSE multiuser detection, iterative processing in wireless systems, and theoretical frameworks for quickest detection applications. 2011 IEEE Eric E. Sumner Award 2005 IEEE James H. Mulligan, Jr., Education Medal 2002 NSF Director's Award for Distinguished Teaching Scholars Multiple honorary doctorates and fellowships As principal investigator on over 50 research grants, Poor has led groundbreaking projects in signal processing and wireless networking. His visiting roles at institutions like Stanford, Harvard, and Imperial College further underscore his global academic influence.

• Signal detection & estimation
• Statistical signal processing
• Wireless networking
• +۴ مورد دیگر

Krishnendu Chatterjee is a Professor at the Institute of Science and Technology Austria (IST Austria) , Department of Computer Science. His research spans formal verification, probabilistic systems, game theory, and evolutionary dynamics, with over 300 peer-reviewed publications in top venues such as DISC, AAAI, LICS, PNAS, Nature , and Journal of the ACM . His research focuses on developing theoretical foundations and practical algorithms for analyzing complex systems, including Markov decision processes, stochastic games, probabilistic programs, and evolutionary models. He has made significant contributions to topics such as reachability analysis, termination of probabilistic programs, synthesis of controllers, and evolutionary game dynamics. Chatterjee's work is highly interdisciplinary, bridging computer science, mathematics, and biology. He has collaborated extensively with leading researchers worldwide and has been involved in editorial roles and program committees for major conferences in formal methods and theoretical computer science.

• Formal Verification
• Probabilistic Systems
• Game Theory
• +۵ مورد دیگر

Nathanael Berestycki is a University Professor (Univ.-Prof.) in the Department of Mathematics within the Faculty of Mathematics. His research spans multiple areas of probability theory and mathematical physics with a particular focus on stochastic processes and their connections to statistical mechanics and quantum gravity. Professor Berestycki's research interests center around probability theory, with significant contributions to the understanding of Gaussian free fields, Liouville quantum gravity, and random processes. His work explores deep connections between statistical mechanics and mathematical physics, particularly in the context of conformal invariance and scaling limits. He has made substantial contributions to the theory of dimers, Brownian motion, random graphs, and branching processes, often revealing unexpected connections between seemingly disparate areas of mathematics. Analysis of his recent publications shows a consistent focus on the intersection of probability theory and mathematical physics, with particular emphasis on conformal invariance properties, scaling limits of discrete models, and the mathematical structure of quantum gravity. His work often bridges theoretical developments with concrete applications in statistical mechanics, demonstrating how deep mathematical structures emerge from seemingly simple probabilistic models. The breadth of his research is reflected in publications across top probability and mathematical physics journals. Throughout his career, Berestycki has maintained a high level of productivity with consistent publication output across leading journals in probability theory and mathematical physics. His collaborative work with researchers across institutions demonstrates strong connections within the mathematical community, particularly in the European probability research network.

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

Benjamin Sudakov is a Professor of Mathematics at ETH Zurich, where he has held positions since 2013. Previously, he served as a Professor at UCLA (2007-2014) and as an Assistant Professor at Princeton University (2002-2007). He has also been affiliated with the Institute for Advanced Study (2005-2006) and held prestigious fellowships including the Veblen Instructorship (1999-2002). His academic journey began with a Ph.D. from Tel Aviv University in 1999 under the supervision of Noga Alon. Education: Ph.D. in Mathematics, Tel Aviv University (1999) Advisor: Noga Alon Sudakov is a leading expert in combinatorics, with primary research interests in probabilistic and extremal combinatorics, random structures, and the application of combinatorial methods to theoretical computer science and mathematics. His work spans algebraic combinatorics, Ramsey theory, and graph theory, addressing foundational questions and developing novel methodologies. His publications and talks highlight his contributions to Ramsey graphs, equiangular lines, hypergraph theory, and submodular optimization. Key themes include structural graph theory, extremal problems, and probabilistic techniques in discrete mathematics. Scientific Awards: Humboldt Research Award (2014) Fellow of the American Mathematical Society (2013) Invited Speaker, ICM 2010 David Saxon Presidential Term Chair (2007-2011) NSF CAREER Award (2006-2011) Alfred P. Sloan Fellowship (2004-2006) Sudakov has mentored 21 Ph.D. students, including prominent mathematicians like Peter Keevash, Jacob Fox, and Matija Bucic, many of whom hold academic positions globally. He has received significant funding, including the SNSF grant 200021_196965, and actively participates in editorial boards and workshops on extremal combinatorics and related fields. Notable among his collaborative efforts is a series of workshops and seminars at institutions like Banff Research Center, IPAM, DIMACS, and BIRS, focusing on probabilistic and extremal combinatorics. His teaching includes graduate-level courses such as Graph Theory, Probabilistic Methods in Combinatorics, and Algebraic Methods in Combinatorics.

• Combinatorics
• Probabilistic Methods in Discrete Mathematics
• Extremal Graph Theory
• +۴ مورد دیگر

Michał Karoński is a Professor of Mathematics at the Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland, and serves as head of the Department of Discrete Mathematics. He has held visiting professorships at Emory University, The Johns Hopkins University, Purdue University, and Southern Methodist University since 1975, with ongoing engagements at Emory University since 1992. Research Focus: Discrete mathematics, random discrete structures, graph theory, and theoretical computer science. Leadership Roles: Editor-in-Chief of Random Structures & Algorithms (since 1990), Chairman of the Council of National Science Centre (2010–2016), and organizer of 17 bi-annual conferences on random structures. His research group in random structures gained international recognition in the 1970s. He has authored 60 publications, delivered over 30 plenary lectures, and collaborated globally at institutions like Microsoft Research, Bellcore, and BRICS. Scientific Awards: 2016 Medal 'Homini Vere Academico' (AMU Rector) 2013 Polonia Restituta Officer Cross (President of Poland) 1990 Minister of Science and Higher Education Prize His work spans probabilistic combinatorics, algorithm theory, and graph irregularity, with influential publications on stochastic Kronecker graphs, random intersection graphs, and distributed complexity in matchings.

• Random discrete structures
• Probabilistic combinatorics
• Graph theory
• +۱ مورد دیگر

Nikolay Konstantinovich Vereshchagin is a Professor at Lomonosov Moscow State University's Faculty of Mechanics and Mathematics. He also holds affiliations with the Poncelet Lab (since 2005), Yandex School of Data Analysis (since 2007), and Higher School of Economics (since 2013). Education: Moscow State University (Faculty of Mechanics and Mathematics) Degrees: Ph.D. (1987), Doctor of Physical and Mathematical Sciences (1996), Full Professor (1997) His research focuses on computational complexity, Kolmogorov complexity, Shannon entropy, and tiling problems. His work connects algorithmic information theory with machine learning, cryptography, and theoretical computer science. Publications demonstrate expertise in algorithmic statistics, oracle complexity, and randomness foundations, with collaborations in theoretical computer science journals and conferences like CiE (Computability in Europe).

• Computational Complexity
• Kolmogorov Complexity
• Shannon Entropy
• +۲ مورد دیگر

Mate Gerencser is an Associate Professor at Vienna University of Technology (TU Wien) within the Institute for Analysis and Scientific Computing (E 101). Since March 2024, he has been supported by an ERC Starting Grant. His research focuses on stochastic partial differential equations (SPDEs), regularization by noise, regularity structures, and numerical methods for stochastic equations. He leads projects such as the ERC StG Project on 'Stochastic PDEs and Renormalization' and the FWF START Project. His research interests span stochastic PDEs, including their theoretical foundations and numerical approximations. Key areas include the analysis of rough paths, KPZ-type equations, and the interplay between noise and equation regularity. Recent work emphasizes high-order approximation schemes and boundary renormalization techniques. Gerencser has received prestigious grants, including the ERC Starting Grant (2024), and has contributed to leading journals in probability and stochastic analysis. He teaches courses such as 'Stochastic PDEs' and 'Applied Mathematics Foundations' at TU Wien. His research group actively collaborates on projects addressing stochastic dynamics in continuous and discrete systems, with a focus on theoretical rigor and computational methods.

• Stochastic PDEs
• Regularity structures
• Coarse paths
• +۵ مورد دیگر