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

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.

Oscar Randal-Williamsمشاهده پروفایل

استاد

• Algebraic Topology
• Geometric Topology
• Mapping Class Groups
• +۸ مورد دیگر

Oscar Randal-Williams is the Sadleirian Professor of Pure Mathematics at the University of Cambridge, where he is affiliated with the Faculty of Mathematics and the Department of Pure Mathematics and Mathematical Statistics (DPMMS). His work is centered in the Differential Geometry & Topology research group, where he contributes to advancing knowledge in geometric and algebraic topology. Professor Randal-Williams specializes in Algebraic and Geometric Topology, with particular expertise in mapping class groups, moduli spaces, cobordism categories, spaces of manifolds, surgery theory, configuration spaces, characteristic classes, and K-theory. His research explores the deep connections between homotopy theory and geometric structures, with applications across various mathematical domains. His work often bridges abstract algebraic structures with concrete geometric problems, creating new frameworks for understanding topological phenomena. An analysis of Professor Randal-Williams' recent publications reveals a strong focus on homological stability phenomena, mapping class groups of high-dimensional manifolds, and the interplay between algebraic structures and geometric topology. His work frequently involves E ∞ -algebras, general linear groups, and the topology of diffeomorphism groups. A significant portion of his research investigates the structure of moduli spaces of manifolds and their connections to algebraic K-theory, with recent work extending to applications in mathematical physics through studies of symmetries in quantum field theories. Professor Randal-Williams maintains active collaborations with leading mathematicians worldwide, including Søren Galatius, Alexander Kupers, and Jeremy Miller, among others. His research has been published in top-tier mathematical journals including the Annals of Mathematics, Inventiones Mathematicae, and the Journal of the American Mathematical Society.

Amitabha Bagchiمشاهده پروفایل

استاد

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +۷ مورد دیگر

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +۵ مورد دیگر

Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).

Renjie Fengمشاهده پروفایل

پژوهشگر ارشد

• Probability Theory
• Random Matrix Theory
• Machine Learning
• +۵ مورد دیگر

Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.

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

• Algebraic Geometry
• Syzygies of Algebraic Varieties
• Secant Varieties
• +۶ مورد دیگر

Jinhyung Park is an Associate Professor in the Department of Mathematical Sciences at KAIST, Daejeon, Korea. He obtained his Ph.D. from KAIST in 2014 under Prof. Sijong Kwak and was mentored as a CMC Fellow at KIAS (2014–2019). His research focuses on Algebraic Geometry , particularly syzygies of algebraic varieties , secant varieties , and positivity of line bundles . Education: Ph.D., KAIST (2014); MS/BS, KAIST and University of Chicago (2002/2001). Research Interests: His work explores geometric properties of projective manifolds, singularities in algebraic geometry, and applications of Okounkov bodies to divisors and syzygies. Recent trends include Castelnuovo-Mumford regularity bounds (e.g., for threefolds with rational singularities) and subadditivity of Okounkov bodies in fiber spaces. Teaching: Courses include Matrix Groups, Algebraic Geometry, and Calculus. He previously taught at Sogang University and Purdue University. Professional Affiliations: Member of the Korean Mathematical Society, American Mathematical Society, and other international societies. Organized the 8th East Asia Number Theory Conference at KAIST (2019).

Michael A Osborneمشاهده پروفایل

استاد

• Machine Learning
• Bayesian Optimization
• Gaussian Processes
• +۳ مورد دیگر

Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML

• Functional Analysis
• Artificial Intelligence
• Foundations of Computational Mathematics
• +۱۵ مورد دیگر

