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

Ning Baoمشاهده پروفایل

استادیار

• High Energy Physics
• Quantum Information Science
• Quantum Algorithms
• +۴ مورد دیگر

Ning Bao is an Assistant Professor in the Departments of Physics and Mathematics at Northeastern University's College of Science. His research bridges high energy theory and quantum information science, focusing on topics such as holographic correspondences, quantum entanglement classification, and quantum algorithm development. He explores the interplay between quantum information principles and fundamental physics concepts like black hole thermodynamics and spacetime geometry. His work often involves cutting-edge techniques from machine learning and applied mathematics to address questions in quantum gravity and condensed matter systems. Key research interests include the information-theoretic properties of black holes, entanglement structure in holographic systems, and the application of quantum information tools to machine learning. He contributes to foundational studies in quantum error correction, entanglement wedge reconstruction, and the ER=EPR conjecture. His articles span topics from AdS/CFT correspondence to quantum cellular automata, reflecting his interdisciplinary approach to theoretical physics. Bao’s research is supported by contributions to holographic entropy inequalities, tensor network models, and the exploration of quantum algorithms through frameworks like classical shadows and reinforcement learning. His work has advanced understanding of entanglement in gauge theories, quantum complexity measures, and the interplay between geometry and quantum information in gravitational systems.

• Combinatorics
• Combinatorial Design
• Latin Squares
• +۵ مورد دیگر

Ian Wanless is a Research Professor at the School of Mathematics, Monash University. He specializes in combinatorics, with a focus on Latin squares, graph theory, and matrix permanents. His work bridges theoretical mathematics and applications in information technology, such as coding and experimental design. Wanless leads collaborative projects funded by the Australian Research Council, including studies on combinatorial structures and hypergraph matchings. He has authored over 120 peer-reviewed articles, with recent work addressing quantum states, Latin square properties, and quasigroup isomorphisms. Key Awards: Australian Mathematical Society 2009 Medal Collaborations: Global partnerships with institutions in the US, Europe, and Asia His research emphasizes universal solutions to combinatorial puzzles, such as Sudoku and the four-color theorem, while prioritizing theoretical rigor over direct applications.

Nabil Shalabyمشاهده پروفایل

استاد

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

Nabil Shalaby is a Professor of Mathematics at Memorial University of Newfoundland, where he holds an office in HH-3016. He earned his PhD from McMaster University and an MA from York University. His research focuses on Combinatorial Designs, Skolem sequences, coding theory applications, and graph labeling problems. He has contributed to seminal works on deletion-correcting codes, covering designs, and cyclic triple systems. He has been recognized with the Motivational Teaching Award (2009). His research spans topics including perfect codes, hypergraph coverings, and combinatorial constructions. His publications frequently intersect graph theory and discrete mathematics, with notable contributions to both theoretical foundations and algorithmic applications. While no current students or grants are listed, his work has been published in top-tier journals such as *Designs, Codes and Cryptography* and *Journal of Combinatorial Designs*. His research maintains a strong emphasis on structural combinatorics and practical applications in information theory.

Ilya Safroمشاهده پروفایل

دانشیار

• Quantum Computing
• Machine Learning
• Artificial Intelligence
• +۷ مورد دیگر

Ilya Safro is an Associate Professor and Associate Chair for Graduate Studies and Research in the Department of Computer and Information Sciences at the University of Delaware. He holds a joint appointment in the Department of Physics and Astronomy. Previously, he served as a Faculty Scholar at Clemson University's School of Health Research and as a postdoctoral researcher at Argonne National Laboratory. Ph.D. in Applied Mathematics and Computer Science (Weizmann Institute, 2008) MSc in Applied Mathematics and Computer Science (Weizmann Institute, 2004) BSc in Mathematics and Computer Science (Ben-Gurion University, 1998) His research focuses on quantum algorithms, machine learning, and combinatorial scientific computing. He develops hybrid quantum-classical algorithms for graph optimization problems and leads projects in biomedical hypothesis generation systems like AGATHA-C. His work spans quantum computing scalability, tensor network simulations, and multiscale approaches for large-scale optimization. Recent publications highlight advancements in QAOA parameter transferability, fermion-qubit mapping optimization, and quantum-inspired network interdiction algorithms. His lab has received multiple student paper awards at IEEE HPEC and QCE conferences. NSF, DARPA, NIH, DOE, BMW funding recipient Co-Chair of IEEE Quantum Computing and Engineering 2025 and 2024 Quantum Algorithms tracks Editorial board member for IEEE Transactions on Quantum Engineering and SIAM Journal on Scientific Computing Current lab members include Ph.D. students Bao Bach, Cameron Ibrahim, Ilya Tyagin, and alumni working at Fujitsu Research USA and Argonne National Laboratory. His Erdős number is 3 via multiple academic lineages.

