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

Ricky Ini Liuمشاهده پروفایل

دانشیار

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

Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.

Stanislav Smirnovمشاهده پروفایل

استاد

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

Stanislav Smirnov is a Professor of Mathematics at the University of Geneva, where he has been a faculty member since 2003. He also holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. As Director of the National Centre of Competence in Research SwissMAP since 2014, he leads a major research initiative funded by the Swiss National Science Foundation. His education includes a mathematics degree from St. Petersburg State University (1992) and a PhD from the California Institute of Technology (1996). Prior to joining Geneva, he held positions at Yale University, the Institute for Advanced Study in Princeton, the Max Planck Institute in Bonn, and the Royal Institute of Technology in Stockholm. Professor Smirnov's research focuses on the mathematical foundations of statistical physics, with particular emphasis on conformal invariance in two-dimensional lattice models. His work has revolutionized our understanding of critical phenomena through rigorous mathematical approaches, establishing deep connections between probability theory, complex analysis, and statistical mechanics. He develops novel discrete complex analysis techniques to prove continuum limits of lattice models at criticality. His publication record shows consistent advancement in understanding random planar geometry, percolation theory, and the Ising model, with increasing attention to Liouville quantum gravity in recent years. His work bridges deep mathematical analysis with physical insights, often providing rigorous proofs for phenomena previously understood only through physical intuition. Fields Medal (2010) for the proof of conformal invariance of percolation and the planar Ising model in statistical physics As an advisor, Professor Smirnov has mentored doctoral students including Ekin Arikök and Nikolai Bobenko. He leads the ANALYSE, PHYSIQUE MATHÉMATIQUE ET PROBABILITÉS research group at the University of Geneva. His research is supported by major grants including the NCCR SwissMAP, European Research Council's AG COMPASP, and Swiss National Science Foundation grants 200020_143434 and 200020_141329. Professor Smirnov has organized numerous influential conferences, including the "Conformal maps from probability to physics" workshop at Monte Verità (2010) and multiple "Random Planar Geometry" meetings in Les Diablerets, fostering collaboration between mathematicians and physicists working on critical phenomena and random geometry.

• Artificial Intelligence
• Computer Vision
• Machine Learning
• +۸ مورد دیگر

Katerina Fragkiadaki is the JPMorgan Chase Associate Professor of Computer Science in the Machine Learning Department at Carnegie Mellon University. She works at the intersection of Artificial Intelligence, Computer Vision, Machine Learning, Language Understanding, and Robotics. PhD from GRASP Lab, University of Pennsylvania Postdoctoral researcher at UC Berkeley (with Jitendra Malik) and Google Research Recipient of NSF CAREER, DARPA Young Investigator, Amazon, Google, Sony, UPMC, and AFOSR awards Organizer of CoRL 2023 Workshop on Generalist Robots ICLR 2024 Program Chair, multiple area chair roles Her research group focuses on developing machines that autonomously improve world models through human-environment interactions, with specific emphasis on: Representation learning and video understanding 2D/3D unified vision-language models Generative simulation and reinforcement learning Real2Sim/Sim2Real robot learning Continual learning and spatial common sense 3D scene reconstruction and dynamics Recent publications highlight advancements in: 3D mesh generation with compositional transformers Unified 2D/3D perception frameworks Physics-aware generative models Diffusion-based robotic manipulation policies Embodied agents with memory prompting Awards include: 2024: DARPA Young Investigator Award 2023: Amazon Faculty Award 2022: Sony Faculty Research Award 2021: UPMC Faculty Research Award 2020: NSF CAREER Award 2019: Google Faculty Award Key collaborations span institutions including UC Berkeley, Google Research, Stanford, MIT, and University of Tsukuba. Her work bridges theoretical innovation with practical applications in: Autonomous robot manipulation 4D world modeling Language-grounded perception Visual dynamics prediction Embodied program synthesis Physics-based simulation engines

Olga Sorkine-Hornungمشاهده پروفایل

استاد

• Digital Content Creation
• Geometry Processing
• Shape Representation and Editing
• +۵ مورد دیگر

