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

• Algebraic Complexity Theory
• Computational Algebra
• Geometric Complexity Theory
• +۴ مورد دیگر

Prof. Dr. Peter Bürgisser is a Professor at the Technical University of Berlin, affiliated with the Institute of Mathematics and the Algorithmic Algebra research group within Faculty II - Mathematics and Natural Sciences. His research focuses on algebraic complexity theory, computational algebra, and geometric methods in computer science. Bürgisser has made significant contributions to topics including invariant theory, numerical analysis of algorithms, and the computational complexity of algebraic problems. He has authored influential books such as *Algebraic Complexity Theory* and has published extensively in top-tier journals like the Journal of the ACM and SIAM Journal on Computing. His work includes developing polynomial-time algorithms for problems in invariant theory, analyzing the condition numbers of algebraic varieties, and studying the computational aspects of semialgebraic sets. Bürgisser's research also intersects with probability theory, particularly in understanding the statistical properties of zeros of random polynomials and the geometry of random algebraic varieties. Recent trends in his publications emphasize geometric complexity theory, non-commutative optimization, and the application of numerical methods to algebraic problems. He has collaborated with researchers such as Felipe Cucker, Michael Walter, and Avi Wigderson on foundational topics in computational mathematics and theoretical computer science. Bürgisser's office is located in room EB 116, and his contact information includes the email pbuerg@math.tu-berlin.de. His research has been supported through grants and collaborations, though specific grant details are not explicitly mentioned in the provided texts.

• Algebraic Geometry
• Combinatorics
• Discrete Geometry
• +۳ مورد دیگر

Laura Felicia Matusevich is a Professor in the Department of Mathematics at Texas A&M University, affiliated with the College of Arts & Sciences. She holds a Ph.D. from the University of California, Berkeley (2002) and a Licenciada en Matemática from the Universidad Nacional de Córdoba, Argentina (1997). Her research focuses on Algebraic Geometry, Combinatorics, and Discrete Geometry, with applications to hypergeometric functions and neural coding. Her work bridges theoretical and applied mathematics, exploring topics such as binomial ideals, local cohomology, and neural code analysis. Recent contributions include advancements in non-convex neural code criteria, hypergeometric systems, and sparse polynomial computations. She has published extensively in top-tier journals and conference proceedings, demonstrating expertise in both foundational and computational aspects of algebraic structures. Dr. Matusevich’s research also intersects with computational algebra, numerical methods, and interdisciplinary applications in neuroscience and data science. Her articles frequently address challenges in algebraic coding, monodromy analysis, and combinatorial optimization, reflecting her broad impact across mathematics.

Asha Raoمشاهده پروفایل

استاد

• Cybersecurity
• Graph Theory
• Combinatorics
• +۷ مورد دیگر

Professor Asha Rao is a distinguished academic at RMIT University, holding the title of Professor in Mathematics and Cybersecurity. She has been instrumental in advancing cyber-mathematics to enhance cybersecurity. Her roles include Associate Dean of Mathematical Sciences (2017–2023) and Interim Director of the Australian Mathematical Sciences Institute (AMSI) (2020). She champions gender equity in STEM and frequently engages in public science communication. University: RMIT University School: School of Science Academic Rank: Professor Research Focus: Her work spans cybersecurity, coding theory, complex networks, and risk management, often integrating mathematical frameworks to address real-world problems like money laundering and small business digital security. She also explores fractal analysis and post-quantum cryptography. Recent Publications: Highlight recent advancements in post-quantum homomorphic encryption, small business cybersecurity frameworks (2021–2025), and data fusion techniques for internal network anomaly detection. Her research bridges technical innovation with policy implications. Scientific Recognition: 2019–2020 Science & Technology Australia Superstar of STEM 2021 Victorian Honour Roll of Women (Trail Blazer) 2021 India Australia Science and Technology Development Award 2016 RMIT Media Stars Award Teaching & Leadership: Actively supervises Masters and PhD students, emphasizing teamwork in cybersecurity education. She led curriculum design initiatives and addressed non-technical skills gaps in the industry (2020). Her leadership extends to national organizations like AMSI. Community Engagement: Promotes cybersecurity through media appearances (ABC News, Australian Financial Review) and events like Pint of Science. She co-founded Women in Mathematics and advocates for girls in STEM.

