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

Justin Mcinroyمشاهده پروفایل

مدرس ارشد

• Algebra
• Group Theory
• Non-Associative Algebras
• +۷ مورد دیگر

Justin McInroy is a Senior Lecturer in Mathematics and Programme Leader for the postgraduate MSc Mathematics programme at the University of Chester. He holds an honorary position as an Honorary Research Fellow at the University of Bristol. His Erdős number is three, reflecting his collaborative research network. Dr. McInroy has a PhD from the University of Birmingham and an MMath from the University of Warwick. He is a Fellow of the Higher Education Academy (FHEA). His research focuses on algebra, group theory, and combinatorics, with an emphasis on non-associative structures like axial algebras and their connections to mathematical physics, coding theory, and computational methods. Notable areas include exploring Miyamoto groups, fusion systems, and the interplay between algebraic structures and geometric/topological properties of spaces. Recent work emphasizes quotients of high-dimensional algebras and their classification under the Monster fusion law. He teaches undergraduate and postgraduate courses in group theory, linear algebra, and mathematical programming. McInroy actively seeks PhD students interested in algebraic research. Professional roles include committee memberships in the Faculty Research & Knowledge Exchange Committee, KEHub for Mathematical Sciences, and the London Mathematical Society. He also maintains platforms for academic engagement via ORCID, arXiv, and GitHub. Scientific awards include Fellowship status from Advance HE. His research outputs span axial algebras, code algebras, and geometric group theory, with extensive collaborations internationally. Grants and funding details are not explicitly listed in the provided texts.

Kengo Katoمشاهده پروفایل

استاد

• Mathematical Statistics
• Applied Probability
• Econometrics
• +۳ مورد دیگر

Kengo Kato is a Professor in the Department of Statistics and Data Science at Cornell University , affiliated with the College of Arts and Sciences. Previously, he held a position at the Faculty of Economics at The University of Tokyo and served as a visiting scholar at MIT’s Department of Economics. His research focuses on Mathematical Statistics, Applied Probability, and Econometrics , with an emphasis on high-dimensional statistical models and optimal transport theory. His work spans topics such as statistical inference in optimal transport, Gromov-Wasserstein distances, bootstrap methods, and high-dimensional data analysis. Notably, he is Editor-in-Chief of the journal Bernoulli (2025-2027) and serves as an associate editor for Japanese Economic Review and Journal of Statistical Planning and Inference . His research bridges theoretical advancements with practical applications in econometrics and machine learning. Recent publications emphasize foundational results in optimal transport theory, including limit laws for Gromov-Wasserstein alignment, stability of entropic maps, and statistical guarantees for sliced Wasserstein distances. His work on bootstrap techniques addresses challenges in high-dimensional and spatial data analysis, offering robust inference methods for modern datasets. While no formal advisees are listed, his contributions to statistical theory and methodology suggest significant mentorship in graduate training programs. His research is supported by Cornell’s interdisciplinary environment and collaborations within affiliated institutes.

• Robust Bayesian Inference
• Statistical Network Analysis
• Hierarchical Bayesian Analysis
• +۲ مورد دیگر

Neil Spencer is an Assistant Professor in the Department of Statistics at the University of Connecticut. His primary research focuses on robust Bayesian inference, statistical network analysis, hierarchical Bayesian modeling, and efficient Bayesian computation, with applications in forensic footwear analysis and network data. He teaches statistical computing courses including STAT5410 for the Master of Data Science program. His educational background includes a joint PhD in Statistics and Machine Learning from Carnegie Mellon University, an MSc in Statistics from the University of British Columbia, and a BScH in Mathematics and Statistics from Acadia University. Previously, he was a postdoctoral researcher in Biostatistics at Harvard School of Public Health. Dr. Spencer's recent publications demonstrate a strong focus on Bayesian methodologies applied to network modeling, computational statistics, and experimental design. His work frequently appears in top-tier statistics journals such as the Annals of Statistics.

Magnus Myreenمشاهده پروفایل

پژوهشگر

• Formal Verification
• Programming Languages
• Compiler Design
• +۴ مورد دیگر

Dr. Magnus Myreen is an affiliate researcher at the Department of Computer Science and Technology, University of Cambridge. His work focuses on formal verification, compiler correctness, and verified systems programming, with a particular emphasis on the CakeML project. He contributes to developing verified compilers, ensuring their reliability through rigorous mathematical proofs. His research integrates formal methods with practical systems programming challenges, addressing topics like SAT solver validation, hardware-software co-verification, and certified approximation algorithms. Myreen’s research interests span formal methods, programming languages, and compiler design. He explores techniques for verifying complex software systems, including device drivers, operating systems, and cryptographic functions. His projects emphasize end-to-end verification, ensuring that every component—from high-level specifications to machine code—is formally validated. Recent work includes advancements in verified propagation redundancy checking and the development of tools like Pancake for systems programming. He collaborates on initiatives such as the SAT Competition, contributing verified tools like VeriPB. His publications highlight trends in verified compilation, formalized mathematics, and the integration of interactive theorem provers with practical applications. Myreen’s efforts aim to bridge the gap between theoretical formal methods and real-world software engineering challenges.

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

