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

• Fast graph algorithms in different computation models
• Robust algorithms against adaptive adversaries
• Continuous optimization for combinatorial problems
• +۳ مورد دیگر

Thatchaphol Saranurak is an Assistant Professor at the University of Michigan , specifically in the Computer Science and Engineering Division . Prior to this, he earned his PhD in Computer Science from KTH Royal Institute of Technology in 2018 under Danupon Nanongkai , followed by a postdoctoral research assistant professorship at Toyota Technological Institute at Chicago (2018-2020). Research Focus : His work bridges fundamental problems in graph theory, including Dynamic graph algorithms for max-flow and min-cut Expander graph decompositions and their applications Robust algorithms against adaptive adversaries Continuous optimization for combinatorial problems Scientific Contributions : He has made breakthroughs in deterministic graph algorithms, notably improving vertex connectivity bounds, developing near-linear time Gomory-Hu trees, and advancing dynamic matching algorithms. His research has been recognized by Sloan Research Fellowship NSF CAREER Award Presburger Award 2023 Teaching : He teaches courses like Expander and Graph Algorithms and Introduction to Algorithms (Winter 23, Winter 25). His lecture videos and notes are publicly available. Collaborations : He works with leading researchers including Sayan Bhattacharya , Joakim Blikstad , and Jason Li , with affiliations to institutions like TTIC , KTH , and SODA conferences.

• Stochastic Processes
• Financial Mathematics
• Systemic Risk
• +۶ مورد دیگر

Jean-Pierre Fouque is a Professor in the Department of Statistics and Applied Probability (PSTAT) at the University of California, Santa Barbara. His research focuses on stochastic processes, financial mathematics, systemic risk, and reinforcement learning, with a particular emphasis on mean field games and multi-scale stochastic models. He explores applications in portfolio optimization, risk management, and algorithmic finance. His work combines theoretical advancements in stochastic analysis with practical applications in economics and finance. Notable contributions include developing models for systemic risk in financial networks, analyzing reinforcement learning algorithms in mean-field frameworks, and studying stochastic volatility effects in derivatives pricing. Recent research trends include integrating deep learning techniques for systemic risk quantification, advancing multi-scale asymptotic methods for portfolio optimization, and investigating strategic interactions in financial systems using game-theoretic approaches. His publications frequently address topics such as stochastic volatility calibration, optimal investment strategies under uncertainty, and the dynamics of financial markets under stress scenarios. Dr. Fouque has contributed to foundational textbooks and edited volumes on systemic risk and mean field games. His interdisciplinary work bridges probability theory, mathematical finance, and computational methods, impacting both academic research and practical risk management practices.

Christophe VIGNATمشاهده پروفایل

استاد

• Mathematics
• Number Theory
• Probability Theory
• +۴ مورد دیگر

Christophe VIGNAT is a Professor at CentraleSupélec, affiliated with the Laboratoire des Signaux et Systèmes (L2S). His research focuses on number theory, special functions, probability, and their applications in signal processing and control systems. He has held visiting professorships at École Polytechnique Fédérale de Lausanne (EPFL) and Tulane University. VIGNAT's work bridges pure mathematics and applied fields, with notable contributions to Bernoulli/Euler polynomials, multiple zeta values, and probabilistic methods in number theory. His recent publications explore topics like partition functions, theta functions, and Ramanujan-type identities. He has delivered talks at international conferences and collaborates widely with researchers in mathematics and physics. Research Interests: Number theory, special functions (Bessel, orthogonal polynomials), probability theory, signal processing, control systems, analytic combinatorics, and their interconnections. His work often employs symbolic computation and probabilistic approaches to uncover identities and structures in mathematical analysis. Publications Trends: Recent articles emphasize partition theory, zeta functions, and integrals related to classical polynomials. His collaborations highlight interdisciplinary efforts between pure mathematics and applied sciences. Over 150 refereed papers and conference contributions demonstrate his prolific output across diverse mathematical domains. Education: While specific academic history isn’t detailed, his roles and publications suggest advanced training in mathematics and engineering, typical for a full professor in systems and control.

Alan Hammondمشاهده پروفایل

استاد

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