Niraj Khareمشاهده پروفایل

دانشگاهی

• Graph Theory
• Hypergraphs
• Combinatorics
• +۴ مورد دیگر

Niraj Khare is an Associate Teaching Professor in the Department of Mathematics at Carnegie Mellon University Qatar, part of the Mellon College of Science. He holds a Ph.D. from Ohio State University. His research focuses on graph theory, hypergraphs, combinatorics, and permutation statistics, with emphasis on matching theory, extremal graph properties, and combinatorial enumeration. His work includes studies on Erdős–Gallai edge bounds, Gončarov polynomials, and structural analysis of hypergraphs. Khare's academic contributions span theoretical and applied combinatorics, with notable publications on permutation statistics, hypergraph size analysis, and edge partitioning in graphs. His teaching role emphasizes mathematics education at the university level. He can be contacted at nkhare@cmu.edu and is located in Office 2194 at CMU Qatar's Education City campus.

Zhang Shixuanمشاهده پروفایل

استادیار

• Mathematical Optimization
• Operations Research
• Data Science
• +۵ مورد دیگر

Zhang Shixuan is an Assistant Professor in the Department of Industrial & Systems Engineering at Texas A&M University. His research focuses on mathematical optimization theory and its applications to data science, operations research, and systems engineering. Education: Ph.D. in Operations Research from Georgia Institute of Technology Postdoctoral: Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University His primary research areas include: Polynomial Optimization Integer Optimization Stochastic Optimization Robust Optimization His recent publications explore advances in distributionally robust optimization, security-constrained power flow algorithms, and theoretical aspects of multistage stochastic programming. Key trends in his work emphasize computational efficiency, algorithm design for nonconvex problems, and applications to energy systems and convex geometry. Doctoral Advisees: Jiamin Chen and Qi Xiao.

• Formal Verification
• Model Checking
• Autonomous Systems
• +۷ مورد دیگر

Professor Alice A Miller is a faculty member at the University of Glasgow's School of Computing Science, where she has held roles including Postdoc, Daphne Jackson Fellow, Lecturer, and Senior Lecturer since 1997. Prior to this, she worked at the Universities of East Anglia, Western Australia, and Stirling. She currently holds a Leverhulme Research Fellowship and is a Chartered Engineer with the IET. Her membership in the London Mathematical Society reflects her interdisciplinary background. Education: Alice Miller holds a PhD in Number Theory, though her research career has primarily focused on Formal Verification and Model Checking. Her academic trajectory includes leveraging mathematical techniques to analyze systems across engineering and computer science disciplines. Research interests: Her work centers on applying formal verification methods to ensure safety and reliability in complex systems such as autonomous vehicles, robots, and telecommunications. Key techniques include model checking and symmetry reduction. Specific areas include: Modelling and Verification of Concurrent Systems Abstraction and Symmetry Reduction Methods Graph Theory Applications in System Analysis Combinatorics and Group Theory for Optimization Recent publications highlight advancements in overtake planning, sensor network protocols, and probabilistic system analysis. Scientific Awards: Daphne Jackson Fellowship, Leverhulme Research Fellowship, and Chartered Engineer status from the IET. Grants and Advising: Alice has led or co-investigated multiple grants totaling over £3 million, including projects on digital twins, autonomous systems governance (£2.7M), and secure memory management (M4Secure). She has advised on student-led initiatives like UAV demonstrators and overtaking planning simulations, though specific advisee names are not listed in the provided text. Labs/Teams: Collaborates with interdisciplinary teams on projects involving robotics, sensor networks, and formal verification tools such as PRISM and SPIN. Her work frequently intersects with engineering and mathematics groups within the university and industry partners like D-RisQ Ltd.

Jin-Yi Caiمشاهده پروفایل

استاد

• Theoretical Computer Science
• Computational Complexity Theory
• Holographic Algorithms
• +۳ مورد دیگر

