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

Hendrik Jan Hoogeboomمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Formal Languages
• Algorithms
• +۱۳ مورد دیگر

Hendrik Jan Hoogeboom is an Associate Professor in the Department of Computer Science at Leiden University, affiliated with the Leiden Institute of Advanced Computer Science (LIACS) and the Theory research cluster. Research Interests: His work lies at the intersection of theoretical computer science and computational biology. He specializes in formal languages , algorithms , logic & automata (including tree-walking automata), and infinitary languages . A major theme is modeling natural computation, such as gene assembly in ciliates using graph polynomials and delta-matroids, and molecular computing paradigms like reaction systems and spiking neural P systems. Publication Trends: His recent publications (2017–2024) show a sustained focus on reaction systems and graph polynomials. He has developed formal models to analyze DNA rearrangements, explored the algebraic structure of gene assembly, and investigated the computational power of various natural computing models, often using combinatorial and algebraic tools from graph theory. Scientific Recognition: While specific awards are not listed, his extensive publication record in premier journals like Theoretical Computer Science , European Journal of Combinatorics , and Fundamenta Informaticae signifies high recognition in his field. Teaching and Mentorship: He has supervised several PhD students, including Robert Brijder, Jun Wang, and Rudy van Vliet. He teaches core courses such as Data Structures , Algorithms , Automata Theory , and Complexity , and has led seminars on topics like combinatorial game theory and SAT solvers. Laboratories and Teams: He is a key member of the Theory research cluster at LIACS, focusing on fundamental aspects of computer science. His work is deeply collaborative, especially with colleagues like Robert Brijder and W.A. Kosters.

Jeremiah M. Blockiمشاهده پروفایل

دانشیار

• Cryptography
• Information Security
• Usable Privacy and Security
• +۷ مورد دیگر

Jeremiah M. Blocki is an Associate Professor in the Department of Computer Science at Purdue University. His research focuses on cryptography, usable privacy and security, and authentication protocols. He joined Purdue in Fall 2016, previously completing his PhD at Carnegie Mellon University and a postdoc at Microsoft Research New England. Education: PhD in Computer Science, Carnegie Mellon University, 2014 Bachelor of Science in Computer Science, Carnegie Mellon University, 2009 Research Interests: Dr. Blocki’s work emphasizes applying theoretical computer science to practical security challenges, including password management, memory-hard functions, and differential privacy. His recent projects include developing distribution-aware password throttling and analyzing the post-quantum security of cryptographic algorithms. Publications: His research spans cryptographic protocols, security mechanisms, and privacy-preserving algorithms. Notable contributions include advancements in memory-hard functions (e.g., CRYPTO 2016, 2019) and differential privacy techniques (e.g., ITCS 2025). Recent work explores the intersection of cryptography with quantum computing and sublinear-time algorithms. Awards: NSF CAREER Award (2021) Purdue Seed for Success Award (2019) Allen Newell Award for Excellence in Undergraduate Research (2009) Advising & Grants: Supervised multiple PhD students and postdocs. Key grants include the NSF CAREER award ($591k) and a $10.7M HACCLE project (IARPA) for secure multi-party computation. Labs/Teams: Co-leads the HACCLE project, focusing on high-assurance cryptographic languages and environments. Active in Purdue’s CERIAS security initiatives.

Susanna de Rezendeمشاهده پروفایل

استادیار

• Computational Complexity
• Proof Complexity
• Circuit Complexity
• +۶ مورد دیگر

Susanna de Rezende is an Assistant Professor in the Department of Computer Science at Lund University (LTH). She is affiliated with the ELLIIT initiative on IT and mobile communication, the LTH Profile Area: AI and Digitalization, and the MIAO group collaborating with the University of Copenhagen. Her research focuses on computational complexity, proof complexity, circuit complexity, and communication complexity. She holds a PhD from KTH Royal Institute of Technology (2019) and a Master's from the University of São Paulo (2014). Her research explores connections between proof systems, circuit lower bounds, and communication complexity, with recent contributions to lifting theorems, automatability, and average-case hardness. She has received awards including the Stockholm Mathematics Centre Prize and Wallenberg Academy Fellow status. Current projects include funded PhD positions in theoretical computer science and editorial work for ZML: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. Key articles address proof complexity trade-offs, clique hardness in Sherali-Adams, and graph coloring challenges. Collaborations span institutions like the Czech Academy of Sciences and the Simons Institute. She advises multiple PhD students and collaborates on foundational research in complexity theory, supported by WASP, ELLIIT, and VR grants.