دانشیار

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

Dr. Charles Wallis is an Associate Professor of Mathematics at Brevard College. His research focuses on graph theory, combinatorics, and mathematics education. He holds a Ph.D. from Clemson University, along with an M.S. and B.S. from Clemson University and North Carolina State University, respectively. Research Interests: Wallis specializes in domination parameters of graphs, combinatorial problems on chessboard graphs, and algebraic graph theory. His work bridges theoretical mathematics with applications in discrete structures and educational assessment. Publications Trends: His publications (1992–2004) emphasize graph theory and combinatorics, with a recurring focus on chessboard-related graph problems, matrix permanents, and educational studies. Key themes include structural graph analysis, algorithmic approaches, and pedagogical evaluation. Awards: No awards explicitly listed in the provided text. Grants & Advising: No grants or advising information provided in the text. His contributions are primarily through research and teaching in mathematics. Labs/Teams: No specific lab or collaborative team affiliations mentioned.

Mike Krebsمشاهده پروفایل

استاد

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

Mike Krebs is a Professor in the Department of Mathematics at California State University, Los Angeles (Cal State LA). He is affiliated with the College of Natural & Social Sciences. His research focuses on algebraic combinatorics, graph theory, and discrete mathematics, with notable work on Cayley graphs, expander families, and combinatorial trace methods. Krebs has collaborated extensively with undergraduate and graduate students, mentoring over 20 theses and co-authoring numerous papers with them. His academic background includes a Ph.D. from Johns Hopkins University (2005), advised by Dr. Richard Wentworth. Krebs has published widely in journals like Discrete Mathematics , Linear Algebra and its Applications , and Journal of Algebraic Combinatorics , with a focus on topics such as chromatic numbers of Cayley graphs, Kazhdan constants, and expander graph constructions. Research trends in his articles emphasize interdisciplinary applications, including sports analytics (PageRank for baseball teams) and pedagogical innovations in mathematics education. He has authored a textbook, Expander Families and Cayley Graphs: A Beginner's Guide (2011), and contributed to the Handbook of Graph Theory . Krebs’s work bridges pure mathematics with computational tools, as seen in his Mathematica code for chromatic number calculations.

Ed Carrمشاهده پروفایل

دانشیار

• Cybersecurity
• Graph Theory
• Quantum Computing
• +۳ مورد دیگر

Ed Carr is an Associate Professor of Computer Science at the Department of Computer Science & Mathematics, Emory & Henry College. Previously, he held roles at North Carolina A&T State University as Undergraduate Program Director and Graduate Faculty. His research focuses on Cybersecurity (Intrusion Detection, Zero-Knowledge Proofs), Graph Theory (Hamiltonian Cycles, Graph Coloring), and Quantum Computing. He has advised numerous graduate and undergraduate students, contributing to cybersecurity, algorithms, and systems projects. Education: Ph.D./MS Computer Science (NC A&T), MS Applied Mathematics (Western Carolina), BS Mathematics (Wingate). Research interests span cybersecurity frameworks, graph theory applications, and quantum computing paradigms. His work has been supported by grants totaling $1.57M from NSF, DOD, DOE, and others. Notable projects include GenCyber Summer Camps (DOD/NSA) and quantum information science initiatives. Publications emphasize graph cycle existence and algorithmic developments. He teaches advanced courses like Operating Systems, Concurrent Programming, and Data Structures. Awards: None explicitly listed. Advising highlights include key permutation libraries, ZKP authentication systems, and network security tools. His professional experience spans academia and community colleges, with roles at Gardner-Webb University and Edgecombe Community College.

Tung T. Nguyenمشاهده پروفایل

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

• Computational Number Theory
• Spectral Graph Theory
• Nonlinear Dynamics
• +۳ مورد دیگر