Professor Anders C. Hansen is a mathematician at the University of Cambridge and University of Oslo, leading the Applied Functional and Harmonic Analysis group. His work bridges functional analysis, artificial intelligence, and computational mathematics, focusing on the Solvability Complexity Index (SCI) hierarchy and stability issues in deep learning. He has held prestigious fellowships, including a Royal Society University Research Fellowship and Peterhouse Bye-Fellowship. Educated at the University of Cambridge, UC Berkeley, and the Norwegian University of Science and Technology Developed groundbreaking theories in compressed sensing and deep learning, revealing algorithmic instability paradoxes Organized workshops on computational mathematics and AI interpretability His research explores the SCI hierarchy , exposing computational barriers in AI, quantum mechanics, and inverse problems. Key projects include Smale’s 18th problem and analyzing neural network stability. His work has transformed understanding of compressed sensing, particularly in medical imaging. Recent scientific awards include the Whitehead Prize (2019), IMA Prize (2018), and Leverhulme Prize (2017). Collaborations span institutions like Caltech, MIT, and the University of Vienna. As an educator, he teaches NST Part IA Mathematical Methods , Part II Numerical Analysis , and a Part III course on Compressed Sensing . His group has mentored 17 PhD and postdoctoral researchers since 2012.

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

Priyanka Rainaمشاهده پروفایل

استادیار

• Domain-Specific Architectures
• Hardware/Software Co-design
• Energy-Efficient Computing
• +۳ مورد دیگر

Priyanka Raina is an Assistant Professor of Electrical Engineering at Stanford University, with a courtesy appointment in Computer Science. She leads the Stanford Accelerate research group, focusing on domain-specific hardware architectures and agile hardware-software co-design. Her work emphasizes high-performance, energy-efficient accelerators for emerging technologies. Education: B.Tech. from IIT Delhi (2011), M.S. and Ph.D. from MIT (2013/2018). Postdoctoral experience includes NVIDIA Research (2018) and Amazon Visiting Academic (2023–present). Awards include the Sloan Research Fellowship (2024), NSF CAREER Award (2023), and Terman Faculty Fellowship (2018). Research Interests: Domain-specific architectures, near-memory computing, design productivity, and machine learning acceleration. Her group develops frameworks like AHA (Agile Hardware) for efficient accelerator design and compilers. Awards: Over 10 major awards, including best paper recognitions at VLSI, MICRO, and JSSC. Active roles as Associate Editor for IEEE JSSC and Program Chair for IEEE Hot Chips (2020). Advising & Teaching: Supervises multiple PhD and MS students in hardware design, CGRAs, and ML accelerators. Teaches VLSI design courses (EE271/272/372) and oversees independent studies in embedded systems and chip design. Labs & Collaborations: Affiliated with Stanford PORTAL Center, AHA Center, and SystemX Alliance. Projects include MINOTAUR (edge AI accelerator), Amber (CGRA-based SoC), and EMBER (RRAM macros).

Sug Woo Shinمشاهده پروفایل

استاد

• Number Theory
• Automorphic Forms
• Algebraic Geometry
• +۶ مورد دیگر

Sug Woo Shin is a Professor of Mathematics at the University of California, Berkeley ( Math Genealogy , MathSciNet Profile ). His research focuses on Number Theory and Automorphic Forms, with significant contributions to the Langlands Program, Shimura varieties, and cohomology of arithmetic spaces. Editorial roles: Astérisque , Manuscripta Mathematica , Journal of the Korean Mathematical Society Recent research explores cohomological properties of locally symmetric spaces, tempered A-packets for classical groups, and modularity of symplectic Galois representations Collaborators include Ana Caraiani, Mark Kisin, Arno Kret, and Peter Scholze He has supervised PhD theses on topics like affine Deligne-Lusztig varieties, specialization maps in Scholze's category of diamonds, and statistical properties of automorphic representations. Teaching includes graduate courses on Number Theory (254A/254B), undergraduate Linear Algebra (110), and Calculus (1A), as well as seminars on global Langlands reciprocity and p-adic cohomology theories. Co-organized conferences include the BIRS workshop on Langlands programs (2025), PRIMA algebraic number theory sessions (2022), and KAST Symposium on automorphic forms (2021). His work appears in journals like Annals of Mathematics, Duke Mathematical Journal, and Compositio Mathematica.