• Security and Reliability of VR/AR Systems
• Internet of Things and Mobile Sensing
• Blockchain and Distributed Systems
• +۷ مورد دیگر

Dr. Henry Hong-Ning Dai is an Associate Professor in the Department of Computer Science at the Faculty of Science, Hong Kong Baptist University (HKBU). He previously held academic positions at Lingnan University and Macau University of Science and Technology, where he advanced from Assistant to Associate Professor. He holds a Ph.D. from the Chinese University of Hong Kong and a D.Eng. from Shanghai Jiao Tong University. Education: Ph.D. in Computer Science and Engineering, Chinese University of Hong Kong (2008) D.Eng. in Computer Technology Application, Shanghai Jiao Tong University (2012) M.Eng. in Computer Science and Engineering, South China University of Technology (2003) B.Eng. in Computer Science and Engineering, South China University of Technology (2000) Dr. Dai's research focuses on security and reliability of VR/AR systems , Internet of Things , blockchain and distributed systems , federated learning , and cyber-physical systems . His work integrates AI, networking, and software engineering to address real-world security and performance challenges in emerging technologies. He has published over 300 papers in top journals and conferences such as IEEE JSAC, TMC, ICSE, INFOCOM, and AAAI, accumulating more than 24,000 citations. The 15 most recent publications (2023–2025) highlight his leadership in VR/AR security (e.g., AcouListener, Meta VR study), blockchain scalability and fairness (e.g., Porygon, Auncel, Justitia), federated and robust learning (e.g., EBS-CFL, FedDP), and edge-AI and wireless security (e.g., HARBOR, Smart Shield). His recent work also explores AI-generated art evaluation and LLM-driven manufacturing systems , showcasing interdisciplinary innovation. Scientific Awards and Recognition: Holder of 1 U.S. patent and 1 Australia innovation patent Winner of more than 17 awards Senior Member of ACM, IEEE, and EAI Dr. Dai has been Principal or Co-Investigator on over 12 research projects totaling HK$16 million, funded by UGC, NSFC, FDCT, and HKBU. He serves as an Associate Editor for IEEE Communications Surveys & Tutorials , IEEE Transactions on Intelligent Transportation Systems , and several other IEEE journals. He has chaired program committees and served on the PC of top conferences including ICSE, KDD, and INFOCOM. He is actively recruiting Ph.D. students and RAs in security, blockchain, and AI. Laboratories and Research Teams: While not explicitly named, Dr. Dai leads a research group focused on secure and intelligent distributed systems, with active projects in blockchain, VR security, and edge AI. His team has developed open-source tools such as VR-SP Detector , PrettySmart , and RLF for smart contract analysis and security assessment.

Shahriar Shahriariمشاهده پروفایل

استاد

• Combinatorics of Posets
• Extremal Set Theory
• Finite Group Theory
• +۳ مورد دیگر

Shahriar Shahriari is the William Polk Russell Professor of Mathematics at Pomona College, part of The Claremont Colleges. He has been affiliated with Pomona since 1989, holding roles such as Department Chair (2004–2007) and Associate Dean of the College (2000–2003). His research focuses on combinatorics, particularly chain partitions, cut-sets in Boolean lattices, and finite group theory. He is renowned for his teaching excellence, including the 2015 Deborah and Franklin Tepper Haimo Award for Distinguished Teaching. His textbook Approximately Calculus (2006) won a Choice Outstanding Academic Title. He has authored over 30 refereed papers in combinatorics and algebra, edited volumes, and Persian-language expository works. His academic service includes editorial roles at Order and Math Horizons , and he has held visiting positions at institutions including Columbia University and EPFL. Shahriari earned his Ph.D. from the University of Wisconsin-Madison (1986) and B.A. from Oberlin College (1977). Education: Ph.D. in Mathematics (1986) from University of Wisconsin-Madison; B.A. in Mathematics and Economics (1977) from Oberlin College. Recent Courses: Abstract Algebra, Combinatorics, Deterministic Operations Research, and Honors Calculus. Publications: Includes books on combinatorics and algebra, plus peer-reviewed articles in Journal of Combinatorial Theory , Proceedings of the AMS , and others. Awards: Multiple Wig Teaching Awards (1993, 1999, 2008, 2013), MAA's Allendoerfer Award (1998), and Pomona College Alumni Service Award (2017). His research emphasizes combinatorial structures and pedagogical innovation.