Alan Hammond is a Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on rigorous mathematical probability techniques applied to problems in statistical mechanics, including percolation theory, polymer models, and random growth processes. He has contributed to understanding critical phenomena, phase transitions, and universality classes in stochastic systems. Hammond's work spans topics such as KPZ universality, Brownian motion, and the geometry of random media. He has investigated models like last passage percolation, self-avoiding walks, and tug-of-war games, often uncovering deep connections between stochastic processes and nonlinear PDEs. His teaching includes courses on stochastic processes and statistical theory at both graduate and undergraduate levels. Notable research highlights include studies on fractal properties of Airy processes, stability in dynamical last passage percolation, and the behavior of geodesics in random environments. His contributions bridge probability theory with applications in physics and combinatorics.

Simon Dobsonمشاهده پروفایل

استاد

• Complex Systems
• Sensor Systems
• Data Analytics
• +۳ مورد دیگر

Simon Dobson is a Professor of Computer Science and Deputy Head of the School of Computer Science at the University of St Andrews. His research focuses on complex systems, sensor analytics, computational tools for simulation, and data analytics. He leads grants exceeding EUR30M, including a £5M EPSRC-funded programme in Sensor Systems Software. He is a Fellow of the Royal Society of Edinburgh (2020) and advises the Scottish government. Education: BSc (University of Newcastle), DPhil (University of York), both in Computer Science. Professional: Chartered Engineer, Fellow of the British Computer Society. Research Interests: Complex systems, network science, higher-order networks, epidemiological modeling, and sensor data integration. Teaching: CS4203 (Computer Security), CS5728 (Complex Systems Modelling). Supervises PhD/MSc projects. Awards: Includes RSE Fellowship, BCS Fellowship, and multiple leadership roles in conferences and committees.

Jeremy Gibbonsمشاهده پروفایل

استاد

• Functional Programming
• Programming Languages
• Software Engineering
• +۳ مورد دیگر

Jeremy Gibbons is a Professor of Computing at the University of Oxford, affiliated with the Department of Computer Science within the Faculty of Computer Science. He serves as Director of the Professional Programmes, overseeing part-time postgraduate degrees in Software Engineering. His roles include Chair of the Faculty of Computer Science (2012–2016), Director of the Software Engineering Programme, and Fellow of Kellogg College. Gibbons' research focuses on programming methodologies, particularly functional and object-oriented languages, with an emphasis on program calculation, design patterns, and bidirectional transformations. He leads the Algebra of Programming research group and is Editor-in-Chief of the Journal of Functional Programming and The Art, Science, and Engineering of Programming . Education includes a D.Phil. from Oxford University. His work spans formal methods, domain-specific modeling for clinical trials (e.g., CancerGrid project), and semantic frameworks for software systems. He has advised numerous students and contributed to open-access initiatives in publishing. Key collaborations include roles in ACM SIGPLAN and IFIP Working Groups 2.1 and 2.11. Research interests emphasize foundational aspects like profunctor optics, categorical programming, and algorithm design. Notable projects include datatype-generic programming and metadata-driven engineering for clinical trials. His work bridges theoretical computer science with practical applications in software architecture and system design.

Valérie Berthéمشاهده پروفایل

پژوهشگر

• Symbolic Dynamics
• Combinatorics on Words
• Discrete Geometry
• +۹ مورد دیگر

Valérie Berthé is a Research Director at CNRS, based at the Institut de Recherche en Informatique Fondamentale (IRIF), Université Paris Cité. Her research lies at the crossroads of theoretical computer science and mathematics, with a focus on symbolic dynamics, combinatorics on words, discrete geometry, and numeration systems. She is a Principal Investigator of the prestigious ERC Synergy project DynAMICs, which unites experts from mathematics and computer science to tackle fundamental problems in dynamical systems and model checking. Research Interests: Her primary research areas include symbolic dynamics, combinatorics on words, discrete geometry, tilings, aperiodic order, continued fractions, and their connections to number theory and automata. She is particularly interested in the algorithmic and arithmetic aspects of dynamical systems, aiming to develop automated verification methods and resolve open conjectures such as the Skolem problem on reachability. Scientific Leadership: She leads a major collaborative research program and is involved in significant national and international projects. Grants & Projects: ERC Synergy Grant: DynAMICs (Model checking seen from a dynamic and arithmetic point of view) ANR PRCI: SymDynAr (2024–2027) ANR Blanc: CODYS (2018) Academic Service: Member, CNRS National Committee, Section 6 Member, Steering Committee of INSMI (Institut national des sciences mathématiques et de leurs interactions) Member, Scientific Council of the Société Mathématique de France (SMF) Advising and Editorial Work: Valérie Berthé has supervised numerous PhD students who have gone on to successful academic careers. She is a co-editor of several influential volumes in her field, including works published by Cambridge University Press and Birkhäuser, covering topics in sequences, automata, number theory, and symbolic dynamics. She is also involved in organizing scientific events and seminars, such as the One World Numeration Seminar, fostering international collaboration in her research community.

