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

Ola Svenssonمشاهده پروفایل

دانشیار

• Approximation Algorithms
• Combinatorial Optimization
• Computational Complexity
• +۳ مورد دیگر

Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences , EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023). Education: PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009) M.Sc. from Uppsala University (2005) Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization. Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems. Awards: Best Paper Awards at FOCS (2011, 2017) and STOC (2018) I&C Teaching Award at EPFL Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M). Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.

• Algebraic Geometry
• Symplectic Geometry
• Mathematical Physics
• +۱ مورد دیگر

Kazushi Ueda is an Associate Professor at the Graduate School of Mathematical Sciences, The University of Tokyo, where he has been since April 2015. His research spans algebraic geometry, symplectic geometry, and mathematical physics, with a focus on homological mirror symmetry and its applications to moduli spaces, Calabi-Yau manifolds, and singularities. He previously held academic positions at Osaka University from 2006 to 2015, including roles as Assistant Professor and Associate Professor. Ueda has also had visiting appointments at institutions such as the University of Oxford, Max Planck Institute for Mathematics, and Korea Institute for Advanced Study. Bachelor of Science, Kyoto University (1997-2001) Master of Science, Kyoto University (2001-2003) Doctor of Science, Kyoto University (2003-2006) Ueda's research explores the deep interplay between complex and symplectic geometry through mirror symmetry, particularly in the context of Calabi-Yau varieties, toric degenerations, and dimer models. His work addresses derived categories, stability conditions, and moduli problems, with recent contributions to noncommutative algebraic geometry and applications in mathematical physics. He has collaborated extensively with researchers like Akira Ishii, Masahiro Futaki, and Shinnosuke Okawa. His publications highlight homological mirror symmetry for K3 surfaces, Grassmannians, and singularities, as well as studies on modular forms, cluster transformations, and the Grothendieck ring. Ueda is a member of the Mathematical Society of Japan and has contributed to educational programs, including graduate lectures on mirror symmetry and symplectic geometry.

Chee-Wooi Tenمشاهده پروفایل

استاد

• Power systems engineering
• Power grid cybersecurity
• Cyber-informed security engineering
• +۴ مورد دیگر

Chee-Wooi Ten is a tenured Professor in the Department of Electrical and Computer Engineering at Michigan Technological University, where he has served since 2010 and achieved tenure in 2016. He concurrently holds an Affiliated Professor appointment in Applied Computing and directs both the PSERC Site and ICC CPS Center. His institutional roles emphasize cyber-physical security integration within power infrastructure. His educational background includes: PhD in Electrical Engineering from University College Dublin (2009) MSc in Electrical Engineering from Iowa State University (2001) BSc in Electrical Engineering from Iowa State University (1999) Ten's research pioneers cyber-informed security engineering strategies for bulk power systems, focusing on quantifying rare events through system risk models and data science. His work bridges power grid interactions with robotics and transportation systems to advance decarbonization and electrification. Key methodologies include validating cyber-physical security frameworks against steady-state and dynamic grid approaches, with emphasis on attack/defense combinatorics and smart home technologies. This transdisciplinary approach supports the fourth industrial revolution's resilience requirements. His publication trends reveal strong focus on risk-aggregated substation testbeds using generative adversarial networks, cyber insurance models for power systems, and cascading failure analysis from switching attacks. Recent works increasingly integrate machine learning with physics-based modeling to address cybersecurity threats in inverter-based resource integration and distribution emergency operations. Ten has secured over $6.5M in active funding including: $2M DOE grant (MTU portion $105,000) for CyDERMS Center on DERs/Microgrids cybersecurity $704,409 CyManII award for secure digitalization in smart manufacturing $1.05M DOE ARPA-E grant for decarbonized freight transportation modeling NSF CyberCorps Scholarship for Service program ($3.38M) His grants consistently address risk management through data-driven and physics-based modeling, with industry partnerships through PSERC and utility collaborations. As ICC CPS Center Director, he leads research on cyber-physical security testbeds and coordinates the PSERC Summer Transformation School. His team develops validation frameworks for NERC CIP compliance while addressing practical pain points in OT cybersecurity for grid operators.