Olga Sorkine-Hornung is a Professor of Computer Science at ETH Zurich and head of the Institute of Visual Computing. She leads the Interactive Geometry Lab, focusing on theoretical and practical advancements in digital content creation, geometry processing, and shape modeling. Current position: ETH Zurich, Department of Computer Science Previous roles: Courant Institute (NYU), Technical University of Berlin Education: BSc and PhD from Tel Aviv University, postdoc at TU Berlin Her research spans shape representation, digital fabrication, computer animation, and fundamental geometry processing. Key contributions include Laplacian surface editing, as-rigid-as-possible deformation, and generalized winding numbers. She works on applications in VR, AR, and autonomous systems. Awards include Test of Time Awards (2024), ACM Fellow (2020), ERC Consolidator Grant (2020), and EUROGRAPHICS Young Researcher Award (2008). She has supervised numerous students and co-developed software libraries like libigl and Instant Meshes . Co-chair roles for SIGGRAPH, Eurographics, and Pacific Graphics Editorial board member for ACM Transactions on Graphics and other journals Keynote speaker at VMV, CVPR, and SIAM conferences Her work bridges mathematical rigor with practical implementation, advancing computer graphics and geometry processing through intuitive algorithms that maintain surface detail while enabling efficient computation.

• Applied Topology
• Dynamical Systems
• Algebraic Topology
• +۵ مورد دیگر

Robert Ghrist is the Andrea Mitchell University Professor at the University of Pennsylvania with dual appointments in the Department of Mathematics and the Department of Electrical and Systems Engineering. He serves as Associate Dean for Undergraduate Education for Penn Engineering. His educational background includes a B.S. in Mechanical Engineering from the University of Toledo (1991), and M.S. and Ph.D. degrees in Applied Mathematics from Cornell University (1994, 1995). Ghrist's research bridges pure and applied mathematics, focusing on applied algebraic topology , dynamical systems , and geometric methods in data science. His work extends to network theory, topological data analysis, and computational geometry, with applications spanning robotics, neuroscience, and social dynamics. Key innovations include developing sheaf-theoretic approaches for networked systems and persistence homology techniques for high-dimensional data. Analysis of his recent publications reveals a strong emphasis on lattice-theoretic frameworks , topological robotics , and network dynamics , with emerging applications in neural data interpretation and geometric computing. His research consistently integrates category theory with real-world engineering challenges. Significant scientific recognition includes: Presidential Early Career Award (PECASE, 2004) Scientific American 'Top 50' Research Leader (2007) Mathematical Association of America's Chauvenet Prize (2013) University of Pennsylvania Lindback Award for Distinguished Teaching (2015) DoD National Security Science and Engineering Faculty Fellowship (NSSEFF, 2015) Ghrist leads multiple federally funded research initiatives supported by AFOSR, DARPA, NSF, and ONR. He directs the development of educational tools including the Calculus BLUE/GREEN Project video series and custom GPTs for mathematical pedagogy. His open online courses have reached over 100,000 learners globally.

Smirnov Stanislavمشاهده پروفایل

استاد

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

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.

Brian Lawrenceمشاهده پروفایل

استادیار

• Arithmetic Geometry
• Number Theory
• Diophantine Geometry
• +۲ مورد دیگر

Brian Lawrence is an Assistant Professor in the Department of Mathematics at the University of Wisconsin–Madison, currently on leave as of 2025. Previously, he held positions at UCLA, the University of Chicago, and Columbia University, following doctoral studies at Stanford University under Akshay Venkatesh. His educational background includes: PhD in Mathematics from Stanford University (advisor: Akshay Venkatesh) Lawrence's research centers on arithmetic geometry, specializing in Diophantine problems through p-adic methods. His work develops innovative approaches to Mordell's conjecture, Shafarevich-type results, and rational point distribution using p-adic Hodge theory, étale cohomology, and period mappings. He bridges theoretical number theory with computational frameworks, particularly in algorithmic solutions for Diophantine equations. His publication trends reveal sustained focus on foundational Diophantine geometry problems, with recent work emphasizing conditional algorithms for the Mordell problem and sparsity phenomena in integral points. Collaborations with leading mathematicians like Venkatesh and Sawin demonstrate interdisciplinary engagement across number theory and algebraic geometry. Lawrence actively mentors undergraduate researchers, supervising projects on resultants, Hodge theory, and symmetric polynomials by students including Pramana Saldin, Yuchen Chen, Anuj Sakarda, and Spencer Dembner. His organizational roles include founding the Crystalline Cohomology seminar at Columbia and co-organizing the University of Chicago Number Theory Seminar, fostering collaborative research environments. He contributes extensively through expository notes on schemes, polynomials on lattices, and Fibonacci numbers modulo p, reflecting commitment to mathematical education and knowledge dissemination across multiple institutions.

