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

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.

Tao Zouمشاهده پروفایل

دانشیار

• Covariance regression modeling
• Network data modeling
• Financial statistics
• +۳ مورد دیگر

Tao Zou is an Associate Professor at the Research School of Finance, Actuarial Studies and Statistics, Australian National University. His research spans covariance regression modeling, network data analysis, and applications in financial and environmental statistics. He earned a Ph.D. in Statistics in 2016. Ph.D. in Statistics, 2016 Dr. Zou’s work pioneers covariance regression, where covariances are modeled as functions of covariiates. Key contributions include robust estimation techniques, spatio-temporal modeling, missing data imputation via semi-supervised learning, and distributed data aggregation. His methods address challenges in high-dimensional and non-Euclidean data analysis. Recent publications (2025–2023) explore quasi-score matching for spatial autoregressive models, regularization in network regression, functional principal component analysis for complex data, and environmental applications like PM2.5 pollution studies. These works emphasize robustness, scalability, and interdisciplinary relevance in economics, finance, and environmental science. Dr. Zou collaborates on projects like the 2023 Data Analysis App to Empower Assessment of Immunogenicity of Biologics (Co-Investigator). While his student supervision list isn’t explicitly provided, his methodological advancements influence big data and spatial statistics. He contributes to open-access software and continues expanding covariance regression for non-normal and functional data.

Noela Müllerمشاهده پروفایل

استادیار

• Probability Theory
• Random Matrices
• Sparse Matrices
• +۵ مورد دیگر

Noela Müller is an Assistant Professor in the Mathematics and Computer Science school at Eindhoven University of Technology . Her research focuses on Probability Theory , Random Matrices , and Random Graphs , with significant contributions to understanding the rank of sparse matrices and clique factors in probabilistic settings. Research Outputs : Published 22 works including journal articles and preprints. Collaborations : Active in international networks, particularly in sparse matrix analysis and probabilistic combinatorics. Her recent work explores sparse pooled data algorithms , random 2-SAT models , and sharp thresholds in random graphs , showcasing interdisciplinary applications in computer science, mathematics, and theoretical physics.

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

استاد

• Geometry
• Differential Geometry
• Discrete Differential Geometry
• +۳ مورد دیگر

Jan Techter is a Professor at TU Berlin's Institute of Mathematics, specializing in Geometry and Mathematical Physics. He leads the research group AG Geometrie und mathematische Physik and is affiliated with the SFB/TRR 109 project on discretization in geometry and dynamics. His research focuses on discrete differential geometry, Laguerre geometry, and incircular nets. Education: Bachelor of Science in Mathematics (2013) Master of Science in Mathematics (2015) PhD in Mathematics (2020) Research Interests: Jan Techter explores geometric structures such as confocal quadrics, checkerboard incircular nets, and discrete parametrized surfaces. His work bridges continuous and discrete geometries, emphasizing integrable systems and Laguerre geometry. Recent projects include studies on principal binets and Koenigs binets. Awards & Recognition: No scientific awards explicitly listed in the text. Advising & Grants: Supervised over a dozen student theses, including master's and bachelor's projects on topics like pencils of quadrics, Laguerre geometry, and discrete channel surfaces. Collaborates on research grants through TU Berlin and the SFB/TRR 109 initiative. Labs & Tools: Co-developed the DGD Gallery for digital research data and the pyddg geometry library. Produced visualizations such as the Koebe polyhedra and minimal surfaces short movie.

• Combinatorics
• Latin squares
• Matrix permanents
• +۵ مورد دیگر

Prof Ian M. Wanless is a Professor in the School of Mathematics at Monash University, Melbourne, Australia. He has held academic positions at institutions including the Australian National University (ANU), University of Melbourne, Christ Church Oxford, and Charles Darwin University. His research primarily focuses on combinatorics, with specializations in Latin squares, matrix permanents, graph theory, and algebraic structures. He has made significant contributions to the enumeration and properties of Latin squares, including groundbreaking work on transversals, orthogonality, and symmetry. Wanless has also explored connections between Latin squares and algebraic structures like quasigroups and loops. His education includes a PhD from ANU (supervised by Brendan McKay) and postdoctoral fellowships at Oxford and ANU. He has been awarded an Australian Research Council Future Fellowship (2011) and has led major research initiatives, including organizing international conferences (e.g., 5ICC in 2017). His work spans theoretical results and computational methods, with over 100 publications in top journals like Journal of Combinatorial Theory and SIAM Journal on Discrete Mathematics . Wanless’s research interests extend to design theory, hypergraphs, and permutation polynomials. He co-edits the Electronic Journal of Combinatorics and has held leadership roles in professional societies, including president of the Combinatorial Mathematics Society of Australasia. His current projects include studies on perfect 1-factorizations, covering radii of permutation sets, and algebraic properties of Latin squares.

