Uday Banerjee is a Professor in the Department of Mathematics at Syracuse University, affiliated with the College of Arts & Sciences. His research focuses on numerical solutions of elliptic PDEs, particularly using finite element methods, meshless methods, and generalized finite element techniques to address non-smooth coefficients and interface problems. He holds a Ph.D. in Applied Mathematics from the University of Maryland (1985), an M.Sc. from the Indian Institute of Technology (1978), and a B.Sc. from Patna University (1975). His recent work emphasizes approximation properties, error estimation, and implementation challenges in numerical methods. Key contributions include penalty-free SGFEM for interface problems and stable generalized FEM for crack analysis. Banerjee has served as Chair of the Department of Mathematics (2014–2020) and holds roles in university governance, including serving on promotion and tenure committees. He teaches courses like MAT 331 (Linear Algebra) and MAT 581 (Numerical Methods).
Madhur Tulsiani is a Professor at the University of Chicago's Department of Computer Science and a researcher at the Toyota Technological Institute at Chicago (TTIC). His research focuses on theoretical computer science, particularly complexity theory and algorithm design, with applications in coding theory and information theory. He has been supported by NSF grants 1254044, 1816372, and 2326685. Education: Bachelor’s in Computer Science, IIT Kanpur (2001-2005) Ph.D. in Computer Science, UC Berkeley (2005-2009), advised by Luca Trevisan Postdoctoral fellowships at the Institute for Advanced Study (IAS) and Princeton University Research Interests: Mathematical foundations of computation Complexity theory and algorithm design Coding theory and error-correcting codes Sum-of-Squares hierarchies and approximation algorithms Recent Contributions: Pioneering work on list decodable codes and expander-based constructions Advances in approximation algorithms for high-dimensional expanders Lower bounds for Sum-of-Squares algorithms using high-dimensional expanders Teaching: Information and Coding Theory Mathematical Toolkit (linear algebra/probability) Summer REU programs in theoretical computer science Students: Advised PhD students including Fernando Granha Jeronimo, Goutham Rajendran, and Shashank Srivastava Co-advised students with Sasha Razborov, Janos Simon, and others Labs/Groups: Member of the Theoretical Computer Science Group at TTIC and UChicago, contributing to cross-disciplinary research in algorithms and complexity.
Christian Muise is an Assistant Professor at Queen's University's School of Computing, part of the Faculty of Arts and Science. He holds a PhD (2014) in Artificial Intelligence from the University of Toronto, where he was advised by Sheila McIlraith and J. Christopher Beck. His research focuses on automated planning under uncertainty, combining planning with learning for applications like goal-oriented dialogue systems and multi-agent coordination. He previously held postdoctoral roles at the University of Melbourne's Agentlab and MIT's CSAIL, and was a Research Staff Member at the MIT-IBM Watson AI Lab. Education: PhD in Artificial Intelligence, University of Toronto (2014) MSc in Computer Science, University of Toronto (2009) BSc in Computer Science, Carleton University (2007) Research Interests: His work bridges automated planning and machine learning, emphasizing robustness in uncertain environments. Key areas include non-deterministic planning, model acquisition with large language models (LLMs), and human-aware planning. He explores applications in healthcare (e.g., treatment response prediction), robotics (autonomous navigation), and dialogue systems for safety-critical domains. Current projects include developing explainable planning systems and mitigating bias in AI decision-making. Awards: Scotiabank Scholar (Scotiabank Centre for Customer Analytics) Advising & Labs: Leads the Mu Lab, supervising PhD and Master's students in topics like model acquisition, dialogue systems, and planning bias. Active in open-source tools (e.g., L2P, MACQ library) to democratize planning research. Collaborates on projects like PRP Rebooted and FixMyPlan to advance FOND planning and LLM integration. Labs/Teams: Mu Lab at Queen’s University, focusing on planning under uncertainty, AI safety, and neuro-symbolic systems.
Gustavo Scuseria is the Robert A. Welch Professor of Chemistry, Professor of Physics and Astronomy, and Professor of Materials Science and NanoEngineering at Rice University . He is a leading figure in computational quantum chemistry , with seminal contributions to electronic structure theory , coupled cluster methods , and density functional theory (DFT) functionals like HSE and PBE0. His research spans strong correlation , symmetry-projection techniques , and quantum computing applications . Education: PhD in Physics (1983) from University of Buenos Aires Research: Pioneered linear scaling quantum methods , developed HSE functional for semiconductor band gaps, and advanced symmetry-projected wave function approaches Awards: Feynman Prize in Nanotechnology, Humboldt Research Award, Guggenheim Fellowship, and multiple Fellowships from ACS, APS, and RSC Software Contributions: Key developer of Gaussian suite and TURBOMOLE implementations His recent publications focus on symmetry-projected methods for spin systems, dualities in electron correlation , and quantum computing applications . Collaborations with institutions like Los Alamos National Laboratory and Max-Planck Institute have shaped his interdisciplinary approach. Scuseria's work remains foundational for quantum chemistry software and materials science research.
Chris Cornelis is a full-time Professor in fuzziness and uncertainty modelling at Ghent University's Department of Applied Mathematics, Computer Science and Statistics. His research integrates fuzzy logic and rough set theory to advance machine learning methodologies for complex data analysis. Education: M.Sc. in Computer Science, Ghent University (2000) Ph.D. in Computer Science, Ghent University (2004) Research Focus: Cornelis pioneers fuzzy-rough hybrid systems for uncertainty handling in machine learning. His work spans theoretical foundations (e.g., implication operators, granular approximations) and practical applications including emotion detection, medical diagnosis, and imbalanced data classification. Key innovations include FRNN-OWA classifiers and polar encoding for missing values, demonstrating exceptional versatility in bridging abstract mathematics with real-world AI challenges. Publication Trends: Recent work (2023-2025) reveals intensified exploration of topological data analysis (Mapper-based rough sets), advanced granular computing (disjoint/adjacent fuzzy granules), and ethical AI ("No Imputation Without Representation"). His research shows consistent progression from foundational fuzzy-rough theory toward multi-disciplinary applications while maintaining mathematical rigor, particularly in Choquet integration and quantifier-based frameworks. Scientific Awards: No specific awards were documented in the provided sources. Research Support: Cornelis has secured competitive funding including FWO postdoctoral mandates, a Ramón y Cajal contract at the University of Granada, and an FWO Odysseus Type II project at Ghent University. These grants enabled foundational work in fuzzy-rough set theory and its applications to complex data problems. Research Unit: He leads research within Ghent University's Computational Web Intelligence (CWI) unit, focusing on intelligent data analysis systems that leverage fuzzy-rough methodologies for web-scale information processing.
Pierpaolo Vivo is a Reader in Disordered Systems at King's College London's Department of Mathematics, part of the Faculty of Natural, Mathematical & Engineering Sciences. He holds a PhD from Brunel University (2008) and conducted postdoctoral research at ICTP Trieste and LPTMS Orsay. His research focuses on Random Matrix Theory, Statistical Mechanics applied to socio-economic systems, and complexity science in legal frameworks. Key research interests include eigenvalue statistics, financial stability modeling, and legal system complexity. His work bridges physics, economics, and law, with recent projects exploring phase transitions in debt recycling and network-based legal visualization tools like Graphie. Major achievements include a UKRI Future Leaders Fellowship (2019) and over 50 peer-reviewed publications. He leads projects on legal system modeling and collaborates internationally on interdisciplinary topics.
Kayll Lake is a Professor in the Department of Physics, Engineering Physics & Astronomy at Queen's University in Kingston, Ontario, Canada. He is affiliated with the Faculty of Astronomy, Astrophysics & Relativity under the Arts & Science school. His contact information includes an email at lakek@queensu.ca and a phone number: 613-533-2720. His academic genealogy traces back to doctoral advisors Werner Israel and John Lighton Synge, with a genealogy PDF available. Education: PhD (University of Toronto) Research Interests: General Relativity Relativistic Astrophysics Computer Algebra Black Hole Physics Gravitational Collapse Recent studies include the propagation of discontinuities in solutions to Einstein’s equations (cosmological structure formation) and the dynamics of gravitational collapse leading to naked singularities. His work emphasizes integrating computational tools with theoretical frameworks to advance understanding of astrophysical processes and cosmology. Publications reflect a focus on applying computer algebra to Einstein’s equations and exploring foundational questions in relativistic astrophysics. He has advised three students: Dr. S. M. M. Rahman in 2018, 2019, and 2020. No grant or award information is explicitly provided. Office: STI 308G, Stirling Hall, 64 Bader Lane, Kingston, ON KL7 3N6.
Dr. Martin Reisslein is a Professor in the School of Electrical, Computer, and Energy Engineering at Arizona State University (ASU), where he also serves as Program Chair of Computer Engineering. He earned his Ph.D. in Systems Engineering from the University of Pennsylvania (1998) and holds degrees from the University of Pennsylvania and Fachhochschule Dieburg, Germany. His research focuses on communication networks (e.g., 5G, optical networks, software-defined networking) and engineering education, with over 200 journal articles and 60 conference papers. He has led NSF-funded projects on network architecture optimization and K-12 engineering education. Education : Ph.D. (Systems Engineering, UPenn, 1998), M.S.E. (Electrical Engineering, UPenn, 1996), Dipl.-Ing. (FH) (Electrical Engineering, Fachhochschule Dieburg, 1994) Awards : NSF Career Award (2002), IEEE Fellow (2014), Bessel Research Award (2015), DRESDEN Fellowship (2016) Editorial Roles : Co-Editor-in-Chief of Optical Switching and Networking , Associate Editor for multiple IEEE journals His research spans communication networks (e.g., multimedia networking, optical systems) and engineering education (e.g., K-12 outreach, instructional design). Recent articles address cloud computing, 5G architectures, and cybersecurity in satellite systems. He teaches courses such as Communication Networks and oversees graduate research.
Jeffrey Heinz is a Professor at Stony Brook University , holding a joint appointment in the Department of Linguistics and the Institute for Advanced Computational Science . He has been at Stony Brook since 2017, following a decade at the University of Delaware. His research focuses on computational linguistics, formal language theory, grammatical inference, and phonology, with applications to robotics and artificial intelligence. He earned his Ph.D. in Linguistics from UCLA in 2007. Heinz’s work bridges theoretical linguistics and computational methods, emphasizing the learnability of linguistic patterns through formal models. He has contributed to understanding phonological typology, reduplication, and the mathematical foundations of language learning. His research has been published in Science , Phonology , and Machine Learning , among others. He was honored with the 2017 Early Career Award from the Linguistic Society of America for his contributions to computational learning theory in linguistics. He teaches advanced courses in computational phonology and linguistics, including a course at the LSA Summer Institute. He actively organizes academic sessions and serves on steering committees for conferences like ICGI. His interdisciplinary approach integrates linguistics with computer science, robotics, and mathematical logic. Award highlights include: 2017 Early Career Award (Linguistic Society of America) He advises students in linguistics and computational fields, though specific names are not listed here. His research labs and collaborations involve computational linguistics and robotics projects, such as stress pattern databases and grammatical inference benchmarks.
Anke Wiese is an Associate Professor at the School of Mathematical & Computer Sciences, Heriot-Watt University, within the Actuarial Mathematics & Statistics department. Prior to her academic roles, she worked in risk management in the financial services industry and held positions at the University of Hamburg and the University of Karlsruhe (now KIT). She earned her PhD from the University of Karlsruhe, Germany. Her research focuses on stochastic systems, particularly developing methods for solving stochastic differential equations (SDEs) while preserving qualitative characteristics. Key areas include algebraic structures of SDEs, integration methods for SDEs with jumps, and applications in computational finance. She bridges mathematical disciplines such as stochastic analysis, algebra, and quantum stochastics. Recent publications explore Grassmannian flows in coagulation systems, integrable equations via Pöppe triples, and efficient inversion techniques in the Heston model. Her work emphasizes numerical methods, stochastic processes, and interdisciplinary applications. Dr. Wiese actively supervises PhD students and welcomes inquiries for doctoral applications. Her research has been published in journals like Physica D, SIAM Journal on Financial Mathematics, and the Proceedings of the Royal Society A.
Robert S. Maier is a Professor of Mathematics and Physics at the University of Arizona, holding a joint faculty appointment. He earned his Ph.D. in 1983 from Rutgers University. His research spans stochastic modeling, quantum mechanics, and mathematical physics, with a focus on noise models, semiclassical limits, and applications in statistical physics and dynamical systems. Maier's work bridges theoretical physics and applied mathematics, addressing topics like weak noise activation, WKB theory, and special functions such as hypergeometric functions and spherical harmonics. His recent publications explore machine learning applications in education and astrophysics, alongside foundational studies in operator ordering and recurrence relations. Despite his extensive contributions to stochastic processes and mathematical physics, he has no explicitly listed scientific awards or advisees. His interdisciplinary research often intersects with computational methods and data-driven approaches, reflecting his dual expertise in mathematics and physics.
Bart De Moor is a Full Professor at the Department of Electrical Engineering, KU Leuven, Belgium, and a guest professor at the University of Siena. He leads the STADIUS research group and has supervised 85 PhD students. His roles include chairman of Health House (2016–present), member of the Board of VIB (Biotech Institute), and former Vice-Rector for International Policy (2009–2013). Education: Master Degree in Electrical Engineering (1983), KU Leuven PhD in Engineering (1988), KU Leuven Research Interests: His work spans numerical linear algebra, optimization, algebraic geometry, systems and control theory, data-driven AI, machine learning, and applications in process industry and biomedical big data. He has contributed to subspace identification, tensor decomposition, bioinformatics, and quantum computing. Publications Trends: His publications highlight subspace identification methods, tensor decomposition, bioinformatics, and biomedical data analysis. These reflect interdisciplinary advancements in control theory, quantum physics, and mathematical engineering, with applications in industrial and healthcare domains. Scientific Awards and Honors: Leslie Fox Prize (1989) Laureate of the Belgian Royal Academy of Sciences (1992) Bi-annual Siemens Award (1994) Fellow of IEEE (since 2004) Member of the Royal Academy of Belgium for Science and Arts (since 2000) Fellow of IFAC (since 2022) Commander in the Order of King Leopold I (2020) Fellow of SIAM (since 2017) FWO Excellence Award (2010) Advising and Grants: He has led a research group of 20 PhD students and postdocs, co-founded 8 spinoff companies, and secured the ERC Advanced Grant ‘Back to the roots’ (2020–2025). He also co-holds the KU Leuven Chair on healthcare systems (2018–present). Labs and Organizations: Active in the STADIUS research group (KU Leuven), he has served on boards of the Flemish Interuniversity Institute for Biotechnology (VIB), the Alamire Foundation, and the Health Tech Experience Center Health House. His spinoffs include Trendminer, Cartagenia, and Ugentec.
Prof. Peter Matthew Magyar is an Associate Professor in the Department of Mathematics at Michigan State University (MSU). He holds a B.A. in Mathematics from Princeton University (summa cum laude, 1986) and a Ph.D. in Mathematics from Harvard University (1993, advised by Joseph N. Bernstein). Before joining MSU in 2000, he held postdoctoral and visiting positions at the University of Utrecht (Netherlands), Université de Paris VII, Northeastern University, and Brandeis University. His research focuses on representation theory, algebraic combinatorics, and algebraic geometry, with emphasis on Lie groups, loop groups, Schubert varieties, and combinatorial structures like Young tableaux and Littelmann paths. Education: Princeton University, B.A. Mathematics, 1986 Harvard University, Ph.D. Mathematics, 1993 Research Interests: Representation theory of semi-simple complex Lie groups Algebraic combinatorics (Young tableaux, Littelmann paths) Schubert calculus and affine Schubert polynomials Geometry of flag varieties and affine Grassmannians Honors: NSF Graduate Fellowship (1986-89) NSF Postdoctoral Fellowship (1995-98) NSF Grants DMS-0405948 (2004-07) and DMS-0703524 (2007-10) Teaching: Courses include graduate combinatorics, abstract algebra, discrete mathematics, and honors calculus. Developed a daily-quiz system for upper-level courses. Collaborations: Works with researchers such as V. Lakshmibai, P. Littelmann, A. Zelevinsky, and others on geometric and combinatorial representation theory. Outreach: Participates in the Kinawa-Chippewa Math Circle, offering modular arithmetic and cryptography workshops for students.
Sergiy Vorobyov is a Professor at the Department of Signal Processing and Acoustics , Aalto University , Finland. He has held academic and research positions at multiple institutions, including the University of Alberta (Canada), Kharkiv National University of Radio Electronics (Ukraine), RIKEN (Japan), McMaster University (Canada), Duisburg-Essen University and Darmstadt University of Technology (Germany), and Heriot-Watt University (UK). His expertise spans optimization, signal processing, and multi-antenna systems. Dr. Vorobyov holds a Doctoral degree in Natural Sciences from the National Technical University Kharkiv Polytechnical Institute, awarded on January 15, 2002. His research interests focus on optimization and multi-linear algebra applied to signal processing challenges, including statistical and array signal processing, sparse signal processing, estimation and detection theory, and sampling theory. He explores multi-antenna, large-scale, cooperative, and cognitive systems, contributing to advancements in wireless communications and radar engineering. His work aligns with UN Sustainable Development Goals, emphasizing education and innovation. In recent years (2025), his publications emphasize cutting-edge advancements in wireless communications and signal processing. Topics include millimeter-wave MIMO channel estimation, optimization algorithms with momentum-based techniques, vehicular network communications, and robust covariance matrix estimation in challenging noise environments. These contributions highlight his expertise in developing efficient and adaptive methods for modern communication systems. He has received prestigious awards, including: 2004 IEEE Signal Processing Society Best Paper Award 2007 Alberta Ingenuity New Faculty Award 2011 Carl Zeiss Award for teaching and innovative methods 2012 NSERC Discovery Accelerator Award 1st Price Best Paper Award (2015) 1st Price Best Student Paper Award at CAMSAP 2015 As a researcher, Vorobyov has supervised seven theses and led multiple funded projects, such as: AI Based RAN (2023–2025): Scalable AI solutions for 5G/6G networks. MASSIVE AND SPARSE ANTENNA ARRAY PROCESSING FOR MILLIMETERWAVE COMMUNICATIONS (2019–2021): Advanced antenna design and processing techniques. M-CUBE SPA (2017–2021): EU-funded sparse antenna array research. Transmit beamspace for active compressive sensing and communication with multiple waveforms (2016–2020): Radar and MIMO system optimization. He leads the Sergiy Vorobyov Group , focusing on real-time signal processing algorithms and their applications in next-generation wireless systems. His research addresses practical challenges such as efficient channel estimation, robust detection in massive access scenarios, and improving network performance in urban environments.
Sam Lindley is a Reader in Programming Language Design and Implementation at the School of Informatics, University of Edinburgh. He holds a UKRI Future Leaders Fellowship in Effect Handler Oriented Programming. His research focuses on foundational aspects of programming languages, including effect systems, session types, type theory, and functional programming. Key research interests span algebraic effects, concurrency models, type systems for resource management, and language implementation techniques. Lindley's work bridges theory and practice, addressing challenges in systems programming, web technologies (e.g., WebAssembly), and compiler design. Recent publications (2023–2025) emphasize effect handlers for low-level languages (e.g., C, WebAssembly), modal type systems for memory management, and formal semantics for concurrent systems. His work often explores how advanced type systems can improve expressivity and efficiency in programming models. Scientific Awards: UKRI Future Leaders Fellowship Labs/Teams: Laboratory for Foundations of Computer Science (LFCS) Grants: Active funding via UKRI Fellowship
