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

Daniel Abadiمشاهده پروفایل

استاد

• Database System Architecture
• Distributed Database Systems
• Scalable Transaction Processing
• +۳ مورد دیگر

Daniel Abadi is the Darnell-Kanal Professor of Computer Science at the University of Maryland, College Park, with an appointment in the University of Maryland Institute for Advanced Computer Studies. He leads the Data Systems Lab at Maryland (DSLAM) and has made significant contributions to database system architecture and implementation, particularly in scalable and distributed systems. Prof. Abadi's research focuses on database system architecture, especially at the intersection with scalable and distributed systems. He is best-known for the development of the storage and query execution engines of the C-Store (column-oriented database) prototype, which was commercialized by Vertica and eventually acquired by Hewlett-Packard, and for his HadoopDB research on fault tolerant scalable analytical database systems which was commercialized by Hadapt and acquired by Teradata. His current work includes deterministic distributed systems like Calvin and SLOG, which provide strictly serializable, low-latency, geographically replicated database transactions. Analysis of his recent publications reveals a strong focus on modern database challenges including transaction processing, distributed systems architecture, data mesh concepts, schema evolution, and IoT data management. His work consistently addresses the tension between consistency, availability, and performance in distributed database systems, with recent emphasis on moving beyond traditional two-phase commit protocols and exploring novel approaches to data architecture like data mesh. ACM Fellow Sloan Research Fellowship Churchill Scholarship NSF CAREER Award VLDB Best Paper Award Two VLDB Test of Time Awards (for C-Store and HadoopDB) 2008 SIGMOD Jim Gray Doctoral Dissertation Award 2013-2014 Yale Provost's Teaching Prize 2013 VLDB Early Career Researcher Award PhD dissertation advisor for Alexander Thomson and Jose Falerio, whose dissertations won SIGMOD Jim Gray Doctoral Dissertation Awards in 2015 and 2020 respectively Prof. Abadi has advised multiple PhD students, including Alexander Thomson and Jose Falerio, both of whom received the prestigious SIGMOD Jim Gray Doctoral Dissertation Award. His research has been supported by numerous grants including NSF funding for projects like SLOG. He maintains an active presence in the database community through his widely-read blog DBMS Musings and through service on program committees for major conferences including SIGMOD, VLDB, and CIDR. He leads the DSLAM research group at the University of Maryland, which focuses on cutting-edge database system research with strong industry connections and practical impact.

Daniel Abadiمشاهده پروفایل

استاد

• Database system architecture
• Distributed database systems
• Column-oriented databases
• +۵ مورد دیگر

Daniel Abadi is the Darnell-Kanal Professor of Computer Science at the University of Maryland, College Park. He leads the Data Systems Lab at Maryland (DSLAM) and is widely recognized for his groundbreaking contributions to database system architecture and implementation. Previously, he was a faculty member at Yale University where he received the Provost's Teaching Prize. Abadi's research primarily focuses on database system architecture, particularly at the intersection with scalable and distributed systems. He is best known for developing the storage and query execution engines of the C-Store prototype (a column-oriented database system commercialized by Vertica and later acquired by Hewlett-Packard), HadoopDB research (commercialized by Hadapt and acquired by Teradata), and deterministic distributed transactional systems like Calvin (currently being commercialized by Fauna). His work bridges theoretical innovation with practical industrial impact. Analysis of his recent publications reveals a consistent trajectory toward solving fundamental challenges in distributed database systems. His research has evolved from foundational work on column-stores and hybrid database architectures to cutting-edge innovations in geo-replicated transactions, concurrency control mechanisms, and the integration of machine learning with database systems. The trend shows increasing focus on practical implementations that address real-world scalability and performance challenges in large-scale data processing environments. ACM Fellow Churchill Scholarship recipient NSF CAREER Award winner Sloan Research Fellowship recipient VLDB Best Paper Award winner Two VLDB Test of Time Awards (for C-Store and HadoopDB) 2008 SIGMOD Jim Gray Doctoral Dissertation Award 2013-2014 Yale Provost's Teaching Prize 2013 VLDB Early Career Researcher Award Professor Abadi has successfully mentored several PhD students, most notably Alexander Thomson and Jose Falerio, both of whom won the prestigious SIGMOD Jim Gray Doctoral Dissertation Award for their work under his supervision. His research has been generously supported by multiple NSF grants including BIGDATA awards and other funding mechanisms that have enabled significant advances in database technology. He actively collaborates with industry partners, with several of his research projects leading directly to commercial products. At the University of Maryland, Abadi directs the Data Systems Lab at Maryland (DSLAM), which focuses on developing innovative database technologies that address contemporary challenges in data management. The lab's research spans distributed transaction processing, database architecture, and the integration of database systems with emerging computing paradigms. Notable projects include SLOG (Serializable, Low-latency, Geo-replicated Transactions), which eliminates traditional tradeoffs in distributed database design, and ongoing work in deterministic database systems that provide strong consistency guarantees without sacrificing performance.