Santiago Figueiraمشاهده پروفایل

استاد

• Theoretical computer science
• Computability theory
• Algorithmic randomness
• +۸ مورد دیگر

Santiago Figueira is a Professor at the Department of Computer Science, Faculty of Exact and Natural Sciences, University of Buenos Aires, and a Researcher at the Institute of Computer Science (ICC), CONICET (Argentine National Council for Scientific and Technical Research) in Buenos Aires, Argentina. He leads the Logic, Language and Computability Research Group (GLyC) and co-directs the Argentinian-French Laboratory SINFIN, a collaborative initiative between Université Paris-CNRS and Universidad de Buenos Aires-CONICET. Additionally, he is a researcher in the Quantum Information, Computation, and Communication team (QuICC). Dr. Figueira's research spans theoretical computer science with a strong emphasis on computability theory, algorithmic randomness, Kolmogorov complexity, and mathematical logic. His work extends to applications in database theory, quantum information, and cognitive modeling. He has made significant contributions to modal logics, model theory, and the theory of databases, particularly in the context of data trees and XPath query languages. His interdisciplinary approach bridges formal methods with practical applications in quantum computing and human cognition. His publication record demonstrates a consistent trajectory of high-impact research, with recent work focusing on modal logic extensions, quantum information theory, cognitive modeling of concept learning, and database query languages. His collaborations span international institutions, particularly with French researchers through the SINFIN laboratory, and with cognitive scientists studying human memory and concept formation. Dr. Figueira has supervised numerous PhD students and postdoctoral researchers, including Gabriel Goren-Roig, Santiago Cifuentes, Edwin Pin Baque, Sergio Romano, Gabriel Senno, and Sergio Abriola. His former postdocs and CONICET researchers include Guido Bellomo, María Emilia Descotte, and Ariel Bendersky, indicating an active and productive research group. He has developed lecture notes in Spanish on Logic and Computability (2020) and Computability Theory (2021), contributing to academic education in his field. His research group GLyC serves as a hub for theoretical computer science research in Argentina, fostering collaborations between Argentine and international researchers.

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

استاد پژوهشی

• Combinatorics
• Graph Theory
• Design Theory
• +۱ مورد دیگر

Dr. David Pike is a Research Professor at Memorial University of Newfoundland, cross-appointed to the Department of Computer Science. His primary research focuses on combinatorial mathematics, including block-intersection graphs of combinatorial designs, cycle systems, graph decompositions, and computational problems in combinatorics. He has held grants from NSERC and CFI for research in combinatorial design theory and high-performance computing. Dr. Pike has taught courses such as Graph Theory, Combinatorial Design Theory, and Cryptography across multiple academic years. He earned a B.Math from the University of Waterloo and a PhD from Auburn University. His awards include the Motivational Teaching Award (2004) and the ICA Hall Medal (2007). Dr. Pike serves as Vice-President of the Institute of Combinatorics and its Applications and previously held roles in the Canadian Mathematical Society. His research spans structural properties of graphs, existential closure, and algorithmic problems in combinatorics. Recent work includes studies on hypergraph burning, firefighting strategies, and colorings of combinatorial systems.

Michael C. Laskowskiمشاهده پروفایل

استاد

• Model Theory
• Mathematical Logic
• Classification Theory
• +۷ مورد دیگر

Michael C. Laskowski is a Professor in the Department of Mathematics at the University of Maryland, College Park. His office is located in Room 3312 of the Mathematics Building with contact information including phone (301) 405-5336 and email mcl@math.umd.edu. For Fall 2025, he teaches Math 712 (Mathematical Logic I) on Tuesdays and Thursdays from 12:30-1:45 PM, with office hours on Tuesdays from 11:00 AM to 12:00 PM. His research focuses on model theory with significant contributions across multiple subfields: Classification theory (uncountable spectra, Karp complexity, Schröder-Bernstein property) Atomic models of countable theories Borel complexity of first-order theories Monadic expansions and NIP theories Mutually algebraic structures Hrushovski and Fraisse constructions Laskowski's recent publications (2022-2024) demonstrate continued innovation in model theory, particularly in monadic NIP characterizations, Borel completeness, and atomic model theory. His work bridges foundational mathematical logic with applications in combinatorics and computer science. His research program has received continuous NSF funding through grants DMS-9403701 to 2154101, spanning over 30 years of sustained scholarly contribution. His collaborative network includes prominent researchers like Saharon Shelah, John Baldwin, and Simon Thomas. While the webpage doesn't list specific students, his numerous collaborations suggest extensive mentorship of graduate students throughout his career.

Kerri Morganمشاهده پروفایل

مدرس ارشد

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

