Dr. Thomas Wong is an Associate Professor of Physics at Creighton University, specializing in quantum algorithms and quantum walks. He has made significant contributions to quantum search theory and education, authoring a widely-used textbook Introduction to Classical and Quantum Computing and creating the educational board game Qubit Touchdown . His research focuses on quantum walks, graph-based quantum algorithms, and quantum education frameworks. Education: PhD in Theoretical Physics (UC San Diego), triple BS in Physics, Computer Science, and Mathematics (Santa Clara University) Academic Service: Former White House OSTP Quantum Liaison, DOE Program Manager, and postdoctoral researcher at University of Texas at Austin and University of Latvia Wong's work bridges theoretical quantum computing with practical educational applications, demonstrating how quantum principles can be taught effectively at all academic levels. His research includes both fundamental quantum algorithm analysis (e.g., Laplacian/Adjacency matrix comparisons) and applied quantum education initiatives. Recent publications show his leadership in quantum walk search optimization and quantum pedagogy. Notably, his 2025 work on student confidence through gamified learning demonstrates commitment to accessible quantum education. Scientific awards include UC San Diego's Best Thesis in Physical Sciences.
Oren Weimann is a Professor in the Department of Computer Science at the University of Haifa, Faculty of Natural Sciences. His research lies at the intersection of theoretical computer science, algorithm design, and data structures, with a strong focus on planar graphs, combinatorial pattern matching, and fine-grained complexity. He has published extensively in top-tier venues such as STOC, SODA, ICALP, PODC, and ESA. Education: Ph.D., Massachusetts Institute of Technology (MIT), 2005–2009. Advisor: Erik Demaine. Dissertation: "Accelerating Dynamic Programming" Postdoc, Weizmann Institute of Science, 2009–2011. Host: David Peleg M.Sc., University of Haifa, 2004–2005. Advisor: Gad Landau. Dissertation: "Using PQ trees for Comparative Genomics" B.A., Technion – Israel Institute of Technology, 1999–2002 Oren Weimann's research centers on the design and analysis of efficient algorithms, particularly for planar and structured graphs. His work explores fundamental problems such as shortest paths, distance oracles, fault tolerance, edit distance, and pattern matching. He investigates both upper and lower bounds, often pushing the limits of what is computationally feasible under fine-grained complexity assumptions. His contributions include optimal labeling schemes, compressed data structures, and breakthroughs in dynamic and distributed graph algorithms. His recent publications reveal a consistent trend in developing highly efficient algorithms for planar graphs, with a focus on distance computation, fault tolerance, and compression. Keywords across these works include planar graphs, dynamic programming, string matching, and conditional lower bounds, reflecting a deep integration of algorithmic techniques and complexity theory. He frequently collaborates with leading researchers such as Shay Mozes, Paweł Gawrychowski, and Philip Bille. Scientific Awards: Best Paper Award, CPM 2007 Best Paper Award, ICALP 2020 (mentioned in context of work) Oren Weimann has advised numerous PhD and Master’s students, including Yaseen Abd-Elhaleem, Nathan Wallheimer, Aviv Bar-natan, and Shon Feller, whose dissertations have led to publications in major conferences. He has also mentored several postdoctoral researchers such as Shay Golan, Itai Boneh, and Panagiotis Charalampopoulos. His work has been supported by competitive research grants, though specific grant titles are not listed in the text. He has served on the program committees of key conferences including SODA, ICALP, CPM, ESA, and SPIRE, demonstrating active leadership in the theoretical computer science community. He is associated with a vibrant research group focused on algorithms and data structures, likely involving collaboration with students and postdocs on projects related to graph algorithms, string processing, and complexity. While no formal lab name is mentioned, his collaborative output suggests a strong, productive research team at the University of Haifa.
Avelio Sepúlveda is an Assistant Professor in the Department of Mathematics at Universidad de Chile, where he has been affiliated since 2021. He previously held a Chair CMM–CNRS fellowship (2020–2021) and completed postdoctoral work at Université Lyon 1 (2017–2020). His education includes a PhD from ETH Zürich (supervised by Wendelin Werner), a Master's from Université d'Orsay, and an Engineering degree from Universidad de Chile. His research centers on probability theory and statistical physics , with emphases on Gaussian free fields, random planar maps, percolation theory, and topological phase transitions. Key investigations include the structure of 2D Gaussian free fields, scaling limits of decorated planar maps, and dynamic conditioning of Markov processes ( myopic conditioning ). His publications (2020–2025) predominantly explore probabilistic geometry, phase transitions, and field theory, with recurring themes in conformal invariance, scaling limits, and lattice models. Notable methodological contributions include novel algorithms for myopic processes and combinatorial characterizations of Markov properties in planar maps. Awards & Service: Chair CMM–CNRS of Excellence for Young Researchers (2020–2021) Associate Editor: Electronic Journal of Probability and Electronic Communications in Probability Advising & Collaborations: He mentors six PhD/Master's students (Pablo Araya, Paul Cahen, Damian Cid, Felipe Espinosa, Pablo Zúñiga, Tomás Laengle) and collaborates extensively with researchers globally, including Christophe Garban (ERC Vortex). He co-organizes the Seminario de Probabilidades de Chile and workshops (e.g., 2025 Topological Phase Transition workshop).
Professor Xiaohui Liu is a distinguished Professor of Computing at Brunel University London, serving within the Computer Science department of the College of Engineering, Design and Physical Sciences. He maintains his office in the Wilfred Brown Building (Room 218) and has established himself as a leading figure in intelligent data analysis and artificial intelligence research. With over 20 years of academic leadership, Professor Liu has held significant visiting appointments including Honorary Pascal Professor at Leiden University (2004), Visiting Scientist at Harvard Medical School (2005), and Visiting Professor at the Chinese Academy of Sciences (2010). Professor Liu's research spans intelligent data analysis, deep learning, dynamical systems, human factors, innovative AI applications, optimisation, statistical pattern recognition, and trustworthy decision making. His work bridges theoretical advances with practical implementations across various industries, demonstrating exceptional translational impact. He has pioneered approaches that integrate artificial intelligence with data science to enable effective data interpretation and trustworthy decision-making systems, with applications spanning healthcare, manufacturing, and business domains. Analysis of Professor Liu's recent publications reveals a strong focus on transformer architectures, transfer learning, and optimization techniques applied to real-world problems. His work demonstrates consistent innovation in neural network architectures, particularly for anomaly detection, fault diagnosis, and recommendation systems. The publications show interdisciplinary applications spanning manufacturing, healthcare, digital marketing, and network science, reflecting his commitment to solving practical challenges through advanced computational methods. Clarivate Highly Cited Researcher for 11 consecutive years (2014-2024) World's top 2% of scientists by Stanford University (2020-2024) ScholarGPS Highly Ranked Scholar – Lifetime: Neural Network (2022-2024) Daniel Berg Award (2023) Research.com United Kingdom Leader Award in Computer Science (2023-2025) IDA Founders Award (2025) Professor Liu has secured substantial research funding from diverse sources including the European Commission, Innovate UK, Royal Society, and EPSRC. His current projects include AI-assisted tax assessment, intelligent data-driven pipelines for manufacturing certified metal parts, and maintenance models for zero-unexpected-breakdowns. He leads collaborative efforts through knowledge transfer partnerships with industry partners like Veritas Advisory Limited and has directed multiple European Commission-funded initiatives focused on IoT platforms, water resource management, and predictive maintenance systems. His research group actively mentors PhD students and collaborates with international partners across multiple continents. Professor Liu leads research activities within the IEHS and CSSB research groups at Brunel University, fostering interdisciplinary collaboration between computer scientists, engineers, and domain experts. His teams integrate expertise in neural networks, optimization algorithms, and statistical pattern recognition to develop innovative solutions for complex real-world problems. The research environment emphasizes both theoretical rigor and practical application, with strong industry partnerships ensuring that research outputs deliver tangible societal and economic impact.
Yoann Dieudonné is a Lecturer in Algorithmic and Complexity at the University of Picardie Jules Verne (UPJV), France, affiliated with research unit UR 4290 (LAMFA). His academic profile centers on theoretical computer science with emphasis on distributed algorithms for mobile agents in networked environments. His research interests include: Graph Algorithms Distributed Computing Computational Complexity Network Exploration Rendezvous Problems Treasure Hunt in Graphs Fault-Tolerant Algorithms Mobile Agent Systems Analysis of his 12 publications from 2020-2025 reveals sustained contributions to deterministic solutions for fundamental coordination problems. Key trends include treasure hunt optimization in unweighted/arbitrary graphs, rendezvous protocols resilient to delay faults, Byzantine-tolerant gathering, and geometric navigation in the plane. His work consistently addresses near-optimal algorithmic bounds while exploring constraints like distance limitations, angular hints, and anonymous environments, advancing foundational understanding of mobile agent systems. Holding an HDR (Habilitation à Diriger des Recherches) awarded in 2023 by UPJV for his thesis 'Meeting in Harsh Conditions', Dieudonné is qualified to supervise doctoral research. He operates within UPJV's ALCO (Algorithmic and Complexity) research domain, collaborating extensively with Stéphane Devismes, Arnaud Labourel, Sébastien Bouchard, and Andrzej Pelc. His research appears in premier venues including ICALP, PODC, SPAA, ACM Transactions on Algorithms, and Distributed Computing.
Samiyuru Menik Hitihami Mudiyanselage serves as a Lecturer at the School of Computing, University of Georgia, where he has been appointed since August 2023. He is affiliated with the Franklin College of Arts & Sciences - Division of Physical & Mathematical Sciences and contributes to the academic mission through teaching and research in computer science. Dr. Menik earned his Doctor of Philosophy in Computer Science from the University of Georgia in 2023, following a Bachelor of Engineering in Computer Science from the University of Westminster in the United Kingdom in 2015. His educational background reflects a strong foundation in both theoretical and applied computer science. His research interests center on advanced machine learning architectures, particularly focusing on modular deep learning approaches for big data applications. He investigates how knowledge graphs can enhance machine learning service descriptions and improve semantic computing frameworks. His work bridges theoretical computer science with practical implementations for large-scale data processing challenges. His two recent publications demonstrate a clear trajectory in developing scalable machine learning systems, with particular attention to architectural innovations that address big data processing limitations and semantic integration challenges. These works reflect his expertise in both cutting-edge AI methodologies and their practical applications. While no specific awards are documented in the available information, his publications in IEEE conferences indicate recognition within the computer science research community. As a Lecturer, Dr. Menik is responsible for teaching computer science courses and contributing to the academic development of students. His research appears to be conducted through university resources, though specific grant funding details are not provided in the available materials.
Pablo Giménez Font es Profesor en el Departamento de Análisis Geográfico Regional y Geografía Física de la Universidad de Alicante, y Secretario del Instituto Interuniversitario de Geografía. Su labor académica incluye la docencia en grados y postgrados de Geografía, Historia y Biología, con especialización en Geografía Histórica y Biogeografía. Doctorado en Geografía (2006), Universidad de Alicante Coordinador del Máster Oficial en Planificación y Gestión de Riesgos Naturales Su investigación se centra en: Reconstrucción de usos del suelo en sociedades históricas Análisis de hábitats de especies vegetales y animales Estudio de riesgos naturales en sistemas fluviales Transformación de paisajes mediterráneos Las publicaciones recientes reflejan tendencias en: Biogeografía de especies amenazadas (Helianthemum caput-felis, Genista longipes) Análisis de riesgos hidrológicos en ramblas Reconstrucción histórica de inundaciones Cartografía de infraestructuras hidráulicas Aplicación de TIG a paisajes históricos Monitoreo de especies endémicas Ha participado en proyectos de investigación con administraciones públicas y empresas privadas, enfocados en: Conservación de flora endémica Inventario de patrimonio natural Previsión de riesgos geomorfológicos Su labor profesional incluye asesoría técnica en: Declaraciones de impacto ambiental Geomorfología del Castillo de Monóvar Valores culturales del Museo Municipal de Villajoyosa
Andrew J. Dean is a Professor of Mathematical Sciences at Lakehead University, where he has served as Chair of the Department of Mathematical Sciences during 2006-2008 and 2017-2019. He also held an Adjunct Professor position at the University of New Brunswick from 2007 to 2016. His academic qualifications include: Ph.D. in Mathematics from the University of Toronto (1999) M.Sc. in Mathematics from the University of Toronto (1995) H.B.Sc. in Mathematics from Lakehead University (1994) Dr. Dean's research focuses on Operator Algebras, particularly C*-dynamical systems and the classification of inductive limits of C*-algebras. He has developed invariants for classifying categories of C*-dynamical systems and has made significant contributions to the study of real structures on C*-algebras. Over the past two decades, Dean's publications have centered on the classification of C*-algebras under group actions, including actions of R, Z_2, and finite groups. His work spans the classification of AF flows, real circle algebras, and actions on approximate interval algebras, contributing to the broader field of noncommutative geometry and operator algebras. Dr. Dean has not been listed with any specific scientific awards in the provided information. Dr. Dean's advising record includes: PhD Students: Aydin Sarraf (2014) Christopher Chlebovec (2016) MSc Student: Bit Na Choi (2020) Postdoctoral Fellows: Toan Ho (2008-2009) Alin Ciuperca (2009-2011) Luis Santiago (2016-2017) Grant information is not provided in the available text.
Dr. Sebastian Ahnert is an Associate Professor at the Department of Chemical Engineering and Biotechnology, University of Cambridge, and a Senior Research Fellow at The Alan Turing Institute. He leads the Structural Complexity research group and is a Fellow of King's College, Cambridge. Current Positions: Associate Professor (Cambridge), Senior Research Fellow (Alan Turing Institute), Fellow (King's College) Research Interests: Algorithmic information theory, network analysis, genotype-phenotype maps, interdisciplinary applications in biology, humanities, and food science His work spans the quantification of biological complexity using algorithmic descriptions, including protein quaternary structure classification , RNA sequence-structure maps , and symmetry in evolutionary systems . Network analysis applications extend to historical correspondence (Tudor Networks of Power), food science (flavor compound networks), and connectomes . Recent publications emphasize non-deterministic genotype-phenotype maps , neutral set thermodynamics , and automated phenotyping technologies. Award highlights: 2024 Richard Deswarte Prize in Digital History Shortlisted for 2024 SHARP Book History Prize Current students include PhD candidates in computational biology and plant science, with former advisees contributing to RNA evolution and network analysis studies. Collaborations span quantum physics, plant developmental biology, neuroscience, and digital humanities.
Sorelle Friedler is the Shibulal Family Professor of Computer Science at Haverford College and a Nonresident Senior Fellow at The Brookings Institution. Her work centers on algorithmic fairness, transparency, and policy, including co-authoring the White House AI Bill of Rights. Ph.D. in Computer Science from the University of Maryland, College Park B.A. from Swarthmore College Research interests include fairness in machine learning , accountability frameworks , and responsible AI , with applications to social networks, materials science, and civic systems. Her recent publications focus on network equity , generative AI bias , and policy-compliant algorithms . Key scientific awards include the Data and Society Research Institute Fellowship. She has secured grants from NSF, DARPA, and Mozilla for projects on algorithmic fairness and responsible computing.
Holly Carley is a Professor of Mathematics at the City University of New York (CUNY) within the School of Arts & Sciences Department of Mathematics. She holds a Ph.D. from the University of Virginia (2004), an M.S. (1999) and B.S. (1997) with honors from the University of Central Florida, advised by R.N. Mohapatra and X. Li. Her research spans mathematical physics, analysis, approximation theory, and copulas in probability and statistics. B.S. with honors: University of Central Florida M.S.: University of Central Florida Ph.D.: University of Virginia Carley's research interests include mathematical physics, where she explores quantum systems and nonlinear effects, and approximation theory, focusing on inequalities and polynomial properties. She also investigates copulas for modeling multivariate dependencies in probability and statistics, with applications to extremal measures and graph-based constructions. Her publications emphasize mathematical physics (e.g., Born-Infeld effects, harmonic oscillator limits), copulas (e.g., subcopula extensions, extremal measures), and pedagogical methods (e.g., matrix reduction techniques, continued fractions). Key trends involve interdisciplinary applications of analysis and geometry to physics and statistics. Grants: Senior Personnel – Minority Science and Engineering Improvement Program (MSEIP), 2015-2018 PSC-CUNY Grants (2008-2013) on polarons, extremal doubly stochastic measures Books (OER): Co-author of PreCalculus (second edition) with Thomas Tradler Co-author of Arithmetic|Algebra with Bonanome et al.
Carlos Gómez Rodríguez is a Full Professor (Catedrático de Universidad) in the Department of Computer Science at the University of A Coruña, Spain, where he leads the FASTPARSE Lab within the LyS Research Group at the CITIC Research Center. His work bridges theoretical and practical aspects of computational linguistics with significant applications in natural language processing. His primary research interests focus on natural language parsing algorithms, with particular emphasis on improving parsing speed for web-scale applications, handling non-projective dependency structures, analyzing morphologically-rich and low-resource languages, and exploring the cognitive aspects of syntax. He maintains a critical perspective on the field's current LLM-driven revolution, advocating for continued research into alternative approaches that prioritize efficiency, explainability, and scientific insight beyond user-facing applications. His recent publications reveal a strong trend toward examining the capabilities and limitations of large language models, particularly in comparison to human language processing, while continuing to advance traditional parsing techniques. His work spans theoretical foundations, practical implementations, and diverse applications including sentiment analysis, opinion mining, and creative writing evaluation. National Young Researcher Price "María Andresa Casamayor" in Mathematics and Information Technologies by Spain's Ministry of Science Honorary Member of the Royal Spanish Mathematical Society CAEPIA 2024 Best Paper Award for research on evaluating creative writing in LLMs Professor Gómez Rodríguez has successfully led significant research projects including the ERC Starting Grant project FASTPARSE, which focused on techniques to improve the speed of parsing algorithms. His work demonstrates consistent funding support for innovative research at the intersection of computational linguistics, cognitive science, and practical NLP applications. He actively collaborates with researchers across Spain and internationally, as evidenced by his extensive publication record with diverse co-authors. He leads the FASTPARSE Lab and is a core member of the LyS Research Group, focusing on advancing both theoretical understanding and practical implementations of language processing technologies. His team explores diverse aspects of natural language processing, from fundamental syntactic analysis to applied sentiment analysis and innovative applications of language technology in domains like healthcare.
Filip Ilievski serves as an Assistant Professor of Commonsense AI (Sr.) at Vrije Universiteit Amsterdam, where he leads the Learning and Reasoning Group. He holds additional affiliations as an Affiliated Scientist at USC Information Sciences Institute and Amsterdam Sustainability Institute, and serves as Scientific Coordinator of the Digital Sustainability Institute (DiSC). His academic journey includes a PhD from Vrije Universiteit Amsterdam (2015-2019), research positions at USC (2019-2023), and a research visit to Carnegie Mellon University (2017). Dr. Ilievski's research focuses on advancing human-centric AI with common sense for social good applications. His work spans three interconnected areas: commonsense reasoning (including situational awareness, numeracy, and modeling of other agents), analogy and abstraction (studying cognitive generalization mechanisms through narratives and lateral thinking puzzles), and AI for social good (interpreting complex online media like internet memes and developing knowledge-based solutions for sustainable policies). He employs neuro-symbolic methods including prototype-based networks, combining LLMs with deterministic engines, and reasoning with scene knowledge graphs to create robust, interpretable AI systems. His publication record shows a strong trend toward multimodal reasoning and practical applications of commonsense AI, particularly in understanding internet memes, developing sustainable AI solutions, and creating robust evaluation frameworks like the MARVEL benchmark. Recent work increasingly integrates cognitive theories with neural architectures to address limitations in current foundation models, with particular emphasis on explainability and cultural context awareness. Best Student Paper Award at K-CAP for 'Knowledge-enhanced Agents for Interactive Text Games' Best Paper and Best Presentation Award at Workshop on Multimodal Content Analysis for Social Good (MM4SG) Book 'Human-Centric AI with Common Sense' published in Springer Nature Synthesis series Dr. Ilievski actively supervises a growing team of PhD students and postdocs, with current projects focusing on visual commonsense reasoning, meme semantics, analogical abstraction, multimodal alignment, and architectures for human-centric AI. His Digital Sustainability Institute (DiSC) coordinates research on knowledge-driven AI for sustainable policies, while his Situated AI minor program develops next-generation AI education. He maintains active collaborations with institutions including USC, CMU, RPI, University of Lyon, UvA, University of Bielefeld, and industry partners like Bosch Research, NEC Labs, Merit Technologies, and Tencent.
Prof. Dr. Mario Fritz is a Professor at Saarland University and faculty member at CISPA Helmholtz Center for Information Security. He serves as a Fellow at the European Laboratory for Learning and Intelligent Systems (ELLIS). His research focuses on Trustworthy Information Processing at the intersection of AI & Machine Learning with Security & Privacy. Mario Fritz leads numerous significant research initiatives including the European Large Open Multi-Modal Foundation Models for Robust Generalization (ELLIOT), European Lighthouse on Secure and Safe AI (ELSA), and multiple projects on privacy-preserving AI applications in healthcare. His work spans security and privacy aspects of large language models, foundation models, and medical AI applications. He has established himself as a leading researcher in trustworthy AI through his extensive publication record and leadership in major collaborative projects. His recent research (2025 publications) demonstrates a strong focus on the security and safety challenges of large language models, including model stealing attacks, causal reasoning capabilities, sampling methods, and privacy risks. His work bridges theoretical foundations with practical applications across multiple domains, particularly in healthcare and cybersecurity. Mario Fritz actively mentors PhD students and Post-Docs, seeking new researchers to join his group. He has been involved in numerous grants and collaborative projects, including those funded by BMBF and the Helmholtz Association, demonstrating his ability to secure substantial research funding and lead large interdisciplinary teams.
Eugenio Manuel Fedriani Martel is a full professor at the University of Pablo de Olavide, Spain, affiliated with the Department of Economics, Quantitative Methods and Economic History. His research bridges mathematics and economics, focusing on Lie algebras , graph theory , and quantitative methods in business . Key Contributions : Classification of complex filiform Lie algebras, infinite graph embeddings in tubular surfaces, and applications of Euclidean geometry to socioeconomic problems. Interdisciplinary Work : Combines mathematical rigor with entrepreneurial policy analysis, poverty measurement, and educational technology. Research Trends derived from 16 publications (2001–2025) include: Mathematical : Combinatorics, nonassociative algebras, computer science applications. Applied : Entrepreneurial survival strategies, ECTS teaching reforms, multidimensional poverty indicators. Students & Collaboration : Co-authored extensively with Luis Boza Prieto and Juan Núñez-Valdés, contributing to collective works like "A historical review of the classifications of Lie algebras" (2013).
