Véronique Benzaken is a Full Professor at Université Paris-Saclay, affiliated with the Laboratoire de Méthodes Formelles (LRI) and INRIA Saclay's Toccata group. Her research focuses on Data-Centric Programming Languages , formal verification of data management systems, and type-safe XML/JSON processing. Key projects: ℂDuce XML-centric functional language, Datacert data certification initiative Collaboration with Oracle Labs on multi-lingual query interfaces using QIR Active in Coq formalization of SQL, Datalog, and data provenance Research interests include: Formal foundations for NoSQL/BigData languages Coq-based verification of database systems Type systems for data models Cloud computing data abstraction Her work bridges theory and practical implementation through collaborations with both academic and industrial partners.
Konstantinos Mamouras is an Assistant Professor at the Department of Computer Science, Rice University. His research focuses on programming abstractions for data streams, runtime verification for cyber-physical systems, program semantics, and Kleene Algebra with Tests. Rice University, Houston, TX Department of Computer Science Research Interests : Design of programming abstractions for streaming data Runtime verification of cyber-physical systems Formal methods in program verification Kleene Algebra with Tests (equational theories) Efficient automata-based processing Quantitative monitoring frameworks Recent Scientific Contributions : 2025: Membership Testing for Semantic Regular Expressions (PLDI 2025) 2024: HybridSA GPU regex acceleration (OOPSLA 2024) 2024: Efficient regex with lookaround (POPL 2024) 2023: Bit Vector Automata for regex (OOPSLA 2023) 2021: Quantitative monitoring framework (RV 2021) Scientific Awards : 🏆 Distinguished Paper Award, PLDI 2024 🏆 Best Paper Award, EuroSys 2021 🏆 EATCS Best Theory Paper Award, FoSSaCS 2015 Advising : Mentored PhD student Lingkun Kong (2023) Advised MSc student Zhifu Wang (2022) Current advisees: Alexis Le Glaunec and Agnishom Chattopadhyay Teaching : Spring 2023: IoT Programming and Data Analysis (COMP 418/518) Fall 2022: Reasoning about Algorithms (COMP 382) Spring 2021: Reasoning about Software (COMP 403/503)
Jonathan Immanuel Brachthäuser is a researcher at the University of Tübingen in Germany. He serves as a program committee member across multiple conferences including IWACO, ICFP, POPL, and SPLASH, and has held organizing roles such as Hybridisation Co-Chair and Sponsorship Chair . His research focuses on algebraic effects , effect handlers , and continuation-passing style in programming language design and compilation. Conference Contributions : 15+ peer-reviewed papers on effect systems, type inference, and compilation techniques. Advising & Mentorship : No formal student advising roles listed, but active participation in academic community building. Technical Leadership : Co-chair for workshops and artifact evaluation committees, reflecting his influence in effect-driven language design.
Prof. Dr. Jens Lang is a Professor at the Numerical Analysis Group within the Department of Mathematics at Technische Universität Darmstadt . His work focuses on adaptive numerical methods for partial differential equations (PDEs), particularly in computational fluid dynamics, uncertainty quantification, and optimal control.
Mirjam Dür is a Full Professor (W3) at the Department of Discrete Mathematics, Optimization and Operations Research within the Faculty of Mathematics, Natural Sciences and Technology at the University of Augsburg (since 2017). Previously, she held Full Professor positions at the University of Trier (2011-2017) and other academic roles in Groningen, Darmstadt, and Vienna. Her research focuses on mathematical optimization, particularly copositive programming, quadratic optimization, matrix theory, and conic optimization. Born in Vienna, Austria M.Sc. in Mathematics (1996) and PhD in Applied Mathematics (1999) from University of Trier Positive Habilitation evaluation at TU Darmstadt (2005) Research Interests : Global optimization, quadratic and combinatorial optimization, conic optimization and matrix theory, copositive programming, and applications to graph theory and discrete problems. She has pioneered methods like factorization-based approaches for completely positive matrices and cutting plane techniques in copositive programming. Scientific Awards : 2013 Optimization Letters Best Paper Award 2010 VICI Grant (NWO) 2012 GIF Research Grant (German-Israeli Foundation) Key Contributions : Development of algorithms for copositive optimization, theoretical advances in matrix cones, and novel applications to problems like graph stability and discrete optimization. She serves as Senior Editor for Optimization Methods and Software and editorial board member for multiple optimization journals.
Professor Dr. Jürgen Sander is a faculty member at the Institute for Mathematics, Mathematics Education and Computer Science Education of the University of Hildesheim. He serves as the Full-time Vice President for Studies, Teaching, and Student Affairs and leads key projects like Digital C@MPUS-le@rning and the Language Learning Project . He is also the Head of the Department of Algebra and Number Theory , focusing on executive board responsibilities and interdisciplinary study commissions. Research Interests : Algebra, Number Theory, Mathematics Education, and Computer Science Education. Leadership Roles : Chair of the Central Commission for Studies and Teaching (ZKSL) and the Interdisciplinary Study Commission for Teacher Training (FaStuL).
Professor Martin Kreuzer holds the Chair of Mathematics with a focus on Symbolic Computation at the University of Passau's Faculty of Computer Science and Mathematics, a position he has occupied since 2007. His academic career centers on advanced mathematical research with significant applications in computer science and cryptography. Dr. Kreuzer's research focuses primarily on computer algebra, commutative algebra, and algebraic geometry, with special emphasis on algebraic cryptography. His work involves constructing new cryptosystems and analyzing the security of existing ones using algebraic methods. He investigates how mathematical equation systems can be used to formulate attacks on cryptosystems, particularly focusing on fault injection techniques where attackers provoke miscalculations in cryptographic hardware to deduce secret keys. This research contributes significantly to IT security and has grown increasingly important in recent years. His publication record shows a strong trend toward applied algebraic research, particularly in cryptographic applications and computational algebra. Recent work demonstrates expertise in zero-dimensional schemes, border basis theory, finite Z-algebras, and SAT solving techniques. The research spans theoretical mathematics while maintaining strong connections to practical security applications, especially in hardware security and post-quantum cryptography. Professor Kreuzer leads the DFG project 'Algebraic Error Attacks' (also referred to as 'Algebraic Fault Attacks'), which investigates the protection of cryptographic hardware against fault injections. This significant research initiative demonstrates his leadership in bridging theoretical mathematics with practical security challenges. His collaborative approach is evident through numerous co-authored publications with researchers including L. Robbiano, Le N. Long, F. Walsh, and others. These collaborations span multiple institutions and demonstrate his active role in the international mathematics and cryptography communities. Professor Kreuzer emphasizes the importance of interdisciplinary work, particularly with computer engineering, for the future design of secure cryptographic systems.
Professor Moritz Müller holds the Chair of Mathematical Logic at the University of Passau since October 2022, after positions at the University of Freiburg, Barcelona, and Vienna. His research bridges mathematical logic and theoretical computer science, focusing on proof complexity and computational complexity. Current affiliation: University of Passau (Faculty of Computer Science and Mathematics) Prior affiliations: University of Freiburg, Barcelona, Vienna Research interests center on the P versus NP problem, proof complexity, and the interplay between mathematical logic and computational theory. His work explores foundational questions like the inherent difficulty of proving complexity lower bounds and the structure of proofs in restricted systems. Recent publications analyze parameterized complexity, circuit lower bounds, and logical frameworks for computational constraints. Key themes include automating proof systems, NP search problems, and algebraic approaches to complexity hierarchies. Scientific contributions have been recognized with a Best Paper Award at FOCS19. His team 'Logic in Passau' investigates logical foundations of algorithmic law and structural representations in foundational theories.
Professor Jens Zumbrägel has been Professor of Mathematics with a focus on Cryptography since 2017. His primary research interests include: Public Key Cryptography Algebra and its applications Discrete Logarithm Problem Post-Quantum Cryptography Codes over Rings Communication Technology Professor Zumbrägel emphasizes the practical applications of abstract mathematical concepts in encryption systems, noting that 'Numbers with hundreds of digits are used to protect confidential information or allow secure authentication.' He values interdisciplinary collaboration with computer science researchers, stating it 'has been a real benefit' and that 'It is always fascinating to see how abstract maths can be practically applied, like in the direct security analysis of encryption processes.' His research on the discrete logarithm problem forms a critical foundation for many public-key cryptosystems, while his recent work in post-quantum cryptography addresses emerging challenges posed by quantum computing advancements.
Sridhar Chellappa is a Postdoctoral Researcher at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, Germany, working within the Computational Methods in Systems and Control Theory (CSC) group since October 2022. His research focuses on numerical methods for simplifying large-scale mathematical models, particularly in Model Order Reduction and Scientific Machine Learning. Education: Bachelor’s in Electrical and Electronics Engineering (2013) from SASTRA University, India. Master’s in Sustainable Transportation and Electric Power Systems (2016) through an Erasmus Mundus joint degree program at Sapienza University of Rome, University of Nottingham, and University of Oviedo. PhD (2022) in Computational Methods in Systems and Control Theory at Otto von Guericke University Magdeburg, supervised by Dr. Lihong Feng. His expertise spans Numerical Linear Algebra, Reduced Basis Methods, and a posteriori error estimation. He collaborates with Prof. Peter Benner’s CSC group, contributing to computational efficiency in technical systems modeling.
Harshit Jitendra Motwani is a Postdoctoral Researcher at the Max Planck Institute for Software Systems (MPI-SWS) , Germany. Previously, he was a Postdoctoral Fellow at the Hong Kong University of Science and Technology (HKUST) (2023-2024), following doctoral research at Ghent University (2021-2023) and earlier engagements at HKUST, Ghent University, and the University of Bristol . Education : PhD in Mathematics: Algebra and Geometry from Ghent University (2021-2023), Thesis on Algebro-Geometric Algorithms for Program Synthesis; Integrated BSc and MSc in Mathematics and Computing from IIT Kharagpur (2015-2020). Research Focus : Integrates mathematics into computational domains, particularly Computational Algebraic Geometry , Formal Verification , and Tensors . His work spans program synthesis , tensor networks , conditional independence models , and control theory applications . Publications : Recent contributions include algorithmic advancements in formal methods (FM, AAAI, LAGOS), algebraic statistics (IMRN), and quantum computing (SIGMA). His research combines symbolic computation with practical software engineering challenges. Awards & Honors : IEEE Computer Society Larson Best Paper Award (2023) ACM SIGPLAN Distinguished Paper Award (2023) Young Researcher of the Heidelberg Laureate Forum (2023) INSPIRE Scholarship (2015-2020) Teaching : Guest Lecturer at HKUST, Teaching Assistant at RPTU Kaiserslautern-Landau and IIT Kharagpur. Mentored multiple bachelor's projects at Ghent University and IIT Kharagpur.
Daniele Agostini is a Junior Professor (Tenure Track) in the Department of Mathematics at Eberhard Karls University of Tübingen, affiliated with the Faculty of Mathematics and Natural Sciences. He is actively involved in the research section on Combinatorial Algebraic Geometry and serves as the international coordinator for the Mathematics Department. University: Eberhard Karls University of Tübingen School: Faculty of Mathematics and Natural Sciences Department: Department of Mathematics Academic Rank: Assistant Professor (Junior Professor, Tenure Track) Email: daniele.agostini@uni-tuebingen.de His primary research lies in algebraic geometry, with a focus on syzygies, curves, surfaces, abelian varieties, and their moduli spaces. He also explores interactions with probability, statistics, and mathematical physics. His recent publications reflect deep work in theta functions, KP solitons, and likelihood geometry, often in collaboration with institutions like MPI-MiS Leipzig and researchers such as Bernd Sturmfels. The 15 most recent publications demonstrate a consistent trend in combinatorial algebraic geometry, particularly in the study of moduli spaces, integrable systems, and computational aspects of algebraic varieties. Key themes include the geometry of curves and their Jacobians, tropical methods, and applications to mathematical physics and statistics. His work bridges theoretical depth with computational experimentation. Otto Hahn Medal (awarded to co-supervised PhD student Claudia Fevola, 2024) Agostini advises several PhD students, including Kees Heesterbeek, Clemens Nollau, Javier Sendra, and Claudia Fevola. He has been involved in significant research projects such as the ANR-DFG POK0 project on positivity of K-trivial varieties and the SFB-TRR 195 'Symbolic Tools'. He has taught courses such as Algebraic Curves, Algebraic Geometry, and Number Theory at Tübingen, Leipzig, and Berlin. He leads a research group in combinatorial algebraic geometry, with current members including postdoc Felix Röhrle and PhD students. His research group includes current and former members such as Demir Eken, Claudia Fevola, Leonid Monin, and Angel Rios Ortiz. He is also part of the URTAG seminar and contributes to the CRC TRR 195 collaboration, emphasizing interdisciplinary and international research engagement.
Robert Krauthgamer is the Harry Weinrebe Professor of Computer Science and currently serves as Department Head in the Department of Computer Science & Applied Mathematics at the Weizmann Institute of Science , within the Faculty of Mathematics and Computer Science . He is a leading researcher in theoretical computer science, particularly in the analysis of algorithms. Research Interests: His research focuses on Analysis of Algorithms , with deep expertise in Data Analysis and Massive Data Sets , Combinatorial Optimization , Approximation Algorithms , Hardness of Approximation , Embeddings of Finite Metrics , and Routing and Peer to Peer Networks . He also maintains a broad interest in Discrete Mathematics and High-Dimensional Geometry . His recent publications highlight work in graph algorithms, parameterized complexity, streaming algorithms, and metric embeddings. Publication Trends: His most recent work, including papers from SODA 2016, demonstrates a strong trend in the design and analysis of efficient algorithms for fundamental problems in graph theory, optimization, and data streams. Key themes include kernelization and sampling techniques for dynamic graph streams, subexponential parameterized algorithms, deterministic derandomization of the polynomial method, and structural results for graph modification problems. His research often bridges theoretical insights with applications in computational biology and network science. Service and Recognition: Journal Editorial: Editor-in-Chief of SIAM Journal on Computing (2019–2025), Associate Editor (2012–2017); Managing Editor of Theory of Computing (2007–2018), and current Editorial Board Member. Conference Leadership: Program Committee Chair for SODA 2016 and HALG 2018; Steering Committee member for SODA, ESA, and HALG; and committee member for the Gödel Prize (2019–2021). Workshops: Organizer of numerous workshops on sublinear algorithms, fine-grained complexity, and high-dimensional data. Teaching and Mentorship: He regularly teaches advanced courses such as Randomized Algorithms and Sublinear Time and Space Algorithms . He advises a large group of MSc and PhD students and hosts postdoctoral researchers, demonstrating a strong commitment to training the next generation of computer scientists. His former students have gone on to successful academic and research careers. Laboratories and Research Groups: He is a key member of the Foundations of Computer Science (theory) seminar at Weizmann and has organized the TheoryLunch and Reading Group in Algorithms, fostering a vibrant research community within the department.
Holger Dell is an Associate Professor at the IT University of Copenhagen, where he conducts research and teaching in theoretical computer science, with a focus on algorithms and complexity. He has previously held positions as Professor at Goethe University Frankfurt, Independent Research Group Leader at Saarland University, and postdoctoral fellow at UC Berkeley, Paris Diderot, and UW Madison. Research Interests: His research centers on the design of efficient algorithms for discrete problems and proving intractability results. Key areas include combinatorial counting problems, algebraic graph algorithms, and complexity theory, with recent work on solving polynomial equations over finite fields and the parameterized complexity of network dynamics. Recent Publications: His recent publications reflect a strong emphasis on theoretical foundations and algorithmic problem-solving in discrete mathematics and network systems. They span topics from computational algebra to dynamic network models, showing a deep integration of mathematical theory and computer science. Scientific Awards: No specific awards mentioned in the provided text. Teaching and Advising: Holger is deeply committed to innovative teaching, particularly through alternative grading systems like Grading for Growth . He is currently developing Algo-Learn , a self-testing e-learning platform that automatically generates and grades exercises for undergraduate algorithms and data structures courses. There is no mention of formal PhD or Master’s advisees in the provided content. Grants: He leads a DFG-funded project on the parameterized complexity of network dynamics, indicating active external research funding. Labs and Teams: While no formal lab name is provided, his GitHub repositories and research projects suggest he collaborates on algorithm visualization tools and open-source scientific software. His work on the color refinement algorithm demo and the COVID-19 plots indicates engagement in both educational and public-interest computing projects.
Mateusz Skomra is a CNRS researcher currently based at the Laboratoire d'analyse et d'architecture des systèmes (LAAS) in Toulouse, France, where he is a member of the POP research team. Previously, he held postdoctoral positions at École normale supérieure de Lyon and CNRS within the Laboratoire de l'Informatique du Parallélisme and the MC2 team. He earned his PhD from École polytechnique, Centre de Mathématiques Appliquées, under the supervision of Xavier Allamigeon and Stéphane Gaubert, as part of the INRIA Tropical team and Université Paris-Saclay. His research lies at the intersection of tropical geometry, convex optimization, algorithmic game theory, and algebraic complexity. He has made significant contributions to the understanding of tropical convexity, semidefinite programming over nonarchimedean fields, mean payoff and stochastic games, and algebraic reconstruction problems. His work often bridges theoretical mathematics with computational aspects, particularly in optimization and complexity theory. The analysis of his recent publications reveals a consistent focus on tropical methods in optimization and game theory, with increasing attention to algorithmic and computational implications. His work connects deep algebraic structures with practical algorithm design, especially in deriving complexity bounds and developing solution methods for games and polynomial systems. Key recurring themes include value iteration, derandomization, Minkowski sums, and the interplay between geometry and algebra in computational settings. Prix Dodu for best presentation by a young researcher Mateusz Skomra has advised doctoral research during his PhD under leading experts and continues to mentor students through master’s internships, such as one on analyzing mean payoff games using sums-of-squares techniques. While specific grant details are not listed, his affiliations with CNRS, INRIA, and participation in numerous national and international workshops suggest active involvement in collaborative research projects. He frequently contributes to academic discourse through seminars and conference presentations across Europe. He is actively involved in research teams including the POP team at LAAS-CNRS, previously the MC2 team at ENS Lyon and the Tropical team at INRIA. These teams focus on mathematical computing, optimization, and theoretical computer science, providing a rich interdisciplinary environment for his work.