• Theoretical Computer Science
• Algorithm Design and Analysis
• Graph Algorithms
• +۵ مورد دیگر

Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).

Ghaith Hiaryمشاهده پروفایل

استاد

• Computational Number Theory
• Analytic Number Theory
• Random Matrix Theory
• +۳ مورد دیگر

Ghaith Hiary is a Professor and Vice Chair for Graduate Recruitment in the Department of Mathematics at The Ohio State University. He holds a PhD from the University of Minnesota (2008). His research focuses on computational and analytic number theory, with emphasis on the Riemann zeta function, L-functions, random matrix theory, and asymptotic analysis. Hiary's work bridges theoretical mathematics and high-performance computation. He develops efficient algorithms (e.g., amortized-complexity methods) to evaluate zeta functions at extreme heights (e.g., near t=10 28 ), implemented in C++/Mathematica. His research uses random matrix models to study zeta-function moments and employs techniques like van der Corput estimates and hybrid methods for explicit bounds. His publications demonstrate consistent focus on zeta-function computations, factorization algorithms, and arithmetic biases. Recent work (2022-2025) explores invariant measures, Lehman's method generalizations, and sign changes in random multiplicative functions, maintaining strong ties to analytic and probabilistic number theory. Hiary shares code and datasets via GitHub, including implementations of T 1/3 algorithms for zeta computations. He collaborates with institutions like the University of Waterloo and maintains numerical databases of zeta zeros.

Dino Pedreschiمشاهده پروفایل

استاد

• Big Data Analytics
• Social Network Analysis and Mining
• Analysis of Human Mobility
• +۱۷ مورد دیگر

Dino Pedreschi is a Full Professor of Computer Science at the University of Pisa, affiliated with the Department of Computer Science (DI-UNIPI). He co-leads the Pisa KDD Lab, a joint research initiative between the University of Pisa and the Italian National Research Council’s Institute of Information Science and Technology, one of the earliest labs focused on data mining and knowledge discovery. His research spans Big Data Analytics , Social Network Analysis , Human Mobility Analysis , Privacy-by-Design , Explainable AI (XAI) , and ethical data mining . He is a pioneer in privacy-preserving data mining and has contributed significantly to understanding societal impacts of AI and big data. Recent publications highlight trends in explainable AI , fairness-aware data mining , urban mobility modeling , and socio-economic nowcasting , reflecting a strong interdisciplinary focus combining computer science, social science, and policy. Notable scientific awards include: Google Research Award on Privacy (2009) University of Pisa Ordine del Cherubino (2017) Pedreschi has played leadership roles in major conferences such as ECML/PKDD (Co-Chair 2004), ICDM (Vice-Chair 2005), and ICDE (Vice-Chair 2014). He founded the Business Informatics MSc program at the University of Pisa to train interdisciplinary data scientists. He has been a visiting scientist at the University of Texas at Austin, CWI Amsterdam, UCLA, and the Barabási Lab at Northeastern University. He actively contributes to European research initiatives including SoBigData++, FAIR, and TAILOR, and has advised on AI policy, including testimony before the Italian Parliament on AI and labor markets. He is a key member of the Pisa KDD Lab, a leading research group in data science and AI ethics, fostering collaboration between academia and public institutions.

Albert Atseriasمشاهده پروفایل

استاد

• Computational Complexity
• Logic in Computer Science
• Finite Model Theory
• +۷ مورد دیگر

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.

Nathan G. Swensonمشاهده پروفایل

استاد

• Ecology and Environmental Biology
• Evolutionary Biology
• Genetics and Genomics
• +۱۰ مورد دیگر