Euiwoong Leeمشاهده پروفایل

استادیار

• Approximation Algorithms
• Hardness of Approximation
• Discrete Optimization
• +۳ مورد دیگر

Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.

• Symplectic topology
• Homological Mirror Symmetry
• Floer theory
• +۴ مورد دیگر

Alexander Ritter is a Professor of Mathematics at the University of Oxford, affiliated with the Mathematical Institute and Wadham College. Holding a PhD from MIT (2009), he maintains active research and teaching roles, including Michaelmas 2025 Linear Algebra instruction. Education PhD, Massachusetts Institute of Technology (MIT), 2009 Research Focus Professor Ritter specializes in symplectic topology, homological mirror symmetry, Floer theory, and Gromov-Witten theory. His work bridges symplectic geometry with algebraic geometry through quantum cohomology invariants, Fukaya categories, and spectral sequence techniques. Key innovations include filtrations on quantum cohomology using C*-actions and Morse-Bott-Floer theory to analyze semiprojective toric manifolds and singularities. Publication Evolution Recent publications (2023-2025) reveal intensified collaboration with Filip Živanović on quantum cohomology filtrations, yielding eight joint papers. This work integrates Hilbert-Poincaré series, equivariant cohomology, and McKay correspondence applications, demonstrating progression from foundational symplectic cohomology (2009-2013) toward geometric topology and birational geometry implications. Honors and Recognition Junior Research Fellowship, Trinity College, Cambridge (2009-2013) Research Fellowship, MIT (2007-2008) McCormick Fellowship, University of Chicago (2004-2006) Rouse Ball Prize & Heilbronn Prize, Trinity College, Cambridge (2003) Senior/Junior Scholarships, Trinity College, Cambridge (2001-2002, 2023) Research Funding As Principal Investigator for EPSRC grant EP/Z535977/1 (2025-2028; £806K), he leads research on "Orbifold Floer cohomology and birational geometry." Previously, he served as Co-Investigator with Dominic Joyce on EPSRC grant EP/T012749/1 (2019; £653K) exploring Bridgeland stability in Fukaya categories of Calabi–Yau 2–folds. Academic Environment Based in Oxford's Geometry research group, Ritter collaborates extensively within symplectic topology networks. His 2022-2023 Visiting Associate Professorship at Stanford University underscores international recognition, while consistent teaching of advanced courses (e.g., Morse homology, Algebraic Topology) reflects commitment to graduate education.

Gene Coopermanمشاهده پروفایل

استاد

• High-Performance Computing
• Computer Systems
• Transparent Checkpointing
• +۴ مورد دیگر

Gene Cooperman is a Professor at the Khoury College of Computer Sciences at Northeastern University, with an affiliation in the College of Engineering. His research focuses on high-performance computing (HPC), transparent checkpoint-restart systems, and model checking. He leads the High Performance Computing Laboratory, where he explores checkpointing technologies like DMTCP, MANA for MPI, and CRAC for CUDA, aiming to enhance HPC workflows on supercomputers such as NERSC's Perlmutter. His work bridges distributed computing, parallel algorithms, and system software to address challenges in fault tolerance, scalability, and resource management. Cooperman has advised 10 PhD students and co-authored over 125 refereed publications, contributing to projects like Geant4-MultiThreaded and Roomy for disk-based computation. His teaching includes courses on computer systems and HPC seminars. Education: Background in computational algebra and parallel computing, transitioning to HPC systems and checkpointing. Research Themes: Transparent checkpointing, MPI agnostic solutions, CUDA integration, and HPC resource optimization. Recent articles emphasize MPI checkpointing, reversible debugging (FReD), and CUDA support, reflecting trends in distributed and GPU-accelerated systems. His grants include NSF, NERSC/DOE, and MemVerge funding. Cooperman collaborates with institutions like CERN and NERSC, advancing applications in particle physics simulations and supercomputing. Current students include Aayushi Gautam, Jiajun Cao, Rohan Garg, and Twinkle Jain.