Paul G Dupuisمشاهده پروفایل

استاد

• Probability Theory
• Stochastic Processes
• Control Theory
• +۴ مورد دیگر

Paul G Dupuis is the IBM Professor of Applied Mathematics at Brown University. His research focuses on applications of probability theory, stochastic processes, control theory, and numerical methods. He holds affiliations with the American Mathematical Society, Society for Industrial and Applied Mathematics (SIAM), and the Institute for Mathematical Statistics (IMS). His work emphasizes large deviation theory, Markov chain approximations, Monte Carlo simulation, and partial differential equations. Education: Ph.D. in Applied Mathematics from Brown University (1985), M.S. from Northwestern University (1982), and B.S. from Brown University (1981). Research Interests: Control of deterministic and stochastic processes, differential games, numerical methods, operations research, and stochastic processes. His contributions include foundational work on large deviation theory, risk-sensitive control, and queueing networks. Awards: Elected SIAM Fellow (2010), Fellow of the Institute for Mathematical Statistics (2011), IBM Professor of Applied Mathematics (2012), and AMS Fellow (2014). Previously held an NSF Postdoctoral Fellowship (1985-1988). Grants: Current funding from the Army Research Office and National Science Foundation. Key collaborations include work on stochastic approximation, constrained diffusions, and reflected Brownian motion. Teaching: Courses include Operations Research: Probabilistic Models, Information Theory, and Advanced topics in Probability and Stochastic Control.

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.

Christopher Deningerمشاهده پروفایل

استاد

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

Christopher Deninger is a distinguished Professor in the Mathematical Institute at the University of Münster, Germany, where he leads research in Arithmetic Geometry and Representation Theory. His office is located in Room 413 of the Einsteinstr. 62 building, and he maintains active teaching responsibilities including courses in Representation Theory of Finite Groups, Linear Algebra, and specialized topics like Adic Spaces. Deninger's research spans multiple interconnected domains of modern mathematics, with a consistent focus on the deep connections between number theory and geometry. His work has evolved from classical arithmetic geometry to incorporate increasingly sophisticated connections with p-adic analysis, dynamical systems, and more recently proalgebraic fundamental groups. A unifying theme throughout his career has been exploring analogies between different mathematical structures, particularly those connecting analytic number theory with dynamical systems on foliated spaces. His recent publications reveal a continued expansion of his research program into new territories while maintaining connections to his foundational work. The most recent papers show increasing integration of algebraic topology concepts with arithmetic geometry, particularly through proalgebraic fundamental groups and their applications. The consistent thread throughout his decades of publications is the search for deeper structural connections between seemingly disparate areas of mathematics, particularly those bridging analysis, geometry and number theory. Professor Deninger has mentored an extensive number of doctoral students and postdoctoral researchers, as evidenced by the comprehensive list of former members in his working group. His collaborations span the international mathematical community, with numerous joint publications with leading mathematicians across Europe and beyond. While specific grant information isn't detailed in the available materials, his sustained publication record across decades suggests consistent research support for his mathematical investigations. The Mathematical Institute at Münster provides the institutional home for Deninger's research activities, where he maintains an active working group focused on arithmetic geometry and related fields. His office environment includes support staff and colleagues working in closely related mathematical domains, creating a vibrant research community centered around advanced topics in pure mathematics.

Albert Atseriasمشاهده پروفایل

استاد

• Computational Complexity
• Logic in Computer Science
• Finite Model Theory
• +۷ مورد دیگر

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.

Lauren K. Williamsمشاهده پروفایل

استاد

• Algebraic Combinatorics
• Cluster Algebras
• Mathematical Physics
• +۴ مورد دیگر

