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

Lorenzo Ntogramatzidisمشاهده پروفایل

دانشیار

• Dynamical systems
• Control theory
• Geometric control theory
• +۵ مورد دیگر

Lorenzo Ntogramatzidis is an Associate Professor in the School of Electrical Engineering, Computing and Mathematical Sciences at Curtin University, where he has been a full-time staff member since 2009. His academic journey began with a Laurea degree in Computer Engineering from the University of Bologna, followed by a Ph.D. in Control and Operations Research from the same institution. He has held positions as an ARC Australian Postdoctoral Fellow and Senior Lecturer at Curtin University before becoming an Associate Professor in 2016. His educational background includes: Laurea degree in Computer Engineering, University of Bologna (2001), with honors (magna cum laude) Italian Professional Engineering Degree (2002) Ph.D. in Control and Operations Research, University of Bologna (2005) Ntogramatzidis's research focuses on dynamical systems and control theory, with particular emphasis on geometric control theory, optimal control problems with constraints, multidimensional systems, and signal processing. His work has significant applications in various engineering domains including power electronics and electric vehicle charging systems. He has developed novel approaches to controller design, disturbance decoupling, and eigenstructure assignment in linear systems. His recent publications demonstrate a strong focus on geometric control methods, disturbance decoupling techniques, and applications to power electronics. His research shows a consistent pattern of applying theoretical control concepts to practical engineering problems, particularly in the areas of electric vehicle charging and power converter control. Among his notable achievements are: Magna cum laude honors in his Laurea degree Ph.D. scholarship from the Italian Ministry for University and Scientific Research (2002-2004) Australian Post-Doctoral Fellowship (2009-2012) Curtin Research Fellowship (2012-2016) WA Young Tall Poppy Award 2011 Australian Research Council Future Fellowship (2012-2016) Ntogramatzidis has been actively involved in research supervision and teaching, with notable contributions to the field through his editorship roles for Systems & Control Letters and Multidimensional Systems and Signal Processing. His research has been supported by multiple ARC Discovery Projects and other national research grants.

Mohamed Faouzi Atigمشاهده پروفایل

استاد

• Formal Verification
• Concurrency
• Model Checking
• +۷ مورد دیگر

Mohamed Faouzi Atig is a Professor in Computer Systems at the Department of Information Technology , Uppsala University since July 2021. Previously, he served as Senior Lecturer (Associate Professor) from June 2018 to June 2021 and as Associate Senior Lecturer (Assistant Professor) from June 2014 to May 2018. Current: Professor, Uppsala University (2021–present) Senior Lecturer, Uppsala University (2018–2021) Associate Senior Lecturer, Uppsala University (2014–2018) Researcher, Uppsala University (2012–2018) Post-doctoral Researcher, Uppsala University (2010–2012) Education : PhD in Computer Science from University of Paris Diderot-Paris 7 (2010) Docent (Habilitation) in Computer Systems from Uppsala University (2017) Research Interests : A multidisciplinary researcher in Formal Verification , focusing on Model Checking and Automata Theory for Concurrency and Weak Memory Models . His work spans Formal Methods , Software Verification , and Logics for system correctness. Publication Trends : His recent works (2015–2024) analyze Hardware Memory Models (Intel-x86, TSO), String Constraint Solving , and Stateless Model Checking under relaxed memory semantics. He applies Automata Theory to Persistent Memory verification and Concurrency problems. Committee Roles : Active in program committees for POPL (2020–2025), PLDI (2017–2024), and VMCAI (2017).

• Optimization
• Cryptography
• Artificial Intelligence
• +۵ مورد دیگر

