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

Christoph Koutschanمشاهده پروفایل

استاد پژوهشی

• Computer Algebra
• Algorithmic Combinatorics
• Symbolic Summation
• +۳ مورد دیگر

Christoph Koutschan is a Senior Fellow in the Symbolic Computation group at the Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences. He holds a PhD in Mathematics from JKU Linz (2009) and a Habilitation in Mathematics (2017). His research focuses on computer algebra, algorithmic combinatorics, and symbolic summation/integration of holonomic functions. Koutschan has held positions at Tulane University (2009–2010), Tulane University (2009–2010), and INRIA (2011–2012) before joining RICAM in 2012. Education: PhD in Mathematics (2009), Research Institute for Symbolic Computation (RISC), JKU Linz Habilitation in Mathematics (2017), JKU Linz M.Sc. in Computer Science (2005), FAU Erlangen-Nürnberg Studies in Computer Science (1999–2005), FAU Erlangen-Nürnberg Research Interests: Koutschan's work revolves around symbolic computation with a focus on holonomic functions, combinatorial identities, and applications in mathematical physics. His tools include algorithmic methods for summation/integration, differential equations, and computational algebra. Publications & Awards: Over 40 journal articles, including work on determinant evaluations, Feynman amplitudes, and combinatorial enumeration. Notable awards include the David P. Robbins Prize (2016), ISSAC's Distinguished Software Presentation Award (2016), and the ACA Early Researcher Award (2021). Grants & Collaborations: Lead or co-PI in projects like 'Certificate-free Summation and Integration' (SFB F50, 2017–2021) and 'Security and Safety for Shared AI' (FFG COMET-K2, 2020–2023). Active in editorial roles at Journal of Symbolic Computation and Annals of Combinatorics . Labs/Teams: Core member of RICAM's Symbolic Computation group, collaborating internationally with institutions like INRIA, Tulane University, and TU Wien.

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

استاد

• Theoretical Computer Science
• Complexity Theory
• Computational Learning
• +۴ مورد دیگر

Leslie Valiant is the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics in the School of Engineering and Applied Sciences at Harvard University, where he has taught since 1982. He previously held positions at Carnegie Mellon University, Leeds University, and the University of Edinburgh. His research spans theoretical computer science with significant contributions to complexity theory, computational learning, and parallel computation. He introduced the #P-completeness concept to explain why enumeration and reliability problems are intractable, developed holographic algorithms, and created the influential "probably approximately correct" (PAC) model that helped establish machine learning theory as a formal discipline. His work extends to computational neuroscience, evolution theory, and artificial intelligence, where he has formulated evolution as a form of computational learning. Nevanlinna Prize (1986) Knuth Award (1997) EATCS Award (2008) A.M. Turing Award (2010) Fellow of the Royal Society Member of the National Academy of Sciences (USA) Valiant's interdisciplinary approach connects computer science with biological evolution, proposing that protein circuits in living organisms evolve through processes analogous to machine learning algorithms. His work on evolvability distinguishes function classes that can evolve with polynomially bounded resources from those that cannot, addressing fundamental questions about how complex biological systems can emerge through natural selection.

• Graph theory
• Combinatorial topology
• Neural network mathematics
• +۱ مورد دیگر

Paul Kainen is an Adjunct Lecturer in mathematics at Georgetown University, specializing in combinatorial mathematics and topological graph theory. His research examines graph embeddings, Eulerian complexes, and neural network foundations. Recent work establishes connections between Fibonacci sequences and graph construction algorithms, while topological investigations extend Euler's polyhedron theorem to CW-complexes. He holds a PhD in Mathematics from Cornell University and teaches courses in advanced mathematical modeling.

Andreas R. Blassمشاهده پروفایل

استاد

• Set Theory
• Category Theory
• Finite Combinatorics
• +۵ مورد دیگر

Andreas R. Blass is a Professor of Mathematics at the University of Michigan, affiliated with the Department of Mathematics. His primary research focuses on mathematical logic, set theory, category theory, finite combinatorics, and theoretical computer science. He serves as associate chairman for regular faculty appointments, reflecting his administrative contributions. His work bridges foundational mathematics with applications in computer science, such as linear logic, complexity theory, and algorithmic analysis. Blass's research explores topics like infinitary combinatorics, cardinal characteristics of the continuum, topos theory, and geometric morphisms. He has contributed significantly to understanding connections between category theory and set theory, as well as the theoretical underpinnings of computation. His publications span journals in logic, computer science, and mathematics, addressing foundational questions in these interdisciplinary areas.

Istvan Miklosمشاهده پروفایل

استاد