Lauren K. Williams is the Dwight Parker Robinson Professor of Mathematics at Harvard University and the Sally Starling Seaver Professor at the Radcliffe Institute. Her research focuses on algebraic combinatorics, cluster algebras, and mathematical physics, with notable contributions to the study of the positive Grassmannian, amplituhedron geometry, and integrable systems. She holds affiliations with Harvard’s Department of Mathematics and the Radcliffe Institute for Advanced Study. Her work bridges combinatorics, algebraic geometry, and physics, particularly in understanding geometric structures like the amplituhedron, which encode scattering amplitudes in quantum field theory. Key areas include cluster algebras, Schubert varieties, and applications of combinatorial methods to stochastic processes such as the asymmetric exclusion process (ASEP). Recent activities include organizing conferences on combinatorics, mathematical physics, and the legacy of mathematicians like Richard P. Stanley. Her research often explores connections between discrete structures and continuous systems, with a focus on positivity and geometric positivity principles. Awards and grants are not explicitly listed in the provided texts, but her contributions have been recognized through invitations to major international conferences and leadership in the field. She actively mentors students and postdocs in combinatorics and algebraic geometry.

June Huhمشاهده پروفایل

استاد

• Algebraic Geometry
• Combinatorics
• Matroid Theory
• +۵ مورد دیگر

June Huh is a Mathematics Professor at Princeton University's Department of Mathematics. His research focuses on the interplay between algebraic geometry, combinatorics, and matroid theory, with notable contributions to Hodge theory, tropical geometry, and log-concavity phenomena. He is actively involved in collaborative projects such as the FRG initiative on matroids, graphs, and algebraic geometry. Key research interests include matroid polytopes, Chow rings, Lagrangian geometry, and combinatorial applications of Hodge-Riemann relations. His work bridges discrete and continuous mathematics, with implications for enumerative geometry and geometric combinatorics. Recent publications explore topics like volume polynomials, Bergman fans, and singular Hodge theory in combinatorial geometries. He has received funding for interdisciplinary research through grants like the FRG Collaborative Research program. His contributions highlight innovative methods in geometric and algebraic combinatorics.

Christopher Ramseyمشاهده پروفایل

دانشیار

• Operator Algebras
• Functional Analysis
• Multivariable Operator Theory
• +۵ مورد دیگر

Christopher Ramsey is an Associate Professor and Interim Chair of the Department of Mathematics and Statistics within the Faculty of Arts and Science at MacEwan University in Edmonton, Alberta. He holds a PhD in Pure Mathematics from the University of Waterloo (2013), an MMath from Waterloo, and a BSc Honours from the University of Regina. Dr. Ramsey's research centers on operator algebras and functional analysis, with particular emphasis on non-selfadjoint operator algebras and multivariable operator theory. His work explores connections between analysis and algebra, studying algebras of infinite matrices and their applications to group theory, dynamical systems, free probability, and quantum information theory. He also investigates aperiodic order and its mathematical structures. His recent publications (2020-2025) demonstrate a consistent focus on operator algebras, with significant contributions to C*-algebras, tensor algebras, and their applications. The research spans theoretical foundations in functional analysis while connecting to diverse fields including symbolic dynamics, aperiodic structures, and quantum information. His work often bridges abstract algebraic structures with concrete analytical problems. Dr. Ramsey has received notable recognition including an NSERC Discovery Grant (2019), a MacEwan University Project Grant (2019), and an NSERC Postdoctoral Fellowship (2013). He serves as Editor-in-Chief of the MacEwan University Student eJournal (MUSe) and Associate Editor of the Canadian Transactions of Operator Theory. As an educator, Dr. Ramsey teaches various mathematics courses and supervises senior students' independent studies. His academic service includes editorial work and active participation in the Canadian Mathematical Society. His research program continues to develop connections between operator algebras and their diverse applications across mathematical disciplines.

Leo Goldmakherمشاهده پروفایل

دانشیار

• Number Theory
• Cryptography
• Topology
• +۷ مورد دیگر

Leo Goldmakher is an Associate Professor of Mathematics at Williams College, where he teaches courses in cryptography, topology, Fourier analysis, measure theory, and analytic number theory. He holds a B.A. in Mathematics from Princeton University (2004) and a Ph.D. in Mathematics from the University of Michigan (2009). Research interests Teaching areas Publications His research focuses on number theory, including topics such as Gauss sums, character sums, multiplicative functions, and analytic methods. He has contributed to refinements of classical theorems like Lagrange’s four-square theorem and Artin’s primitive root conjecture. His recent publications explore bounds on character sums, spectral properties of random graphs, and algebraic structures in number theory. The work demonstrates a strong emphasis on analytic and algebraic techniques. Leo has been affiliated with Williams College’s Department of Mathematics and Statistics, which received the 2014 Exemplary Department Award from the American Mathematical Society. He has taught advanced courses such as Cryptography, Topology, and Analytic Number Theory, though these were not offered in the 2025/26 academic year.