• Rigidity Theory
• Discrete Geometry
• Combinatorics
• +۴ مورد دیگر

Louis Theran is a Lecturer in Mathematics at the University of St Andrews , School of Mathematics and Statistics. His research bridges geometry, combinatorics, and algorithmic problems, with applications in physics, materials, and machine learning. Education: Ph.D. in Computer Science, University of Massachusetts, Amherst (2010) M.S. in Computer Science, University of Massachusetts, Amherst (2007) B.S. in Computer Science and Mathematics, University of Massachusetts, Amherst (2006) Theran’s research focuses on the rigidity theory of frameworks , exploring how geometric and combinatorial properties determine structural stability. He investigates discrete geometry, sparse hypergraphs, and pebble game algorithms, connecting these to machine learning (e.g., low-rank matrix completion) and materials science (e.g., auxetic metamaterials, sticky disks). His recent work analyzes rigidity transitions in random graphs , universal rigidity in one-dimensional frameworks, and maximum likelihood thresholds via graph rigidity. Collaborations span computational geometry, algebraic statistics, and physics, emphasizing interdisciplinary applications. Scientific Awards: Heilbronn small grants scheme (2021) NSF/KOSEF East Asia and Pacific Summer Institutes Fellowship (2006) Theran has supervised numerous BSc, MMath, and PhD projects , including topics like tensegrities, graphons, and geometric constraint systems. He has also contributed to Gaussian graphical models and universality theorems for Delaunay triangulations.

Garth Isaakمشاهده پروفایل

استاد

• Discrete Mathematics
• Graph Theory
• Combinatorics
• +۵ مورد دیگر

Garth Isaak is a Professor in the Department of Mathematics and Statistics at Lehigh University , part of the College of Arts and Sciences. He has held roles such as Department Chair (2012–2022) and Associate Dean for Graduate Studies (2012–2016). Isaak earned his Ph.D. in 1990 from Rutgers University’s RUTCOR interdisciplinary program. His research focuses on discrete mathematics, particularly graph theory, with contributions to interval orders, pebbling games, Ramsey numbers, and tolerance graphs. He has also explored combinatorial duality and alternative calculus pedagogy. Isaak teaches courses like Graph Theory and Introduction to Mathematical Reasoning . His work emphasizes algorithmic solutions for graph problems and structural characterizations. Over 150 publications and a strong academic mentorship record highlight his scholarly impact. Education: Ph.D. (Rutgers University, 1990); Postdoctoral research at Dartmouth College (1990–1992). Research Interests: Discrete Mathematics, Graph Theory, Interval Orders, Combinatorial Optimization, Ramsey Theory, and Algorithmic Graph Analysis. His work bridges theoretical foundations and practical applications, such as efficient graph recognition algorithms and game-theoretic graph dynamics.

Kevin Igaمشاهده پروفایل

استاد

• Mathematical Physics
• Supersymmetry
• Differential Topology
• +۴ مورد دیگر

Kevin Iga is a Professor of Mathematics at Pepperdine University's Seaver College, part of the Natural Science Division. He has been teaching since 1998 and holds a PhD from Stanford University (1998) and dual BS degrees in Mathematics and Physics from MIT (1992). His research focuses on supersymmetry, particularly using Adinkra diagrams, differential topology, general relativity, and cryptography. He has contributed to geometric interpretations of supersymmetry algebras and combinatorial analysis of Adinkras. Iga serves as Public Information Officer for the MAA's Philosophy of Mathematics SIG and is active in professional organizations like the AMS, ASA, and MAA. His work spans over 25 years, with significant contributions to mathematical physics, including structural theory of Adinkras, cohomological applications, and cryptographic hardness problems. He teaches courses such as Algebraic Structures, Automata Theory, and Real Analysis. Iga is also involved in community activities, singing in the Pepperdine Concert Choir and participating in Malibu Presbyterian Church.

