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

Andrew Childsمشاهده پروفایل

استاد

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

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

استاد

• Algorithms
• Complexity Theory
• Randomised Algorithms
• +۵ مورد دیگر

Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.

David Eppsteinمشاهده پروفایل

استاد

• Graph Algorithms
• Computational Geometry
• Graph Theory
• +۳ مورد دیگر

David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).

Sanjay Jainمشاهده پروفایل

استاد

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +۳ مورد دیگر

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

• Algebra
• Combinatorics
• Number Theory
• +۳ مورد دیگر

Gábor Somlai is a mathematics researcher at Eötvös Loránd University's Faculty of Science, affiliated with the Department of Algebra and Number Theory since 2006. He is a core member of the HUN-REN-ELTE Geometric and Algebraic Combinatorics Research Group (previously MTA-ELTE until 2023) and participates in the Asymptotic Group Theory ERC project. His institutional roles include contributions to the Mathematics Doctoral School and the Institute of Mathematics. His research spans Algebra , Combinatorics , and Number Theory , with emphasis on spectral sets, tiling problems, group theory, and finite geometry. Recent work explores cyclotomic polynomials, the generalized trifference problem, and connections between tiling and spectral properties in finite abelian groups. His publications reveal a strong focus on combinatorial number theory and algebraic methods in discrete geometry. Somlai's publication trends show sustained contributions to theoretical foundations of tiling and spectral sets (testing Fuglede's conjecture in cyclic groups) Cayley graph properties and CI-group classifications polynomial methods in finite geometry and direction problems His work bridges pure algebra with combinatorial applications, often resolving long-standing conjectures in specialized domains. As part of the HUN-REN-ELTE research group, he collaborates on geometric and algebraic combinatorics projects, leveraging ERC funding for asymptotic group theory investigations. His research infrastructure includes access to the Alfréd Rényi Institute of Mathematics (http://www.renyi.hu) resources.

• Artificial Intelligence
• Computational Social Choice
• Computational Complexity
• +۵ مورد دیگر

Edith Hemaspaandra is a Professor in the Department of Computer Science at the Rochester Institute of Technology (RIT), located in the Golisano College of Computing and Information Sciences. She holds a BS, MS, and Ph.D. in Computer Science from the University of Amsterdam (the Netherlands). Her research focuses on computational social choice, computational complexity theory, logic complexity, and formal methods. She teaches courses such as CSCI-262/263 (Introduction to Computer Science Theory) and CSCI-664 (Computational Complexity). Her work explores the algorithmic aspects of voting systems, including election manipulation, control, and bribery, with a focus on their computational complexity. She has also contributed to formal methods for automata theory, educational tools like JFLAP extensions, and the study of complexity classes such as LWPP and WPP. Her research bridges theoretical computer science with practical applications in social choice theory and algorithm design. Her grants include an NSF-funded project on computationally protecting elections from manipulation (2011). She actively publishes in top venues like STACS and ISAAC, addressing topics ranging from graph reconstruction to hybrid election models. Though no awards are explicitly listed, her extensive publication record highlights her contributions to theoretical computer science. Her advising and grant activities include collaborative research projects and educational tool development. She is affiliated with RIT’s Department of Computer Science and maintains a personal website and ORCID profile.

Katrin Tentمشاهده پروفایل

استاد

• Model theory
• Group theory
• Geometry
• +۴ مورد دیگر

Professor Katrin Tent is a distinguished mathematician specializing in mathematical logic at the University of Münster, where she holds a professorship in the Faculty of Mathematics and Computer Science within the Institute for Mathematical Logic and Foundations Research. She is an active researcher in Mathematics Münster, an investigator in CRC 1442 Geometry: Deformations and Rigidity, and contributes to multiple research projects including Topics in Mathematics Münster T3: Models and universes, T4: Groups and actions, and T8: Random discrete structures and their limits. PhD in Linguistics, Christian-Albrechts-Universität zu Kiel (1988) Diplom in Mathematics, Christian-Albrechts-Universität zu Kiel (1989) PhD in Mathematics, University of Notre Dame (1994) Habilitation, "Model theory of groups and BN-pairs" (2000) Professor Tent's research bridges model theory, group theory, and geometry, with particular focus on finite Morley rank structures, BN-pairs, and sharply multiply transitive groups. Her work often combines methods from these areas to prove unexpected results, either constructing groups or incidence geometries with surprising model theoretic properties or using model theory to construct new and interesting geometries or groups. Her recent publications reveal a consistent trajectory connecting model theory with group-theoretic structures. She has made significant contributions to understanding sharply 2- and 3-transitive groups, finite Morley rank geometries, and the model theory of generalized polygons. Her work demonstrates how model-theoretic techniques can solve deep problems in group theory and geometry, particularly through the study of BN-pairs and incidence structures. DFG Research Fellowship (1996-1998) Bayerischer Habilitationsförderpreis (1998-2001) Heisenberg-Stipendium (2001-2004) ERC Consolidator Grants expert panel (2016, 2018) Elected to DFG Senate (2019) Professor Tent leads an active research group with current members including Marco Amelio, Dr. Benjamin Brück, Anna Cascioli, Lukas Jonuska, Silke Meissner, Zahra Mohammadi Khangheshlaghi, and Dr. Sam Shepherd. Her former research group members include Dr. Simon Andre, Dr. Isabel Müller, and Dr. Tim Clausen, among others. Her supervisory work spans both theoretical foundations and specific applications in geometric group theory and model theory. Her research group operates within the Institute for Mathematical Logic and Foundations Research at the University of Münster, collaborating closely with other researchers in the Mathematics Münster cluster. The group participates in various projects including CRC 1442 - C04: Group theoretic aspects of negative curvature, contributing to the vibrant mathematical research environment at one of Germany's leading mathematics institutions.

Albert Atseriasمشاهده پروفایل

استاد

• Computational Complexity
• Logic in Computer Science
• Finite Model Theory
• +۷ مورد دیگر

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.

• Algorithms and Complexity
• Logic
• Database Theory
• +۲ مورد دیگر

Martin Grohe is a Professor at the School of Logic and Theory of Discrete Systems , part of the Department of Computer Science at RWTH Aachen University . His research spans Algorithms and Complexity , Logic , Database Theory , Graph Theory , and Machine Learning , with a focus on integrating logical frameworks into computational models. His recent work explores graph neural networks , Weisfeiler-Leman algorithms , and parameterized complexity , as seen in publications on isomorphism testing , database repairing , and probabilistic query evaluation . While no specific scientific awards are mentioned, his contributions to graph theory and machine learning are widely recognized through numerous peer-reviewed publications.

• Physics
• Computer Science
• Mathematics
• +۱۰ مورد دیگر

Cristopher Moore is a Professor at the Santa Fe Institute, where he conducts interdisciplinary research at the intersection of physics, computer science, and mathematics. His work focuses on understanding phase transitions in computational problems, statistical inference, and network analysis. Moore has made significant contributions to the fields of complex systems, quantum computing, and algorithmic justice. Moore's primary research areas include phase transitions in computational problems and statistical inference, where he investigates how problems suddenly become hard or impossible to solve when certain thresholds are crossed. His work spans social networks, big data analysis, quantum computing, algorithmic transparency, and decarbonization efforts. He is particularly known for applying physics-inspired approaches to computational problems, using techniques from spin glass theory, network theory, and computational complexity. His recent publications reveal a strong focus on community detection in networks, phase transitions in data science problems, algorithmic fairness in criminal justice systems, and quantum computing applications. Moore's work demonstrates consistent patterns across multiple disciplines, with recurring themes of phase transitions, computational limits, and the application of physics concepts to computational problems. Moore actively mentors students and has advised numerous PhD and Master's students who have gone on to successful careers in academia and industry. His work on algorithmic justice has influenced policy discussions in New Mexico and beyond, particularly regarding risk assessment in the criminal justice system.

Xi Chenمشاهده پروفایل

دانشیار

• Algorithmic Game Theory
• Economics
• Complexity Theory
• +۳ مورد دیگر

Xi Chen is an Associate Professor in the Department of Computer Science at Columbia University. Prior to this, he was a postdoctoral researcher at the Institute for Advanced Study (Princeton University) and the University of Southern California. He holds a B.S. in Physics/Maths from Tsinghua University (2003) and a Ph.D. in Computer Science from Tsinghua University (2007), advised by Professor Bo Zhang under the guidance of the Institute for Theoretical Computer Science led by Andrew Chi-Chih Yao. His research focuses on Algorithmic Game Theory, Economics, and Complexity Theory. His work is supported by an NSF CAREER award, a Sloan Research Fellowship, and Columbia University startup funds. He has received the EATCS Presburger Award and multiple best paper awards, including at FOCS 2006, ISAAC 2009, and CCC 2017. Xi Chen has taught courses such as Analysis of Algorithms , Lower Bounds in Theoretical Computer Science , and Introduction to Computational Complexity . He co-advises current PhD students Tim Randolph and Erik Waingarten, and has graduated students like Timothy Sun (Emory University) and Xiaorui Sun (University of Illinois at Chicago). He has served on program committees for conferences like WINE, SODA, and STOC. His research spans theoretical computer science, including property testing, graph isomorphism, and fixed-point computation. He is affiliated with Columbia's Theory Group and actively participates in the Theory Seminar organized by Alex Andoni. Xi Chen's research also extends to algorithmic economics, exploring mechanisms, pricing strategies, and market equilibria. His work on complexity theory includes contributions to counting problems and circuit complexity. He maintains a lab and collaborates with researchers in theoretical computer science and algorithmic game theory.

Melanie Matchett Woodمشاهده پروفایل

استاد

• Number Theory
• Arithmetic Statistics
• Arithmetic Geometry
• +۵ مورد دیگر

Melanie Matchett Wood is the William Caspar Graustein Professor of Mathematics at Harvard University. Her research spans number theory, arithmetic statistics, algebraic geometry, and probability theory, with a focus on distributions of class groups, Galois groups of unramified extensions, and random algebraic structures. She has been supported by prestigious awards including the Packard Fellowship, the NSF Waterman Award, and the MacArthur Fellowship. Her work connects number theory to topology through function field analogs, studying moduli spaces of curves and their statistical properties. She has made significant contributions to understanding the universality of random matrix cokernels and their applications to sandpile groups of graphs. Her editorial roles include the Journal of the American Mathematical Society and Algebra and Number Theory . Recent publications emphasize arithmetic topology, proving universality theorems for 3-manifold groups, and developing new heuristics for class group torsion. She organizes seminars on arithmetic statistics and topology-number theory interactions. Her teaching includes advanced courses like Algebraic Number Theory and Class Field Theory, with research supervision spanning PhD and undergraduate projects. Scientific Awards: Packard Fellowship for Science and Engineering National Science Foundation Waterman Award MacArthur Fellowship

Lutz Warnkeمشاهده پروفایل

استاد

• Combinatorics
• Probability Theory
• Random Graphs
• +۵ مورد دیگر

Lutz Warnke is a Professor of Mathematics at the University of California, San Diego, with prior affiliations at Georgia Institute of Technology (where he received tenure in 2021) and Peterhouse, Cambridge University (Junior Research Fellow until 2016). His research focuses on probabilistic combinatorics, random graphs, phase transitions, and combinatorial probability, with applications to extremal combinatorics and Ramsey theory. Education : Ph.D. in Mathematics from the University of Oxford (2012), supervised by Oliver Riordan. Dr. Warnke's research explores the structure and evolution of random graphs and processes, including Achlioptas processes, Ramsey numbers, and extremal problems. His work often bridges probabilistic methods with algorithmic applications and theoretical computer science. His publications from 2022–2025 reveal trends in random graph isomorphisms, clique coloring thresholds, extremal subgraph counts, and hardness of online algorithms. Key subfields include percolation, phase transitions, and probabilistic methods applied to combinatorial structures. Scientific Awards : Dénes König Prize (2016), Alfred P. Sloan Research Fellowship (2018), NSF CAREER Award (2020), Richard Rado Prize (2014). Dr. Warnke actively supervises PhD students and postdocs, including Matthew Cho (PhD ongoing), Erlang Surya (PhD 2025), Emily Zhu (PhD 2025), and He Guo (PhD 2021). He has received teaching accolades at Georgia Tech and contributes to graduate courses in probabilistic combinatorics, random graph theory, and stochastic processes.

• Operator Algebra
• C*-algebras
• K-theory
• +۳ مورد دیگر

Søren Eilers is a Professor at the Department of Mathematical Sciences , University of Copenhagen. His research focuses on Operator Algebras , particularly the classification of C*-algebras related to discrete and low-dimensional structures. He is a member of the FNU network 'Automorphisms and Invariants for Operator Algebras' and advocates for experimental mathematics using computational methods in pure mathematics. Education: MS in Mathematics and Computer Science, University of Copenhagen (1993) PhD in Mathematics, University of Copenhagen (1995) Research Interests: Operator Algebras K-theory Symbolic Dynamics Discrete Mathematics Experimental Mathematics Recent Publications (2016-2024) demonstrate expertise in graph C*-algebras , symbolic dynamics , and computational approaches to pure mathematics, with key collaborations in Denmark, Japan, Canada, and the U.S. Scientific Leadership: President, Danish Mathematical Society (2006-2008) Principal Investigator, Villum Fonden (2012-2016) Main Organizer, Mittag-Leffler Institute Program (2016) Advisory Roles: Supervised 28 master's theses and mentored 9 PhD students/postdocs (2003-2022) across institutions in Denmark, Canada, Japan, and the U.S.

Manuel Penschuckمشاهده پروفایل

پژوهشگر ارشد

• Algorithm Engineering
• Random Graphs
• Parallel and Distributed Computing
• +۳ مورد دیگر

Manuel Penschuck is a Research Fellow at the Institute of Computer Science , Goethe University Frankfurt, Germany. His research focuses on algorithm engineering, graph theory, and scalable network generation, with emphasis on parallel computing, I/O-efficient algorithms, and random graph models. He actively contributes to conferences like ESA, SEA, and IPDPS, and has co-authored publications in top venues including LIPIcs , IEEE Transactions , and SIAM . His work includes engineering algorithms for non-linear preferential attachment , parallel shuffling , and hyperbolic graph generation . He has co-organized program committees for ESA, EuroPar, and SEA, and his collaborations span institutions such as MPI-INF, TU Darmstadt, and Australian National University. Recent publications highlight advances in uniform graph sampling, geometric network models, and distributed systems. His research integrates theoretical rigor with practical implementation, addressing challenges in big data and high-performance computing. He is a key contributor to the Networkit toolkit for large-scale network analysis.