Jin-Yi Cai is a distinguished Professor of Computer Science and Steenbock Professor of Mathematical Sciences at the University of Wisconsin at Madison, where he has been a faculty member since 2000. Previously, he held academic positions at State University of New York at Buffalo (Professor 1996-2000, Associate Professor 1993-1996), Princeton University (Assistant Professor 1989-1993), and Yale University (Assistant Professor 1986-1989). He has also been a Radcliffe Institute Fellow at Harvard University (2007-2008) and a Guggenheim Fellow and Visiting Professor at the University of Toronto (1999-2000). Dr. Cai earned his Ph.D. in Computer Science from Cornell University in 1986, an M.A. in Mathematics from Temple University in 1983, and a Certificate in Mathematics from Fudan University in 1981. His academic journey spans prestigious institutions across the United States and demonstrates a consistent trajectory of scholarly excellence. Professor Cai's research focuses on theoretical computer science, particularly computational complexity theory, with significant contributions to holographic algorithms, counting constraint satisfaction problems, and graph homomorphisms. His work bridges computer science and mathematics, developing sophisticated algorithms and proving fundamental complexity results. His research has evolved from foundational work in structural complexity and oracle separations to specialized work in holographic algorithms and counting problems, demonstrating both depth and breadth in theoretical computer science. His publication record shows a consistent output of high-impact research, with major contributions spanning over three decades. His work on holographic algorithms represents a particularly innovative strand of research that has opened new avenues in computational complexity. The progression of his research demonstrates increasing specialization in counting problems while maintaining connections to broader theoretical frameworks in computer science and mathematics. 2022 Simons Fellowship 2022 CCF Award for Overseas Outstanding Contribution 2022 Fellow, American Mathematical Society (AMS) 2021 Fulkerson Prize in Discrete Mathematics 2021 Gödel Prize in Theoretical Computer Science 2014 Steenbock Professorship, UW Madison 2001 ACM Fellow 1998 John Simon Guggenheim Fellowship 1994 Sloan Fellowship Professor Cai has served as Editor of the Journal of Computer and System Sciences and Associate Editor of the Journal of Computational Complexity. His work has been recognized with numerous prestigious fellowships including the Guggenheim Fellowship, Sloan Fellowship, and Humboldt Research Award. His research has had significant impact in theoretical computer science, earning him the Gödel Prize and Fulkerson Prize, two of the most prestigious awards in theoretical computer science and discrete mathematics respectively.

Erika Roldan Roaمشاهده پروفایل

استادیار مهمان

• Stochastic Topology
• First Passage Percolation
• Extremal Topological Combinatorics
• +۳ مورد دیگر

Erika Roldán Roa is a mathematician with academic affiliations at Ohio State University (Visiting Assistant Professor, 2019-2020) and Technische Universität München (Marie Skłodowska-Curie Fellow, 2020-2022). She holds a Ph.D. in Probability and Statistics from CIMAT (2018) and has conducted postdoctoral research at institutions like EPFL and Ohio State. Her work bridges stochastic topology, combinatorics, and educational technology, focusing on topics like cubical sliding puzzles, Eden growth models, and extremal topological problems in polyominoes. Education: Ph.D. in Probability and Statistics, CIMAT (2018) M.Sc. in Mathematics, CIMAT (2014) B.Sc. in Mathematics, Universidad de Guanajuato (2010) Research Interests: Her research spans stochastic topology, extremal combinatorics, and applications of discrete geometry to puzzles and games. She explores configuration spaces, topological properties of random structures, and innovative educational approaches like the Music Math Project, which integrates music and mathematics. Awards: Includes the Marie Skłodowska-Curie Fellowship (2020-2022), Arana-Ordaz Prize (2019), and Sofia Kovalevskaia Prize (2019). She has also received grants from CONACYT and CIMAT. Grants & Outreach: Developed workshops in marginalized communities using music and math, and contributed to software tools like the Eden Model analysis package. Active in science popularization through articles and outreach programs. Labs/Teams: Collaborated on projects like the Eden Model (topology analysis software) and extremal animal configurations, often involving interdisciplinary teams in mathematics and computer science.

• Statistical Physics
• Critical Phenomena
• Combinatorics
• +۳ مورد دیگر

Jesus Salas Martinez is an Associate Professor and Deputy Director of the Gregorio Millan Barbany Institute in the Department of Mathematics at Carlos III University of Madrid. His research focuses on statistical mechanics, critical phenomena, and combinatorial algorithms. Dr. Salas Martinez investigates phase transitions in lattice models including Potts and Ising systems, develops Monte Carlo algorithms, and analyzes universality classes in critical systems. His work bridges mathematical physics, combinatorics, and computational methods. His publications demonstrate consistent focus on finite-size scaling corrections, ergodicity properties of algorithms, and exact solutions in statistical mechanical models.