Radu Balanمشاهده پروفایل

استاد

• Applied Mathematics
• Harmonic Analysis
• Signal Processing
• +۶ مورد دیگر

Radu Balan is a Professor of Applied Mathematics in the Department of Mathematics at the University of Maryland, College Park. He is affiliated with the Center for Scientific Computation and Mathematical Modeling (CSCAMM) and the Norbert Wiener Center for Harmonic Analysis and Applications. His research bridges harmonic analysis, signal processing, and machine learning, with a strong focus on phase retrieval, frame theory, and deep neural network analysis. He earned his Ph.D. in Applied Mathematics from Princeton University in 1998, advised by Ingrid Daubechies, and holds B.Sc. degrees in Physics and B.E. in Electrical Engineering from Romanian institutions. His academic journey includes a postdoctoral stint at IMA and IBM, followed by research roles at Siemens before joining the University of Maryland faculty in 2006 as an Associate Professor, rising to full Professor in 2011. His research interests include harmonic analysis, statistical signal processing, machine learning, phase retrieval, and mathematical modeling. He has made significant contributions to the theory of frames, phaseless reconstruction, and the stability of deep neural networks. His recent work explores permutation-invariant representations, Lipschitz bounds in CNNs, and graph deep learning. His recent publications (2020–2024) reveal a strong trend toward theoretical machine learning and its mathematical foundations, particularly in the stability and invertibility of neural networks and representations. He frequently publishes in top-tier journals such as IEEE Transactions, SIAM Journal, and Foundations of Computational Mathematics, often on arXiv, indicating an active and current research program in mathematical signal processing and deep learning theory. Radu Balan has authored or co-authored over 60 peer-reviewed papers, edited five volumes of Excursions in Harmonic Analysis , and holds 25 U.S. and international patents in signal processing and source separation. His work has been supported by the National Science Foundation (NSF), Army Research Office (ARO), Simons Foundation, Siemens, and Verisk. He has advised numerous students and collaborators, with research projects spanning statistical signal processing, blind source separation, and deep learning. His lab and research group are associated with CSCAMM and the Norbert Wiener Center, fostering interdisciplinary collaboration in mathematical modeling and computation.

Adva Mondمشاهده پروفایل

پژوهشگر

• Discrete Probability
• Random Graphs
• Extremal Combinatorics
• +۳ مورد دیگر

Adva Mond is a Researcher in the Department of Mathematics at King's College London, affiliated with the Probability Group within the Faculty of Natural, Mathematical & Engineering Sciences. She holds a PhD from the University of Cambridge, supervised by Professor Béla Bollobás, and a postdoctoral position under Dr. Matthew Jenssen. Her research focuses on Discrete Probability, Random Graphs, and Extremal Combinatorics, with a particular emphasis on probabilistic combinatorics and graph theory applications. Education: BSc and MSc in Pure Mathematics, Tel Aviv University Part III Mathematics, University of Cambridge PhD in Combinatorics, University of Cambridge Research Interests: Adva's work explores theoretical and applied aspects of combinatorics, including random graph structures, extremal problems, and probabilistic methods. She investigates properties of Hamiltonian cycles, graph decomposition, and percolation processes. Her recent studies address spanning forests, discrepancy in dense graphs, and game-theoretic approaches to combinatorial problems. Publications: Over 10 peer-reviewed articles and preprints, focusing on probabilistic combinatorics, graph algorithms, and extremal graph theory. Key contributions include work on Hamiltonian cycles in hypergraphs, online Ramsey numbers, and percolation games on random graphs. Labs/Teams: Active member of the Probability Group at King's College London, collaborating with institutions globally on interdisciplinary projects in combinatorics and graph theory.