• Uncertainty Reasoning and Decision Making in Artificial Intelligence
• Electronic Business
• Systems Analysis and Design
• +۷ مورد دیگر

Liping Liu is a Professor in the Department of Management at The University of Akron's College of Business. He holds a Ph.D. in Business from the University of Kansas (1995), Master of Engineering in Systems Engineering (1991), and dual bachelor's degrees in Applied Mathematics (1986) and River Dynamics (1987). Ph.D., University of Kansas MS, Huazhong University of Science and Technology B.E., Wuhan University BS, Huazhong University of Science and Technology His research spans Artificial Intelligence , Electronic Business , Systems Analysis , Data Quality , and Belief Function Theory . He pioneered coarse utility theory and linear belief functions , now taught in top Ph.D. programs across multiple disciplines. Key trends in his publications include Belief Function Applications (2012-2024), Medical Data Systems (2003-2015), and Decision Theory (2004-2014). Recent works focus on Gamma Belief Functions (2024) and computational improvements in linear belief function operations (2019-2016). Scientific contributions recognized via: Microsoft Azure Educator Grant (2014-2016) Inclusion in Who's Who in America (2010-2013) and Who's Who in the World (2011-2013) As an editor and committee member for major conferences (INFORMS, AMCIS, Belief Functions conferences), he bridges academic research with practical systems implementation in e-business and healthcare domains.

Seth Lloydمشاهده پروفایل

استاد

• Quantum Information Science
• Quantum Computation
• Quantum Communications
• +۵ مورد دیگر

Seth Lloyd is a Professor of Mechanical Engineering at the Massachusetts Institute of Technology (MIT), where he directs the Center for Extreme Quantum Information Theory (xQIT). His work bridges theoretical physics, quantum information science, and complex systems theory. He has made significant contributions to the foundations of quantum computing and quantum information processing. Lloyd received his education from prestigious institutions: B.A. from Harvard College (1982) M.Phil from Cambridge University (1984) as a Marshall Scholar Ph.D. in Physics from Rockefeller University (1988) Lloyd's research focuses on quantum information science, particularly quantum computation and quantum communications. He has pioneered work in quantum analog computation, quantum error correction, and quantum metrology. His research explores how quantum mechanics can be harnessed for information processing tasks, with applications ranging from quantum computing to understanding biological processes like photosynthesis. Lloyd is also known for his work on complex systems and the relationship between information and physical systems, arguing that the universe itself can be viewed as a quantum computer. His publication record shows a clear progression from foundational quantum computing work to applications in quantum machine learning and quantum biology. The most recent articles reveal a strong focus on quantum algorithms for machine learning, quantum metrology, and the intersection of quantum mechanics with biological systems. His work on the HHL algorithm for solving linear systems has been particularly influential in quantum machine learning, though its practical advantages have been debated following Ewin Tang's classical algorithms. Lloyd has received numerous scientific honors: Lindbergh Fellow (1994) Finmeccanica Professorship (1996) Edgerton Prize (2001) Fellow of the American Physical Society (2007) Quantum Communication Award (2012) International Quantum Communication Award (2012) Throughout his career, Lloyd has mentored numerous students and researchers in quantum information science. He has secured significant research funding for his work in quantum computing and complex systems. His research has been supported by various foundations and government agencies interested in advancing quantum technologies. Lloyd has also been involved in interdisciplinary collaborations, particularly with biologists studying quantum effects in photosynthesis. Lloyd directs the Center for Extreme Quantum Information Theory (xQIT) at MIT, which brings together researchers from physics, computer science, and engineering to tackle fundamental challenges in quantum information processing. His lab has been at the forefront of developing theoretical frameworks for quantum computing and exploring practical implementations of quantum information protocols.

Anoosheh Heidarzadehمشاهده پروفایل

استادیار

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +۳ مورد دیگر

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.