Tung T. Nguyen is a Visiting Assistant Professor of Computer Science at Lake Forest College, with a PhD in Mathematics from the University of Chicago (2020). He will transition to a tenure-track Assistant Professor position at Elmhurst University in Fall 2025. His research bridges computational number theory, spectral graph theory, and nonlinear dynamics, with recent work exploring AI-driven theorem proving. He actively mentors students, emphasizing experimental projects that merge mathematical rigor with coding. Education: PhD in Mathematics (University of Chicago, 2020) under Prof. Kazuya Kato; Postdoc at Western University (2020-2024); Undergraduate at Vietnam National University. Research focuses on Algorithms for prime number theory Applications of algebraic structures in graph theory Nonlinear oscillator networks and synchronization phenomena Key awards: 2025 SIAM Early Career Travel Award (to present work at AG25 conference) and MAA Project NExT fellowship. Organized conferences include the virtual celebration of Prof. Moshe Rosenfeld's 85th birthday. Teaching includes Probability & Statistics and independent studies on prime number algorithms. Collaborates on initiatives like the Vietnam PolyMath REU program.

Valentina Grazianمشاهده پروفایل

پژوهشگر ارشد

• Cryptography
• Group Theory
• Fusion Systems
• +۳ مورد دیگر

Valentina Grazian is a Research Fellow in Algebra at the University of Padua (IT) since September 2024. Her academic journey includes roles as a Postdoctoral researcher at the University of Salerno (2023–2024) and University of Milano–Bicocca (2020–2023), and a Lecturer at the University of Padua (2019–2020). She completed her PhD at the University of Birmingham under Prof Chris Parker, with a thesis titled "Fusion systems on p-groups of sectional rank 3". Research Interests: Grazian focuses on fusion systems, group theory, cryptography (specifically fully homomorphic encryption), and algebraic structures. She has contributed to projects like the EPSRC-funded "Fusion Systems and Localities" at the University of Aberdeen (UK). Her work bridges pure mathematics and applications in cryptography and education. Professional Affiliations: Member of the Unione Matematica Italiana, European Women in Mathematics, INDAM GNSAGA group, and AGTA (Advances in Group Theory and Applications). She organized the Algebra Seminar at the University of Milano–Bicocca and has published extensively in peer-reviewed journals. Grants & Projects: Participated in the EPSRC project "Fusion Systems and Localities" (2017–2018). Her current research explores cryptographic applications of algebraic systems and pedagogical tools like WIMS for primary education. Labs/Teams: Part of the Algebra group at the University of Padua and collaborated with researchers like Carlo Blundo and Ellen Henke. She advocates for gender equity in mathematics through her involvement with European Women in Mathematics.

Joshua Grochowمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Algebraic Complexity
• Group Theory
• +۳ مورد دیگر

Joshua Grochow is an Associate Professor in Computer Science at the University of Colorado Boulder, with joint appointments in Mathematics. His research spans theoretical computer science, algebraic complexity, and complex systems. Key research areas: Algebraic approaches to matrix multiplication complexity Isomorphism problems for groups/tensors/polynomials Geometric complexity theory and circuit lower bounds Network analysis and complex systems modeling Recent publications feature breakthroughs in tensor isomorphism completeness and parallel algorithms for group isomorphism. Research combines representation theory, combinatorics, and complexity theory. Awards include Omidyar and Dean's Fellowships. Leads research groups in complexity theory and complex networks. Organizes workshops on wildness in computer science.

Petar Markovićمشاهده پروفایل

استاد

• Universal Algebra
• Constraint Satisfaction Problems
• Algebraic Logic
• +۴ مورد دیگر

Petar Marković is a full professor at the University of Novi Sad, Faculty of Sciences, Department of Mathematics and Informatics. His research focuses on universal algebra, constraint satisfaction problems, algebraic logic, and combinatorics. He holds a Ph.D. and has been actively publishing since at least 2000, with notable contributions to Mal’cev conditions, semigroup theory, and finite basis problems in algebra. His academic career includes roles such as chair of the Applied Algebra department and membership in research groups studying algebraic structures and computational complexity. Marković’s work bridges theoretical computer science and mathematics, with applications in logic, graph theory, and computational problems. His personal website at http://people.dmi.uns.ac.rs/~markovicp/ provides further details on his research and publications. Key areas of exploration include the structure of algebraic varieties, congruence properties, and the algebraic approach to constraint satisfaction problems (CSP). He has investigated the computational complexity of CSPs on specific graph classes and contributed to understanding the boundaries between tractable and intractable cases through algebraic methods.

• Computer Science
• Artificial Intelligence
• Machine Learning
• +۷ مورد دیگر