Gabor N Sarkozyمشاهده پروفایل

استاد

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

Gabor N Sarkozy is a Professor in the Department of Computer Science at Worcester Polytechnic Institute (WPI). He holds a PhD from Rutgers University (1994) and completed a postdoc at the University of Pennsylvania (1994-1996). His research focuses on graph theory, discrete mathematics, and theoretical computer science, particularly the structure of large graphs and Ramsey-type problems. Education: BS, Eötvös University (1990); MS, PhD, Rutgers University (1994); Postdoc, University of Pennsylvania (1994-1996) His scholarly work spans over 100 publications, with notable collaborations with Endre Szemerédi, János Komlós, and András Gyárfás. Key contributions include algorithmic applications of the Blow-up Lemma, monochromatic cycle partitions, and advancements in Ramsey theory for hypergraphs and planar graphs. Professional highlights include the Good Teaching Award (1995) and the Doctor of the Hungarian Academy of Sciences (2009). He founded the Budapest Project Center, WPI's first project center in Eastern Europe, and remains actively engaged in educational data mining projects. Scientific Awards Good Teaching Award, 1995 Doctor of the Hungarian Academy of Sciences, 2009 His research trends over the past two decades show a transition from classical Ramsey theory and graph decomposition (1995-2010) to interdisciplinary applications in time series analysis and educational data mining (2011-2024), while maintaining core contributions to combinatorial graph theory. Advising and grants are not explicitly detailed in the provided texts, though his collaborative nature is evident through extensive co-authorships. He maintains active research groups at WPI and the Rényi Institute, with ongoing projects in Ramsey-type problems and algorithmic applications.

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

دانشیار

• Discrete Mathematics
• Extremal and Probabilistic Combinatorics
• Geometry

Istvan Tomon is an Associate Professor in the Department of Mathematics and Mathematical Statistics at Umeå University in Sweden. His research focuses on discrete mathematics, extremal and probabilistic combinatorics, and geometry. He leads research in combinatorial structures and graph theory, with recent work exploring hereditary families, symmetric chain decompositions, and Zarankiewicz problems. His publications demonstrate broad expertise in combinatorial optimization, hypergraph theory, and geometric combinatorics. Recent articles show consistent focus on extremal problems in set systems, matrix combinatorics, and incidence geometry.

Alice Devillersمشاهده پروفایل

دانشیار

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

Alice Devillers is an Associate Professor (part-time) in the Department of Mathematics and Statistics at the University of Western Australia (UWA), within the School of Physics, Maths and Computing. She holds a doctorate in science from the Université Libre de Bruxelles (2002) and has held postdoctoral positions at Michigan State University and the Fonds National de la Recherche Scientifique (FNRS) in Belgium. Her research focuses on group theory, graph theory, combinatorics, finite geometry, and Tits' buildings. She is a member of the Centre for the Mathematics of Symmetry and Computation. Dr. Devillers' academic journey includes roles as a Research Fellow with the FNRS (1998–2002), a Belgian American Education Foundation fellow (2002–2003), and a Research Associate at UWA (2008–2011) before becoming a Senior Lecturer in 2011 and Associate Professor in 2022. She has been actively involved in mathematics outreach, particularly with the Western Australian Junior Olympiad (WAJO) and national senior competitions. Her research explores symmetry in combinatorial structures, including automorphism groups of designs and graphs, with a focus on imprimitive actions and transitivity properties. She collaborates internationally, contributing to algebraic combinatorics and finite geometries. She has secured grants, including an ARC project on exceptionally symmetric combinatorial designs (2020–2024) and another on permutation groups and graph symmetry (2013–2017). Teaching responsibilities include first-year mathematics units and a third-year geometry course. Her work balances research, education, and community engagement, reflecting her commitment to advancing mathematical understanding and accessibility.

Michel Goemansمشاهده پروفایل

استاد

• Combinatorial Optimization
• Algorithms
• Approximation Algorithms
• +۳ مورد دیگر