Yu Li is a Lecturer at the University of Picardie Jules Verne (UPJV) and a member of research unit UR 4290 “Optimization and Cryptography, AI – OCIA.” His office is located in room 302, reachable by internal telephone extension 5900. Research Interests Dr. Li’s research spans several inter-related domains: Optimization & Control Theory – developing dynamic optimization algorithms for industrial processes such as continuous casting in steel manufacturing. Cryptography & Security – investigating secure and dependable models for cloud and distributed systems. Artificial Intelligence & Robotics – integrating AI perception and decision-making into cloud-connected robotic platforms, including exoskeletons for rehabilitation and autonomous ground vehicles. Cloud & Fog Computing – designing middleware and domain-specific languages that seamlessly connect robotic devices with cloud and edge resources. Publication Trends Over the past decade, Dr. Li’s publication record reveals a clear evolution from foundational work in software architecture and component-based systems (2010-2016) toward cutting-edge applications in cloud/fog-enabled robotics and AI-driven cyber-physical systems (2017-2023). His studies increasingly emphasize real-world deployment, simulation-driven resource estimation, and human-centric interaction in rehabilitation robotics. Scientific Awards & Recognition No specific awards are listed in the provided materials. Advising & Funding No explicit information about supervised students or funded grants is available in the text supplied. Laboratories & Teams He carries out his research within the UR 4290 research unit “Optimization and Cryptography, AI – OCIA” at UPJV, focusing on collaborative projects that bridge mathematics, computer science, and robotics engineering.

Sepehr Assadiمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Algorithm Design
• Complexity Theory
• +۷ مورد دیگر

Sepehr Assadi is an Associate Professor and Faculty of Mathematics Research Chair at the Cheriton School of Computer Science , University of Waterloo, since 2023. His research focuses on theoretical computer science , particularly algorithm design and complexity theory for modern computation models like streaming , distributed , and sublinear time algorithms. Recognized with the 2025 Presburger Award for groundbreaking work in multi-pass streaming lower bounds Developed hierarchical embedding technique for optimal lower bounds in graph streaming Key contributions to maximal independent set , maximum matching , and minimum spanning tree problems His work has been cited over 2,500 times (h-index: 30). He has served on program committees for major conferences (FOCS, STOC, COLT) and mentors students in graph algorithms and complexity theory . Awards include Sloan Research Fellowship , NSERC Discovery Grant , and Google Research Scholar Award .

Thomas W. Repsمشاهده پروفایل

استاد

• Program analysis
• Abstract interpretation
• Model checking
• +۷ مورد دیگر

Thomas W. Reps is the J. Barkley Rosser Professor & Rajiv and Ritu Batra Chair in the Computer Sciences Department of the University of Wisconsin-Madison, where he has been a faculty member since 1985. He is also President of GrammaTech, Inc., which he co-founded in 1988 to commercialize research on programming environments. Reps received his Ph.D. in Computer Science from Cornell University in 1982, winning the ACM Doctoral Dissertation Award. His research spans program analysis, abstract interpretation, model checking, programming languages, and computer security. Reps's most influential work includes pioneering program slicing techniques with Susan Horwitz, development of the Cornell Program Synthesizer and Synthesizer Generator with Tim Teitelbaum, and significant contributions to interprocedural dataflow analysis. His recent work extends into quantum computing and advanced program synthesis techniques. The analysis of his publications reveals consistent focus on program analysis techniques, with recent papers exploring quantum circuit verification, abstract transformer synthesis, and program synthesis. His work bridges theoretical foundations with practical applications, often addressing scalability challenges in program analysis. NSF Presidential Young Investigator Award (1986) Packard Fellowship (1988) ACM Fellow (2005) ACM SIGPLAN Programming Languages Achievement Award (2017) Elected foreign member of Academia Europaea (2013) Multiple best paper awards including ETAPS (2004, 2008) Reps has advised numerous students, several of whom have received departmental and national recognition. His work on the Wisconsin Program-Slicing Tool led to commercial products through GrammaTech. He has served on advisory boards for significant projects including Year 2000 remediation for the Department of Defense and F/A-22 avionics software integration.

• Algorithms
• Graph Theory
• Dynamic Algorithms
• +۴ مورد دیگر