• Computational Complexity
• Bioinformatics
• Markov Chain Monte Carlo Methods
• +۵ مورد دیگر

Istvan Miklos is a Professor in the Department of Stochastics at the Hungarian Academy of Sciences' Rényi Institute. He teaches Combinatorics CO1 at Budapest Semesters in Mathematics and Stochastic models in bioinformatics at the Technical University of Budapest. His academic journey began with biology and chemistry studies at Eötvös Loránd University in 1992 before switching to mathematics in 1993, where he graduated in 1998 and completed his PhD on Statistical Sequence Alignment. His research spans computational complexity, bioinformatics, and combinatorial mathematics, with particular focus on counting and sampling problems, Markov chain mixing, and applications to biological systems including genome rearrangement and network analysis. His work bridges theoretical computer science with practical biological applications, exploring the intersection of #P-complete and FPRAS complexity classes. Analysis of his recent publications (2019-2025) reveals consistent work in graph theory, hypergraph construction, degree sequence realization, and Markov chain Monte Carlo methods. His research demonstrates strong interdisciplinary connections between theoretical computer science, discrete mathematics, and biological applications, with particular emphasis on developing efficient sampling algorithms for complex combinatorial structures. He has supervised numerous graduate students including PhD candidates Imelda Somodi and Adrienn Szabó, and has mentored over a dozen undergraduate research students at Budapest Semesters in Mathematics who have published peer-reviewed papers with him since 2012. Miklos maintains active research collaborations, as evidenced by his extensive publication record with co-authors including P.L. Erdős, T.R. Mezei, and L. Soukup. His work combines deep theoretical insights with practical applications in bioinformatics and computational biology.

Mark Newmanمشاهده پروفایل

استاد

• Network Science
• Statistical Physics
• Complex Systems
• +۳ مورد دیگر

Mark Newman is the Anatol Rapoport Distinguished University Professor of Physics at the University of Michigan, affiliated with the Department of Physics within the College of Literature, Science, and the Arts. His research focuses on network science, statistical physics, and complex systems, with notable contributions to community detection algorithms, network topology analysis, and applications in epidemiology, social dynamics, and computational modeling. Newman's work has been widely recognized, including his election to the Royal Society (2022) and the 2024 Leo P. Kadanoff Prize. His research spans theoretical frameworks and practical applications, such as developing methods for inferring network structures from noisy data, analyzing core-periphery hierarchies in social systems, and exploring the interplay between luck, skill, and competition in games. He is also renowned for his cartogram mapping techniques, featured in the Washington Post for visualizing election data through network-based spatial distortions. Newman's academic contributions include foundational textbooks like *Networks: An Introduction* (2010), which remain pivotal in teaching and research. His recent work addresses challenges in drug-disease network analysis, Bayesian mixture models, and improving mutual information measures for classification tasks. Awards and honors include the Royal Society Fellowship and the Kadanoff Prize, underscoring his impact on both theoretical and applied physics.

Christian Beanمشاهده پروفایل

مدرس

• Enumerative Combinatorics
• Algorithmic Mathematics
• Permutation Patterns
• +۳ مورد دیگر

Christian Bean is a Lecturer in Mathematics at Keele University, joining in 2023. Previously, he held postdoctoral positions at Reykjavik University (Iceland) from 2020 and LIPN, Université Paris Nord (France) in 2019. He earned his PhD in Computer Science from Reykjavik University in 2018 under Henning Ulfarsson. His research focuses on enumerative combinatorics and algorithmic methods for proving mathematical statements, particularly in permutation patterns and combinatorial structures. Key areas include permutation enumeration, pattern avoidance, and algorithmic frameworks for combinatorial exploration. Bean has authored/co-authored influential papers in journals like The Electronic Journal of Combinatorics , Information and Computation , and Journal of Symbolic Computation , with recent work emphasizing insertion encodings, mesh patterns, and generating functions for Motzkin paths. His Combinatorial Exploration framework has become a cornerstone in algorithmic enumeration. Supervision includes current PhD student Abigail Ollson and past MSc/BSc advisees. Active in academic collaboration, his work bridges theoretical computer science and discrete mathematics, with applications to structural analysis and automated discovery in combinatorial domains.

Danny Dyerمشاهده پروفایل

استاد

• Graph Theory
• Combinatorial Designs
• Graph Searching
• +۳ مورد دیگر