Mitchell Goemans is the RSA Professor of Mathematics at the Massachusetts Institute of Technology (MIT), where he also serves as the Head of the Department of Mathematics. He is a member of the Theory of Computation group at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on combinatorial optimization, approximation algorithms, and algorithmic mathematics. He is an ACM Fellow, recognizing his contributions to theoretical computer science and discrete mathematics. Goemans has taught numerous advanced courses at MIT, including Advanced Combinatorial Optimization , Algorithms , and Topics in Theoretical Computer Science . His work bridges foundational mathematics with computational challenges, emphasizing techniques like semidefinite programming and matroid theory. Key research areas include non-bipartite matchings, matroid intersection, submodular function optimization, and approximation algorithms for NP-hard problems. His contributions to the Traveling Salesman Problem and semidefinite programming relaxations are particularly influential. Awards and recognitions include the ACM Fellowship (2009) and leadership roles in academic administration, reflecting his dual impact on research and education.

Marius Tibaمشاهده پروفایل

مدرس

• Geometric Inequalities
• Probability
• Combinatorics
• +۵ مورد دیگر

Dr. Marius Tiba is a Lecturer in Pure Mathematics at King's College London, part of the Analysis group within the Department of Mathematics. His academic journey includes a PhD from the University of Cambridge (2021, supervised by Béla Bollobás), a postdoctoral position at IMPA (Rio de Janeiro), and a Titchmarsh Research Fellowship at the University of Oxford (2022–2024). His research focuses on geometric problems rooted in analysis, probability, and combinatorics, with a special emphasis on stability of geometric inequalities, covering systems, Ramsey theory, and Littlewood polynomials. He holds a BA and Master of Mathematics from Trinity Hall, University of Cambridge. His teaching includes lecturing on Complex Analysis and supervising dissertations on Stability of Geometric Inequalities and Ramsey theory. He currently co-supervises PhD student Albert Rehak at KCL and Zhaoyang Liu at the London School of Geometry and Number Theory. His research outputs include groundbreaking work on geometric inequalities (e.g., Brunn-Minkowski stability), multicolour Ramsey numbers, and the existence of flat Littlewood polynomials. He collaborates extensively with leading mathematicians like Alessio Figalli and Robert Morris. His work bridges pure mathematics fields, often applying probabilistic and combinatorial techniques to geometric problems. Key research themes include quantitative stability estimates for functional inequalities, extremal combinatorics, and additive number theory. His contributions have appeared in top journals like the Annals of Mathematics, Journal of the European Mathematical Society, and Inventiones Mathematicae.

Niraj Khareمشاهده پروفایل

عضو هیئت علمی

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

Niraj Khare is an Associate Teaching Professor in the Department of Mathematics at Carnegie Mellon University Qatar, part of the Mellon College of Science. He holds a Ph.D. from Ohio State University. His research focuses on graph theory, hypergraphs, combinatorics, and permutation statistics, with emphasis on matching theory, extremal graph properties, and combinatorial enumeration. His work includes studies on Erdős–Gallai edge bounds, Gončarov polynomials, and structural analysis of hypergraphs. Khare's academic contributions span theoretical and applied combinatorics, with notable publications on permutation statistics, hypergraph size analysis, and edge partitioning in graphs. His teaching role emphasizes mathematics education at the university level. He can be contacted at nkhare@cmu.edu and is located in Office 2194 at CMU Qatar's Education City campus.

• Theoretical Computer Science
• Statistics
• Probability
• +۵ مورد دیگر

Alex Wein is an Assistant Professor of Mathematics at the University of California, Davis. His research focuses on theoretical computer science, statistics, probability, and data science, with an emphasis on computational complexity of statistical inference, particularly in low-degree polynomial models. He explores challenges in tensor analysis, Bayesian inference, and group actions such as cryo-electron microscopy. His work bridges statistical physics and algorithmic hardness, contributing to foundational understanding of estimation and recovery thresholds. Education: Ph.D. in Mathematics, Massachusetts Institute of Technology (2018) Research Interests: Optimal algorithms for hidden structure detection in noisy data Low-degree polynomial framework for algorithmic hardness predictions Tensors and their computational challenges Connections between Bayesian methods and statistical physics Recent Talks: 'Sharp Phase Transitions in Estimation with Low-Degree Polynomials' at SLMath (2025) 'Unifying Statistical Physics and Low-Degree Polynomials?' at Les Houches School of Physics (2025)