• Uncertainty Quantification
• Scientific Machine Learning
• Stochastic Optimization
• +۳ مورد دیگر

Hadi Meidani is a Clinical Associate Professor at the Carle Illinois College of Medicine , specifically within the Department of Biomedical and Translational Sciences at the University of Illinois at Urbana-Champaign . He teaches courses in Civil and Environmental Engineering, including topics like Systems Engineering & Economics , Machine Learning in CEE , and Uncertainty Quantification . Ph.D., Civil Engineering, University of Southern California (2012) M.S., Electrical Engineering, University of Southern California (2012) M.S., Structural Engineering, Sharif University of Technology (2005) B.S., Civil Engineering, K.N. Toosi University of Technology (2002) Dr. Meidani's research focuses on uncertainty quantification , scientific machine learning , and optimization under uncertainty for engineering systems. His work spans stochastic multiscale analysis , physics-informed machine learning , and model reduction techniques. His recent publications emphasize machine learning for infrastructure systems , graph neural networks , physics-informed models , and traffic assignment . Key trends include deep learning , multi-fidelity modeling , and neural operator transformers applied to metamaterial design , seismic reliability , and autonomous freight delivery .

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +۳ مورد دیگر

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

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

استاد

• Algorithmic Game Theory
• Computational Complexity Theory
• Machine Learning
• +۳ مورد دیگر

Paul Goldberg is a Professor of Computer Science and Director of the MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford. He holds a BA in Mathematics from Oxford University and a PhD in Computer Science from the University of Edinburgh. His research focuses on algorithmic game theory, computational complexity, and machine learning, with notable contributions to equilibrium computation, complexity classes of total search problems, and decentralized systems. Affiliations: Department of Computer Science, Oxford; Editorial Board of ACM Transactions on Economics and Computation. Education: PhD in Computer Science (1993), University of Edinburgh MSc in Computer Systems Engineering (1989), University of Edinburgh and Université Paris-Sud BA in Mathematics (1988), Oxford University Research Interests: Algorithmic game theory, computational complexity (especially total search problems like CLS and PPAD), decentralized computation of equilibria, and applications in machine learning and AI. His work bridges theoretical computer science and economics, with a focus on algorithm design and complexity analysis. Publications and Awards: Over 120 papers, including influential work on Nash equilibrium complexity (2009), gradient descent (2023), and fair division algorithms. Notable awards include the ACM SIGecom Test of Time Award (2022) and a SIAM Outstanding Paper Prize (2011). Grants and Students: Leads EPSRC-funded projects on game theory and machine learning. Supervised 11 PhD graduates and currently advises Giannis Tyrovolas and others. Active in mentoring MSc and undergraduate projects. Labs/Teams: Part of the Algorithms and Complexity Theory group at Oxford, contributing to research on optimization, equilibrium dynamics, and fair division.

Kazuhiro Saitouمشاهده پروفایل

استاد

• Computational Design Synthesis
• Topology Optimization
• Manufacturing Process Optimization
• +۷ مورد دیگر