Nathan G. Swenson is a Professor in the Department of Biological Sciences at the University of Notre Dame and serves as the Gillen Director of the Environmental Research Center (UNDERC). He has held prior academic positions at the University of Maryland and Michigan State University, advancing from Assistant to full Professor. His research integrates genomics, ecology, and evolutionary biology to understand forest biodiversity and dynamics. Research Interests: Ecology and Environmental Biology Evolutionary Biology Genetics and Genomics Global Change Biology Forest Ecology Functional and Phylogenetic Ecology Tree Physiology and Demography His research focuses on leveraging intra- and interspecific variation in tree performance to predict forest biodiversity patterns. He employs integrative approaches from genomes to forest canopies and utilizes large-scale global datasets. Recent publications emphasize intraspecific trait variation, transcriptomic responses to drought, ecological forecasting, and functional group dynamics in tropical and temperate forests. Scientific Awards: Winner of 2017 British Ecological Society John Harper Prize (awarded to J. Zambrano; Swenson was senior author) Advising and Grants: Dr. Swenson has mentored numerous researchers, including M.N. Umana, S.J. Worthy, and J. Yang, who frequently co-author high-impact papers. His lab receives substantial research funding, evident from large collaborative projects and participation in global networks like ForestGEO and the TRY plant trait database. He has secured support for long-term ecological research, genomic studies, and international fieldwork. Labs and Teams: He leads the Swenson Lab, which conducts research on woody plant ecology in dynamic environments. The lab emphasizes community transcriptomics, functional trait analysis, and large-scale ecological modeling. It collaborates widely across institutions and is involved in major initiatives such as ForestGEO and NEON.

• Programming Language Design
• Program Verification
• Type Theory
• +۳ مورد دیگر

Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge's Computer Laboratory , and a Fellow of Trinity College . His research focuses on the intersection of program verification, programming language design, and foundational topics like type theory and semantics. His work spans areas such as refinement types, parser design, separation logic for systems software, and the semantics of reactive programming. Notable contributions include the Datafun language for higher-order Datalog and the λert type theory for explicit refinement types. He has also developed foundational frameworks for verifying imperative programs using advanced type systems and logical relations. Key publications include 'Explicit Refinement Types' (ICFP 2023), 'flap: A Deterministic Parser with Fused Lexing' (PLDI 2023), and 'CN: Verifying Systems C Code' (POPL 2023). His work frequently addresses challenges in efficiency, correctness, and modularity for both functional and imperative systems. His awards include Distinguished Paper Awards at PLDI 2019 and POPL 2020. His research integrates theoretical rigor with practical tooling, exemplified by contributions to languages like Coq, Lean, and Haskell.

Saikat Duttaمشاهده پروفایل

استادیار

• Software Engineering
• Machine Learning
• Artificial Intelligence
• +۵ مورد دیگر

Saikat Dutta is an Assistant Professor in the Department of Computer Science at Cornell University. He is affiliated with the Software Engineering Group and focuses on the intersection of Software Engineering and Machine Learning . His work aims to enhance the reliability of ML-based systems while applying ML techniques to solve software engineering challenges. PhD in Computer Science from University of Illinois Urbana-Champaign (Summer 2023) Postdoctoral Researcher at University of Pennsylvania Bachelor's in Computer Science and Engineering from Jadavpur University Research Interests: Dr. Dutta's research spans several key areas: Automated test generation and debugging for ML/DL libraries Using AI/ML for automated software engineering tasks Improving performance of regression tests in ML libraries Static and dynamic analysis for probabilistic programming Article Trends: His recent publications emphasize: Automated testing of ML systems Security vulnerability detection using LLMs Probabilistic program analysis Neurosymbolic learning frameworks Flaky test management in stochastic environments Stochastic regression test optimization Scientific Awards: Meta AI LLM Evaluation Research Grant (2025) Mavis Future Faculty Fellowship (2022-23) Facebook PhD Fellowship (2020-22) 3M Foundation Fellowship (2019-2020) Advising & Grants: Dr. Dutta actively recruits PhD students and postdocs. He leads research projects supported by grants from Meta AI and participates in program committees for top conferences like ICSE and ISSTA. His lab focuses on neurosymbolic systems and ML-based software verification.

Yihan Sunمشاهده پروفایل

استادیار

• Parallel Computing
• Algorithms
• Data Structures
• +۱۲ مورد دیگر

