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

Guido Kingsمشاهده پروفایل

استاد

• Special Values of L-functions
• Tamagawa Number Conjecture
• Polylogarithms
• +۳ مورد دیگر

Prof. Dr. Guido Kings is a Professor of Pure Mathematics at the Faculty of Mathematics, University of Regensburg. His research focuses on Special Values of L-functions , Tamagawa Number Conjecture , and Polylogarithms , with significant contributions to Iwasawa Theory and Arithmetic Geometry . He has held leadership roles in research projects such as the CRC Higher Invariants. Prof. Kings has authored influential papers on topics like Eisenstein-Kronecker classes , p-adic interpolation , and regulators in arithmetic geometry . He received the Frontier of Science Award in recognition of his work. His team includes doctoral students and postdoctoral researchers, such as Bernadette Melichar and Julio de Mello Bezerra. Current Affiliations: Faculty of Mathematics, University of Regensburg Recent Courses Taught: Analysis II, Advanced Seminar in Arithmetic Geometry, and Modular Forms Research Group: Comprises scientific staff (e.g., Han-Ung Kufner) and doctoral students working on number theory and algebraic geometry. His publications are widely cited in Annals of Mathematics , Duke Mathematical Journal , and Inventiones Mathematicae , reflecting his expertise in connecting motivic cohomology with p-adic analysis.

Oliver Schlottererمشاهده پروفایل

دانشیار

• Theoretical Physics
• String Theory
• Mathematical Physics
• +۳ مورد دیگر

Oliver Schlotterer holds the position of Associate Professor at Uppsala University, affiliated with both the Department of Mathematics (Centre for Geometry and Physics) and the Department of Physics and Astronomy (Theoretical Physics). His research focuses on theoretical physics and mathematical structures in string theory, particularly exploring string amplitudes, modular forms, and algebraic geometry. He has contributed to understanding one-loop string amplitudes, modular graph forms, and supersymmetric field theories. Education: Not explicitly detailed in the provided text. Departments: Joint appointment in Mathematics and Theoretical Physics. His research interests include the interplay between string theory and mathematical frameworks like modular forms, algebraic geometry, and polylogarithmic functions. Recent work emphasizes chiral-splitting techniques, cyclic products of kernels, and the coaction principle in scattering amplitudes. Collaborations span topics from supersymmetric Yang-Mills theories to Einstein-Yang-Mills systems. Publications highlight advancements in string perturbation theory, including studies on non-holomorphic modular forms, genus-one integrals, and the single-valued map in string theory. His work often bridges high-energy physics with number-theoretic structures, such as zeta functions and Poincaré series. No awards or grants are listed in the provided data. He advises no students explicitly mentioned, though his collaborative research suggests involvement in training through projects. Active in the Centre for Geometry and Physics and theoretical physics groups, his research explores foundational aspects of string theory and their mathematical implications.

Damien Woodsمشاهده پروفایل

استاد

• DNA Computing
• Molecular Programming
• Self-Assembly
• +۳ مورد دیگر

Professor Damien Woods is a faculty member at Maynooth University's Faculty of Science & Engineering, specifically affiliated with the Department of Computer Science and the Hamilton Institute. He leads groundbreaking research in DNA computing, molecular programming, and optical computing, focusing on self-assembly, algorithmic design, and computational complexity. ERC Consolidator Grant: 'Computationally Active DNA Nanostructures' SFI ERC Support Award EIC Pathfinder Challenge Grant: 'DISCO - DNA Infrastructure for Storage and Computation' His research projects explore programmable DNA storage, molecular robotics, and robust self-assembly systems. Recent publications span diverse topics like algorithmic DNA tile assembly, thermodynamic stability, and computational universality in nanosystems. Awards include ERC and SFI grants, with a focus on bridging theoretical computer science and experimental molecular biology. Scientific Contributions include: 2022: 'Turning Machines' - Molecular Robotics 2019: 'Diverse Molecular Algorithms' in Nature 2017: 'A Cargo-Sorting DNA Robot' in Science

Anton Mellitمشاهده پروفایل

دانشیار

• Algebraic Geometry
• Enumerative Geometry
• Representation Theory
• +۴ مورد دیگر