Dr. Danny Dyer is a Professor of Mathematics at Memorial University of Newfoundland, where he has been since 2005. He holds a PhD from Simon Fraser University (2004) and a B.Sc. from Memorial University (1998). His research focuses on graph theory, including motion in graphs, cops and robbers games, graph searching, watchman walks, graph decomposition, and labelling problems. He also explores the Scholarship of Teaching and Learning in undergraduate mathematics education. He has received prestigious awards, including the President’s Award for Distinguished Teaching and the Atlantic Universities’ Distinguished Teaching Award. His work bridges theoretical mathematics with educational innovation. Research interests prominently feature graph theory subfields such as pursuit-evasion games, graph labeling strategies, and structural graph analysis. His recent publications explore constrained searching algorithms, extremal graph problems, and applications of combinatorial sequences. Teaching contributions emphasize undergraduate mathematics pedagogy. Key academic milestones include foundational work on zero-forcing sets, eternal domination in graphs, and graceful labeling techniques. His research has been published in over 40 peer-reviewed articles, spanning topics from theoretical graph problems to practical teaching methodologies.

• Combinatorics
• Probability
• Statistical Mechanics
• +۴ مورد دیگر

Olivier Bernardi is a Professor of Mathematics and Chair of the Brandeis University Department of Mathematics. His research focuses on combinatorics, with applications in probability, mathematical physics, computer science, and algebra. He specializes in bijective methods, encoding complex geometric structures into simpler forms like lattice paths and trees. A key interest is the combinatorics of maps (embedded graphs), which intersect fields like random surface theory and representation theory. Education includes a Ph.D. from Université Bordeaux 1, and M.S. and B.S. degrees from École Normale Supérieure Paris. His work bridges theoretical combinatorics with practical algorithms, emphasizing structural insights through bijections. Recent publications explore Tutte polynomials, percolation on triangulations, and geometric drawing algorithms. Awards and grants are not explicitly listed, but his leadership role as Department Chair highlights institutional contributions. He advises on research in discrete mathematics and collaborates on projects involving graph enumeration and algebraic combinatorics. His research spans foundational topics, with applications in both pure and applied mathematical domains.

Daniel Pritikinمشاهده پروفایل

استاد

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

Professor Daniel Pritikin is an academic in the Department of Mathematics at Miami University. He holds a Ph.D. in Mathematics from the University of Wisconsin. His research focuses on Graph Theory, Combinatorics, and Recreational Mathematics, with notable contributions to Hamiltonian cycles in multipartite graphs, Steiner tree problems in hypercubes, and combinatorial game theory. His work bridges theoretical graph structures with algorithmic applications and playful mathematical explorations. Key research themes include graph embeddings, combinatorial optimization, and algebraic graph theory, often intersecting with geometric and number-theoretic concepts. Recent studies explore hypercube networks, Cayley graph representations, and the interplay between graph parameters like separation numbers and domination. His articles frequently address structural properties of graphs and their applications in network design and puzzle-solving. While no specific scientific awards are listed, his prolific publication record since 1985 underscores sustained academic engagement. His advising record is not detailed here, but his research spans over three decades, including foundational work on unitary Cayley graphs and Steiner tree optimizations.

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

Alessio Borzì is a Researcher in the Nonlinear Algebra group at the Max Planck Institute for Mathematics in the Sciences (MPI MiS) in Leipzig, Germany, under the leadership of Bernd Sturmfels. He holds a PhD from the University of Warwick (2023), supervised by Diane Maclagan, following a Master’s and Bachelor’s from the University of Catania, where he was also part of the Scuola Superiore di Catania. His research focuses on Combinatorics, Algebraic Geometry, and Tropical Geometry, with particular emphasis on matroids, toric geometry, and their interactions with Commutative Algebra. Research interests include tropical geometry’s connections to toric varieties, matroid realizability, and algebraic structures like cyclotomic numerical semigroups. His work bridges abstract algebra and combinatorial geometry, with applications in computational algebraic tools such as Macaulay2. Notable contributions include studies on matroid quotients, tropical flag varieties, and graded algebras with cyclotomic Hilbert series. Recent talks and publications highlight trends in realizability problems (e.g., matroid quotients and Bergman fans), tropical moduli spaces, and algebraic combinatorics. Borzì has organized reading groups and seminars on topics like K-stability and tropical geometry, reflecting his commitment to advancing interdisciplinary research. He is a member of the London Mathematical Society and Italy’s GNSAGA. Collaborative networks include co-authors such as Diane Maclagan, Bernd Sturmfels, and others in the Nonlinear Algebra community. His work often involves international collaborations, as evidenced by presentations at institutions like the University of Tübingen, York, and Warwick.

Vadim Sokolovمشاهده پروفایل

دانشیار

• Systems Engineering
• Operations Research
• Transportation Systems Analysis
• +۶ مورد دیگر