• Mathematical Optimization
• Game Theory
• Mechanism Design
• +۷ مورد دیگر

Max Klimm is an Assistant Professor for Discrete Optimization at Technische Universität Berlin, affiliated with Faculty II – Mathematics and Natural Sciences and the Department of Mathematics. He leads the research group in Discrete Optimization and holds editorial roles at journals like the International Journal of Game Theory and Operations Research Forum . His academic journey includes a PhD in Mathematics from TU Berlin (2012), followed by roles as an Assistant Professor at Humboldt-Universität zu Berlin and Head of the Junior Research Group at the Einstein-Center for Mathematics. His research focuses on mathematical optimization, game theory, and mechanism design applied to multi-agent systems in traffic, telecommunications, and economics. Recent work addresses equilibrium computation in congestion games, stochastic optimization, and algorithmic challenges in network design. Key projects include Combinatorial Network Flow Methods for Gas Markets and the Math+ projects on mechanism design and evolutionary models for networks. Teaching responsibilities include courses on Discrete Optimization, Algorithmic Game Theory, and introductory mathematical courses. His research has been funded by DFG, Einstein Center, and Math+ initiatives. Notable contributions include advancements in parametric flow algorithms, impartial selection mechanisms, and reconstructing historical road networks using cost-benefit models.

• Mathematical Optimization
• Algorithmic Game Theory
• Multi-Agent Systems
• +۳ مورد دیگر

Max Klimm is an Assistant Professor for Discrete Optimization at Technische Universität Berlin, affiliated with the Department of Mathematics within Faculty II – Mathematics and Natural Sciences. He holds a PhD in Mathematics from TU Berlin (2012) and previously served as an Assistant Professor for Operations Research at Humboldt-Universität zu Berlin (2014–2016) and led the Junior Research Group for Optimization under Uncertainty at the Einstein-Center for Mathematics (2014–2016). His research focuses on algorithmic game theory, mathematical optimization of multi-agent systems in traffic, telecommunications, and economics. Key areas include network flows, congestion games, mechanism design, and infrastructure networks. He actively contributes to academic activities as an associate editor for journals like International Journal of Game Theory and Operations Research Forum , and has served on program committees for conferences such as AAAI, EC, and WINE. Recent work includes studies on evolutionary road network reconstruction, robustness of potential-based flows, and algorithmic solutions for knapsack and assignment problems. His research bridges theoretical foundations with practical applications in transportation and resource allocation.

Charles Cusackمشاهده پروفایل

استاد

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

Charles Cusack is a Professor of Computer Science at Hope College, where he has taught since 2005, with a joint appointment in the Department of Mathematics & Statistics since 2016. His expertise spans theoretical and algorithmic domains, particularly in discrete mathematics, graph theory, and algorithmic art. Ph.D. in Computer Science (2000), University of Nebraska–Lincoln M.S. in Computer Science (1998), University of Nebraska–Lincoln M.S. in Discrete Mathematics (1994), Michigan Technological University B.S. in Pure Mathematics (1992), Michigan Technological University His research focuses on graph pebbling, Lemke graphs, and their connections to network optimization, number theory, and computational complexity. He has also pioneered algorithmic art creation using mathematical principles and Lego/Pix Brix since 2022, generating over 3 million unique works through custom programs. Recent publications highlight his work in graph algorithms, combinatorial design, computational complexity, and innovative applications of gaming to distributed computing. While specific scientific awards are not named, his algorithmic art has been recognized in local and international exhibitions. Outside academia, he is an active runner and disc golfer, contributing to community engagement through the Holland Running Club.

Fan Chung Grahamمشاهده پروفایل

استاد

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