Anton Mellit is an Associate Professor in the Faculty of Mathematics at the University of Vienna. He holds a Doctor of Natural Sciences from the University of Bonn (2008) and completed postdoctoral positions at institutions including the Hausdorff Center for Mathematics (Bonn), Scuola Internazionale Superiore di Studi Avanzati (Trieste), and the Institute of Science and Technology Austria (Klosterneuburg). His research focuses on algebraic geometry, enumerative geometry, and their connections to representation theory, combinatorics, and number theory, with particular emphasis on moduli spaces, categorification, and character varieties. Education: Doctor of Natural Sciences (2008), University of Bonn Master in Applied Mathematics (2004), National Technical University of Ukraine Bachelor in Applied Mathematics (2002), National Technical University of Ukraine Research Interests: Investigates Poincaré polynomials of moduli spaces, Higgs bundles, and character varieties Studies Khovanov-Rozansky homology and torus knots Explores connections between Macdonald polynomials and affine Springer fibers Develops combinatorial approaches to algebraic geometry via Hilbert schemes and categorification Grants & Projects: ERC Consolidator Grant: Macdonald polynomials and related structures in geometry FWF Standalone Project: Refined invariants in combinatorics, low-dimensional topology, and geometry of moduli spaces Labs/Teams: Collaborates with researchers in geometric representation theory, quantum cohomology, and algebraic combinatorics, including notable co-authors like Erik Carlsson, Eugene Gorsky, and Maxim Smirnov.

Don Zagierمشاهده پروفایل

استاد

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

Don Zagier is a distinguished mathematician holding positions as Scientific Member and former Director at the Max Planck Institute for Mathematics in Bonn. He has been a Professor at the University of Bonn, University of Maryland, Kyushu University, University of Utrecht, and Collège de France. His work bridges number theory, algebraic geometry, topology, and mathematical physics. Born in 1951, he studied at MIT (1966–1968), earned a D.Phil. from Oxford (1971), and completed his habilitation at Bonn (1975). He has held roles in the Sonderforschungsbereich (SFB) Theoretische Mathematik, served as ICTP Distinguished Staff Associate since 2014, and is an Honorary Member of the London Mathematical Society (2019). Research interests include modular forms, zeta functions, quantum invariants, and algebraic geometry. Notable works include studies on the Birch-Swinnerton-Dyer conjecture, polylogarithms, and the theory of Jacobi forms. His contributions span over 200 publications, including foundational texts like Zetafunktionen und quadratische Körper (1981) and co-edited volumes on modular forms. His awards include the Carus Prize (1984), Frank Nelson Cole Prize (1987), and Karl Georg Christian von Staudt Prize (2001). Research trends in his articles focus on modular forms, knot theory, quantum topology, and the interplay between number theory and geometry. Grants and collaborations are extensive, though specifics remain unspecified. He leads research at the MPI and contributes to global mathematical communities through educational initiatives and editorial roles in journals like Communications in Number Theory and Physics .

Ovidiu Costinمشاهده پروفایل

استاد

• Mathematical Physics
• Differential Equations
• Asymptotics
• +۷ مورد دیگر

Ovidiu Costin is a Professor of Mathematics at The Ohio State University's Department of Mathematics, College of Arts and Sciences. His research focuses on mathematical physics, differential equations, asymptotics, and resurgence theory. He holds a PhD from Rutgers University (1995) and has authored numerous influential papers on topics such as Borel summability, Painlevé equations, and quantum dynamics. Education: PhD in Mathematics from Rutgers University, awarded in 1995. Research Interests: Resurgence theory, asymptotic analysis, integrable systems, spectral theory, and complex dynamics. His work bridges pure and applied mathematics, with applications in quantum mechanics and nonlinear dynamics. His recent articles explore non-perturbative solutions of Schrödinger equations, Borel summability in PDEs, and the analysis of singularities in nonlinear systems. Notable contributions include the proof of the Dubrovin conjecture and foundational work on transseries and surreal numbers. Scientific Awards: Recipient of the Guggenheim Fellowship. His research has been supported by NSF grants, including DMS-0103807, DMS-1515755, and others. Teaching: He teaches advanced courses in real and complex analysis, functional analysis, and applied mathematics. Office: Math Tower 404; email: costin.9@osu.edu.

Katerina Sotirakiمشاهده پروفایل

استادیار

• Theoretical Cryptography
• Post-Quantum Cryptography
• Complexity Theory
• +۴ مورد دیگر

