جستجوی استاد راهنمای دانشگاهی

Nathanaël Fijalkow is a Researcher at CNRS in LaBRI (Bordeaux) and a Research Fellow at The Alan Turing Institute in London. His primary research fields include games , machine learning , automata theory , and dynamical systems , with a focus on synthesizing programs from logical specifications and probabilistic models. Research Interests span program synthesis (programming by example), controller synthesis (temporal logic specifications), games on graphs (parity/mean payoff games), probabilistic automata (bounded ambiguity), and invariants for linear dynamical systems. He bridges formal methods with machine learning through projects like DeepSynth . Scientific Contributions include: Undecidability results for probabilistic automata Advances in parity game algorithms (quasi-polynomial lower bounds) Foundations of probabilistic modal logics Efficient synthesis techniques using SMT solvers and distributional learning Supervision involves guiding postdocs and PhD students such as Guillaume Lagarde, Antonio Casares, and Pierre Ohlmann. He has secured grants like the Momentum DeepSynth project (2019-2021) , aiming to merge formal methods with ML for program synthesis.

• Games
• Machine Learning
• Automata Theory
• +۹ مورد دیگر

Reyan Ahmed serves as an Assistant Professor of Practice at The University of Arizona, holding a Ph.D. from the institution with office GS 831. His academic profile bridges theoretical computer science and practical visualization systems. Ph.D., The University of Arizona Dr. Ahmed's research centers on graph-theoretic foundations with emphasis on sparsification techniques, spanner constructions, and geometric optimization. His work advances computational geometry through polygon-based facility assignments and stress-invariant metrics, while pioneering neural network integrations for Steiner tree approximations and vertex-splitting algorithms. Key contributions include multi-level graph sketching frameworks and scalable layout methodologies addressing NP-hard combinatorial problems. Analysis of his 2021-2025 publications reveals three dominant threads: (1) Algorithmic innovations in graph sparsification using machine learning-assisted search, (2) Theoretical advancements in additive spanners with lightness guarantees, and (3) Practical visualization systems for evolving networks. His methodology consistently merges discrete mathematics with gradient-based optimization for real-world network applications. Scientific recognition: No awards documented in source materials Research leadership includes development of Monte Carlo tree search frameworks for graph optimization and semantic zooming architectures for massive network visualization. Current projects focus on scale-invariant stress metrics and multi-priority sparsification, with ongoing exploration of neural network accelerators for classical combinatorial problems. No student advising or grant details were provided. Lab infrastructure supports large-scale graph processing through custom visualization pipelines, though specific team compositions remain undocumented.

• Graph Theory
• Algorithms
• Network Visualization
• +۳ مورد دیگر

Malte Helmert is a Professor at the University of Basel in the Department of Mathematics and Computer Science. He previously worked at the University of Freiburg's Research Group on the Foundations of Artificial Intelligence from 2001 to 2011. His research focuses on intelligent problem-solving , particularly in automated planning , combinatorial search , constraint satisfaction , and NP-hard graph problems . Helmert has made significant contributions to classical planning, including the development of the Fast Downward planning system and its derivatives. Education : Diploma in Computer Science (M.Sc.) from the University of Freiburg (2001) Ph.D. in Computer Science from the University of Freiburg (2006) Research interests encompass the theoretical and practical aspects of automated planning, including heuristic search , optimal planning , abstraction techniques , and domain-independent planning . His work explores merge-and-shrink abstractions , landmark progression , and cost partitioning algorithms for classical planning systems. Recent publications analyze advancements in pseudo-Boolean proof logging , higher-dimensional potential heuristics , and correlation complexity in planning domains. These works often integrate mathematical modeling, algorithm design, and empirical benchmarking. Scientific awards include the AAAI Fellow (2021), EurAI Fellow (2020), multiple Best Paper Awards at ICAPS and SoCS conferences, and the Computers and Thought Award (2011). He also received the VDI-Förderpreis for his Master’s thesis. Software contributions include the Fast Downward planning system, MIPS (now maintained by Stefan Edelkamp), and COVER (a vertex cover solver). Helmert has organized tutorials at ICAPS and AAAI conferences on topics like landmark progression , abstraction heuristics , and LP-based heuristics .

• Automated Planning
• Combinatorial Search
• Artificial Intelligence
• +۷ مورد دیگر

