Michael Carbin is the Jamieson Career Development Assistant Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT) and leads the MIT Programming Systems Group. His research focuses on programming systems that address system uncertainty to enhance performance, energy efficiency, and resilience, particularly in environments involving neural networks , approximate computing , and unreliable hardware . His work spans probabilistic programming , quantum computing , and machine learning systems . Articles highlight contributions in pruning neural networks , quantum data structures , and compiler optimization , reflecting trends in deep learning , formal verification , and language-driven systems . Scientific Awards : MIT Frank E. Perkins Award (2020) Sloan Research Fellowship (2020) Facebook Research Award (2019) NSF CAREER Award (2018) Best Paper Awards at OOPSLA (2013, 2014) He has advised numerous graduate students and postdocs including Eric Atkinson, Cambridge Yang, and Charles Yuan, and served on program committees for conferences like POPL, OOPSLA, and ICLR. His group collaborates with institutions such as MIT CSAIL and explores applications in quantum algorithms and probabilistic inference .
Paul Gölz is an Assistant Professor at Cornell University's School of Operations Research and Information Engineering (ORIE), with affiliations in Computer Science. His research focuses on computational social choice, algorithmic fairness, and AI ethics, addressing topics like democratic innovation, fair resource allocation, and AI systems for diverse users. Education: Undergraduate studies at Saarland University (Germany), PhD in Computer Science from Carnegie Mellon University, followed by postdoctoral research at Harvard University, UC Berkeley, and the Simons Laufer Mathematical Sciences Institute. His work has been recognized with awards including the JPMorgan Chase AI Research Fellowship (2021) and honorable mentions for prestigious dissertation awards (Dantzig and ACM SIGecom). Research Highlights : Developed Panelot, a tool for selecting citizens' assemblies using state-of-the-art algorithms. His work on fair refugee resettlement and apportionment methods has been featured in Operations Research and Nature . Recent projects include AI alignment distortion analysis and generative social choice mechanisms. Teaching : Teaches Optimized Democracy (Spring 2025) and Mathematical Programming (Fall 2024). Supervises PhD students in ORIE, focusing on interdisciplinary applications of optimization and social choice. Awards & Grants : Received a $40K Structural Democracy Fellowship (Crankstart) and an OpenAI grant for Democratic Inputs to AI. Active in policy briefs (e.g., mini-public selection strategies). Labs/Tools : Co-developed Panelot.org , a nonprofit platform for fair citizen assembly selection. Active in open-source tool development for social choice applications.
Ashley Montanaro is Professor of Quantum Computation in the School of Mathematics at the University of Bristol, and co-founder of the quantum software startup Phasecraft. He is a member of the Quantum Information Theory research group at Bristol. His research focuses on the theory of quantum computing, with particular interest in quantum algorithms, computational complexity, quantum query and communication complexity, and classical algorithms. His work spans both theoretical foundations and practical applications of quantum computing. Montanaro's research output shows significant trends toward quantum algorithms for optimization problems, quantum computational supremacy, and bridging theoretical advances with practical implementation challenges. His publications span foundational quantum information theory to applied quantum algorithms, demonstrating a versatile research program that connects computer science with quantum physics. Among his professional activities, Montanaro served on the QIP steering committee (2016-2018) and was an editor for the Quantum journal until 2019. He has been active in conference organization, serving on program committees for ITCS 2018, AQIS 2017 and 2015, QIP 2015, and TQC 2014 and 2013, reflecting his standing in the quantum computing research community. He has supervised numerous PhD students including Josh Blake, Jorja Kirk, Sheila Perez Garcia, Sami Boulebnane, Jan Lukas Bosse, Lana Mineh, Joao F. Doriguello, Chris Cade, Sam Pallister, and Stephen Piddock. His teaching includes Quantum Computation (MATHM0023) which he has taught since 2014 and Advanced Quantum Information Theory which he taught in 2015 and 2016. As co-founder of Phasecraft, Montanaro is actively translating theoretical quantum computing advances into practical software solutions, positioning him at the intersection of academic research and quantum technology commercialization.
Bernhard J. Berger is a Lecturer in the Department of Computer Engineering at the Institute of Embedded Systems, Hamburg University of Technology (TUHH). His research focuses on software security, static code analysis, machine learning, optimization, and research data management. He has held significant roles such as Program Committee member for ICPC 2025 and MSR 2025, and has received awards including the Best Reviewer Award (ICPC 2023) and Best Engineering Paper Award (SCAM 2019). His work spans interdisciplinary applications including maritime systems security, GPU-accelerated AI, and evolutionary algorithms. Recent studies emphasize AI-driven security tools (e.g., ML-SAST) and domain-specific language approaches to optimization (EvoAl). He has contributed to over 30 peer-reviewed publications, with notable work in IEEE Transactions on Software Engineering and Science of Computer Programming. Berger collaborates closely with industry through DAAD review committees and serves on artifact evaluation boards for ISSTA and ARES conferences. Education: Doctoral Thesis (2022), Diploma in Computer Science (2007) Key Projects: ArchSec tool suite, Threat Modeling Frameworks, Bauhaus static analysis methodology Lab Affiliation: Embedded Systems Design Group His advisory roles include Deputy of TUHH's Election Verification Committee and Session Chair at IEEE Congress on Evolutionary Computation 2023. Current research trends integrate machine learning with static analysis for automated vulnerability detection, while also exploring explainable AI techniques for neural network optimization.
Marco Platzner is a Professor for Computer Engineering at Paderborn University , Germany. He serves as the Dean of Research for the Faculty of Computer Science, Electrical Engineering and Mathematics and heads the Department of Computer Science. Previously, he held research positions at ETH Zurich, Stanford University, GMD (now Fraunhofer IAIS), and Graz University of Technology. Education: Diploma and PhD in Telematics (Graz University of Technology, 1991 and 1996), Habilitation in Hardware-Software Co-Design (ETH Zurich, 2002) Research Interests focus on reconfigurable computing, approximate computing, self-* computing, and embedded systems. His work addresses hardware security, FPGA design, and sustainable AI in data centers. Current projects include energy-efficient AI through deep neural network approximation for FPGAs (EKI-App) and lifecycle sustainability of socio-technical systems (SAIL). Publication Trends show expertise in FPGA security, approximate circuit synthesis, robotics, and hardware acceleration. Collaborations span robotics (ROS 2 integration), AI (transformer optimization), and cybersecurity (Trojan detection). Scientific Awards: ACM SIGDA Hall of Fame (2020) Significant Paper Award (FPL 2015) Best Paper Awards at IEEE ISVLSI (2024), ARC (2018), IEEE ReConFig (2015), and others Weierstraß Prize for Teaching (2008) Leadership Roles include membership in the board of Paderborn Center for Parallel Computing (PC2) and the Jenny Aloni Centre for Early Career Researchers. He has contributed to EU FP7 FET project EPiCS and German priority programs on embedded systems and organic computing.
Holger Fröning is a full professor at Heidelberg University’s Institute of Computer Engineering (ZITI), where he leads the Hardware and Artificial Intelligence (HAWAII) Lab. His research focuses on embedded machine learning , high-performance computing , and hardware-software co-design , with emphasis on resource efficiency, power optimization, and emerging architectures like analog , photonic , and resistive memory systems. He has held leadership roles including Managing Director of ZITI (2023–present) and Dean of Studies for Computer Science (2019–2022) , and has collaborated with institutions such as NVIDIA Research, Chinese Academy of Sciences, and Graz University of Technology. Research Trends : His recent publications explore Bayesian neural networks , green machine learning , analog computing noise mitigation , and GPU/FPGA optimization . Articles highlight photonic computing for AI , memory-efficient training , and hardware-aware DNN compression . Scientific Awards : 2025 HiPEAC Paper Award (Nature Computational Science) 2014 Google Faculty Research Award Multiple Best Paper Awards (IPDPS, ICPP, ECML-PKDD workshops) Leadership & Service : Organized workshops (WEML, ITEM, F4HD), chaired tracks at EuroPar and ISC, and served on program committees for ICPR, ECAI, and FPL. Education & Affiliations : PhD and MSc from University of Mannheim (2007/2001). Sponsors include DFG, FWF, FFG, NVIDIA, SAP, and XILINX.
Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University. His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty. Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University. Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.
Peter Benner is a Professor and Director at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, where he leads the Computational Methods in Systems and Control Theory group. He also holds an Honorarprofessor position for Mathematics at Otto-von-Guericke Universität Magdeburg since 2011. Benner has previously served as Managing Director of the Max Planck Institute during multiple periods (2013-2014, 2021-2022, and 2025-2026), demonstrating his leadership in the field. Benner's research focuses on Scientific Machine Learning, Numerical Linear and Multilinear Algebra, Model Order Reduction and Reduced-order Modeling, Numerical Methods in Systems and Control Theory, PDE Constrained Optimization, High-performance and Power-aware Computing, and Mathematical Software development. His work bridges theoretical mathematics with practical engineering applications, particularly addressing challenges in large-scale dynamical systems. Analysis of his recent publications reveals a strong emphasis on developing efficient computational methods for complex systems. Benner has pioneered approaches combining model order reduction with tensor methods to tackle high-dimensional problems in uncertainty quantification and PDE-constrained optimization. His work shows a consistent trend toward integrating data-driven techniques with traditional model-based approaches, particularly for nonlinear and parametric systems. Throughout his career, Benner has actively mentored students and collaborated with researchers worldwide, delivering numerous invited talks at prestigious institutions and conferences across Europe, North America, and Asia. His research has received significant funding, supporting the development of mathematical software and computational methods for industrial applications. Benner leads the Computational Methods in Systems and Control Theory department at the Max Planck Institute, which focuses on developing and implementing advanced numerical methods for large-scale dynamical systems. The group maintains strong connections with both theoretical mathematics and practical engineering applications, particularly in fluid dynamics, energy systems, and control theory.
Prof. Dr. Michael Ulbrich is a full professor and Chair of Mathematical Optimization at the Technical University of Munich (TUM), within the School of Computation, Information and Technology. He has held this position since 2006 and previously served as Dean of Studies (2007–2010) and Vice Dean of the Faculty of Mathematics (2012–2015). His research focuses on nonlinear optimization, optimal control, and numerical analysis, with applications in fluid dynamics, shape optimization, and PDE-constrained systems. He leads projects in the DFG SPP 1962 and IGDK 1754, and has received prestigious awards including the Howard Rosenbrock Prize (2015) and the Doctoral Award from the TUM Association of Friends (1996). Ulbrich is Editor-in-Chief of Optimization and Engineering and contributes to multiple journals. His work bridges theoretical foundations and practical applications, including CO2 sequestration, fluid-structure interaction, and distributed optimization algorithms. Education: PhD (1996), Habilitation (2002) in Mathematics at TUM. Research stays at Rice University (USA) under DFG funding. Research Areas: Semismooth Newton methods, PDE-constrained optimization, optimal control of Navier-Stokes equations, and distributed parameter systems. Awards: Rosenbrock Prize, Teaching Excellence Awards, and recognition for doctoral work. Leadership Roles: Department Head of Mathematics (2022–), Member of TUM Senate (2019–2022), and Co-Chair of GAMM 2018. Ulbrich has authored influential textbooks like Semismooth Newton Methods for Variational Inequalities and Nichtlineare Optimierung . His recent projects include OptiGeoS (2024–2026) and collaborations on nonsmooth optimization and stochastic algorithms. His academic contributions span over 100 publications, emphasizing both algorithmic innovation and rigorous mathematical analysis.
Vladimir Spokoiny is a Professor at the Departments of Mathematics and Economics of the Humboldt University of Berlin and Head of the Research Group "Stochastic Algorithms and Nonparametric Statistics" at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) in Berlin, Germany. His research spans multiple areas of statistics, machine learning, and financial mathematics, with significant contributions to nonparametric statistics, high-dimensional data analysis, and statistical methods in finance. Spokoiny received his M.Sc. in applied mathematics from the Moscow Institute of Railway Engineering in 1981 and his Ph.D. in mathematics from Lomonosov Moscow State University in 1988. He completed his Habilitation at Humboldt University in 1996. His academic career includes positions at the All-Union Institute of Railway Transport in Moscow, the Institute for Information Transmission Problems in Moscow, and the Institute for Applied Analysis and Statistics in Berlin before joining the Weierstrass Institute and Humboldt University where he has been a professor since 2002. Spokoiny's research focuses on adaptive nonparametric smoothing and hypothesis testing, high dimensional data analysis, statistical methods in finance, image analysis with applications to medicine, classification, and nonlinear time series. His work often addresses the challenges of nonstationarity in time series data and develops innovative methods for volatility estimation and risk management. He has made significant contributions to the development of adaptive weights smoothing procedures, which have applications in image processing, community detection, and manifold learning. His recent work has expanded into high-dimensional statistics, Bayesian inference, and optimization methods for machine learning, with publications demonstrating novel approaches to Gaussian approximation, Laplace methods, and statistical inference in non-Euclidean spaces. Spokoiny has supervised numerous PhD students including Oliver Reiss, Danilo Mercurio, Ying Chen, Elmar Diederichs, and Mstislav Elagin, whose research has focused on mathematical finance, time series analysis, and statistical methods. He serves as an Associate Editor for The Annals of Statistics (since 2004) and Statistics and Decisions (since 2002), and has previously served on the editorial board of the Journal of Statistical Planning and Inference. His professional activities include reviewing for major statistical journals including Annals of Statistics, Bernoulli, Econometrica, and Journal of American Statistical Association, as well as reviewing grant proposals for the National Science Foundation (USA), German Research Foundation, and Netherlands Organisation for Scientific Research. Spokoiny is a member of several professional societies including the International Statistical Institute, American Statistical Association, Institute of Mathematical Statistics, and Bernoulli Society. He is fluent in Russian (mother tongue), English, and German, and has good knowledge of French. His research group at WIAS focuses on developing novel statistical methodologies with applications across various scientific domains, particularly emphasizing adaptivity and robustness in complex data environments. The group's work has significant implications for financial risk management, medical imaging, and machine learning applications, with recent publications addressing fundamental questions in high-dimensional statistics and nonparametric inference.
Warut Suksompong is an Assistant Professor in the School of Computing at the National University of Singapore (NUS), where he holds the NUS Presidential Young Professorship. Previously, he was a postdoctoral researcher at the University of Oxford, hosted by Edith Elkind, and completed his PhD at Stanford University under Tim Roughgarden. He holds bachelor's and master's degrees from MIT. His research focuses on algorithmic game theory, computational social choice, mechanism design, and interdisciplinary problems at the intersection of computer science, economics, mathematics, and operations research. He is particularly known for contributions to fair division, including envy-freeness, proportionality, and maximin fairness in both divisible and indivisible resource allocation contexts. Key awards include the IJCAI 2021 Distinguished Paper Award for work on dividing land with geometric constraints and the WINE 2021 Best Student Paper Award for research on funding public projects via the Nash product rule. His work bridges theoretical foundations with practical applications, addressing challenges such as connectivity constraints, budget allocation, and social choice mechanisms. He has authored over 100 publications in top conferences and journals, including SIAM Journal on Discrete Mathematics, Artificial Intelligence, and Games and Economic Behavior. His research has been supported by grants from NUS and international collaborations.
Anastasia Ailamaki is a Professor at the Swiss Federal Institute of Technology in Lausanne (EPFL), renowned for her work in database systems and data management . Her research focuses on optimizing query processing for modern hardware, particularly GPUs and heterogeneous systems, and advancing cloud data analytics with serverless architectures like PixelDB . She has co-authored influential frameworks for adaptive query optimization , hardware-conscious database engines , and model-relational data management . Key research areas: GPU acceleration , HTAP , query approximation , spatial data processing , and cloud-native databases . Recent work emphasizes cross-task optimizations in distributed environments, efficient sampling , and context-aware joins integrating vector embeddings. In 2023, she contributed to adaptive recursive query optimization and speculative K-means clustering, while 2024 publications addressed proportional caching (HPCache) and model-relational systems . Her collaborations span institutions such as MIT, Microsoft, and ETH Zurich, with publications in top venues like SIGMOD , VLDB , and ICDE .
Aleksandar Bojchevski is a full professor of Computer Science at the University of Cologne, leading the Trustworthy Artificial Intelligence Lab (TAIL). His research focuses on developing robust, interpretable, and privacy-preserving machine learning models, particularly graph neural networks (GNNs). The lab emphasizes trustworthiness in high-stakes applications through methods that handle noisy, adversarial, or anomalous data. Bojchevski holds a PhD and PostDoc from the Technical University of Munich, advised by Stephan Günnemann. Previously, he was faculty at CISPA Helmholtz Center for Information Security. His work bridges theory and practice, addressing adversarial robustness, uncertainty quantification, and scalable GNN techniques. Research interests include: robustness certification for GNNs, conformal prediction, adversarial attack analysis, and privacy-aware machine learning. His lab actively collaborates with RWTH Aachen and organizes events like the Learning on Graphs Meet Up. Recent achievements include a teaching award for the Machine Learning lecture (SS 24) and NeurIPS 2024 acceptance of SVFT: Parameter-Efficient Fine-Tuning with Singular Vectors . Open positions are available in his group focusing on trustworthy ML topics. Key labs/teams: Trustworthy Artificial Intelligence Lab (TAIL), Center for Data and Simulation Science (CDS) as a core scientist.
Prof. Massimo Fornasier holds the Chair of Applied Numerical Analysis at the Technical University of Munich (TUM), within the School of Computation, Information and Technology and the Department of Mathematics. His research focuses on mathematical modeling, numerical analysis, and data-driven methods, particularly in areas like compression, sparse recovery, and optimization. He has made significant contributions to consensus-based optimization, control of multiagent systems, and applications in image/signal processing. Education: PhD in Computational Mathematics, University of Padua (2003) Postdoctoral fellowships at University of Vienna, Sapienza University of Rome, and Princeton University Awards: ERC Starting Grant (2012) START Prize (2011) Prix de Boelpaepe (2009) His work bridges theoretical analysis and computational methods, with applications ranging from compressive sensing to machine learning. Recent research emphasizes consensus-based optimization frameworks and their global convergence properties. Editorial roles include journals like Networks and Heterogeneous Media and Calcolo . He leads research groups in areas such as Data Science and Numerical Analysis at TUM.
Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.
