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

• Theoretical Computer Science
• Algorithm Engineering
• Parallel Computing
• +۳ مورد دیگر

Prof. Dr. Peter Sanders is a full professor in Theoretical Computer Science at the Karlsruhe Institute of Technology (KIT), leading the Algorithm Engineering group. His academic career includes a doctoral degree from Karlsruhe University and research stints at institutions like the Max Planck Institute for Informatics. He specializes in algorithm theory and engineering, focusing on parallel computing, large-scale data processing, and graph partitioning. His research bridges theoretical foundations with practical implementations, emphasizing real-world applications in optimization, route planning, and distributed systems. Education: Ph.D. in Computer Science, Karlsruhe University (1996) Bachelor/Master studies at Karlsruhe University (1988-1996) Research Interests: Algorithm design and analysis Parallel and distributed algorithms Graph algorithms and partitioning Algorithm engineering for big data High-performance computing Publications: Over 250 papers, emphasizing parallel algorithms, distributed systems, and graph theory. Recent work includes scalable SAT solving, hypergraph partitioning, and distributed string sorting. His contributions have advanced practical applications in route planning, load balancing, and large dataset processing. Awards: Recipient of the prestigious Leibniz Prize (DFG) and Baden-Württemberg State Research Prize. He coordinated the DFG Priority Program on Algorithm Engineering and is an active reviewer for major funding bodies. Consulting: Engages with companies like SAP and Google, focusing on optimization, route planning, and database algorithms. Leads projects on algorithm scalability and real-world problem-solving. Labs/Teams: Heads the Algorithm Engineering group at KIT, fostering collaborations in distributed computing and algorithmic research.

Siegfried Nijssenمشاهده پروفایل

استادیار

• Data Mining
• Pattern Mining
• Exploratory Data Analysis
• +۵ مورد دیگر

Siegfried Nijssen is an Assistant Professor of Data Mining and Artificial Intelligence at the Catholic University of Louvain (UCLouvain) in Belgium, working within the ICTEAM research institute's Artificial Intelligence and Algorithms group. He has been at UCLouvain since 2016, previously serving as an Assistant Professor at University Leiden (2012-2016) and completing postdoctoral work at KU Leuven (2006-2015). He earned his PhD in Computer Science from University Leiden in 2006. His research focuses on making data analysis simpler through intersections between pattern mining, exploratory data analysis, and programming paradigms in Artificial Intelligence, particularly constraint programming and probabilistic programming. He has developed techniques for analyzing diverse data types including graphs, networks, and multi-relational data. His work bridges theoretical foundations with practical applications in decision tree learning, probabilistic networks, and source code analysis. Nijssen's recent publications demonstrate a strong focus on optimal decision trees, constraint-based pattern mining, and applications in bioinformatics and education. His research shows consistent evolution from foundational graph mining work (including the Gaston algorithm developed in 2004) to current work integrating machine learning with constraint programming for interpretable AI solutions. As an educator, he teaches courses including Mining Patterns in Data, Databases, and Artificial Intelligence and Machine Learning seminars at UCLouvain. He has advised numerous PhD students and postdocs, primarily in collaboration with Pierre Schaus, with former students like Tias Guns now holding professorships.

Alexander Steenمشاهده پروفایل

استادیار

• Computational Logic
• Automated Reasoning
• Theoretical Computer Science
• +۷ مورد دیگر