Vadim Sokolov is an Associate Professor in the Department of Systems Engineering and Operations Research at George Mason University (GMU), with affiliate status in the College of Engineering and Computing (CEIE). His research focuses on developing robust methodologies for large-scale systems analysis, combining agent-based modeling, Bayesian statistical techniques, and computational experimentation. He co-developed Polaris, an open-source mobility simulator widely used in transportation network analysis by government entities. Previously, Sokolov served as a Principal Computational Scientist at Argonne National Laboratory, a Fellow at the University of Chicago's Computation Institute, and a Lecturer at the University of Chicago. He holds a Ph.D. in Computational Mathematics from Northern Illinois University. His research interests span agent-based modeling, Bayesian analysis, transportation systems, and computational software development. Notable contributions include work on stochastic computer models, deep learning applications in traffic flow prediction, and quantum Bayesian computation. He has published in top-tier journals such as the Annals of Applied Statistics and Transportation Research Part C. Though no awards are explicitly listed, his extensive publications and industry collaborations highlight his impactful work in computational systems and transportation analysis.

• Programming Languages
• Software Engineering
• Compiler Optimization
• +۵ مورد دیگر

Qirun Zhang is an Assistant Professor in the School of Computer Science at the Georgia Institute of Technology . He holds the Catherine M. and James E. Allchin Early Career academic title. His research focuses on programming languages , software engineering , and compiler optimization , with an emphasis on program analysis , static analysis , and formal methods . He received his Ph.D. in Computer Science and Engineering from The Chinese University of Hong Kong (2013) and a Bachelor's from Zhejiang University (2009). Research Interests include techniques for improving software reliability/security via program analysis and compiler optimization. His work leverages computational complexity, analytic combinatorics, graph theory, and formal languages. Notable contributions involve debug information validation , context-free language reachability , and compiler testing frameworks like Skeletal Program Enumeration (SPE) . Recent Work spans scalable cryptographic accelerator design, LLVM-based debug validation, and SMT solving optimizations. His papers often address algorithmic improvements for reachability problems and compiler correctness. Awards include the PLDI Distinguished Paper Award (2020) and Facebook Fellowship (2021). He serves on program committees for top venues like POPL, SAS, and PLDI, and chairs artifact evaluation committees (PLDI'25). Teaching includes courses on compilers (CS 4240), software analysis (CS 6340), and advanced program analysis (CS 8803). He mentors a research group with current Ph.D. students and MS/undergraduate researchers. Lab/Team focuses on rigorous compiler validation and program analysis tools. Open positions are available for Fall 2025.

Olga Bodroža-Pantićمشاهده پروفایل

استاد

• Graph Theory
• Combinatorics
• Theoretical Computer Science
• +۳ مورد دیگر

Olga Bodroža-Pantić is a Professor at the Department of Mathematics and Informatics , Faculty of Sciences , University of Novi Sad . Her research spans Graph Theory , Combinatorics , and Discrete Mathematics , with significant contributions to the study of Hamiltonian cycles , 2-factors , and Kekule structures in grid graphs and topological surfaces like torus and Klein bottle. Email: bodroza@dmi.uns.ac.rs Recent publications focus on graph enumeration and structural analysis in grid graphs, alongside interdisciplinary applications in mathematical biology and food production processes . Her work on the MTE-model highlights interests in mathematics education.

Charis Papadopoulosمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Graph Algorithms
• +۵ مورد دیگر

Charis Papadopoulos is a Professor at the Department of Mathematics, University of Ioannina, Greece. He holds a PhD in Computer Science (2005) and MSc (2001) from the University of Ioannina, and conducted postdoctoral research at the University of Bergen, Norway (2005-2007). His academic activities include visiting researcher positions at the University of Ioannina (2008-2010) before joining the faculty in 2011. Education: MSc and PhD in Computer Science, University of Ioannina Postdoc: Algorithms Research Group, University of Bergen (2005-2007) His research interests focus on Theoretical Computer Science, particularly: Design and analysis of algorithms Algorithmic graph theory Graph modification problems Width parameters and graph layouts Combinatorial enumeration Algorithm engineering Recent publications address structural parameterization of cluster deletion, subset feedback vertex set problems, avoidable vertex/path enumeration, and connectivity-preserving subgraphs. His work spans both journal publications (e.g., Algorithmica , Theory of Computing Systems ) and conference proceedings (e.g., WALCOM , SODA ). He has served on program committees for major conferences including: CIAC 2025 EuroCG 2025 WADS 2023 WALCOM 2023 Current projects include FANTA (Efficient Algorithms for Network Analysis) funded by H.F.R.I. and Separators and Cut Problems under HFRI grants. He has supervised PhD and Master's dissertations and collaborated with European research institutions.