Kerri Morgan is a Senior Lecturer in Mathematics at RMIT University, based at the City Campus in Australia. She is affiliated with the School of Science, where her research focuses on graph theory, combinatorics, optimization algorithms, and network analysis. Dr. Morgan actively supervises research students in areas such as applications of mutually orthogonal Latin squares and has contributed to interdisciplinary projects involving computational mathematics and neuroscience. Her work bridges theoretical mathematics with practical applications in fields like industry collaboration and educational psychology. Her research interests include chromatic polynomials, graph polynomials, and network science, with notable contributions to brain connectivity analysis and optimization problems in car sequencing and large-scale graphs. Dr. Morgan is open to supervising Masters and PhD students in relevant mathematical domains. She has published extensively on topics such as clique detection, induced subgraphs, and professional identity development in computing students. Her recent work demonstrates a focus on applying mathematical frameworks to real-world challenges, including healthcare and education. While no specific awards are listed, her prolific publication record reflects a strong commitment to advancing discrete mathematics and its applications.

Sophie de Buylمشاهده پروفایل

دانشیار

• Theoretical Physics
• Mathematical Physics
• Biophysics
• +۷ مورد دیگر

Sophie de Buyl is an Associate Professor at the Vrije Universiteit Brussel (VUB), actively contributing to interdisciplinary research bridging theoretical physics and biological systems. She is affiliated with the Department of Bio-engineering Sciences and the VUB Data Lab, focusing on mathematical modeling of biological processes, synthetic biology, and biophysics. PhD in Theoretical Physics (2006, Université Libre de Bruxelles) Postdoctoral experience at IHES, UC Santa Barbara, Harvard University Her research spans cosmological singularities, gauge/gravity correspondence, and black hole entropy in her early career, evolving to integrate theoretical physics with experimental biology. Current projects include synthetic gene regulatory circuits, microbial community dynamics, and embryonic development precision. Key publication trends (2025–2019) reflect dual expertise in mathematical physics (Kac-Moody algebras, black holes) and biological systems (microbial ecology, synthetic biology, circadian clocks). Awards highlight early-career recognition by the Belgian Physics Society and Belspo. Supervised FWO PhD projects on dynamic pathway regulation and microbial systems Director of the Interuniversity Institute of Bioinformatics in Brussels since 2020 Her work emphasizes data-driven discovery of general laws in biological systems, with collaborations spanning bioinformatics, microbiology, and computational modeling.

Matt Fickusمشاهده پروفایل

استاد

• Applied Mathematics
• Frame Theory
• Harmonic Analysis
• +۵ مورد دیگر

Matt Fickus is a faculty member at the Air Force Institute of Technology (AFIT) , where he conducts research in applied mathematics with a focus on frame theory, harmonic analysis, and combinatorial design. His research lies at the intersection of mathematics and engineering, particularly in the construction and analysis of equiangular tight frames (ETFs) and their applications in signal processing, quantum information, and spherical codes. He has developed novel methods for constructing ETFs using harmonic frames and relative difference sets, contributing to the understanding of optimal line packings in Euclidean spaces. His work often draws connections between abstract algebra, combinatorics, and practical applications in data science and communications. Matt Fickus has presented his research in academic seminars, including a 2020 talk on Mutually Unbiased Equiangular Tight Frames, showcasing his contributions to infinite families of ETFs through tensor products and combinatorial structures. He has not been mentioned as receiving any specific scientific awards in the provided text. There is no information available about his advising activities or grant funding in the provided material. No information is available about labs or research teams he may lead or participate in.

Andreas Klappeneckerمشاهده پروفایل

استاد

• Quantum Computing
• Image Processing
• Cryptography
• +۳ مورد دیگر

