Anna Levina is an Assistant Professor for Computational Neuroscience at the University of Tübingen , affiliated with the Department of Computer Science under the Faculty of Science. Her research focuses on the self-organization of neuronal activity, critical dynamics in neural networks, and the excitation/inhibition balance in cortical circuits. Current positions: Assistant Professor (since 2018), Group Leader (2017-2018), Equality Officer (Computer Science) Previous roles: IST Fellow (2015-2017), Associated Researcher (2011-2015), Postdoc/PI (2011-2015), Postdoc (2008-2011) Her research integrates mathematical modeling , statistical physics , and computational neuroscience to study criticality phenomena, neural avalanches, and adaptive network dynamics. Key interests include: Self-organized criticality in neural systems Excitation/Inhibition balance mechanisms Network topology and dynamics Timescale analysis in neural processing Stochastic modeling of neural activity Recent publications reveal trends in understanding critical dynamics across biological and artificial networks, with applications to memory systems, sensorimotor integration, and disease modeling. She has received recognition as an IST Fellow .
Mehmet Esat Belviranli is an Assistant Professor in the Computer Science Department at the Colorado School of Mines, where he directs the High Performance Systems and Software Lab (HyperSys). His research focuses on increasing resource utilization in heterogeneous architectures through runtime systems, scheduling algorithms, and performance modeling, with publications in top venues including MICRO, PPoPP, and SC. Education: Ph.D. in Computer Science, University of California, Riverside (2016) M.S. in Computer Science, Bilkent University (2009) B.S. in Computer Science, Bilkent University (2006) Belviranli's research spans heterogeneous architectures, runtime systems, performance modeling, parallel programming, autonomous computing, deep learning acceleration, cyber-physical systems, and edge-cloud platforms. His work develops analytical models and programming abstractions to address resource management, scheduling, and security challenges in diversely heterogeneous systems, with applications in edge computing, autonomous systems, and machine learning acceleration. Recent projects emphasize real-world constraints and security implications. His publication trends reveal increasing focus on edge-cloud resource management (e.g., HARNESS), security vulnerabilities in heterogeneous systems (e.g., MC3), and deep learning acceleration under resource constraints. Key themes include memory contention modeling, scheduling for cyber-physical systems, and concurrent DNN execution, reflecting a shift toward practical deployment in security-sensitive edge environments. Scientific Awards: U.S. Air Force Research Lab Summer Faculty Fellowship Award (2022) U.S. Air Force Research Lab Summer Faculty Fellowship Award (2021) Oak Ridge National Laboratory Significant Event Award (2019) Best Paper Finalist, IEEE HPEC 2018 Outstanding Paper Award, DATE 2024 Belviranli mentors Ph.D. students Ismet Dagli (MLCommons Rising Star 2024, CGO'24 SRC finalist) and Justin Davis (DATE'24 Outstanding Paper Award winner). He has secured $2M+ in funding from NSF, DoE, and SRC, including an NSF-SaTC grant on mobile security (2024), a DoE grant on superconductive systems (2023), and an NSF FuSe grant on graphene nanoribbons (2023), often leading multi-institutional teams from Rochester, Virginia, Arizona, and Minnesota. The HyperSys Lab develops ecosystems for high-performance heterogeneous systems, with recent projects including HARNESS for edge-cloud resource management and MC3 for mobile SoC security. The lab has received equipment donations from Google Coral.ai and Xilinx, and collaborates with national labs on security challenges and next-generation semiconductor technologies.
Béla Bollobás is a renowned mathematician affiliated with the University of Memphis as the Jabie Hardin Chair of Excellence in Combinatorics and the University of Cambridge as a Fellow of Trinity College and Honorary Professor at the Centre for Mathematical Sciences. His work spans combinatorics, probability theory, and graph theory, with significant contributions to percolation and random graphs. Dr. Rer. Nat. (Budapest, 1967) Ph.D. (Cambridge, 1972) Sc.D. (Cambridge, 1984) Bollobás pioneered extremal graph theory, random graphs, and probabilistic combinatorics. He introduced novel graph polynomials and advanced bootstrap percolation models, impacting both theoretical mathematics and statistical physics. His research includes inhomogeneous random graphs and cellular automata in random environments. His selected publications reveal a focus on percolation thresholds, graph invariants, and stochastic processes. Notably, he derived sharp thresholds for bootstrap percolation and defined critical probabilities for Voronoi percolation. Senior Whitehead Prize (2007) Fellow of the Royal Society (2011) Foreign Member, Hungarian Academy of Sciences (1990) Foreign Member, Polish Academy of Sciences (2013) Honorary Doctorate, Adam Mickiewicz University (2013) Szechenyi Prize (2017) Bollobás has supervised over 50 Ph.D. students and authored over 450 publications, including 10 books. He co-founded the journal Combinatorics, Probability and Computing and served on eight editorial boards. He organized numerous conferences, including Bill Tutte and Paul Erdős events.
Mingsheng Ying is a Distinguished Professor and Research Director of the Centre for Quantum Computation and Intelligent Systems (QCIS) at the Faculty of Engineering and Information Technology, University of Technology Sydney, Australia. He also holds the position of Cheung Kong Professor at the State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China. Professor Ying graduated from the Department of Mathematics, Fuzhou Teachers College, Jiangxi, China, in 1981. His primary research interests span quantum computation (particularly quantum programming and model-checking quantum systems), programming theory and formal methods, and the foundations of artificial intelligence (focusing on logic and uncertainty). As an author of the books "Foundations of Quantum Programming" (Elsevier - Morgan Kaufmann 2016) and "Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs" (Springer-Verlag, 2001), he has published over 100 papers in top international journals and conferences. His recent research publications demonstrate a strong focus on quantum programming languages, verification techniques for quantum systems, and the theoretical foundations of quantum computation. The trend in his work shows increasing emphasis on formal verification methods for quantum systems, particularly model-checking techniques for quantum Markov chains and quantum processes. His research bridges theoretical computer science with quantum information theory, creating frameworks for reliable quantum software development. Editorial Board, Artificial Intelligence, Elsevier, Amsterdam Editorial Board, Fuzzy Sets and Systems, Elsevier, Amsterdam Vice President, International Fuzzy Systems Association (elected in 2005) Program Chair, IFSA 2005, World Congress of International Fuzzy Systems Association Chairman, Chinese Association of Fuzzy Systems and Mathematics Professor Ying has secured significant research funding including multiple Australian Research Council Discovery Projects such as "Model-checking quantum Markov chains: towards verification techniques for quantum cryptographic systems" (2013-2015) and "Process algebra approach to distributed quantum computation and secure quantum communication" (2011-2013). His work has also received funding from the National Natural Science Foundation of China and Tsinghua University. At QCIS, he leads research in quantum software theory and methodology, with applications in quantum cryptography and secure communication.
Elette Boyle is an Associate Professor at Reichman University (IDC Herzliya) and a Senior Scientist at NTT Research . She holds a Ph.D. in Mathematics from MIT (advised by Shafi Goldwasser and Yael Tauman Kalai) and an undergraduate degree from Caltech . Education Ph.D. in Mathematics, MIT B.S. in Mathematics, Caltech Her research focuses on cryptographic solutions for secure data processing , particularly in secure multi-party computation , function/homomorphic secret sharing , and distributed point functions . Recent work explores topology-hiding communication , memory checking complexity , and sublinear-communication MPC . Key trends in her publications include: Advancements in Function Secret Sharing for branching programs and sparse vectors. Efficient Secure Multi-Party Computation protocols with preprocessing. Information-theoretic and computational Topology-Hiding Broadcast schemes. Optimized Oblivious Transfer with constant computational overhead. Scientific Awards European Research Council (ERC) Award Israeli Science Foundation (ISF) Grant United States Air Force Office of Scientific Research (AFOSR) Grant Google Research Scholar Award International Association for Cryptologic Research (IACR) Recognition As Director of the Foundations & Applications of Cryptography (FACT) Research Center , she leads collaborative work with institutions like Technion Israel , Cornell University , and NTT Research . Her students include Pierre Meyer (Ph.D.) , Matan Hamilis (Ph.D.) , and D'or Banon (MSc.) .
Shiva Nejati is a Professor at the University of Ottawa 's School of Electrical Engineering and Computer Science . He holds a PhD in Computer Science from the University of Toronto and previously worked as a Senior Scientist (2012-2019) and Scientist (2009-2012) at the SnT Centre (University of Luxembourg) and Simula Research Laboratory. Research focus: Software engineering for cyber-physical systems (autonomous vehicles, IoT), blending formal verification, machine learning, and search-based testing Key tools developed: ARIsTEO, SOCRaTEs, SimCoTest, EPIcuRus Editorial roles: Associate Editor for EMSE Journal (2025–), ASE Journal (2025–), IEEE Transactions on Software Engineering (2020–2024) His work combines formal methods , empirical software engineering , and AI/ML to address verification challenges in complex systems, particularly through evolutionary algorithms and surrogate modeling . Notable collaborations include industry partners in telecommunications, automotive, and aerospace sectors. Recent publications emphasize large language models for requirements analysis, adversarial testing of vision systems, and multi-objective optimization for test generation. His Sedna Research Lab actively trains graduate students in these cutting-edge methodologies.
Michela Becchi is an Associate Professor in the Department of Electrical and Computer Engineering at North Carolina State University. She specializes in computer architecture, systems software, and applications, with a focus on heterogeneous systems, parallel algorithms, and acceleration techniques for bioinformatics, pattern recognition, and quantum computing. Her work spans multi-core CPUs, GPUs, FPGAs, and distributed clusters, emphasizing the boundary between hardware and software design. Dr. Becchi holds a Ph.D. and Master’s degree in Computer Engineering from Washington University in St. Louis (2009) and a Bachelor’s degree in Computer Engineering from Politecnico di Milano, Italy (2000). Her research has been recognized with prestigious awards, including the NSF CAREER Award (2015) and the University of Missouri System President Award for Early Career Excellence (2016). Her research interests include compiler and runtime techniques for heterogeneous systems, acceleration of bioinformatics algorithms, and high-speed networking applications. She has pioneered frameworks for efficient data transformation, GPU-accelerated compression, and memory-efficient graph algorithms for quantum computing. Her work also explores thread coarsening, mixed-precision auto-tuning, and secure multi-core processor design. Key contributions include the PILOT runtime system for GPU memory management, the GPU-FPtuner auto-tuner for floating-point applications, and innovative approaches to automata processors for genomic analysis. Her publications emphasize reproducible accuracy in scientific simulations and the optimization of irregular applications on many-core platforms.
David Doty is a Professor in the Department of Computer Science at the University of California, Davis . His research focuses on the intersection of molecular systems and computation , exploring how natural processes like chemical reactions , DNA nanotechnology , and self-assembly can perform computation. He also investigates connections to theoretical computer science, including distributed computing and algorithmic information theory . Doty's work bridges physics , chemistry , and biology through rigorous computational models like the Tile Assembly Model and Population Protocols . His research program includes software development ( scadnano , ppsim ), theoretical analysis, and collaborations with experimentalists. He teaches courses on theory of computation and molecular computing , and has advised numerous students in his research group. His publications cover topics such as algorithmic self-assembly , chemical reaction networks , and thermodynamic binding networks , with a focus on understanding fundamental computational and physical limits. Key software tools developed by his group include scadnano for DNA design and ppsim for population protocol simulations. Doty's recent research trends explore rate-independent chemical computing , error correction , and stochastic modeling in molecular systems. Current academic activity includes teaching ECS 120 (Undergraduate Theory of Computation), ECS 220 (Graduate Theory of Computation), and ECS 232 (Theory of Molecular Computation). He maintains a research lab in 2306 Academic Surge and continues to publish in leading conferences like DNA Computing and CMSB .
Marcin Jurdzinski is an Associate Professor (Reader) in the Department of Computer Science at the University of Warwick , UK. He has been a faculty member since 2004 and is a core member of the Foundations of Computer Science and Discrete Mathematics and its Applications research groups. University: University of Warwick School: Faculty of Science Department: Department of Computer Science Position: Associate Professor (Reader) Email: Marcin.Jurdzinski@warwick.ac.uk Office: CS2.19 His research lies at the intersection of algorithms, game theory, automata, and logic , with a strong emphasis on formal verification , model checking , and theoretical computer science . He is best known for his foundational work on parity games , including the development of small progress measures and discrete strategy improvement algorithms. The recent publications reveal a consistent focus on computational complexity in games and verification. Key themes include stochastic games, timed automata, bisimilarity, and quantitative analysis . His work often bridges theoretical insights with practical verification challenges, especially in real-time and probabilistic systems. He has supervised several PhD students and hosted postdoctoral researchers such as Laure Daviaud and Alexander Kozachinskiy. He has led EPSRC-funded projects including Solving Parity Games in Theory and Practice and Counter Automata: Verification and Synthesis . PhD Students: Aditya Prakash, Thejaswini K. S., Michail Fasoulakis, John Fearnley, Michal Rutkowski, Ashutosh Trivedi Postdocs: Laure Daviaud, Alexander Kozachinskiy He is actively involved in the academic community, serving on the steering committee of the Highlights of Logic, Games and Automata conference and on program committees for major venues such as CONCUR, ICALP, and LICS. He has also organized workshops including FORMATS and ICALP co-located events.
Sabine Süsstrunk is a Full Professor and Director of the Images and Visual Representation Laboratory (IVRL) at EPFL's School of Computer and Communication Sciences. She holds a BS in Scientific Photography from ETH Zürich, MS from Rochester Institute of Technology, and PhD from University of East Anglia. Her career includes positions at Hewlett-Packard Labs and Corbis Corporation. Her research explores computational imaging, computational photography, color processing, computer vision, and image quality. Key interests include near-infrared applications, multispectral imaging, and computational aesthetics. Her work bridges hardware and software solutions for imaging challenges. Publications demonstrate consistent focus on advancing generative models (diffusion models, neural cellular automata), 3D reconstruction (NeRF variants), and media integrity (DeepFake detection). Recent trends show increased emphasis on 3D vision, robustness in generative AI, and video analysis. Awards & Honors: IS&T/SPIE Electronic Imaging Scientist of the Year (2013) Raymond C. Bowman Teaching Award (2018) EPFL AGEPoly IC Polysphere Award (2020) 8 Best Paper/Demo Awards Fellowships: IEEE, IS&T, ELLIS, AIIA She leads the IVRL lab and advises PhD candidates while serving as President of the Swiss Science Council. Research is supported through competitive grants and industry collaborations.
Jeffrey Heinz is a Professor at Stony Brook University, with a joint appointment in the Department of Linguistics and the Institute for Advanced Computational Science. He holds a Ph.D. from UCLA (2007) and previously served on the faculty at the University of Delaware from 2007–2017. His research bridges theoretical linguistics, computational learning theory, and formal language models, focusing on phonology, linguistic typology, and grammatical inference. He has contributed to influential works on computational phonology and edited volumes on topics like phonological stress and learning theory. Key academic achievements include the 2017 Linguistic Society of America Early Career Award for contributions to computational inference in language. His work emphasizes the intersection of formal models and empirical linguistics, with applications to reduplication, phonological processes, and machine learning benchmarks like MLRegTest. Heinz has co-authored a book on grammatical inference and guest-edited special issues in Machine Learning and Phonology . His research also extends to interdisciplinary applications, such as modeling human-robot interaction and pediatric motor rehabilitation through grammatical inference techniques.
Cem Say is a Professor in the Department of Computer Engineering at Boğaziçi University's Faculty of Engineering, where he has established himself as a leading researcher in theoretical computer science and artificial intelligence. His academic journey began with the completion of his doctoral dissertation titled Qualitative System Identification in 1992, which was the first thesis of Boğaziçi University's Computer Engineering PhD program. Professor Say's research interests span multiple domains of computer science, with significant contributions to quantum computing, artificial intelligence, and theoretical computer science. His early work focused on qualitative reasoning and simulation, particularly through the QSIM algorithm, where he made significant improvements to filtering techniques and addressed challenges in representing physical systems. Over time, his research evolved toward quantum computation, where he has made substantial contributions to quantum finite automata theory, space-bounded quantum computation, and quantum complexity classes. His recent work explores the energy complexity of computation, bridging theoretical computer science with thermodynamics. His publication record shows a clear evolution from classical AI and qualitative reasoning toward quantum computation. The most recent articles demonstrate his focus on space-bounded quantum computation, energy complexity of regular languages, and interactive proof systems with minimal resources. His work consistently addresses fundamental questions about computational limits, particularly in quantum and sublogarithmic-space models. Professor Say has also made significant contributions to science communication through several books written for general audiences, including 50 Soruda Yapay Zekâ (2018), Yeni Dünya, Yeni Ağ (2020), and En Hakiki Mürşit (2021), which explain complex concepts in artificial intelligence and scientific methodology in accessible terms. Throughout his career, Professor Say has been actively involved in the Turkish academic community, editing proceedings for multiple Turkish symposia on artificial intelligence and neural networks. His doctoral dissertation established foundational work in qualitative system identification, and his subsequent research has consistently pushed boundaries in theoretical computer science, particularly in quantum computation where he has collaborated extensively with Abuzer Yakaryılmaz and other researchers.
Victor Vianu is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego, within the Jacobs School of Engineering. His work focuses on the intersection of database theory and verification techniques, particularly in the context of data-driven business processes and workflows. Research Interests Professor Vianu's primary research interests span database theory, verification of database-driven systems, and computational logic. His current work focuses on automatic verification of interactive data-driven web services and business processes, exploring how to provide customized workflow views for different stakeholders in organizational settings. His research addresses significant technical challenges at the intersection of data management and process modeling, requiring novel approaches that go beyond traditional relational algebra to handle both data and process aspects simultaneously. His work on data-driven business processes investigates how to specify, analyze, and synthesize views of workflows that expose only information relevant to specific user roles. This research has important applications in e-commerce, digital government, healthcare, and scientific infrastructure, where different stakeholders require varying levels of workflow abstraction and detail. Research Contributions and Trends Professor Vianu's recent publications demonstrate a consistent focus on the integration of data management and workflow processes. His work has evolved from foundational database theory to increasingly practical applications in business process management. A key trend in his research is the development of formal frameworks for workflow views that maintain consistency while providing appropriate abstractions for different user roles. His publications reveal a progression from theoretical foundations to more applied aspects of workflow verification and integration, often in collaboration with researchers from INRIA and other institutions. Advising and Research Support Professor Vianu leads the UCSD Database Laboratory, which conducts research on database systems and theory. He currently advises graduate student Marysia Tran and has likely mentored numerous other students throughout his career. His research is supported by the National Science Foundation under grant "Views of Data-Driven Business Processes: Foundations and Applications" (NSF Project III 1815247). This project brings together techniques from logic, automata theory, complexity theory, algorithms, and automatic verification to address challenges in workflow management. Research Environment Professor Vianu is an active member of the UCSD Database Laboratory, which maintains a regular research seminar series. He has collaborated extensively with researchers including Alin Deutsch (UC San Diego), Serge Abiteboul (INRIA and ENS-Paris), Pierre Bourhis (Univ. of Lille and CNRS), and Adrien Koutsos (ENS Cachan). His foundational work includes co-authoring the influential textbook "Foundations of Databases" with S. Abiteboul and R. Hull, which remains a standard reference in database theory.
Aniello Murano is a Professor of Computer Science at the Department of Electrical Engineering and Information Technologies , University of Naples Federico II. He serves as Scientific Director of the ASTREA (Automated Strategic Reasoning) Laboratory and leads cutting-edge research in Artificial Intelligence, Strategic Reasoning, Multi-Agent Systems , and Formal Verification . Research Interests : Strategic reasoning under perfect/imperfect information, specification/verification/synthesis of reactive systems, temporal/modal logics, automata theory, parity games, game theory, mechanism design, and formal languages. Notable Projects : PNRR Research Unit Coordinator (2023-2025) on Resilient AI, PRIN 2020 Unit Coordinator (RIPER: Resilient AI-Based Self-Programming and Strategic Reasoning), H2020-MSCA SEAL (Principal Coordinator). Awards & Honors : JPMorgan Faculty Research Award (2022), Royal Society Award (2016), Best Paper PRIMA (2015), INDAM Project Leader (2023), Italian Scientific Habilitation (2017-2018). Students & Postdocs : Supervised 6 PhD students (e.g., Silvia Stranieri, Vadim Malvone) and mentored postdocs such as Munyque Mittelmann and Bastien Maubert. Laboratory : Leads ASTREA Lab, focusing on automated strategic reasoning and resilient AI systems.
Gheorghe Paun is a Senior Researcher at the Institute of Mathematics of the Romanian Academy (1994–present) and a Visiting Researcher at the University of Sevilla (2009–present). He earned his Ph.D. in Mathematics from the University of Bucharest (1977), supervised by Solomon Marcus. His research spans Automata and Language Theory (descriptional complexity, regulated rewriting), Natural Computing (DNA computing, membrane computing), and he is the initiator of membrane computing . Education : M.Sc. in Mathematics (1974), University of Bucharest (specialization: computer science) Ph.D. in Mathematics (1977), University of Bucharest His work includes foundational contributions to DNA computing (book DNA Computing. New Computing Paradigms , 1998) and membrane computing (book Membrane Computing. An Introduction , 2002). He has collaborated with over 100 researchers globally and advised multiple Ph.D. students, including Victor Mitrana and Gianina Georgescu. His scientific awards include the Gheorghe Lazar award (1981), Corresponding Member of the Romanian Academy (1997), Doctor Honoris Causa from Silesian University of Opava (2007), and recognition as an ISI Highly Cited Scientist (2007). He also holds honorary citizenships in Curtea de Arges (1998), Arges County (2007), and Cicanesti village (2009). Paun has served on editorial boards for journals like Theoretical Computer Science. Natural Computing Series and Natural Computing , and organized major workshops in membrane computing. His academic contributions include over 150 publications and editorial roles in 20+ journals.
