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

Dan A. Simoviciمشاهده پروفایل

استاد

• Data Mining
• Machine Learning
• Information Theory
• +۵ مورد دیگر

Dan A. Simovici is a Professor of Computer Science at the University of Massachusetts Boston, where he has served since 1985 and currently directs the Computer Science Graduate Program. He also holds an Honorary Professorship at the University of Iasi (Romania) and has held visiting positions at the University of Science and Technology Lille and Tohoku University. A Senior Member of IEEE and active in ACM and AAAI, his research integrates information theory, data mining, formal logic, and algebra. Education Ph.D. in Mathematics, University of Bucharest (1974) M.S. in Mathematics, University of Iasi (1970) M.S. in Electrical Engineering, Polytechnical Institute of Iasi (1965) Research Interests Dr. Simovici’s work centers on information-theoretic and linear-algebraic techniques in data mining , semantic database models, and the algebraic foundations of multiple-valued logic. His recent focus includes clustering validation via entropy measures, ultrametric structures in dissimilarity spaces, and the mathematical underpinnings of machine-learning algorithms. These themes are unified by a rigorous mathematical approach that bridges theory and practical data-analysis challenges. Books & Recent Publications Over the past decade, he has authored or co-authored major reference texts including Clustering – Theoretical and Practical Aspects (2021), Mathematical Analysis for Machine Learning and Data Mining (2018), and the 1004-page Linear Algebra Tools for Data Mining (2nd ed., 2023). His 2024 volumes Logical Foundations of Computer Science (2 vols.) and Introduction to the Theory of Formal Languages consolidate decades of scholarship. Scientific Awards & Honors Best Paper Award, AFIA (2000) Senior Member, IEEE Vice Chair, IEEE Computer Society Technical Committee for Multiple-Valued Logic Managing Editor, Journal of Multiple-Valued Logic and Soft Computing Editorial roles: International Journal of Parallel, Emergent and Distributed Systems and International Journal of Software and Information Technologies PhD Advising & Graduate Program Leadership Since 1984, Dr. Simovici has directed the Computer Science Graduate Program at UMass Boston, mentoring 12 PhD graduates (2002–2021) whose work spans data-mining algorithms, clustering, and machine-learning theory. He regularly organizes and chairs premier conferences such as ISMVL (International Symposium on Multiple-Valued Logic) and serves on program committees for KDD, PKDD, and DAWAK. Laboratories & Teams While no specific laboratory name is provided, Dr. Simovici’s graduate program leadership and extensive editorial and conference responsibilities effectively coordinate a distributed research group focused on theoretical computer science and data mining, collaborating with institutions in the U.S., Europe, and Asia.

Catalin Zaraمشاهده پروفایل

استاد

• Differential Geometry
• Equivariant Cohomology
• K-Theory
• +۳ مورد دیگر

Catalin Zara is a Professor in the Department of Mathematics at the University of Massachusetts Boston (UMass Boston), serving as Interim Associate Dean of the College of Science and Mathematics (CSM). He holds a Ph.D. in Mathematics from the Massachusetts Institute of Technology (MIT). His research focuses on differential geometry, equivariant cohomology and K-theory, combinatorial structures, and applications of distance metrics in finite spaces. He has published extensively in top-tier journals such as Advances in Mathematics and Journal of Combinatorics . Dr. Zara's work bridges pure and applied mathematics, with notable contributions to GKM theory, polynomial assignments, and combinatorial optimization. His recent projects include studies on balance weighing problems, windfarm geometry impacts, and Thue-Morse sequences. Teaching evaluations highlight his engaging style, challenging yet supportive approach, and ability to foster deep conceptual understanding across courses like Calculus, Linear Algebra, and advanced topics in combinatorics. He maintains an active research program with interdisciplinary applications, including collaborations in environmental science (bird mortality modeling) and computer science (medoid-based clustering). His office is located in Wheatley Hall and he is regularly involved in academic service roles such as department leadership and curriculum development.

Eric Moorhouseمشاهده پروفایل

استاد

• Projective Geometry
• Codes and Designs
• Non-Associative Structures
• +۶ مورد دیگر