Fan Chung Graham is a distinguished Taiwanese-American mathematician and professor at the University of California, San Diego (UCSD), holding the Paul Erdős Chair in Combinatorics. She earned her Ph.D. in Mathematics from the University of Pennsylvania in 1974 under Herbert Wilf, focusing on Ramsey Theory. Her career includes 20 years at Bell Labs and Bellcore, where she contributed to combinatorics and network analysis. She joined UCSD in 1998 as a professor in Mathematics and Computer Science and Engineering. Her research interests span Spectral Graph Theory, Discrete Geometry, Algorithms, and Communication Networks. Notable contributions include foundational work on quasi-random graphs, Laplacian spectra of graphs, and applications of graph theory to complex networks. She authored influential books like Spectral Graph Theory (1997) and Erdős on Graphs (1998). Chung has received numerous accolades, including the 1990 Allendoerfer Award, membership in the American Academy of Arts and Sciences (1998), and the 2009 Noether Lecture. Her work bridges pure mathematics and applied fields, emphasizing interdisciplinary connections. Her academic journey includes visiting roles at Harvard and Princeton, and she has collaborated extensively with mathematicians like Ron Graham and Paul Erdős. Her research continues to influence graph theory, network science, and discrete mathematics.

Courtney Gibbonsمشاهده پروفایل

دانشیار

• Commutative Algebra
• Homological Algebra
• Algebraic Statistics
• +۵ مورد دیگر

Courtney Gibbons is an Associate Professor of Mathematics and Director of Data Science at Hamilton College , where she has been a faculty member since 2013. Her academic journey includes a Ph.D. in Commutative Algebra (2013) and M.S. in Mathematics (2009) from the University of Nebraska–Lincoln , and a B.A. in Mathematics (2006) from Colorado College . Research Focus : Commutative Algebra (infinite free resolutions, Boij-Söderberg theory), Algebraic Statistics, and Science Policy (AI policy, Federal data policy). Teaching : Courses in Computational Algebra, Modern Algebra, Number Theory, and Mathematics in Social Context, emphasizing active learning and accessibility. Awards : 2023-2024: AAAS Science and Technology Policy Fellow, National Science Foundation 2022-2023: AAAS Legislative Science and Technology Policy Fellow, U.S. Senate John R. Hatch Excellence in Teaching Award, Hamilton College (2015) Service : Data Science Program Committee, Committee on Academic Policy (Chair 2021-22), Association for Women in Mathematics Student Chapter Advisor, Phi Beta Kappa member, and various college committees.

Vincent Pilaudمشاهده پروفایل

پژوهشگر

• Combinatorics
• Algebraic Combinatorics
• Geometric Combinatorics
• +۴ مورد دیگر

Vincent Pilaud is a researcher in the Combinatorics group at the Departament de Matemàtiques i Informàtica, Universitat de Barcelona. Formerly a senior CNRS researcher (Directeur de recherche CNRS) on leave, his work focuses on combinatorial geometry, polytopes, and algebraic combinatorics. Education: PhD in Mathematics (2000s) under Michel Pocchiola and Francisco Santos Master's thesis in Mathematics at École Normale Supérieure Research Interests: Vincent’s research spans geometric and algebraic combinatorics, emphasizing polytopes (e.g., associahedra, permutahedra), cluster algebras, lattice theory, and combinatorial geometry. His work often bridges discrete mathematics with geometric realizations and algebraic structures. Recent Articles: His 2025 publications include studies on Hochschild polytopes, wigglyhedra, and minimum maximal matchings in permutahedra, reflecting his focus on geometric and algebraic combinatorics. Earlier work explores polytope deformations and cluster algebra applications. Awards: Premio Extraordinario de Doctorado de la Universidad de Cantabria (Doctorate Award) Grants & Projects: Leads the AEI-DFG project “Combinatorial Polytope Theory” (2025–2028) and co-leads international collaborations like the ANR-PAGCAP project. Active in funding from French and Spanish agencies. Advising: Supervises PhD students (e.g., Louis Marin, Félix Gélinas) and mentors postdocs, fostering research in geometric and algebraic combinatorics. Completed students include Germain Poullot and Thibault Manneville. Labs/Teams: Part of the Combinatorics group at Universitat de Barcelona, collaborating internationally on geometric and combinatorial structures.

Klara Stokesمشاهده پروفایل

دانشیار

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