Alexander Steen is an Assistant Professor (Juniorprofessor) at the University of Greifswald within the Institute of Mathematics and Computer Science. His research focuses on computational logic, automated reasoning, and theoretical computer science, with significant contributions to higher-order logic (HOL) and non-classical reasoning systems. He leads the development of the Leo-III automated theorem prover, a versatile system supporting classical HOL with choice, polymorphic logics, and higher-order modal/deontic logics. Steen's academic journey includes a Dr. rer. nat. (summa cum laude) from Freie Universität Berlin (2018), followed by post-doctoral work at the University of Luxembourg (2018-2021) as a principal investigator for the AuReLeE project on legal reasoning automation. He holds a 2024 nomination for the University of Greifswald Teaching Award and was elected Fellow of the Academy of Sciences and Humanities in Hamburg (2022). Key Research Areas: Higher-Order Logic, Automated Reasoning, Non-Classical Logics, Legal Tech, Formal Methods in AI, Computational Ethics. Major Projects: Leo-III (DFG-funded automated prover), AuReLeE (FNR-funded legal reasoning), MET (modal logic embedding tool). His recent publications (2025-2022) explore diverse applications of HOL in non-classical reasoning, legal formalization, argumentation frameworks, and TPTP infrastructure extensions. Steen actively contributes to AI governance as co-speaker of the GI AI section and deputy member of Greifswald's Senate. He also engages in science communication through works like the 2024 science comic book Was wissen wir schon (What Do We Know?), featuring his automated reasoning research. Scientific Honors: CLAR 2023 Best Paper Award, IRIS 2020 LexisNexis Best Paper Award, CASC-27 LTB Division Winner, Woody Bledsoe Travel Awards (CADE 2018, 2016), GI Junior Fellowship (2018). Advising: Supervises ongoing PhD/MSc/BSc theses in logic-based AI, modal reasoning, and legal tech at University of Greifswald and Freie Universität Berlin.

Toni Milunمشاهده پروفایل

مدرس

• Mathematics Education
• Financial Mathematics
• Business Statistics
• +۳ مورد دیگر

Toni Milun serves as a lecturer in mathematics and statistics at Algebra University of Applied Sciences, where he bridges theoretical concepts with practical business applications. His academic foundation includes a 1999 degree from the Faculty of Science and Mathematics at the University of Zagreb and a 2012 postgraduate specialist degree in Statistical Methods for Economic Analysis and Forecasting from the Faculty of Economics in Zagreb. He is currently completing his doctoral research in Economics at the Faculty of Economics in Rijeka. His research spans Mathematics Education, Financial Mathematics, and Business Statistics, with a distinctive focus on making complex quantitative concepts accessible through innovative pedagogical approaches. Milun's work consistently connects mathematical theory to real-world economic scenarios, particularly in SME financing, investment analysis, and statistical literacy for decision-makers. His publications reveal a strong emphasis on practical applications in Croatian business contexts and educational settings. Analysis of his 15 most recent publications shows dominant themes in financial mathematics (35%), business statistics (30%), and adult education (25%), with recurring subfields including percentage calculations in commerce, regression modeling of socioeconomic factors, and maritime/IT-specific mathematical applications. His research demonstrates consistent engagement with Croatian economic data and educational challenges. His notable recognition includes: Pride of Croatia award for special contribution to education Milun actively disseminates knowledge through public-facing initiatives rather than formal academic advising. He has co-authored a high school mathematics textbook and provides consulting services in applied mathematics and statistics, focusing on business problem-solving. His educational outreach generates significant impact through digital platforms and traditional media. He leads the www.tonimilun.com educational portal and television productions ('Školski sat' and 'Financijalac'), directing teams of educators, video producers, and subject-matter experts to create accessible mathematical and financial literacy content for diverse audiences across Croatia.

John Francoمشاهده پروفایل

استاد

• Cybersecurity
• Formal Verification
• Satisfiability Algorithms
• +۴ مورد دیگر