Eric Moorhouse is a Professor of Mathematics in the Department of Mathematics and Statistics at the University of Wyoming, where he has served since joining the faculty in 1989 after appointments at the University of Oregon. His academic credentials include a Ph.D. in Mathematics (1987), M.Sc. in Mathematics (1984), and B.Sc. in Mathematics (1980), all from the University of Toronto. Dr. Moorhouse's research spans projective geometry, codes and designs, non-associative structures, algebraic combinatorics, and information theory, employing both experimental programming and theoretical methods from group theory, algebraic geometry, number theory, and mathematical logic. His interdisciplinary approach bridges combinatorial structures with algebraic and geometric frameworks to solve complex problems in finite geometry. His publication record demonstrates sustained focus on projective planes and combinatorial designs, with recent works emphasizing computational techniques and algebraic geometry applications. These contributions reveal evolving trends toward algorithmic solutions and cross-disciplinary synthesis in geometric combinatorics. He maintains active engagement in teaching across undergraduate and graduate mathematics curricula, reflecting his commitment to academic instruction at all levels.

Dane Taylorمشاهده پروفایل

استادیار

• Networks
• Data Science
• Complex Systems
• +۴ مورد دیگر

Dane Taylor is an Assistant Professor at the University of Wyoming's School of Computing and Department of Mathematics and Statistics, with an adjunct appointment in Electrical Engineering and Computer Science. He joined UW in 2023 after serving as assistant professor at University at Buffalo (2017-2023). His research focuses on network science, complex systems, and data science methodologies. Education includes: Ph.D. Applied Mathematics, University of Colorado Boulder (2013) B.S. Electrical Engineering (bioengineering), University of Wyoming (2008) B.S. Physics, University of Wyoming (2008) Research interests span: network-based modeling, spectral theory, random matrix theory, neurocomputation, and self-organization in complex systems. His work develops mathematical frameworks for temporal/multilayer networks and simplicial complexes. Publication trends show consistent focus on network dynamics, topological data analysis, and applications in neuroscience, epidemiology, and social systems. Recent work explores machine learning integration with network theory and pandemic-related human mobility patterns. Awards and research support: NSF Algorithms for Threat Detection (ATD) grant NSF Mathematical Biology grant Nakatani Foundation (2020-2021) Simons Foundation (2018-2024) Postdoctoral Award for Research Excellence, UNC (2015) Teaching Award, UNC/HHMI (2014) ARCS Foundation Fellowship (2009-2012) NASA Space Grant Fellowship (2006) Organizational leadership includes: 2022 Northeast Regional Conference on Complex Systems, 2020 SIAM Workshop on Network Science, and multiple minisymposia for major conferences. Outside academia, enjoys hiking, snowboarding, and mountain biking.

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

دانشیار

• Algebra
• Set Theory
• Combinatorics
• +۲ مورد دیگر

Daniel Herden is an Associate Professor in the Department of Mathematics at Baylor University's College of Arts & Sciences. He earned his Habilitation (2013) and Dr. rer. nat. (2005) from the University of Duisburg-Essen, Germany. His research spans algebra-set theory interactions, combinatorics applications, and coding theory. Herden maintains strong international collaborations and currently serves on the problem proposal committee of the German Mathematical Olympiad. Research interests focus on constructing large algebraic structures under set-theoretic constraints, applications of infinite combinatorics to algebra, finite combinatorics in symplectic geometry and partitions, and emerging work in coding theory at the algebra-combinatorics interface. Herden's publication trends demonstrate sustained contributions to pure mathematics, with recent work expanding into applied combinatorics and coding theory. Earlier research emphasized foundational work in set-theoretic algebra and module theory. Scientific honors include: 3 Silver Medals at International Mathematical Olympiad (1997-1999) Ranked #2 in German Math Olympiad Hall of Fame 5 First Prizes in German Mathematical Olympiad 3 First Prizes at German Federal Math Competition He advises PhD students in algebra and combinatorics, with current joint supervision in coding theory. Former students have completed dissertations on incidence algebras, group automorphisms, and forcing methods in group theory.