Yihan Sun is an Assistant Professor at the University of California, Riverside (UCR) since January 2020. He earned his Ph.D. in Computer Science from Carnegie Mellon University (CMU) , advised by Guy Blelloch , and holds a Bachelor's degree in Computer Science from Tsinghua University . Research Interests: Yihan Sun focuses on the theory and practice of parallel computing , including Parallel algorithms and data structures Write-efficient algorithms for Non-Volatile Memory (NVM) Computational geometry (range trees, Delaunay triangulations) Graph algorithms (SSSP, SCC, cluster-based BFS) Concurrent and persistent data structures Multi-version concurrency control (MVCC) with garbage collection Applications in databases, transactional systems, and computational biology Recent Research Trends: His work on join-based parallel balanced trees has been foundational, supporting four balancing schemes (AVL, red-black, weight-balanced, treaps) and enabling efficient implementations in graph analytics, spatial queries, and dynamic programming. Recent publications focus on output-sensitive algorithms , scalable graph libraries (PASGAL) , and pedagogical approaches to teaching parallel algorithms. Teaching: He teaches CS260 (Parallel Algorithms) at UCR and has served as a guest lecturer for MIT 6.886 (Algorithm Engineering) and CMU 15-859 (Algorithms in the real world) . He also contributed to algorithm education through a tutorial at the ACM Symposium on Principles and Practice of Parallel Programming (PPoPP 2019) . Labs & Collaborations: Yihan is a core contributor to the PAM (Parallel Augmented Maps) library, which has been integrated into systems like Aspen (graph-streaming) and C-trees . He collaborates with teams at CMU-Parlay , PBBS , and Ligra , with his code available on Github for community feedback.

Julian Shunمشاهده پروفایل

دانشیار

• Parallel Computing
• High-Performance Computing
• Graph Analytics
• +۷ مورد دیگر

Julian Shun is an Associate Professor at the Massachusetts Institute of Technology (MIT) in the Department of Electrical Engineering and Computer Science (EECS) and a principal investigator in the Computer Science and Artificial Intelligence Laboratory (CSAIL). Previously, he was a Miller Research Fellow at UC Berkeley and earned his Ph.D. from Carnegie Mellon University under Guy Blelloch. His research focuses on parallel and high-performance computing, with emphasis on graph analytics, spatial/graph clustering, and dynamic algorithms. He designs algorithms with theoretical guarantees and empirical efficiency, along with high-level programming frameworks to simplify parallel code development. His work spans cache-oblivious, external-memory, and streaming graph algorithms, addressing scalability and performance across diverse computational architectures. Julien's recent publications highlight advancements in parallel graph traversal, dynamic connectivity, and approximation algorithms for centrality metrics. His research also explores domain-specific languages like GraphIt for graph analytics and frameworks such as Julienne for work-efficient bucketing. Scientific Awards: Miller Research Fellow at UC Berkeley He has taught graduate-level courses at MIT, including 6.506 (Algorithm Engineering) and 6.886 (Graph Analytics), emphasizing theoretical foundations, experimental analysis, and open-ended research projects.

• Cyber-Physical Systems
• Internet of Things (IoT) Security
• Computer Architecture
• +۵ مورد دیگر

Hokeun Kim is an Assistant Professor in the School of Computing and Augmented Intelligence (SCAI) at Arizona State University (ASU), part of the Ira A. Fulton Schools of Engineering. He previously held positions at Hanyang University (2021-2023) and worked in industry roles at Google, LinkedIn, and HP Labs. His research focuses on cyber-physical systems, IoT security, and computer architecture, with a particular emphasis on safety and security aspects of time-sensitive systems. Education: Ph.D. in EECS, University of California, Berkeley (2017) M.S. in EECS, Seoul National University (2012) B.S. in Computer Science and Engineering, Seoul National University (2010) Research Interests: Kim’s work spans secure IoT frameworks, real-time embedded systems, and edge computing. He develops tools like the Secure Swarm Toolkit (SST) and Lingua Franca, addressing challenges in distributed system security, interoperability, and performance. Key Contributions: Authored over 30 peer-reviewed publications in top venues like IEEE Transactions, ACM Conferences, and DATE. Received the ACM/IEEE Best Paper Award (IoTDI 2017) and IEEE Micro Top Picks Honorable Mention (2017). Active in organizing conferences (e.g., DATE, FDL) and serves on technical committees for top journals/conferences. Teaching: Courses include Computer Architecture I/II, Real-Time Embedded Systems, and IoT design at both undergraduate and graduate levels.

Heather Millerمشاهده پروفایل

استادیار

• Distributed Systems
• Concurrent Programming
• Programming Languages
• +۴ مورد دیگر