Prof. John Franco is a Professor of Computer Science at the University of Cincinnati, serving as Director of the National Center of Academic Excellence in Cyber Operations. His roles include Editor-in-Chief of the Journal on Satisfiability, Boolean Modeling, and Computation , and Vice Chair of the SAT Association. He has held visiting scientist positions at institutions in Germany (FAW Ulm, Universität Paderborn) and spent sabbatical leave at Fort George G. Meade. Education: Ph.D. in Computer Science, Rutgers University, 1981 M.S. in Electrical Engineering, Columbia University, 1971 B.S. in Electrical Engineering, City College of New York, 1969 Research Interests: Franco’s work focuses on satisfiability (SAT) algorithms, formal verification, cybersecurity, and computational complexity. He has pioneered probabilistic analysis of SAT-solving heuristics and contributed to the integration of SAT techniques into network security and formal methods. His research bridges theoretical computer science with practical applications in cyber defense and algorithm optimization. Grants & Funding: Franco has secured over 18 grants from agencies like the NSA, NSF, and ONR. Notable projects include Satisfiability Algorithm Research (NSA grants since 1999), cybersecurity curriculum development (NSA 2018–2022), and Ohio Cyber Range initiatives. He has led or collaborated on federal and state-funded projects totaling millions in funding. Labs/Teams: Directs the National Center of Academic Excellence in Cyber Operations, a collaborative effort with local defense contractors. His work involves partnerships with institutions like Wright State Applied Research Corporation and Riverside Research Institute.

• Theoretical Computer Science
• Theorem Proving
• Automated Reasoning
• +۲۶ مورد دیگر

Jasmin Blanchette is a Professor of Theoretical Computer Science and Theorem Proving at Ludwig-Maximilians-Universität München (LMU), where he also serves as the Dean of Studies for Computer Science since January 22, 2024. He is affiliated with the Institute for Informatics and leads the Theoretische Informatik und Theorembeweisen research unit. Additionally, he is a guest researcher in the VeriDis group at Loria, Nancy. Research Interests: His research centers on strengthening proof automation for general-purpose logics and enhancing the usability of proof assistants. He combines automatic and interactive methods, bridging human and artificial intelligence in formal verification. His work spans higher-order logic, automated and interactive theorem proving, formalization of mathematical results, and foundational mechanisms for (co)datatypes and (co)recursive functions. Key projects include Sledgehammer, Nitpick, Matryoshka, Nekoka, IsaFoL, and Lean Forward. Publication Trends: His recent publications (2023–2025) show a strong focus on higher-order automated reasoning, superposition calculus, proof automation in Isabelle/HOL, and formalization of logical and mathematical concepts. There is a consistent emphasis on verification, efficiency, and integration of SAT/SMT techniques into higher-order provers. Scientific Awards: FroCoS 2023 Best Paper Award (with Visa Nummelin and Sander Dahmen) CADE 2023 Best Paper Award for 'Verified given clause procedures' (with Qi Qiu and Sophie Tourret) IPA Dissertation Award (awarded to student Petar Vukmirović) Dutch Prize for ICT Research 2022 Advising and Grants: He supervises a large team of postdocs and PhD students at LMU and co-supervises students at other institutions. His leadership in major collaborative projects like Matryoshka indicates significant grant funding and collaborative research efforts. He is editor-in-chief of the Journal of Automated Reasoning and serves on numerous steering and program committees, reflecting strong academic leadership and visibility. Labs and Teams: He leads a research group at LMU’s Institute for Informatics, focusing on theorem proving and formal methods. He is also associated with the VeriDis group at Loria, Nancy, and collaborates widely across Europe in the automated reasoning community.

Oleg Pikhurkoمشاهده پروفایل

استاد

• Extremal combinatorics
• Graph theory
• Descriptive combinatorics
• +۶ مورد دیگر