Klara Stokes is an Associate Professor in Mathematics at the Department of Mathematics and Mathematical Statistics, Umeå University. She holds a qualification as a Recognised University Teacher. Her research focuses on incidence geometry, combinatorial structures, and their geometric realizations, with an emphasis on symmetries and motions. She also explores algebraic and geometric graph theory, finite field geometry, and applications in coding theory, cryptography, data privacy, and kinematics. Her affiliations include membership in the Discrete Mathematics research group. Key research themes involve incidence geometries with trialities, projective rigidity of configurations, and privacy-preserving graph database models. She collaborates on topics such as rigidity circuits, Assur graphs, and geometric decoding of subspace codes. Publications highlight her work on flag transitive geometries, pebble game algorithms for sparse posets, and structural rigidity analysis. Her research bridges pure mathematics and applied areas like data privacy through probabilistic models and clustering techniques. Stokes has contributed to foundational work on pentagonal geometries, minimal genus graph embeddings, and combinatorial configurations. She remains active in advancing geometric and combinatorial methods with interdisciplinary applications.

• Discrete Geometry
• Combinatorial Rigidity
• Graph Theory
• +۱۳ مورد دیگر

Louis Theran is a Lecturer in the School of Mathematics and Statistics at the University of St Andrews, where he has been a faculty member since 2016. His academic journey includes postdoctoral positions at Aalto University, Freie Universität Berlin, and Temple University, supported by grants from the NSF, ERC, and AKA. He holds a PhD in Computer Science from the University of Massachusetts, Amherst, advised by Ileana Streinu. PhD, Computer Science, University of Massachusetts, Amherst (2010) MS, Computer Science, University of Massachusetts, Amherst (2007) BS, Computer Science and Mathematics, University of Massachusetts, Amherst (2006, cum laude) Theran's research centers on discrete geometry and combinatorial rigidity, particularly the rigidity of frameworks with symmetry, periodicity, and sparsity constraints. He explores theoretical foundations and applications in materials science, machine learning, and geometric constraint systems. His work often bridges pure mathematics and computational methods. His recent publications reveal a strong trend in unlabeled rigidity problems, maximum likelihood thresholds in graphical models using rigidity theory, and the combinatorial analysis of symmetric and periodic frameworks. These works appear in top journals across mathematics, statistics, and applied sciences, indicating interdisciplinary impact. Key themes include graph sparsity, matroid theory, and algorithmic implementations like pebble games. NSF/KOSEF East Asia and Pacific Summer Institutes Fellowship (2006) PI, Heilbronn Small Grant: Discrete structures (2021) Coordinator, AScI Thematic Program on Large Geometric Structures (2014–2017) Theran has advised numerous PhD, MMath, and BSc students at the University of St Andrews, Lancaster, and Temple University, with projects ranging from rigidity theory to surreal numbers and zero-knowledge proofs. He has secured research funding and supervised student theses on topics in discrete geometry, combinatorics, and computational mathematics. His service includes organizing workshops and conferences such as the SIAM AG2017 mini-symposium and the Fields Institute workshop on rigidity. He is actively involved in the academic community as an organizer of the Pure Colloquium at St Andrews and has held leadership roles in admissions. He serves on research committees and referees for top journals including Discrete & Computational Geometry , SIAM Journal on Discrete Mathematics , and Advances in Mathematics .

Craig Tennenhouseمشاهده پروفایل

استاد

• Graph Theory
• Combinatorial Game Theory
• Evolutionary Algorithms
• +۳ مورد دیگر

Craig Tennenhouse is a Professor in the School of Computer Science and Data Analytics at the University of New England. He holds a Ph.D. in Applied Mathematics from the University of Colorado Denver and has previously served as an Associate and Assistant Professor at UNE, as well as teaching roles at Simpson University and Jamestown College. His research spans Graph Theory, Combinatorial Game Theory, and Evolutionary Algorithms. Ph.D. in Applied Mathematics, University of Colorado Denver M.A. in Mathematics, University of Colorado A.B. with Honors in Mathematics, University of Chicago Junior Year Abroad, University of Edinburgh Craig’s research focuses on structural properties of graphs, combinatorial game complexity, and genetic algorithm applications. He has authored 15+ peer-reviewed publications, including work on Hnefatafl complexity, Olympic Games with infinite octal codes, and graph saturation extensions. His recent projects explore game state analysis using genetic programming and graph-based modeling. He has received multiple awards, including the Eleanor DeWolfe Ludcke Professorship, NSF grants, and teaching excellence awards. Craig is actively involved in undergraduate research mentoring and serves as a referee for academic journals. His teaching methodology includes inquiry-based learning, flipped classrooms, and integration of game theory into coursework.