Heather Miller is a tenure-track Assistant Professor in the Software and Societal Systems Department within Carnegie Mellon University's School of Computer Science. Her academic journey includes prior roles as an Assistant Clinical Professor at Northeastern University's College of Computer and Information Science and as Executive Director of the Scala Center at EPFL. Miller's research centers on distributed and concurrent computation through the lens of programming languages, with particular emphasis on data-centric systems, big data processing, and edge computing. A defining theme throughout her work is composability - enabling construction of complex distributed systems through composition of components that are correct by construction. Her projects span distributable closures, flexible serialization techniques, futures and promises for asynchronous programming, and deterministic concurrent dataflow models. Her recent publications demonstrate strong trends in applying programming language theory to practical distributed systems challenges, with increasing focus on WebAssembly instrumentation, microservice resilience, and language model pipelines. This evolution reflects her commitment to bridging theoretical foundations with real-world system requirements. Dahl-Nygaard Junior Prize (2023) Mentorship forms a significant component of Miller's academic work. She actively supervises multiple PhD, MS, and undergraduate researchers at CMU, including Christopher Meiklejohn, Matthew Weidner, Huairui Qui, Ria Pradeep, and Luke Dramko. Her service contributions span numerous top-tier conferences including PLDI, SPLASH, ECOOP, and ICSE where she has served as committee member, chair, and keynote speaker. Miller co-founded the Curry On conference to foster industry-academia dialogue, hosting successful editions in Prague, Rome, Barcelona, Amsterdam, and London. She leads research groups focused on distributed programming models and maintains strong industry connections through Two Sigma, where she holds an affiliation. Her work consistently emphasizes practical open-source implementations, primarily within the Scala ecosystem where she's been a core contributor since 2011.

• Data Mining
• Bioinformatics
• Machine Learning
• +۳ مورد دیگر

Domingo Savio Rodríguez Baena is a Professor at Pablo de Olavide University, affiliated with the Department of Computer Languages and Systems. His research focuses on data mining, bioinformatics, and computational biology, with a particular emphasis on biclustering algorithms, gene co-expression networks, and high-performance computing applications. PhD in Engineering, Data Science, and Bioinformatics (2012) from Pablo de Olavide University His work spans interdisciplinary domains, including recommender systems , livestock behavior analysis , and biological data interpretation . Recent articles highlight his contributions to multi-GPU optimization , ensemble learning , and historical database construction . Key collaborations include the DATAi Intelligent Data Analysis and DASE Data Analytics Science & Engineering research groups. He has developed tools like the CyEnGNet–App for gene network visualization and BIGO for gene enrichment analysis. Contact: dsrodbae@upo.es

Ioan Todincaمشاهده پروفایل

استاد

• Graph Algorithms
• Theoretical Computer Science
• Exact Algorithms
• +۶ مورد دیگر

Ioan Todinca is a Professor of Computer Science at the University of Orléans, France, affiliated with the LIFO (Laboratoire d'Informatique Fondamentale d'Orléans) research laboratory. His academic career spans over two decades, with significant contributions to theoretical computer science, particularly in graph algorithms and distributed computing. Faculty of Science, University of Orléans LIFO Research Laboratory Member of Institut thématique pluridisciplinaire Modélisation, Systèmes, Langages (since 2014) Former director of MIPTIS doctoral school (2012-2014) Former head of Computer Science degree program (2007-2011) Former leader of LIFO Graphs, Algorithms and Computational Models team (2008-2012) Todinca's research focuses primarily on graph algorithms, with expertise in exact algorithms (moderately exponential), parameterized algorithms, and algorithms for specific graph classes. He has made significant contributions to techniques involving tree decompositions, treewidth, minimal separators, and potential maximal cliques. More recently, his work has expanded into distributed algorithms, especially in communication-constrained models like the broadcast congested clique. His research bridges theoretical foundations with practical algorithmic approaches for NP-hard problems. The analysis of his recent publications reveals a strong trend toward distributed computing problems, particularly in congested network models. His work spans from fundamental graph theory problems (cycle detection, graph modification) to applications in quantum computing and model checking. The consistent focus on communication complexity, verification, and efficient algorithms across different computational models demonstrates his ability to adapt theoretical computer science principles to emerging computational paradigms. Todinca has supervised numerous PhD students and has been actively involved in the theoretical computer science community through conference organization and editorial work. His publications appear consistently in top-tier venues including SIAM Journal on Computing, Algorithmica, and proceedings of major conferences like STACS, WG, and DISC. Teaching responsibilities include algorithms, graph theory, and discrete structures for undergraduate and graduate students, with previous experience teaching databases, programming, and software engineering. His educational materials are hosted on the university's Celene platform.