Oleg Pikhurko is a Professor of Mathematics at the University of Warwick, affiliated with both the Mathematics Institute and DIMAP (the Centre for Discrete Mathematics and its Applications). His office is located in room B2.12 at the University of Warwick in Coventry, UK. Pikhurko has established himself as a prominent researcher in combinatorics with significant contributions to extremal combinatorics, graph theory, and related fields. His research interests span a wide range of topics in discrete mathematics including extremal combinatorics and graph theory, descriptive combinatorics, graph limits, random structures, and algebraic, analytic and probabilistic methods in discrete mathematics. Pikhurko's work bridges theoretical foundations with practical applications, often employing sophisticated mathematical techniques to solve challenging problems in combinatorial structures. The analysis of Pikhurko's recent publications reveals a consistent focus on extremal combinatorics, particularly Turan-type problems, hypergraph theory, and graph limits. His work demonstrates increasing sophistication in handling complex combinatorial structures, with recent papers exploring connections to measure theory, geometry, and coding theory. Notably, his research shows a progression from classical combinatorial problems toward more abstract and interdisciplinary approaches, including measurable versions of combinatorial theorems and applications to high-dimensional spaces. ERC Advanced Grant 'Finite and Descriptive Combinatorics' (2022-2026) Pikhurko has successfully supervised numerous PhD students including Teresa Sousa (2006), David Offner (2009), Zelealem Yilma (2011), Matthew Fitch (2019), and Matteo Mazzamurro (2023). He currently co-advises Irene Gil Fernández and Zhuo Wu, both expected to complete their PhDs in 2025. His research group focuses on 'Finite and Descriptive Combinatorics,' reflecting his dual interest in finite combinatorial structures and their descriptive (measurable) counterparts. The ERC Advanced Grant awarded in 2022 has provided significant funding to support this research program through 2026. Beyond traditional research, Pikhurko founded the Hedgehog Fund, which encourages innovative proofs of mathematical results presented in his lectures. He also maintains an Erdos Lap Number of 2, having sat on the lap of Barbie Freidin (Erdos Lap Number 1) who herself sat on Paul Erdos's lap.

• Deductive Verification
• Interactive Theorem Proving
• Automated Reasoning
• +۴ مورد دیگر

Yong Kiam Tan is a research scientist at the Institute for Infocomm Research (A*STAR, Singapore) and holds a joint appointment as a Nanyang Assistant Professor at the College of Computing and Data Science, Nanyang Technological University (NTU, Singapore). He earned his PhD in Computer Science (Pure and Applied Logic) from Carnegie Mellon University, supported by a National Science Scholarship (BS-PhD) from A*STAR, Singapore. His research focuses on Deductive verification and interactive theorem proving Applications in automated reasoning, compilers, formalized mathematics, hybrid systems, and cybersecurity (cryptography) Development of verified tools like the CakeML compiler and KeYmaera X for hybrid systems His recent work spans formal verification of machine learning models, cryptographic protocols, and hybrid systems, with a strong emphasis on tool development and practical applications. Notable trends include integrating theorem proving with SAT solving and model-counting techniques for security verification. Scientific awards include: CMU SCS Distinguished Dissertation Award 2022 Distinguished Paper Award at CAV 2024 Best Paper and Best Repeatability Evaluation Awards at HSCC 2022 Peter Landin Prize at IFL'15 Best Tool Paper Award at FM'19 He actively recruits students and postdocs for fully funded positions at NTU and A*STAR, and collaborates with researchers such as Wei-Lin Wu (A*STAR) Joe Watt (A*STAR) Ciaran McCreesh (University of Glasgow) Magnus Myreen (Chalmers University)

Alexey Ignatievمشاهده پروفایل

مدرس ارشد

• Artificial Intelligence
• Satisfiability Solving
• Automated Reasoning
• +۲ مورد دیگر

Alexey Ignatiev is a Senior Lecturer in Monash University's Department of Data Science & AI. His research develops SAT/SMT-based methods for AI applications including explainable AI, automated software debugging, and neuro-symbolic systems. Key projects: Formal Explainability for Neuro-Symbolic AI (ARC-funded) Hierarchical Abstractions for Neuro-Symbolic Systems Recent publications focus on formal explanation techniques for machine learning models, including defect prediction systems and interpretable rule extraction.

Gabriel Ciobanuمشاهده پروفایل

استاد

• Membrane Computing
• Natural Computing
• Distributed Systems
• +۶ مورد دیگر