Kathrin Hanauer is an Assistant Professor at the University of Vienna, where she is affiliated with the Research Group Theory and Applications of Algorithms and the Research Network Data Science. She conducts research in the design, analysis, and experimental evaluation of fast algorithms, with a focus on Algorithm Engineering connecting theoretical foundations with practical implementations. Her research interests include: Algorithm Engineering for practical algorithm implementation Dynamic algorithms for efficiently handling changing data Graph algorithms and network analysis Reachability problems on directed graphs Ranking problems, particularly the NP-hard Feedback Arc Set problem Network analysis, motif search, and subgraph counting Dr. Hanauer's recent publications demonstrate a strong focus on dynamic graph algorithms, with significant contributions to reachability queries, subgraph counting, and datacenter network optimization. Her work spans both theoretical algorithm design and practical implementation, often with C++ software projects. Notable contributions include the O'Reach algorithm for faster reachability queries in large graphs and several dynamic algorithms for subgraph counting and network analysis. Her scientific contributions: O'Reach: A novel approach to reachability queries in large graphs that outperforms previous methods Dynamic algorithms for four-vertex subgraph counting with efficient update operations Work on demand-aware link scheduling for reconfigurable datacenters Interdisciplinary research on normative reasoning with Aristotelian diagrams Dr. Hanauer actively supervises student research, with numerous completed theses focusing on dynamic graph algorithms, geometric algorithms, and reachability problems. Her lab maintains several software projects related to graph algorithms, including a modular algorithms library for dynamic graphs written in C++ and specialized implementations for reachability queries and subgraph counting.

• International Security Policy
• Swiss Security Policy
• Conflict Analysis
• +۳ مورد دیگر

Leo Eigner is a Researcher affiliated with the Department of Swiss and International Security Policy at ETH Zürich, Switzerland. He is part of the Professorship for International and Swiss Security Policy. His work focuses on strategic security analysis, conflict resolution mechanisms, and policy frameworks related to national and international security dynamics. His research interests include the application of quantitative methods to security studies, policy evaluation frameworks, and interdisciplinary approaches to addressing contemporary security challenges. He collaborates on projects involving geopolitical risk assessment and institutional resilience strategies. Eigner has contributed to over 20 peer-reviewed publications since 2011, with notable work in control theory and optimization applied to security contexts. His articles explore stability verification of control systems, region-of-attraction computations, and optimization-based methods for nonlinear systems. Key contributions include advancements in sum-of-squares programming and semidefinite programming techniques for complex system analysis. No specific academic awards or grants are explicitly mentioned in the provided materials. His professional activities are centered on maintaining rigorous research output within the security policy domain.

Thomas W. Repsمشاهده پروفایل

استاد

• Programming languages
• Software engineering
• Static program analysis
• +۵ مورد دیگر

Thomas W. Reps is a Professor in the Department of Computer Science at the University of Wisconsin, holding the position since 1985. He has served as President and Co-founder of GrammaTech, Inc. since 1988, and held visiting roles including Guest Professor at the University of Paris 7 (2007-08), Visiting Researcher at CNR in Pisa, Italy (2000-01), and Guest Professor at the University of Copenhagen (1993-94). He previously served as Associate Chairman of the Computer Sciences Department at Wisconsin (1990-93) and held postdoctoral roles at Cornell University and INRIA. Reps' research spans programming languages, software engineering, and computer security, with a focus on static program analysis, machine-code analysis, and program slicing. His work in model checking, software maintenance, and analysis techniques for information security has significantly impacted the field of computer science. 2017 ACM SIGPLAN Programming Languages Achievement Award 2015 WARF Named Professorship 2005 ACM Fellow 2000 Guggenheim Fellowship 1986 NSF Presidential Young Investigator Award Reps' publications highlight advancements in interprocedural dataflow analysis, weighted pushdown systems, and symbolic computation. His work bridges theoretical foundations with practical applications in software verification and security, creating tools that have shaped modern program analysis techniques. He has collaborated extensively with researchers like Somesh Jha, Mooly Sagiv, and Gogul Balakrishnan across institutions in Europe and the U.S.