Katerina Sotiraki is an Assistant Professor in the Department of Computer Science at Yale University, associated with the Archimedes AI research group. Her work focuses on theoretical cryptography, post-quantum cryptography, complexity theory, and secure computation. She holds a Ph.D. (2020) and M.S. (2016) in Computer Science from MIT, and a B.S. in Applied Mathematics (2013) from the National Technical University of Athens. Prior to Yale, she was a postdoc at UC Berkeley working with Raluca Ada Popa and Alessandro Chiesa, under the guidance of Vinod Vaikuntanathan at MIT. Research Interests : Design and analysis of cryptographic protocols resilient to quantum computing Efficient zero-knowledge proofs and succinct arguments Algorithmic game theory and fair division problems Lattice-based cryptography and post-quantum security Awards & Honors : Winner of 7th iDASH Competition (Track 3) - 2018 Chateaubriand Fellowship - 2018 Paris C. Kanellakis Fellowship (MIT EECS) - 2013 Key Contributions : Developed HOLMES - a system for secure collaborative learning Pioneered lattice-based succinct arguments with polylogarithmic verification Advanced understanding of modulo-p arguments through topological methods Labs & Teams : Active member of the Archimedes AI group at Yale, focusing on secure computation and cryptographic protocols.

Shi Liمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Combinatorial Optimization
• +۱۱ مورد دیگر

Shi Li is a Professor in the Theory Group at the Department of Computer Science and Technology, School of Computer Science, Nanjing University. He previously held faculty positions at the University at Buffalo (2015–2023) as Assistant and Associate Professor, and was a Research Assistant Professor at Toyota Technological Institute at Chicago (2013–2015). He earned his Ph.D. from Princeton University in 2014 under Moses Charikar and completed his B.S. in Computer Science and Technology at Tsinghua University, where he was part of Andrew Chi-Chih Yao’s Special Pilot Class. His research lies at the intersection of theoretical computer science and combinatorial optimization, with a focus on the design and analysis of algorithms for problems in clustering, scheduling, network design, facility location, and online algorithms. He also explores learning-augmented algorithms and differential privacy in algorithmic contexts. His work combines deep theoretical insights with practical algorithmic frameworks, often leveraging linear programming relaxations, iterative rounding, and randomized techniques. The recent publications highlight a consistent trend in approximation algorithms, particularly in clustering (e.g., correlation clustering, fair k-set selection), scheduling (e.g., unrelated machine scheduling, load balancing), and robust optimization. His work frequently appears in top-tier theoretical venues such as STOC, FOCS, SODA, and ICALP, with increasing emphasis on fairness, privacy, and efficiency in algorithm design. Best Paper Award of Track A, ICALP 2011 Co-winner of Best Paper Award, FOCS 2012 Invited to Special Issue of SICOMP (FOCS 2017 paper) Best Paper Award, COCOON 2018 Invited to Special Issue of SICOMP (STOC 2019 paper) Best Paper Award of Track A, ICALP 2024 Outstanding Paper Award, SPAA 2024 Shi Li has advised several PhD and master’s students, including Yuda Feng, Han Dai, Zihao Liang, and Jia Ye, and has mentored postdoctoral researcher Ruilong Zhang. He has served on numerous program committees (e.g., STOC, SODA, ICALP) and is an Editorial Board Member of ACM Transactions on Algorithms . He teaches core algorithm courses such as Design and Analysis of Algorithms and Advanced Algorithms , and actively collaborates with researchers worldwide. His lab focuses on theoretical foundations of efficient and fair algorithm design, with applications in large-scale data analysis and distributed systems.

Grey Ballardمشاهده پروفایل

دانشیار

• Numerical Linear Algebra
• High Performance Computing
• Computational Science
• +۶ مورد دیگر