Reeve Hunterمشاهده پروفایل

مدرس

• Math Pedagogy
• Topological Dynamics
• Coding Applications
• +۲ مورد دیگر

Reeve Hunter is a full-time Lecturer of Mathematics at Baylor University's College of Arts and Sciences. He teaches courses including Calculus, Linear Algebra, and Precalculus, employing pedagogical strategies enhanced by computational tools. His interdisciplinary interests intersect mathematics with digital media, music theory, and coding.

Charlotte Atenمشاهده پروفایل

پژوهشگر ارشد

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

Charlotte Aten is a Burnett Meyer Instructor at the University of Colorado Boulder's Department of Mathematics, part of the College of Arts and Sciences. Previously, she held a postdoctoral position at the University of Denver. Her research focuses on combinatorics, universal algebra, and category theory, with applications to machine learning and formal verification. A proponent of interdisciplinary work, she explores connections between algebraic structures and topological spaces, as well as categorical approaches to neural networks. Education: PhD in Mathematics (2022), University of Rochester, thesis: Finite Generation of Families of Structures Equipped with Compatible Group Actions Bachelor of Science in Mathematics (Honors, 2017), University of Rochester Associate of Science in Mathematics (Honors, 2014), Monroe Community College Research Interests: Functorial constructions of spaces from quasigroups, representation stability, categorified invariant theory, applied category theory in machine learning, and formal verification. Her work bridges abstract algebra with geometric and computational frameworks, emphasizing practical applications. Recognition: Provost’s Fellowship (2017), University of Rochester Doris Ermine Smith Award (2017), University of Rochester McNair Scholar (2015), University of Rochester Xerox STEM Scholarship (2014), Monroe Community College Teaching & Outreach: Taught courses at the University of Colorado Boulder and University of Denver, including Linear Algebra, Calculus, and specialized topics. Led undergraduate research programs (e.g., NSF REU/Grad for All), focusing on category theory and Python coding. Served as President of the University of Rochester’s AMS Graduate Student Chapter and Treasurer of outGRADS. Contributions: Authored textbooks, including Category Theory: A Concise Course (2019). Active on GitHub with repositories on algebraic structures and lattice theory. Maintains an educational YouTube channel on universal algebra and collaborates with Mastodon’s math-focused community (mathstodon.xyz).

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

استاد

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

Yuanlin Li is a Professor of Mathematics at Brock University. He holds a PhD from Memorial University, an MSc from Nanjing University, and a BSc from Jiangsu University. His research focuses on group rings, combinatorial number theory, and algebraic structures, with applications in coding theory. Key interests include Zassenhaus conjectures, zero-sum problems, and homological properties of modules. Research Projects: Includes studies on unit groups of group rings, normalizer problems, and additive number theory. Interdisciplinary Work: Explores connections between rings and graphs (e.g., zero-divisor graphs) and combinatorial problems in group theory. He is affiliated with the Department of Mathematics and Statistics and maintains an active research program, though no specific grants or awards are listed in the provided text.

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

استاد

• Algorithms
• Complexity Theory
• Approximation Algorithms
• +۴ مورد دیگر

David Juedes is a Professor of Electrical Engineering and Computer Science and Associate Dean for Academics at Ohio University's Russ College of Engineering and Technology. He also directs the Avionics Engineering Center and is part of the Center for Scientific Computing and Immersive Technologies. Juedes holds a Ph.D. from Iowa State University (1994) and has taught courses ranging from introductory computer science to advanced graduate topics like computational complexity and formal languages. His research focuses on algorithms, complexity theory, approximation algorithms, and computational biology. Notable contributions include work on secure embedded systems (e.g., d-GUARD and DAGGER frameworks) and parameterized algorithm analysis. He has advised multiple graduate and undergraduate students in areas like parameterized algorithms and bioinformatics. Juedes has received awards including ACM Senior Membership (2010) and the Russ College Outstanding Research Paper Award (2004). His work spans 30+ years with over 80 publications in top journals/conferences. He actively promotes STEM education through initiatives like cybersecurity workshops for K-12 teachers and curriculum development for real-time systems and CORBA-based resource management. Labs/Teams: Director of Avionics Engineering Center, Core member of Center for Scientific Computing and Immersive Technologies.