Kazuhiro Saitou is a Professor of Mechanical Engineering at the University of Michigan, affiliated with the College of Engineering. His research focuses on computational design synthesis, topology optimization, and manufacturing process integration. He leads the Algorithmic Synthesis Laboratory (ASL), advancing algorithms for automated design and optimization of mechanical systems. Education: Ph.D. (1996), MIT; M.S. (1992), MIT; B.Eng. (1990), University of Tokyo. He has held tenured positions since 1997, including roles as Founding CEO of Comnext, Inc. (2007–2012) and visiting professorships at École Centrale Paris and Donghua University. Research interests include multi-material topology optimization (M^3 TO), AI-driven design, and sustainable manufacturing. Key projects address additive manufacturing, composite structures, and energy-efficient production systems. He has pioneered methods for manufacturability-driven design and assembly optimization. Notable awards include IEEE Fellow (2018), ASME Kos-Ishii Award (2015), and NSF CAREER Award (1999). He serves as Editor-in-Chief for IEEE Transactions on Automation Science and Engineering and holds leadership roles in ASME and IEEE societies. Teaching includes courses on design optimization, CAD, and global product development. His lab has advised over 30 students, with alumni in academia and industry. Current research explores biomechanical modeling, traffic flow optimization, and medical image registration algorithms.

Nina Balcanمشاهده پروفایل

استاد

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +۱۲ مورد دیگر

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

Olga Sorkine Hornungمشاهده پروفایل

استاد

• Computer Graphics
• Geometric Modeling
• Geometry Processing
• +۳ مورد دیگر

Prof. Olga Sorkine Hornung is a Full Professor of Computer Science at ETH Zürich, leading the Interactive Geometry Lab. She holds a BSc and PhD from Tel Aviv University (2000 and 2006) and conducted postdoctoral research at Technical University Berlin. Her research focuses on computer graphics, geometric modeling, and geometry processing, with applications in shape editing, digital fabrication, and animation. She has received numerous accolades, including the ACM Fellowship (2020), ERC Consolidator Grant (2020), and the Golden Owl Teaching Award (2021). Her work bridges theoretical foundations and practical algorithms, addressing challenges in parameterization, surface compression, and interactive design tools. Her research interests span: Computer Graphics & Visualization Geometric Modeling & Processing 3D Content Creation & Digital Fabrication Garment Design & Simulation Human Motion Analysis & Animation Awards and grants include: 2024: Best Paper Honorable Mention (EUROGRAPHICS) 2023: Member of Swiss Academy of Engineering Sciences (SATW) 2020: ERC Consolidator Grant 2017: Rössler Prize (ETH Zurich) Her lab focuses on developing novel methods for interactive geometry processing, with recent advancements in garment modeling (e.g., AIpparel, Rags2Riches) and motion retargeting systems like WalkTheDog. She actively collaborates on interdisciplinary projects, including biomedical applications and sustainable fashion technology.

Pieter van Goorمشاهده پروفایل

پژوهشگر ارشد

• Robotics
• Control Theory
• Equivariant Systems Theory
• +۵ مورد دیگر

Pieter van Goor is a Research Fellow at the Australian National University (ANU), affiliated with the School of Engineering and the Systems Theory and Robotics (STR) group. He holds a PhD in Control Theory (completed 2022) and dual bachelor's degrees (BEng/BSc, 2018). His research focuses on equivariant systems theory, state estimation, and robotics applications. Key contributions include equivariant observer design, Lie group-based control, and geometric data fusion. Education: Bachelor of Engineering (Research & Development) (Honours) in Mechatronics (ANU, 2018) Bachelor of Science in Mathematics (ANU, 2018) PhD in Control Theory (ANU, 2022) Research Interests: Equivariant systems theory, nonlinear control, robotics applications, state estimation on Lie groups, sensor fusion, and geometric control methods. His work emphasizes symmetry exploitation in filter design and observer construction for systems with inherent geometric structures. Grants & Collaborations: Active collaborations include work with Robert Mahony and institutions like the IEEE. Research spans theoretical frameworks (e.g., equivariant filters) and applied systems (e.g., ArduPilot autopilot, event cameras). Labs/Teams: Member of the Systems Theory and Robotics (STR) group at ANU, focusing on advanced control theory and robotics.

Jacob Foxمشاهده پروفایل

استاد

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

Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.