Bettina Speckmann is a full Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU Eindhoven), where she leads the Applied Geometric Algorithms group. She holds additional appointments as EAISI Health Professor and EAISI Foundational Professor, and is affiliated with the Data Science Center Eindhoven. Her research bridges theoretical algorithm design with practical applications in spatial computing. Her research interests lie primarily in computational geometry and geometric algorithms, with strong applications in GIScience, Smart Mobility (including moving object analysis and automated cartography), geo-visualization, visual analytics, and e-Humanities. She focuses on developing efficient algorithms and data structures for spatial data, combining rigorous theoretical methods with practical engineering for real-world impact. Her recent publications (2025) show a strong trend in geometric data processing, particularly in polycube segmentations, dual loop algorithms, density estimation for moving groups, and topological analysis using merge trees and Fréchet distances. These works reflect her interdisciplinary focus on computational geometry, visualization, and data structures. Scientific awards received include: Netherlands Prize for ICT Research (2011) NWO Vici Award (2012) PEriTiA Prize (2020) Bettina Speckmann has advised numerous students and researchers through her group and has secured major grants, including the NWO Vici. She has served in leadership roles such as PC co-chair for Graph Drawing (GD 2011), PC chair for ICALP Track A (2015), and PC co-chair for SoCG (2018). She teaches courses such as Data Structures and Heuristic Algorithms. She leads the Applied Geometric Algorithms group, which actively collaborates with industry partners like HERE Global B.V., Fugro NL Land B.V., and OCLC B.V., and contributes to UN Sustainable Development Goals in areas related to data and mobility.

• Computational Geometry
• Geometric Algorithms
• Spatial Data Analysis
• +۱۲ مورد دیگر

Mark Newson is an Associate Professor at the School of English and American Studies and a lecturer in the Department of English Linguistics at Eötvös Loránd University (ELTE) . He is also affiliated with the Általános Irodalomtudományi Kutatócsoport (General Literary Studies Research Group), where he holds a lecturer position. His research focuses on syntax , particularly case theory , generative grammar , and optimality theory . He has extensively studied syntactic movement phenomena, case assignment in English and Hungarian, and the role of functional categories in grammatical frameworks. Key trends in his publications include analyses of DP movement , modal auxiliaries , non-finite clause structures , and syntactic dependencies . His work often bridges theoretical linguistics with empirical studies of specific languages. Mark Newson maintains active academic collaboration through conferences like the Budapest Linguistics Conference (BLINC) and has contributed to the dissemination of linguistic theory, including translations of foundational works like Chomsky's Universal Grammar into Chinese.

• Linguistics
• Syntax
• Case Theory
• +۵ مورد دیگر

Bettina Speckmann is a Professor at Eindhoven University of Technology in the Netherlands, specializing in computational geometry and algorithms. Her work spans theoretical computer science, visualization, and geographic information systems. She is actively involved in academic conferences such as SoCG, SODA, and GIScience, and serves as a co-author and editor for multiple journals including Computational Geometry and IEEE Transactions on Visualization and Computer Graphics . Key roles: Conference program committee member, journal reviewer. Research interests: Algorithm design, geometric optimization, topological data analysis, and visual abstraction techniques. Her research focuses on advancing computational methods for spatial data analysis, including Fréchet distance algorithms, modular robotics reconfiguration, and visualizing categorical patterns. Recent work includes optimizing symbol placement in maps and analyzing trajectories in mobility data. She collaborates extensively with researchers in computer science and geography, producing impactful contributions to both theoretical and applied domains.

• Computational Geometry
• Algorithms
• Visualization
• +۳ مورد دیگر

Nodari Sitchinava is a Professor in the Department of Information and Computer Sciences at the University of Hawaii at Manoa, where he leads the Algorithms and Parallel Computing Group (AlgoPARC). His research focuses on designing efficient algorithms for modern parallel systems, particularly cache-efficient and I/O-optimized solutions for multicore and GPU architectures. His educational background includes advanced training in computer science with specialization in parallel algorithms. Research interests span: Parallel algorithm design for multicores and GPUs Cache-oblivious and I/O-efficient algorithms Communication-efficient distributed computing models Computational geometry and graph algorithms Lower bounds in computational complexity Publication analysis reveals consistent focus on parallel computing foundations, with recent work emphasizing GPU algorithm efficiency, external memory models, and geometric computations. Theoretical contributions frequently include novel lower bound proofs and practical implementations optimized for modern hardware constraints. Awards and honors include: Best Paper Award at the European Symposium on Algorithms (2019) for contributions to comparison-based algorithm complexity Teaching encompasses graduate and undergraduate courses in algorithms, parallel computing, and data structures. His instructional approach emphasizes fundamental principles of algorithm design and analysis across sequential and parallel computational models.