Javier Esparzaمشاهده پروفایل

استاد

• Theoretical Computer Science
• Software Verification
• Model Checking
• +۹ مورد دیگر

Javier Esparza is a Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich (TUM), Germany. He has held academic positions at several prestigious institutions including the University of Stuttgart, University of Edinburgh, and Technische Universität München since 1990. His work focuses on theoretical computer science with applications in software verification and formal methods. His educational background includes: M.S. in (Theoretical) Physics from the University of Zaragoza (Spain, 1987) Ph.D. in Computer Science from the University of Zaragoza (Spain, 1990) Habilitation in Computer Science from the University of Hildesheim (Germany, 1994) Professor Esparza's research interests span multiple areas of theoretical computer science and formal methods. He has made significant contributions to the fields of software verification, model checking, and Petri nets. His work on algorithms for the design and verification of reactive and distributed systems has been particularly influential. He has developed theoretical foundations and practical tools for analyzing systems with infinitely many states, pushing the boundaries of what can be formally verified. His research on formal models for distributed systems, particularly Petri nets and process algebras, has provided new insights into concurrency theory. Additionally, his work on the analysis of probabilistic systems and applications of linear and constraint programming to verification problems has opened new avenues for research. His recent publications demonstrate a continued focus on fundamental problems in verification and theoretical computer science, with particular emphasis on population protocols, model checking techniques, and theoretical foundations of distributed computing. His work bridges the gap between theoretical insights and practical applications in software reliability. His scientific achievements have been recognized with several prestigious awards: Doctor honoris causa in Informatics, Masaryk University (2009) Dissertation prize, University of Zaragoza (1990) TeachInf Award for best Bachelor course at TU München (2009) TeachInf Award for best Master course at TU München (2010) Diploma for excellent Teaching, TU München (2011) Member of Academia Europaea (2011) Professor Esparza has successfully advised numerous PhD students who have gone on to make their own significant contributions to computer science. His research has been consistently supported by competitive grants from major funding bodies including the German Research Council (DFG), the British Engineering and Physical Sciences Research Council, and the European Union. His research projects have often involved international collaborations, reflecting the global recognition of his work. He leads a vibrant research group at TUM focused on theoretical computer science and verification. The group has developed several influential software tools including Rabinizer, Peregrine, Owl, and Strix, which are widely used in both academia and industry for verification tasks. His group maintains strong collaborations with research institutions worldwide, particularly in Europe.

ZIDANI Hasnaaمشاهده پروفایل

استاد

• Optimal Control
• Mathematical Modeling
• Numerical Simulation
• +۳ مورد دیگر

Hasnaa ZIDANI is a Professor in applied mathematics at INSA Rouen Normandie , holding the COPTI Chair . Her research focuses on optimal control , mathematical modeling , and numerical simulation , with applications to transportation systems (e.g., autonomous vehicles, traffic management) and environmental modeling (e.g., resource management, marine ecology). She leads the COPTI project, funded by the ANR , Région Normandie , and EU’s ERDF , aiming to advance international-level research in optimal control methods. Research priorities include Optimal control of large-scale and stratified systems, Trajectory planning and crowd movement optimization, Image segmentation and optimal transport, Applications in aerospace (e.g., launcher trajectory optimization) and energy (e.g., demand response systems). ZIDANI actively contributes to academic events, such as the 2024 conference on Control Theory (co-chair) and the 2023 workshop on Optimal Control in Italy . She collaborates with institutions like Thales Alenia Space and develops tools like the ROC-HJ solver for reachability analysis and optimal control. Affiliations : Laboratoire de Mathématiques de l’INSA Rouen (LMI), CNRS EA-3226. Contact via Hasnaa.Zidani@insa-rouen.fr .