Joachim Rosenthalمشاهده پروفایل

استاد

• Coding Theory
• Cryptography
• Algebraic Geometry
• +۲ مورد دیگر

Joachim Rosenthal is a Professor of Applied Mathematics at the University of Zurich's Department of Mathematics, leading the Applied Algebra Group. His research integrates coding theory, cryptography, and algebraic geometry with applications in communications and security systems. His primary research explores algebraic coding theory including convolutional codes, subspace codes, and post-quantum cryptography. He develops algorithms for error correction, code optimization, and cryptographic protocol analysis, with emphasis on mathematical structures in finite fields and rings. Professor Rosenthal serves as President of the Swiss Mathematical Society (2024-2025) and sits on IEEE Information Theory Society's Board of Governors. He has organized multiple international conferences on coding theory and cryptography, including the Zurich COST Meeting and Workshop on Convolutional Codes. His editorial contributions include roles at Archiv der Mathematik and SIAM Journal on Applied Algebra and Geometry. Recent publications focus on code construction methods, complexity analysis in group-based cryptography, and algebraic approaches to error-correcting codes.

Jan de Gierمشاهده پروفایل

استاد

• Mathematical Physics
• Statistical Mechanics
• Solvable Lattice Models
• +۳ مورد دیگر

Jan de Gier is a Professor at the School of Mathematics and Statistics, The University of Melbourne . He is also the Founding Director of MATRIX , Australia’s residential research institute in the mathematical sciences, and a former Deputy Director and Chief Investigator in the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS) . Additionally, he co-founded the Australian and New Zealand Association for Mathematical Physics (ANZAMP) in 2011 and served as its inaugural Chair. His research focuses on solvable lattice models at the intersection of mathematical physics and statistical mechanics . Key areas include the application of quantum integrability , algebraic structures like the Yang-Baxter equation, Hecke algebras, and quantum groups, as well as analytical methods such as complex analysis and elliptic curves. His work bridges pure and applied mathematics through connections between enumerative combinatorics , representation theory , and real-world phenomena like traffic flow modeling via exclusion processes . The 15 most recent articles reflect his expertise in integrable systems , non-equilibrium statistical mechanics , and algebraic combinatorics . Topics span Macdonald polynomials , stochastic duality , quantum spin chains , and traffic modeling , with methodologies involving matrix product forms , exact solutions , and critical phenomena analysis. He has contributed to editorial efforts through the AustMS Gazette and MATRIX Annals, and has been involved in public science communication via opinion pieces on mathematics funding and applications. His work emphasizes the importance of fundamental research in driving technological innovation, as highlighted in media articles discussing pi calculation , zero-knowledge proofs , and mathematics education .

• 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.

Steven N. Evansمشاهده پروفایل

استاد

• Probability
• Mathematical Analysis
• Applied Mathematics
• +۱۱ مورد دیگر

Steven N. Evans is a Distinguished Professor at the University of California, Berkeley , affiliated with the Department of Statistics and the Center for Computational Biology . With over three decades of service since 1987, his work bridges probability theory , stochastic processes , and their applications in mathematical biology , computational genetics , and phylogenetics . His research spans: Probability on Algebraic Structures , including random matrices and local fields. Measure-Valued Processes and coalescent models in population genetics. Phylogenetic Inference in historical linguistics and ecology. Stochastic Models for gene expression, fitness landscapes, and mutation-selection balance. Markov Processes and their applications in phylodynamics. Recent publications highlight his contributions to phylogenetic networks , Frechet mean sets , and Levy process analysis , with keywords spanning Probability , Computational Biology , and Population Genetics . He has mentored 10 PhD students, including Boyan Xu (2024) and Nicholas Bhattacharya (2022). His email is evans@stat.berkeley.edu .

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 .

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.

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.