• Parallel Algorithms
• Cache-efficient Computing
• I/O-efficient Algorithms
• +۴ مورد دیگر

Tim A.E. Ophelders is an Assistant Professor at the School of Mathematics and Computer Science, Eindhoven University of Technology, specializing in the Applied Geometric Algorithms department. His research focuses on computational geometry, algorithms, and topological data analysis, particularly in the context of the Fréchet distance and related geometric measures. Education: Master’s thesis on algorithms for comparing moving complex shapes and higher-dimensional Fréchet distance (2014), supervised by Kevin Buchin and Bettina Speckmann. Ophelders’ research explores advanced topics in computational geometry, including trajectory analysis, subtrajectory clustering, and topological similarity measures. His recent work addresses the Fréchet distance in geodesic settings, ordered merge trees, and deterministic algorithms for geometric data processing. His contributions span both theoretical advancements and practical applications, such as measuring plant phenotypes via the Euler characteristic transform. Selected publications highlight his expertise in algorithm design, complexity analysis, and geometric modeling. Collaborations involve multidisciplinary projects, including datasets for barley seed morphology and shape analysis. His work aligns with the UN Sustainable Development Goals, particularly in computational methods for environmental and biological systems. Scientific Awards: Veni Grant (2021) from Eindhoven University of Technology Ophelders teaches courses in Topological Data Analysis and has contributed to media discussions on algorithmic research. His affiliations include the Applied Geometric Algorithms group at TU/e, with external collaborations in computational biology and data science.

• Computational Geometry
• Algorithms
• Fréchet Distance
• +۷ مورد دیگر

Gopalan Nadathur is a Professor in the Department of Computer Science and Engineering at the University of Minnesota , where he works in the Teyjus Project developing an efficient implementation of λProlog. His research focuses on higher-order logic programming , lambda calculus representations , and explicit substitution mechanisms with applications in formal verification and meta-programming . Key projects: Abella theorem prover, Bedwyr model checker Editorial roles: Theory and Practice of Logic Programming , Journal of Functional and Logic Programming Conference involvement: IEEE Symposium on Logic in Computer Science (2009), International Workshop on Logical Frameworks (2009) He has developed specialized techniques for: Higher-order pattern unification Modular logic programming Intensional lambda term reduction Binding structure representation

• Programming Languages
• Logic Programming
• Higher-Order Logic
• +۵ مورد دیگر