Marco Antonio Muniz Rodriguezمشاهده پروفایل

دانشیار

• Timed Automata
• Formal Verification
• Model Checking
• +۶ مورد دیگر

Marco Antonio Muniz Rodriguez is an Associate Professor at the Department of Computer Science, part of The Technical Faculty of IT and Design at Aalborg University. His research focuses on formal methods, specifically timed automata and model checking, with applications in machine learning, stochastic systems, and safety-critical decision-making. He contributes to the UPPAAL verification tool and explores interdisciplinary areas like healthcare optimization and traffic systems. He participated in the BEO-COVID project (2020), developing decision support tools for pandemic management. His work integrates formal verification techniques with machine learning to address real-world problems such as traffic rerouting and epidemic prevention. Key collaborations include projects with the Poul Due Jensen Foundation and industrial partners. His research spans theoretical advancements in timed systems and practical implementations, emphasizing computational efficiency through GPU acceleration and static analysis. He has published on topics ranging from stubborn set reduction to proactive traffic management, demonstrating a commitment to both foundational research and applied solutions.

Louis Esperetمشاهده پروفایل

پژوهشگر

• Graph Theory
• Combinatorial Optimization
• (Distributed) Algorithms
• +۷ مورد دیگر

Louis Esperet is a Senior CNRS Researcher at the G-SCOP Laboratory in Grenoble, France, affiliated with Université Grenoble Alpes since 2009. His research spans graph theory, combinatorial optimization, and interactions with mathematics and computer science. Education: Higher education in Paris, Lyon, and Bordeaux (2000-2005); Ph.D. in Computer Science (2005-2008) from University of Bordeaux under André Raspaud; Habilitation thesis (2017) from Université Grenoble Alpes. Research focuses on graph theory, with applications in combinatorial optimization, distributed algorithms, extremal combinatorics, property testing, communication complexity, geometric group theory, probability theory, discrete geometry, and topology. Current projects include asymptotic dimension of minor-closed families, clustered coloring, and adjacency labeling schemes. Recent publications address the Clustered Hadwiger Conjecture, sparse universal graphs for planarity, and optimal labelling schemes. Grants include ANR ENEDISC (2024-2028), ANR TWIN-WIDTH (2021-2025), and others. He co-organizes events like the Graphs and Complexity workshop and serves as managing editor for diamond open-access journals.

• Systems Theory
• Control Theory
• Commutative Algebra
• +۳ مورد دیگر

Andrés Sáez Schwedt is a Full Professor (Profesor Titular de Universidad) in the Department of Mathematics at the University of León, Spain, affiliated with the School of Industrial, Information and Aerospace Engineering. His academic work focuses on applied mathematics with specialization in systems theory and control. Dr. Sáez Schwedt earned his doctorate from the University of Valladolid in 2000 with a thesis titled "Classification of 2-dimensional linear dynamic systems over commutative rings," supervised by Dr. Tomás Sánchez Giralda. His educational background demonstrates strong foundations in algebraic structures applied to dynamic systems. His research interests center around mathematical control theory, particularly the intersection of algebra and systems engineering. He has made significant contributions to understanding linear systems over rings, with particular emphasis on von Neumann regular rings. His work explores fundamental problems in control theory including feedback classification, pole assignability, cyclic accessibility, and the regulator problem for systems over algebraic structures. His publication record shows a consistent research trajectory focused on applying algebraic methods to control theory problems. The most recent publications (2021-2015) continue his exploration of linear systems over von Neumann regular rings, while earlier works (2007-2010) established foundational results in feedback cyclization and coefficient assignability. His research demonstrates a strong connection between abstract algebra and practical control theory applications. Dr. Sáez Schwedt has published 12 research papers since 2002, primarily in high-impact mathematics journals such as Linear Algebra and its Applications. His work has been cited 16 times across 9 documents, indicating recognition within the mathematical control theory community. He maintains an active collaboration network, most notably with Tomás Sánchez Giralda (7 joint publications), Miguel V. Carriegos (2), José Angel Hermida Alonso (2), and Wiland Schmale (1). This collaborative approach has enabled him to address complex problems at the intersection of algebra and control theory from multiple perspectives.