• Theoretical Physics
• Mathematical Physics
• General Relativity
• +۴ مورد دیگر

Eduardo Jesús Sánchez Villaseñor is an Associate Professor in the Department of Mathematics at Universidad Carlos III de Madrid since 2009. He holds a PhD in Theoretical Physics from Universidad Complutense de Madrid (2001). His research focuses on mathematical and theoretical physics, with emphasis on classical and quantum aspects of general relativity, field theory, statistical mechanics, and combinatorics. He has contributed extensively to topics like gravitational theories with boundaries, loop quantum gravity formulations, and geometric approaches to spacetime symmetries. Education: PhD in Theoretical Physics, Universidad Complutense de Madrid (2001) Bachelor's degree in Computer Science with courses in Calculus and Discrete Mathematics (UC3M) Research Interests: His work bridges theoretical physics and mathematics, addressing foundational questions in general relativity (e.g., Palatini formalism, nonmetricity, torsion), quantum gravity (loop quantization, black hole entropy), and combinatorial structures (permutations, recurrence relations). Recent efforts explore edge observables in gauge theories and geometric diffusion phenomena. Publications: His 15 most recent articles (2021–2025) reflect a focus on gravitational theories with boundaries, geometric constraint formulations, and topological field theories. Key themes include equivalence of phase space approaches, self-dual gravity formulations, and Dirac’s algorithm in boundary contexts. Teaching: He teaches courses including Perturbation Methods (Master’s level), Calculus , and Discrete Mathematics at UC3M. His pedagogical materials emphasize applications of advanced mathematical techniques to physics problems. Labs/Teams: Collaborates actively with researchers like F. Barbero, J. Margalef-Bentabol, and V. Varo, focusing on gravitational and mathematical physics projects. His work is supported by institutional research portals at UC3M.

Alexander Schrijverمشاهده پروفایل

استاد

• Discrete Optimization
• Combinatorics
• Optimization
• +۳ مورد دیگر

Alexander Schrijver is a Full Professor of Mathematics at the University of Amsterdam since 1990 and a CWI-Fellow at the National Research Institute for Mathematics and Computer Science (CWI) in Amsterdam since 2005. He previously held roles such as Leader of the Scientific Cluster PNA1 at CWI and Group Leader of the Department of Combinatorial Optimization and Algorithmics. His academic career includes professorships at the University of Tilburg (1983–1989) and early research roles at CWI. He earned his Ph.D. in Mathematics from Vrije Universiteit Amsterdam in 1977 with a thesis on 'Matroids and Linking Systems.' His research focuses on discrete mathematics, optimization, and algorithms, particularly applying classical mathematical methods—such as algebra, geometry, and invariant theory—to modern problems in combinatorics and optimization. Notable contributions include algorithms for railway planning and theoretical work linking representation theory to code bounds and statistical physics partition functions. His awards include the Spinoza Prize (2005), John von Neumann Theory Prize (2006), Franz Edelman Award (2008), and SIGMA Prize (2008). He is a member of prestigious academies, including the Royal Netherlands Academy of Sciences (since 1995) and Academia Europaea (2008). His academic activities include editorships of journals like Combinatorica and Journal of Combinatorial Theory, Series B , and leadership roles in conferences such as the 5th European Congress of Mathematicians (2006). His work bridges foundational mathematics with applied optimization, impacting both theoretical and practical domains.

Emo Welzlمشاهده پروفایل

استاد

• Foundations of computer science
• Computational geometry
• Combinatorial models for optimization
• +۵ مورد دیگر