Dr. Grey Ballard is an Associate Professor in the Department of Computer Science at Wake Forest University . He earned a B.S. in Math and Computer Science (2006), M.A. in Math (2008) from Wake Forest, and PhD in Computer Science (2013) from the University of California, Berkeley. He was a Truman Fellow at Sandia National Laboratories before joining Wake Forest. Research Focus: Ballard develops communication-optimal algorithms for high-performance computing , particularly in tensor decompositions , symmetric matrix computations , and nonnegative matrix factorization . His work combines numerical linear algebra with parallel algorithm design to reduce data movement costs in distributed systems. Publications demonstrate expertise in communication lower bounds , randomized tensor rounding , and visualization tools for parallel algorithms. He has contributed software packages such as TuckerMPI , GentenMPI , and PLANC for large-scale data compression and clustering. Scientific Awards: Wake Forest Excellence in Research Award NSF CAREER Award SIAM Linear Algebra Prize Three Conference Best Paper Awards (SPAA, IPDPS, ICDM) C.V. Ramamoorthy Distinguished Research Award (UC Berkeley) ACM Doctoral Dissertation Award – Honorable Mention Teaching: Courses include Introduction to Computer Science , Numerical Linear Algebra , and Parallel Algorithms . He has developed educational tools using the Thread-Safe Graphics Library to visualize parallel dynamic programming and collective communication.

Anastasia Volovichمشاهده پروفایل

استاد

• Quantum Field Theory
• String Theory
• General Relativity
• +۳ مورد دیگر

Anastasia Volovich is a Professor of Physics at Brown University, specializing in theoretical physics with a focus on quantum field theory, string theory, general relativity, and their mathematical foundations. Her research explores hidden mathematical structures in scattering amplitudes to advance understanding of gauge and gravity theories. B.A. and M.A. in Physics, Moscow State University (1999) Ph.D. in Theoretical Physics, Harvard University (2002) Her work on scattering amplitudes involves cluster algebras, polylogarithms, and celestial holography. Recent publications address symbol alphabets, Landau singularities, and Yangian invariants in high-energy physics. Notable honors include: APS Fellowship (2019) IBM Einstein Fellowship (2017) Blavatnik National Finalist (2016-2018) Simons Investigator Award (2015) DOE Early Career Award (2011) NSF CAREER Award (2007) White House PECASE (2008) She has held editorial roles at Letters in Mathematical Physics and Physics Letters B , and her research is funded by the Department of Energy and Simons Foundation.

Matthias Oliver Wilhelmمشاهده پروفایل

دانشیار

• Quantum Field Theory
• Mathematical Physics
• Special Functions
• +۳ مورد دیگر

Matthias Oliver Wilhelm is an Associate Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark, affiliated with the Quantum Mathematics research group. His work focuses on advanced theoretical physics topics including scattering amplitudes in gauge/gravity theories, Feynman integrals, special functions, and applications of machine learning in physics. He has contributed to groundbreaking research at the intersection of quantum field theory and mathematical physics, particularly in understanding gravitational wave phenomena and high-energy particle interactions. Research Interests: His research combines quantum field theory with algebraic geometry and computational methods, exploring topics like elliptic Feynman integrals, post-Minkowskian expansions, and machine learning-driven amplitude calculations. Recent work includes leveraging Calabi-Yau manifolds for gravity-related Feynman integrals and developing transformer-based algorithms for scattering amplitude computations. Awards: He received the Velux Grant - Villum Young Investigator in 2018, recognizing his innovative contributions to theoretical physics. Projects: Leveraging Algebraic Geometry for High-Precision Fundamental Physics (2024-2028, DFF-funded) Thermodynamics of strongly coupled Quantum Field Theory (2019-2027, private foundation-funded) Key Themes in Recent Work: His articles emphasize novel computational techniques (e.g., machine learning for integration-by-parts reduction), formal developments in scattering amplitude theory, and geometric approaches to quantum gravity problems. Notable contributions include classifying Feynman integral geometries for black-hole scattering and advancing elliptic function methodologies in perturbative QFT.

• Cryptography
• Secure Multiparty Computation (MPC)
• Zero-Knowledge Proofs
• +۳ مورد دیگر