Gabriel Ciobanu is a Professor at Alexandru Ioan Cuza University of Iasi, Romania, and a Senior Researcher at the Romanian Academy, Iasi. He has held various academic positions internationally including as a Visiting Professor at Newcastle University (UK) from 2010-2015 and as a Research Fellow/Professor at the National University of Singapore (2000-2004). His educational background includes PhD studies at A.I.Cuza University and Edinburgh University (1990-1994) under the mentorship of Robin Milner, and his undergraduate studies in the Faculty of Mathematics and Computer Science at A.I.Cuza University of Iasi (1977-1982). Professor Ciobanu's research focuses on Membrane Computing and Natural Computing , Distributed Systems Models including process calculi with emphasis on semantics, behavioral equivalences, logics, and verification. He has made significant contributions to bridging membrane computing and process calculi, and to the Foundations of Mathematics and Computer Science through his work on Finitely Supported Mathematics. His research has applications in theoretical computer science, formal methods, and computational biology. His publication record shows a consistent research trajectory focusing on theoretical computer science with applications to natural computing, membrane systems, process calculi, and finitely supported structures. Recent work (2023-2025) continues to explore these areas with increasing focus on multi-agent systems, continuation semantics, and applications to medical systems and reaction systems. Scientific Awards and Recognition 2013 Grigore Moisil Award, Romanian Academy (as co-author of "Mobility in Process Calculi and Natural Computing", Springer) 2010-2013 Member of the National Research Council (CNCS) in Romania 2008-2010 Royal Society of London Joint International Project (Newcastle University, School of Computing) 2004 Octav Mayer Award for Scientific Achievements, Romanian Academy of Sciences, Iasi branch 2000 Grigore Moisil Award of the Romanian Academy of Sciences for results in Theoretical Computer Science 1995-1996 Japan Society for the Promotion of Science Fellowship (Tohoku University and Kyoto University) 1994 DAAD Research Fellowship (Institute of Computer Science, University of Kiel) 1991-1992 Royal Society of London and Romanian Academy Fellowship (University of Edinburgh) Professor Ciobanu has supervised 8 PhD students and numerous master's students. He has served as Editor-in-Chief of the Scientific Annals of Computer Science since 2006 and has been a guest editor for special issues of several international journals. He has collaborated with researchers from numerous countries including UK, France, Netherlands, Spain, Italy, Russia, China, Singapore, and India. He has been involved in various research projects and has spent research periods at prestigious institutions worldwide including Edinburgh University, Universite de Paris XI, CWI and VU Amsterdam, Tohoku and Kyoto University, National University of Singapore, and Newcastle University.

• Formal Methods
• Satisfiability (SAT)
• Satisfiability Modulo Theories (SMT)
• +۱۱ مورد دیگر

Enric Rodríguez Carbonell is a faculty member at the Department of Computer Sciences within the Faculty of Computer Science at Universitat Politècnica de Catalunya (UPC). He is a key member of the LOGPROG - Lògica i Programació research group, focusing on formal methods, automated reasoning, and combinatorial optimization. Research Interests: His work centers on satisfiability (SAT), satisfiability modulo theories (SMT), and their applications in program verification, constraint solving, and optimization. He investigates techniques such as conflict-driven learning, invariant generation, and Max-SMT for proving termination and safety. His research bridges theoretical foundations with practical applications in software analysis and industrial problem-solving. Publication Trends: His recent publications (2020–2024) show a sustained focus on enhancing SAT and SMT solvers, particularly in pseudo-Boolean reasoning, integer linear programming, and multi-conflict analysis. Earlier works established contributions in non-linear arithmetic, termination proofs, and efficient encodings for cardinality constraints, reflecting a long-term commitment to foundational and applied aspects of automated reasoning. Scientific Awards: Best student paper award at SAT 2024 Advising and Grants: Rodríguez Carbonell has contributed to multiple competitive R+D+i projects under Spain’s State Research Plans, indicating active grant involvement. He has co-authored doctoral theses and educational initiatives like Jutge.org, demonstrating engagement in academic supervision and pedagogical innovation. Labs and Teams: He is a core researcher in the LOGPROG group at UPC, which specializes in logic and programming, with strong collaborations across formal methods, verification, and constraint technologies.