Emo Welzl has been a Full Professor of Computer Science at the Institute for Theoretical Computer Science, ETH Zurich since 1996. His academic journey spans institutions including Free University of Berlin, University of Denver, Rijks University Leiden, and collaborations through graduate programs like the Berlin-Zurich Graduate Program in 'Combinatorics, Geometry, and Computation'. 1996–Present: Full Professor of Computer Science, ETH Zurich 1987–1996: Full Professor of Mathematics (theory of computation), Free University of Berlin Education Diplom in Applied Mathematics, Graz University of Technology (1981) Ph.D. in Formal Languages, Graz University of Technology (1983) Habilitation in Foundations of Computer Science, Graz University of Technology (1988) Research Interests Welzl's work focuses on foundations of computer science , with emphasis on algorithms , data structures , and computational geometry . Key subfields include combinatorial optimization , randomized methods , and discrete geometry . His recent interests extend to satisfiability problems. Honours and Awards Max Planck Prize (1992) Gottfried Wilhelm Leibniz-Prize (1995) ACM Fellow (1998) Member of Leopoldina (2005), Academia Europaea (2006), and Berlin-Brandenburg Academy (2007) Service and Leadership He has chaired program committees for major conferences like the ACM Symposium on Computational Geometry (1995), ICALP (2000), and European Symposium on Algorithms (2007). He served on editorial boards of journals including the Journal of Discrete and Computational Geometry and ACM Transactions on Computation Theory .

Jane Tanمشاهده پروفایل

پژوهشگر ارشد

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

Dr. Jane Tan is a Post-Doctoral Research Fellow in Mathematics at the University of Oxford's All Souls College since 2023. She holds a PhB (Science) with Honours in Mathematics from the Australian National University (2015-2018) and a DPhil in Mathematics from St John’s College, Oxford (2019-2023). Her research focuses on combinatorics with particular emphasis on reconstruction problems, structural graph theory, probabilistic combinatorics, and intersections with geometry/topology. Education: PhD (DPhil): Mathematics, St John’s College, Oxford (2019-2023) Bachelor’s: PhB (Science) with Honours in Mathematics, Australian National University (2015-2018) Research Interests: Graph Theory: Structural properties, reconstruction conjectures, and extremal problems Probabilistic Methods: Applications to random graphs and combinatorial enumeration Topological/Geometric Combinatorics: Interplay between combinatorial structures and geometric/topological concepts Publications: Focuses on foundational problems in combinatorics with applications to graph theory and probabilistic analysis Collaborations with leading researchers such as Alex Scott and Paul Balister Labs/Teams: Active member of Oxford’s combinatorics research group

Massimiliano Mellaمشاهده پروفایل

استاد

• Algebraic Geometry
• Birational Geometry
• Projective Varieties
• +۳ مورد دیگر

Massimiliano Mella is a Full Professor at the University of Ferrara's Department of Mathematics and Computer Science. His research focuses on Algebraic Geometry, with particular emphasis on birational geometry, projective varieties, and Cremona groups. He has published extensively on topics such as identifiability of projective varieties, minimal Cremona degrees, and the geometry of quartic surfaces. Recent work includes studies on edge volume, tangential weak defectiveness, and geometric conjectures like Bronowski’s. His teaching includes courses such as Geometry and Algebra for Mechanical Engineering and Geometry II for Mathematics students, both taught in Italian. Notable publications include contributions to Duke Mathematical Journal, Journal of the European Mathematical Society, and Transactions of the American Mathematical Society. Mella collaborates with leading researchers in the field, including Ivan Cheltsov, Alex Massarenti, and Giorgio Ottaviani.

Joseph Hydeمشاهده پروفایل

پژوهشگر ارشد

• Extremal Combinatorics
• Graph Theory
• Ramsey Theory
• +۱ مورد دیگر

Dr. Joseph Hyde is a Research Fellow in the Department of Mathematics at King’s College London, supervised by Matthew Jenssen. He holds a Research Associate position within the Probability research group. Previously, he was a Post-Doctoral Fellow at the University of Victoria (2022–2024) under Jonathan Noel, Natasha Morrison, and Bruce Reed, and a Research Assistant at the University of Warwick (2021–2022) with Hong Liu and Oleg Pikhurko. His research focuses on Extremal Combinatorics , Graph Theory , Ramsey Theory , and Combinatorial Number Theory . Notable contributions include resolving the 0-statement of Kohayakawa and Kreuter’s conjecture in random Ramsey theory, and work on spanning trees in pseudorandom graphs and clique subdivisions. Publications highlight interdisciplinary approaches in combinatorics and graph theory, often blending probabilistic methods with structural analysis. His work has been published in peer-reviewed journals and is available on his personal website.