Aarushi Goel is an Assistant Professor of Computer Science at Purdue University's Department of Computer Science, part of the College of Science. She joined the department in Fall 2024 and is affiliated with Purdue's main campus in West Lafayette, Indiana. Her research focuses on cryptographic protocols, with a strong emphasis on secure multiparty computation (MPC), zero-knowledge proofs, and distributed systems security. Her work addresses challenges in privacy-preserving computation, Byzantine fault tolerance, and efficient cryptographic systems. Notable research directions include optimizing MPC protocols for dynamic environments, minimizing communication overhead in distributed systems, and developing practical zero-knowledge proof frameworks. Recent publications explore topics like homomorphic secret sharing, sublinear prover protocols, and Byzantine agreement with polylogarithmic communication complexity. Dr. Goel's contributions often bridge theoretical cryptography with real-world applications, such as secure machine learning training and verifiable computation. Her work has implications for decentralized systems, blockchain technology, and privacy-enhancing technologies. No awards or grants are explicitly listed in the provided materials, but her prolific publication record indicates active engagement in cutting-edge research. She holds no listed advisees or students in the current data. Lab and team affiliations are not specified in the provided text, though her research likely involves collaborations within Purdue's computer science department and external institutions. Her office is located in LWSN 2142D on the Purdue campus.

Dominik Kempaمشاهده پروفایل

استادیار

• String algorithms
• Data compression
• Compressed data structures
• +۳ مورد دیگر

Dominik Kempa is an Assistant Professor in the Department of Computer Science at Stony Brook University, NY. He previously held postdoctoral positions at Johns Hopkins University (2021), UC Berkeley (2020), and the University of Warwick (2019). His PhD (2015) and MS (Computer Science) are from the University of Helsinki, while his BS (Mathematics) and MS (Computer Science) are from Jagiellonian University, Kraków. Research focuses on string algorithms, data compression, compressed data structures, bioinformatics, and parallel/external-memory algorithms. Notable contributions include compressed indexing techniques for large-scale genomic data and theoretical advancements in LZ77 parsing and suffix array construction. He leads projects like the NSF-funded CAREER initiative on scalable compressed sequence indexing. Key awards include the NSF CAREER Award (2024), Junior Researcher Award, and Outstanding Doctoral Dissertation Award. His work bridges theoretical foundations and practical implementations, with over 30 publications in top venues like STOC, FOCS, and SODA. Education: PhD Computer Science (2015, University of Helsinki), MS Computer Science & BS Mathematics (Jagiellonian University) Selected Awards: NSF CAREER, Junior Researcher Award Professional Activities: Program committee member for STACS, SODA, DCC, and multiple conferences since 2020 Research highlights include resolving the Burrows-Wheeler Transform conjecture (2020) and developing sublinear-time LZ77 factorization (2024).

Jara Uittoمشاهده پروفایل

استادیار

• Massively Parallel Computation
• Distributed Computing
• Sublinear Computing
• +۳ مورد دیگر

Jara Uitto is an Assistant Professor in the Department of Computer Science. His research focuses on Massively Parallel Computation, Distributed Computing, and Sublinear Computing, with a particular emphasis on graph algorithms and distributed systems. Research Interests: Massively Parallel Computation (MPC) Distributed Algorithms and Symmetry Breaking Graph Theory and Edge Processing Algorithm Design for Sparse Graphs Approximation and Optimization in Streaming Models Key Project: Massively Parallel Algorithms for Large-Scale Graph Problems (2020-2024) , where he led research on optimizing algorithms for distributed and parallel computing environments. Publications highlight contributions to symmetry breaking, parallel coloring, and approximation algorithms in dynamic streams. His work bridges theoretical foundations with practical distributed computing challenges.

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

Alexander Goncharov is the Philip Schuyler Beebe Professor of Mathematics at Yale University's Department of Mathematics. His research focuses on arithmetic algebraic geometry, geometry, representation theory, and mathematical physics. He has received the European Mathematical Society Prize for his contributions to mathematics. His work spans topics such as motives, moduli spaces, polylogarithms, and quantum geometry. Education: Ph.D. 1987 (USSR). His research explores connections between algebraic geometry, number theory, and physics, with a focus on motivic cohomology, Hodge theory, and geometric representation theory. He has contributed to the understanding of scattering amplitudes, cluster varieties, and quantum invariants of moduli spaces. Research highlights include studies on Hodge correlators, motivic fundamental groups, and the geometry of moduli spaces. His recent work integrates quantum geometry with algebraic structures, such as cluster algebras and non-commutative systems. Key publications address exponential volumes of hyperbolic surfaces, spectral descriptions of non-commutative systems, and quantum aspects of moduli spaces. He has authored over 100 papers and is a leading figure in the field, with contributions to both pure mathematics and its intersections with theoretical physics. His lab or team collaborations are not explicitly detailed in the provided texts.