• Data management and data science
• Artificial intelligence
• Distributed computing and systems software
• +۶ مورد دیگر

Thomas C Henderson is a tenured Professor at the School of Computing within the College of Engineering at the University of Utah. His research focuses on autonomous systems , computational models , and intelligent machine systems , with specific interests in biosystem simulation, distributed systems, and adaptive algorithms. He has contributed to Bayesian sensor networks , UAS traffic management , and probabilistic logic frameworks for intelligent agents. Current academic appointments since 1989 Adjunct roles in Biomedical Engineering Active in IEEE committees (2024-2025) Research trends in recent publications emphasize autonomous aircraft coordination , probabilistic reasoning , and multi-sensor integration . Key subfields include lane-based airspace modeling, reinforcement learning for UAS, and pseudogradient navigation techniques. His work has received recognition through a Best Paper Award (IEEE 2008) and the US Air Force Summer Faculty Fellowship . Strategic deconfliction protocols Dynamic data-driven applications Structural health monitoring systems He actively mentors undergraduate research through courses like Deep Learning Capstone and Senior Capstone Design . Current grants include "Deep Learning in AI and Robotics" (2024-2029) and "Robust Reasoning using Geometric SAT/PSAT" (2022-2023).

• Computational Complexity
• Logic in Computer Science
• Proof Complexity
• +۴ مورد دیگر

Nicola Galesi serves as an Associate Professor in the Department of Computer, Control and Management Engineering (DIAG) at Sapienza University of Rome since 2022, following 17 years in Sapienza's Department of Computer Science (2005-2022). His academic journey began with an Associate Professorship at Universitat Politecnica de Catalunya (2001-2005) after postdoctoral positions at the Institute for Advanced Studies in Princeton (2000-2001) and University of Toronto (2002-2003) under Stephen Cook and Toni Pitassi. His educational background features a PhD from Universitat Politecnica de Catalunya supervised by Maria Luisa Bonet, complemented by dual Italian habilitations as full professor in Mathematical Logic (2012) and Computer Science. These qualifications underpin his rigorous theoretical approach across research domains. Galesi's research program centers on Computational Complexity and Logic in Computer Science , with specialized expertise in Proof Complexity (investigating resolution refinements and algebraic proof systems), SAT-Solving , Optimization , and applied domains like Group Testing and Network Tomography . His seminal work on space complexity in algebraic proof systems (JACM 2015) established foundational frameworks, while recent network tomography research develops mathematical models for node failure identification in communication networks using Boolean algebra and graph connectivity principles. Analysis of his 15 most recent publications (2022-2025) reveals a cohesive research trajectory bridging theoretical proof complexity and practical network analysis. Key trends include depth lower bounds in stabbing planes for combinatorial principles, vertex-connectivity metrics for failure localization, and algebraic investigations of vanishing sums in polynomial calculus. His work consistently applies combinatorial principles to derive tight bounds across graph structures while advancing the theoretical understanding of proof systems through tensor isomorphism and roots of unity analyses. His scientific recognition includes: ACM Computing Review Most Notable paper in Theory of Computing for 2012 Galesi mentors the next generation through PhD supervision of Massimo Lauria (2009), Ilario Bonacina (2015), and Fariba Ranjbar (2021), while hosting postdocs including Alan Skelley, Olaf Beyersdorff, and Massimo Lauria. His research is amplified through prestigious visiting positions at the Simons Institute for Theory of Computing (2015, 2021) and Tokyo Institute for Technology (2015), building on his foundational work at IAS Princeton and Toronto. He actively shapes the theoretical CS landscape as organizer of the Sapienza LOC3 (Logic, Complexity, Combinatorics, Computability) seminar series and founder of the RaTLoCC workshops (Ramsey Theory in Logic, Complexity and Combinatorics). His editorial role for Logical Methods in Computer Science (LMCS) and program committee service for CIAC, IJCAI, and FSTTCS conferences demonstrate sustained community leadership beyond his core research and teaching responsibilities in Calculus, Mathematical Logic, and Computational Complexity.