Huan Zhou is a prolific researcher affiliated with multiple institutions including the University of Oldenburg , China Three Gorges University , and Wuhan University . His work spans Computer Science , Mathematics , and Engineering disciplines. Key affiliations: Signal Processing Group (Oldenburg), Computer and Information Technology College (China Three Gorges University), Geodesy and Geomatics (Wuhan University) Research interests include: Graph Theory : Resistance spectra, planar graph properties, and spectral analysis Optimization Algorithms : Manta ray foraging, vortex search, and swarm intelligence applications Computer Vision : Road segmentation, stereo matching, and remote sensing image analysis Telecommunications : RIS-assisted wireless systems and beamforming techniques Machine Learning : Anomaly detection, continual learning, and transformer architectures Recent publications demonstrate cross-domain impact in bioinformatics (TriGCN for medicine), network systems (Plover distributed logging), and computational pathology (glioma diagnosis with transformers).

Rigoberto Florezمشاهده پروفایل

استاد

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

Dr. Rigoberto Florez is a Professor of Mathematics at The Citadel, The Military College of South Carolina, within the Department of Mathematical Sciences, part of the Swain Family School of Science and Mathematics. He holds a Ph.D. in Mathematics from Binghamton University (SUNY), an M.S. from Universidad Nacional de Colombia, and a B.A. from Universidad de Antioquia in Colombia. His research focuses on combinatorics, particularly graphs, algebraically representable matroids, harmonic matroids, biased graphs, enumerative combinatorics, and elementary number theory. He actively involves undergraduate and graduate students in research projects, which have led to conference presentations and awards. He co-founded the Carolina Math Seminar to foster collaborative research and education. Dr. Florez’s recent publications explore topics like Fibonacci identities, Dyck paths, matroid projectivity, and asymmetric graph families. His work bridges theoretical mathematics with pedagogical innovation, emphasizing student-driven problem-solving and visual proofs through experiments like the Möbius strip. He serves in roles that enhance academic excellence and leadership, aligning with The Citadel’s mission. His research and teaching highlight interdisciplinary connections between combinatorics, algebra, and geometry.

Lixin Fuمشاهده پروفایل

دانشیار

• Databases
• Data Mining
• Machine Learning
• +۳ مورد دیگر

Lixin Fu is an Associate Professor and Director of Undergraduate Studies in the Department of Computer Science at The University of North Carolina at Greensboro (UNCG). They hold a Ph.D. in Computer and Information Sciences and Engineering from the University of Florida. Their research focuses on Databases, Data Mining, Machine Learning, Social Networks, and Algorithms, with notable contributions to optimization in delivery systems, shortest path discovery in social graphs, and data cube technologies. Education: Ph.D. in Computer and Information Sciences and Engineering from University of Florida. Research interests emphasize scalable algorithms for social network analysis, graph theory applications, and efficient data mining techniques. Their work often bridges theoretical advancements with practical implementations in areas like recommendation systems, spam detection, and privacy-preserving data processing. Recent publications highlight innovations in pathfinding algorithms, clustering methodologies, and optimizing multi-source delivery systems. Teaching responsibilities include advanced courses such as CSC 671 (Advanced Database Systems), CSC 674/474 (Principles of Data Mining), and CSC 654/454 (Design and Analysis of Algorithms). Labs/Teams: While no specific lab is mentioned, their research collaborations likely involve data science and computational methods groups at UNCG.

Yifan Jingمشاهده پروفایل

استادیار

• Additive and Combinatorial Number Theory
• Combinatorics and Graph Theory
• Harmonic Analysis
• +۸ مورد دیگر

Yifan Jing is an Assistant Professor in the Department of Mathematics at The Ohio State University (OSU). He previously held postdoctoral positions at the University of Oxford’s Mathematical Institute and Wolfson College, mentored by Ben Green. His academic journey includes a PhD from the University of Illinois Urbana-Champaign (2021), supervised by József Balogh and Xiaochun Li, an M.Sc. from Simon Fraser University (2018) under Bojan Mohar, and a B.Sc. from the University of Science and Technology of China (2016), advised by Jack Koolen. His research focuses on Arithmetic Combinatorics, Analytic and Combinatorial Group Theory, Lie groups, Abstract Harmonic Analysis, Representation Theory, Additive Number Theory, Model Theory applications, Discrete Probability, and Theoretical Computer Science. Notable contributions include work on measure growth in Lie groups, inverse theorems for geometric inequalities, and structural graph theory. He received the 2023 Kirkman Medal for his research contributions. He currently organizes OSU’s Combinatorics Seminar and teaches Math 4507: Geometry. His advising includes PhD students Yewen Sun, Chavdar Lalov, and Yuchen Meng, alongside mentoring multiple undergraduate researchers at Oxford. Collaborators include leading mathematicians such as Chieu-Minh Tran, Ruixiang Zhang, and Bojan Mohar. His work bridges analysis, algebra, and logic to address problems across combinatorics, number theory, and geometry.