• Set Theory
• Mathematical Logic
• Ontologies
• +۶ مورد دیگر

Domenico Cantone is a Professor in the Department of Mathematics and Computer Science at the University of Catania, Italy. With an extensive publication record spanning from 1987 to 2025, he has established himself as a leading researcher in mathematical logic, set theory, and their applications to computer science problems. His research bridges theoretical foundations with practical applications in ontologies, blockchain technology, and quantum computing. Professor Cantone's research interests primarily focus on set theory and mathematical logic, with significant contributions to computational aspects of these fields. His work has evolved from foundational set theory to practical applications in semantic web technologies, blockchain systems, and quantum algorithms. He has made substantial contributions to decidability problems in set theory fragments, developing decision procedures that have applications in automated reasoning systems. His recent work demonstrates a strategic expansion into interdisciplinary areas, particularly the application of formal methods to blockchain technology and the exploration of quantum computing for string algorithms. The trajectory of Cantone's publication record shows a consistent focus on theoretical foundations while gradually incorporating more applied research directions. His early work concentrated on pure set theory and logic, then expanded to include applications in automated reasoning and ontology representation, and more recently has embraced emerging technologies like blockchain and quantum computing. This evolution reflects both his theoretical depth and ability to identify promising intersections between formal methods and cutting-edge technologies. Professor Cantone has maintained exceptionally productive collaborations throughout his career, most notably with Marianna Nicolosi Asmundo (58 joint publications), Simone Faro (54 publications), Daniele Francesco Santamaria (35 publications), and Eugenio G. Omodeo (35 publications). These long-standing collaborations demonstrate his ability to build and sustain research teams focused on complex theoretical problems. His work has appeared in prestigious venues including Theoretical Computer Science, Journal of Automated Reasoning, and Fundamenta Informaticae, among others.

Paul Hunterمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Formal Verification
• Graph Theory
• +۳ مورد دیگر

Dr. Paul Hunter is an Associate Professor in the School of Computer Science and Engineering at the University of New South Wales (UNSW), Faculty of Engineering. He completed his BSc in mathematics at the University of Tasmania, followed by a PhD in Theoretical Computer Science at the University of Cambridge. His academic journey included an EPSRC Postdoctoral Fellowship at the University of Oxford (2008-2013), a postdoctoral position at the Université Libre de Bruxelles (2013-2016), and his return to Australia in 2016 to join UNSW. Dr. Hunter's research spans theoretical computer science with particular expertise in formal verification, graph theory, algorithms, and game theory. His work focuses on quantitative games, reactive synthesis, and automata theory, with significant contributions to areas such as mean-payoff games with partial observation, regret minimization, and real-time logic. His research has important applications in formal verification, controller synthesis, and decision-making under uncertainty. His publication record shows consistent scholarly output since 2004, with particular concentration in the period 2014-2022. His work demonstrates strong theoretical foundations while addressing practical problems in computer science. The research trends indicate increasing focus on reactive synthesis without regret, quantitative games with incomplete information, and the application of game theory to formal verification problems. Among his notable achievements is the EPSRC Postdoctoral Fellowship, which supported his research at Oxford for five years. His research has been published in top theoretical computer science venues and has influenced the field of formal methods and game theory. Dr. Hunter maintains an active research program with recent publications in 2022, indicating ongoing scholarly productivity. His work bridges theoretical computer science with practical applications in verification and synthesis. He is part of UNSW's strong research ecosystem in technology and computer science, contributing to Australia's research capacity in theoretical foundations of computing.