Ruzica Piskacمشاهده پروفایل

استاد

• Software Verification
• Security and Applied Cryptography
• Automated Reasoning
• +۴ مورد دیگر

Ruzica Piskac is a Professor of Computer Science at Yale University, where she leads the Rigorous Software Engineering (ROSE) group. She has made significant contributions to the fields of software verification, security, automated reasoning, and code synthesis, focusing on improving software reliability and trustworthiness through formal techniques. Dr. Piskac received her PhD from the Swiss Federal Institute of Technology (EPFL) in 2011, where her dissertation won the Patrick Denantes Prize. Prior to joining Yale, she led an independent research group at the Max Planck Institute for Software Systems in Germany (2012-2013). Her research spans several key areas: symbolic execution for Haskell (G2), privacy-preserving formal methods (PPFM), functional reactive synthesis, verification of configuration files, and analysis of software updates. Her work consistently bridges theoretical formal methods with practical applications in real-world systems. Dr. Piskac's recent publications demonstrate a strong trend toward applying formal verification techniques to emerging challenges including large language models, quantum computing security, legal accountability of automated systems, and cyber-physical systems. Her research increasingly intersects with AI, cryptography, and legal domains while maintaining strong foundations in formal methods. Her scientific achievements have been recognized with numerous prestigious awards: Multiple Amazon Research Awards Yale University's Ackerman Award for Teaching and Mentoring Facebook Communications and Networking Award Microsoft Research Award for the Software Engineering Innovation Foundation (SEIF) Patrick Denantes Prize for her PhD dissertation Dr. Piskac has graduated five PhD students, four of whom have gone on to become assistant professors of computer science. She has served as Program Chair of the 37th International Conference on Computer Aided Verification and is on the Steering Committee of the Formal Methods in Computer-Aided Design conference. She leads the Rigorous Software Engineering (ROSE) group at Yale, which focuses on several key projects including: Symbolic Execution Engine for Haskell (G2) Privacy Preserving Formal Methods (PPFM) Functional Reactive Synthesis Verifications for Configuration Files Analysis of Software Updates and Configuration Files

• Theoretical Computer Science
• Logic in Computer Science
• Algorithms
• +۷ مورد دیگر

Alexandre Vigny is a junior professor at University Clermont Auvergne, France, where he conducts research at the intersection of logic, algorithms, and graph theory. His work focuses on theoretical computer science, particularly in model checking, query enumeration, and distributed algorithms on sparse graph classes. Research Interests: Theoretical Computer Science Logic in Computer Science Parameterized and Distributed Algorithms Graph Theory and Structural Sparsity Database Query Evaluation Reconfiguration Problems His recent publications explore algorithmic meta-theorems, first-order logic with connectivity, elimination distance, and distributed domination, primarily on sparse and structurally constrained graphs. His work appears in top venues such as LICS, ICALP, PODS, and JACM. Scientific Awards: No awards explicitly mentioned. Advising and Grants: Co-supervising Jona Dirks, PhD student since October 2024, with Mamadou Kanté. No specific grants mentioned, but active in collaborative research with prominent figures like Sebastian Siebertz, Luc Segoufin, and Patrice Ossona de Mendez. Labs and Teams: Previously part of Sebastian Siebertz’s team at the University of Bremen. Collaborates with researchers across Europe, including in Warsaw and Paris. Involved in the theoretical computer science community, co-organizing the PODC-DARE workshop.