José Orlando Pereira is an Associate Professor at the Department of Informatics, University of Minho, and Research Coordinator at INESC TEC (INESC Technology and Science). His primary research interests lie in dependable distributed systems, with a focus on data management, group communication protocols, and tools for distributed system evaluation. He leads the High-Assurance Software Laboratory (HASLab) , part of INESC TEC and the University of Minho. Roles: Academic supervisor, conference committee member (e.g., SRDS 2025 General Co-Chair), and grant recipient (e.g., ADAPQO funding from CMU Portugal 2024). Key Projects: Includes CYBERACTIONING (cybersecurity education), EUMaster4HPC (European HPC master's program), and AIDA (adaptive assurance platform). Research Themes: Database replication, georeplicated systems, consensus protocols, edge computing, and fault injection tools like LAZYFS. His work emphasizes practical applications, such as improving transactional performance in hybrid workloads (TiQuE) and designing scalable NoSQL middleware (CloudMdsQL). He has authored over 200 publications, including seminal contributions to gossip protocols (HyParView) and consensus algorithms. Awards: Honorable Mention at ACM SIGMOD 2025 for CRDV research. Active in organizing conferences such as SRDS, DSN, and EuroSys. Teaching: Offers advanced courses on distributed systems, database administration, and large-scale data replication at both undergraduate and graduate levels.

• Dependable Distributed Systems
• Data Management
• Database Replication
• +۷ مورد دیگر

Justin M. Curry is a tenured Associate Professor in the Department of Mathematics and Statistics at the University at Albany SUNY. His research focuses on developing theoretical foundations for Topological Data Analysis (TDA) using sheaf theory and category theory. He completed his PhD at the University of Pennsylvania under Robert Ghrist and held a postdoc at Duke University. Recent activities include sabbaticals at the University of Oxford, VU Amsterdam, and the Max Planck Institute for Mathematics in the Sciences (MPI MiS). Education: PhD in Mathematics from University of Pennsylvania (2014) Visiting Associate at the Institute for Advanced Study (2009-2011) Research interests span applied topology with emphasis on algebraic and geometric models for space communications, topological deep learning, and inverse problems in TDA. Notable collaborations include NASA's TIMAEUS project (2020-2025) and contributions to the IEEE Aerospace Conference. His work bridges pure mathematics and engineering applications, particularly in distributed space networks and topological signal processing. Recent publications (2021–2024) explore decorated Reeb spaces, universal ℓ^p-metrics on merge trees, and topological attributed graphs for shape discrimination. He has delivered invited lectures at venues like the International Conference on Machine Learning (ICML) and the Max Planck Institute. Awards: NSF CRII Award (2020), NSF Grant for Enriched Topological Summaries (2019) Advising 5 PhD students and leading the NASA-funded TIMAEUS initiative ($650k), his lab integrates categorical methods with geometric deep learning frameworks. Current work includes algebraic models for space communication protocols and sheaf-theoretic approaches to shape space construction. Labs/Teams: Active member of the ATiA (Applied Topology and Inverse Problems) research group and collaborator with NASA's DTN (Disruption Tolerant Networking) working group.

• Applied Topology
• Sheaf Theory
• Category Theory
• +۵ مورد دیگر

Jop Schouten is a researcher at Tilburg University's Department of Econometrics and Operations Research within the Tilburg School of Economics and Management (TiSEM). His research focuses on game theory, operations research, and their applications in transportation and sustainable logistics. He is part of the Compose 3.0 project analyzing the freight transport industry's zero-emission transition using game-theoretic and social psychological frameworks. Education: PhD in Operations Research (2022), Tilburg University Research Master in Business (2017), Tilburg University Master of Mathematics (2016), Radboud University Bachelor of Mathematics (2014), Radboud University Research interests include cooperative and non-cooperative game theory, sequencing and purchasing situations, cost-sharing mechanisms, and network effects in technology adoption. He has held roles as a postdoctoral researcher (2024–present), lecturer at the University of Amsterdam (2022–2024), and PhD researcher at Tilburg University (2017–2022). His work addresses strategic interactions in linear production, optimal sequencing, and peer-based network effects in sustainable technology selection. He collaborates on projects involving freight transport decarbonization and mathematical modeling of interactive decision-making processes.

• Game Theory
• Operations Research
• Cooperative Game Theory
• +۷ مورد دیگر

Bei Wang is an instructor in the Department of Computer Science at the University of Utah, School of Computing. She teaches CS 6210: Advanced Scientific Computing I, focusing on numerical methods and algorithms for scientific computing. Her research interests span topological data analysis, scientific visualization, and algorithm design for data compression and analysis. She contributes to the Computational Engineering and Science (CES) program, supporting interdisciplinary scientific computing education. Her work emphasizes integrating topology into computational frameworks and advancing visualization techniques for complex scientific data. Education: Not explicitly stated in the provided materials. Research Focus: Numerical algorithms, topological methods, and visualization tools for scientific computing. Her recent articles explore topics such as lossy compression with topological guarantees, harmonic chain analysis, and uncertainty-driven visualization. These contributions highlight her expertise in merging computational efficiency with topological rigor. She actively participates in academic initiatives like the CES program, fostering collaboration in scientific computing education and research. Bei Wang’s academic contributions include developing algorithms for topological data structures and enhancing visualization techniques for fluid dynamics and astronomical data. Her work bridges theoretical foundations and practical applications, advancing the analysis of complex datasets in multiple domains.

• Scientific Computing
• Numerical Methods
• Topological Data Analysis
• +۳ مورد دیگر