Andreas Klappenecker is a Professor in the Department of Computer Science & Engineering at Texas A&M University. His research focuses on quantum computing, image processing, and cryptography, with contributions to quantum error correction, algorithms, and distributed systems. He holds a Ph.D. and Diplom from the University of Karlsruhe (now Karlsruhe Institute of Technology). Klappenecker has received notable awards including the NSF CAREER Award (2004) and the Halliburton Faculty Fellowship (2007). Education: Ph.D., Computer Science, University of Karlsruhe, 1998 Diplom (Master's equivalent), Computer Science, University of Karlsruhe Research Interests: Quantum algorithms and error correction Design of efficient quantum circuits (e.g., Toffoli gates) Subsystem codes and stabilizer codes Distributed systems and sensor networks Applications of algebraic structures (e.g., finite fields, nearrings) Awards: Best Paper Award, ICQNM 2009 National Science Foundation CAREER Award (2004) TEES Select Young Faculty Award (2004) Fellow-at-Large, Santa Fe Institute (2000) Grants & Projects: NSF Nano: Resilient Quantum Error Correction (CCF 0622201) CAREER: Design of Efficient Quantum Algorithms (CCF 0347310) Quantum Computing research funded by Texas Institute for Technology Futures (TITF) Labs & Collaborations: Active in interdisciplinary quantum computing initiatives involving computer science, mathematics, and physics departments at Texas A&M. Organized workshops on quantum computation and information.

Stefan Weigertمشاهده پروفایل

دانشیار

• Quantum Theory
• Mathematical Physics
• Quantum Information
• +۸ مورد دیگر

Dr. Stefan Weigert is an Associate Professor in Mathematical Physics at the University of York. He holds roles as Programme Leader for Mathematics and Philosophy, Departmental International Officer, and member of the Sustainability Committee. His research focuses on quantum theory, including quantum information, foundations of quantum mechanics, and uncertainty relations. Notable areas include Gleason's theorem, mutually unbiased bases, PT symmetry, and quantum state reconstruction. He also explores the history of science and rhetorical strategies in scientific writing, with studies on Georg Christoph Lichtenberg. Education: RWTH Aachen (Physics BSc), PhD from University of Basel under Harry Thomas, postdoctoral work in Switzerland and California. Current Students: Adam Beales, Laurens Walleghem, Alistair Mansfield, Vincenzo Fiorentino. Research Group: Mathematical Physics and Quantum Information Research Group. Recent publications address foundational quantum topics like state-update rules, uncertainty relations, and paradoxes. He supervises PhD projects on post-quantum correlations and generalized probabilistic theories. His interdisciplinary interests bridge quantum foundations with literary analysis of scientific texts.

Scott Kaschnerمشاهده پروفایل

استادیار

• Complex Dynamics
• Julia Sets
• Rational Maps
• +۱۱ مورد دیگر

Scott Kaschner is an Assistant Professor in the Department of Mathematics and Actuarial Science at Butler University, College of Liberal Arts and Sciences. His work bridges pure mathematics, applied mathematical biology, and mathematics education. He is actively engaged in research and undergraduate teaching, with a diverse portfolio of scholarly output. Education: Ph.D. in Mathematics, Department of Mathematical Sciences, IUPUI, 2013 M.S. in Theoretical Mathematics, University of Akron, 2008 B.S. in Theoretical Mathematics, University of Akron, 2003 His research interests span Complex Dynamics , particularly Julia sets, rational maps, and bicomplex analysis; Mathematical Virology , including modeling of coronavirus and respiratory syncytial virus (RSV) replication; and Mathematics Education , with focus on student success in introductory courses, assessment design, and interdisciplinary co-teaching. His work reflects a strong interdisciplinary approach, combining deep mathematical theory with real-world applications in biology and pedagogy. The 15 most recent publications reveal a consistent trajectory across three domains: foundational work in complex dynamics and operator theory, applied modeling in virology, and scholarship of teaching and learning in mathematics. The keywords and sub-fields reflect a sophisticated blend of pure and applied mathematics, with increasing engagement in biological modeling and educational research. Scientific Awards: No awards explicitly mentioned in the text. Scott Kaschner has advised or collaborated with numerous students and researchers, particularly evident in his co-authored papers in virology and mathematics education. His involvement in the NSF GK-12 program as a fellow indicates a long-standing commitment to STEM outreach and pedagogical development. He has secured research support through collaborative grants, especially in virology and education. He co-authored an open textbook on linear transformations, contributing to accessible educational resources. He is involved in interdisciplinary research teams, particularly in virology (with Christopher Stobart and others) and mathematics education (with Aubrey Neihaus and others). His work on virus modeling suggests collaboration with biologists, and his educational research involves partnerships across disciplines. These teams reflect a commitment to collaborative, cross-cutting scholarship.

William J. Martinمشاهده پروفایل

استاد

• Algebraic Combinatorics
• Association Schemes
• Quantum Information Theory
• +۴ مورد دیگر

William J. Martin is a Full Professor in the Department of Mathematical Sciences at Worcester Polytechnic Institute (WPI) , with affiliated appointments in Computer Science and Bioinformatics. He earned his BA, MA, and PhD from the State University of New York Potsdam and the University of Waterloo. Research Interests: Algebraic Combinatorics, Association Schemes, Quantum Information Theory, Cryptology, and K-12 Education Outreach His recent publications focus on quantum computing, association schemes, and cryptography. Articles span topics like quantum error correction, homomorphic encryption, and algebraic structures in discrete mathematics. Scientific Awards: Erskine Fellowship (2024) Grants include multiple NSF and National Security Agency awards for research in association schemes, quantum information, and cryptographic systems. He co-founded the Northeast Combinatorics Network and is active in educational outreach, including math clubs and curriculum development.