Boris Hasselblattمشاهده پروفایل

استاد

• Dynamical Systems
• Hyperbolic Dynamics
• Chaos Theory
• +۱۱ مورد دیگر

Boris Hasselblatt is a Professor in the Department of Mathematics at Tufts University's School of Arts and Sciences. He has been affiliated with Tufts since 1989, holding roles including Department Chair and Associate Provost (2014-2016). His research focuses on geometrically motivated hyperbolic dynamics chaos theory ergodic theory topological dynamics centralizers of dynamical systems and has produced over 5000 published pages, including the seminal textbook on dynamical systems. He has held visiting appointments at ETH Zurich, University of Tokyo, and IHES Paris. Hasselblatt's research spans the regularity of Anosov splittings ergodic theory for hyperbolic systems exotic Anosov flows degree-growth of monomial maps pointwise vs. uniform hyperbolicity differentiability of Hartman-Grobman linearizations His work connects dynamical systems with differential geometry, number theory, and coding theory. He has received NSF grants for Award #2020: VISION FOR DYNAMICS (2019-2020) School on Geometry and Dynamics (2014-2015) Tufts Math Circle (2012-2013) and held leadership roles across mathematical societies including Secretary of the American Mathematical Society (2021-present) Founding Editor of Journal of Modern Dynamics Founding Editor-in-Chief of Mathematics Research Reports AMS Council and Committees membership Teaching activities include advanced courses in Differential Equations Graduate and PhD thesis advising Master's thesis instruction Honors thesis supervision at Tufts University.

Xiang-dong Houمشاهده پروفایل

استاد

• Finite Fields
• Permutation Polynomials
• Coding Theory
• +۲ مورد دیگر

Xiang-dong Hou is Professor in the Department of Mathematics and Statistics at the University of South Florida. His research spans algebra, number theory, coding theory, cryptography, and combinatorics, with particular expertise in finite fields and permutation polynomials. Research develops novel approaches to polynomial factorization over finite fields and equivalence classification of rational functions. Applications include cryptographic Boolean function design and efficient coding theory implementations. Publications demonstrate innovative connections between abstract algebra and information security, particularly in developing new permutation polynomial families for cryptographic applications. Recent work advances theoretical frameworks for normal polynomial identification. Scientific Awards: No awards listed Supervises doctoral students in finite field applications and serves as editorial board member for Finite Fields and Their Applications journal.

Giacomo Micheliمشاهده پروفایل

دانشیار

• Applied Algebra
• Finite Fields
• Cryptography
• +۲ مورد دیگر

Giacomo Micheli is Associate Professor in the Department of Mathematics & Statistics at University of South Florida's College of Arts and Sciences, and Co-Director of the Center for Cryptographic Research. Education includes a PhD in Mathematics from University of Zurich (2015) and MA/BA degrees from University of Rome (2012/2010). Research spans applied algebra and number theory with focus areas: Algebraic foundations of cryptography (finite fields, code equivalence) Locally recoverable codes for distributed storage Differential cryptanalysis of symmetric ciphers Current projects supported by NSF CAREER and RTG grants develop cryptographic primitives and analyze number-theoretic structures. Advises PhD students in algebraic coding and cryptanalysis. Serves as associate editor for Advances in Mathematics of Communications and Journal of Number Theory.

Betty Fyn-Sydneyمشاهده پروفایل

مدرس

• Group Theory
• Representation Theory
• Coding Theory
• +۲ مورد دیگر

Dr. Betty Fyn-Sydney is an Associate Lecturer in the Department of Computing at Goldsmiths, University of London, and holds concurrent roles as a Teaching Fellow at the University of Birmingham and a Lecturer at the University of Greenwich. She specializes in pure mathematics with a focus on group theory, representation theory, and coding theory. Her teaching spans foundational mathematics courses for computing students, including Mathematical Modelling and Problem Solving, and she oversees undergraduate research projects at the University of Birmingham. Education: PhD in Pure Mathematics, University of Birmingham (2013) MSci in Mathematical Sciences, University of Birmingham (2007) BSc in Statistics, Obafemi Awolowo University, Nigeria (2004) Research & Teaching: Dr. Fyn-Sydney’s research bridges abstract algebra (group theory) and applied mathematics (coding theory). She actively contributes to teaching across multiple institutions, leading tutorials in mathematical modelling for first-year undergraduates at Greenwich and supervising advanced projects at Birmingham. Her expertise also extends to linear algebra, number theory, and calculus instruction. Awards: No scientific awards explicitly mentioned in the provided materials. Advising & Grants: Supervises undergraduate mathematics projects at Birmingham but no specific grants or funding details are noted. Her academic service includes curriculum development in symbolic and numerical mathematics. Labs/Teams: No dedicated lab or research team described in the text.

Alexander Golovnevمشاهده پروفایل

استادیار

• Computational Complexity
• Algorithms
• Pseudorandomness
• +۲ مورد دیگر

Alexander Golovnev is an Assistant Professor at Georgetown University's Computer Science Department. His research focuses on computational complexity, algorithms, pseudorandomness, learning theory, and cryptography. He received his PhD from New York University in 2017, advised by Oded Regev and Yevgeniy Dodis, with postdoctoral positions at Columbia University, Yahoo Research, and Harvard University. His current teaching includes Matrix Rigidity (Spring 2025) and Introduction to Algorithms. He has developed a 5-Course Specialization on Discrete Mathematics and organized workshops on Matrix Rigidity and Fine-Grained Cryptography. Service includes program committees for CSR'22, FOCS'22, STOC'24, CCC'24, and ITC'25. Research interests span quantum computing reductions, lattice problems, circuit complexity, and fine-grained cryptography. His recent publications explore worst-case to average-case reductions, function inversion tradeoffs, and SNARK constructions. Awards include NSF CAREER Award (2024), Rabin Postdoctoral Fellowship (2018-2020), and IPEC excellent student paper award (2012). Current PhD/Master's advisees: Sidhant Saraogi (joint with Justin Thaler), Karthik Gajulapalli, Samuel King, and Satyajeet Nagargoje.

Sebastian Sternمشاهده پروفایل

پژوهشگر

• Wireless Communications
• MIMO Systems
• Lattice Coding
• +۳ مورد دیگر

Dr.-Ing. Sebastian Stern serves as a Senior Researcher at the Institute of Communications Engineering, Ulm University, Germany. His research focuses on advanced communication systems with particular expertise in MIMO transmission, lattice-based coding, and optical communications. Stern maintains active collaborations with researchers including Robert F.H. Fischer and Johannes K. Fischer across multiple publications. His educational background includes a dissertation titled Advanced Equalization and Coded-Modulation Strategies for Multiple-Input/Multiple-Output Systems (2019) from Ulm University, building upon his Master's thesis Comparison of the peak value behavior of single- and multi-carrier methods (2012) which earned the VDE Award for Outstanding Master Thesis. Stern's research interests span wireless communications, optical transmission systems, and advanced signal processing techniques. His work demonstrates significant contributions to 4D constellation design using Hurwitz and Eisenstein integers, lattice reduction methods for MIMO systems, and non-binary coding schemes for high-throughput fiber-optic communication. Recent publications show expanding work into quaternionic lattices and AI applications for network security. His publication record shows consistent output since 2013 with 25+ journal and conference papers, including high-impact publications in IEEE Transactions on Information Theory and Journal of Lightwave Technology. Recent work (2023-2025) demonstrates continued innovation in integer-forcing techniques, quaternionic Minkowski reduction, and 4D constellation optimization. VDE Award for Outstanding Master Thesis (2013) Stern has taught multiple courses at Ulm University including Communications Engineering lab courses, Multiuser Communications and MIMO Systems exercises, and Signale und Systeme tutorials between 2013-2017. His teaching experience complements his research in practical implementation of advanced communication techniques.