Find Academic Supervisors

Nectarios KozirisView profile

Professor

• Parallel and Distributed Systems
• Computer Architecture
• Systems Software
• +10 more

Nectarios Koziris is a Professor at the Department of Computer Science , National Technical University of Athens (NTUA) , and former Dean of the School of Electrical and Computer Engineering . His research focuses on Parallel and Distributed Systems , Computer Architecture , and Cloud Computing . Key Research Themes: Compiler-OS-Architecture Interaction, Datacenter Hyperconvergence, Sparse Matrix Optimization, Quantum Computing, FPGA Virtualization Leadership: Founder of ~okeanos (Europe's largest public Cloud IaaS), Co-founder of GFOSS , Member of IEEE Computer Society Greece, Advisor to Arrikto Inc. His work has led to over 180 publications with 5800+ citations (h-index 33) , including two Best Paper Awards (IPDPS 2001, CCGRID 2013) and Intel Recognition (2015). He has supervised 12 PhD students and participated in 15+ EU projects as coordinator or consortium partner. Scientific Leadership: Program Co-Chair for Europar 2012 , Organizer for IPDPS , ICPP , SC conferences, and active member in Cloud Computing Expert Groups for the European Commission.

Gérard BerryView profile

Professor

• Computer Science
• Lambda Calculus
• Functional Programming
• +5 more

Gérard Berry (born December 25, 1948) is a distinguished French computer scientist currently serving as Professor at the Collège de France, holding the permanent chair Algorithmes, machines et langages (Algorithms, Machines, and Languages) since 2012. He previously held the Informatique et sciences numériques chair (2009-2010) and the Technological Innovation Liliane Bettencourt chair (2007-2008) at the same institution. Before joining Collège de France full-time, he served as Director of Research at INRIA Sophia Antipolis (2009-2012) and at École des Mines de Paris (1977-2001). His research spans over 30 years in three main fields: lambda calculus and functional programming, parallel and real-time programming languages, and design automation for synchronous digital circuits. He is particularly renowned for developing the Esterel programming language. His work bridges theoretical computer science with practical industrial applications. Berry's research has evolved to include current work in Hop and HipHop for Web programming, formal verification of compilers, and languages for computer music. His publications demonstrate consistent contributions to programming language theory, formal methods, and their applications in hardware and software systems. Gold Medal of CNRS (2014) Chevalier de l'Ordre de la Légion d'Honneur (2012) Member of French Academy of Sciences (2002) Member of Academia Europaea (1993) Monpetit Prize of Académie des sciences (1990) Berry has advised 17 PhD students and reviewed numerous theses. His industrial experience includes serving as Chief Scientist Officer of Esterel Technologies (2000-2009), where he directed the implementation of the Esterel v7 compiler. He has also held significant leadership roles including President of the Scientific Council of IRCAM and membership on the Scientific Council of the National Education. His teaching at Collège de France has covered topics ranging from the foundations of computation to the societal impact of digital technology, with courses including The Informatics of Time and Events and Proving Programs: Why? When? How? His laboratory work has focused on developing practical applications of theoretical computer science concepts.

Ruzica PiskacView profile

Professor

• Software Verification
• Security and Applied Cryptography
• Automated Reasoning
• +4 more

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

Ilias DiakonikolasView profile

Professor

• Robust Statistics
• Machine Learning Theory
• Algorithmic Game Theory
• +2 more

Ilias Diakonikolas is the Sheldon B. Lubar Professor in the Department of Computer Sciences at UW-Madison, with affiliations in Statistics, the Wisconsin Institute for Discovery, and the Data Science Institute. He holds a Ph.D. from Columbia University and previously held positions at USC, University of Edinburgh, and UC Berkeley. Research examines: Tradeoffs between statistical efficiency, computational efficiency, and robustness in machine learning High-dimensional robust statistics and information-computation tradeoffs Foundations of deep learning and nonparametric estimation Publications establish fundamental limits for learning algorithms and develop efficient methods for distribution testing and robust estimation. Awards include Sloan and Romnes Fellowships, NSF CAREER Award, and Best Paper at NeurIPS 2019. Advises PhD students in theory of computing and machine learning, leading the Algorithmic High-Dimensional Robust Statistics research program. Organizes workshops on computational-statistical frontiers and authored the Cambridge University Press textbook on robust statistics.

Konstantinos LimniotisView profile

Lecturer

• Cryptography
• Boolean Functions
• Network Security
• +5 more

Konstantinos Limniotis is an ICT Specialist at the Hellenic Data Protection Authority since 2009 and an active academic teaching at multiple Greek and Cypriot universities. He is currently teaching 'Network and Telecommunications Systems Security' at the University of Athens, 'Cryptography' and 'Security risk management' at the Open University of Cyprus, and has previously taught at the University of Peloponnese, Harokopio University of Athens, and Technological Educational Institutes. Since 2022, he is a member of ENISA's Ad Hoc Working Group on Data Protection Engineering. Dr. Limniotis received his B.Sc. in computer science (1999), M.Sc. in communications systems and networks (2002), and Ph.D. in 'Signal Processing Techniques in Cryptography' (2007) from the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens, under the supervision of Professor N. Kalouptsidis. His research focuses on the intersection of cryptography, security, and data protection. Dr. Limniotis has made significant contributions to cryptographic Boolean functions, particularly in algebraic immunity properties, and has extended his expertise to practical applications in data protection and privacy. His work bridges theoretical cryptography with real-world applications in personal data protection, particularly in the context of GDPR compliance. Recent research directions include post-quantum cryptography, blockchain security, and privacy-enhancing technologies for emerging applications like AI systems and IoT ecosystems. His publications demonstrate a clear trajectory from theoretical cryptographic research to applied security and privacy solutions that address contemporary regulatory and technological challenges. Dr. Limniotis has received multiple 'Excellence in Teaching' Awards from the Open University of Cyprus (2019-2023), recognizing his contributions to cybersecurity education. His teaching spans graduate programs in Computer and Network Security, Telecommunications Systems, and Data Science. As an active contributor to data protection policy, Dr. Limniotis has participated in multiple ENISA reports on pseudonymization techniques, data protection engineering, and personal data sharing. His work with the Hellenic Data Protection Authority since 2009 demonstrates a strong commitment to bridging academic research with practical data protection implementation.

• Category Theory
• Mathematical Logic
• Foundations of Mathematics
• +3 more

Panagis Karazeris is an Associate Professor at the Department of Mathematics, School of Sciences, University of Patras. His research focuses on Category Theory, Mathematical Logic, and Foundations of Mathematics. Ph.D. in Mathematics (1993, Aarhus University) B.Sc. in Mathematics (1987, University of Patras) Graduate Diploma in Distance Learning (1999, Greek Open University) Research Interests : Dr. Karazeris specializes in Category Theory, with applications to Domain Theory, Algebraic Structures, and Foundations of Mathematics. His work explores Gabriel Topologies, Flatness, and Coalgebras in Accessible Categories. Teaching : He teaches undergraduate courses in Algebra, Set Theory, and Real Analysis, as well as graduate courses on Category Theory and Foundations of Mathematics. Publications : His work spans categories, logic, and algebraic structures, with notable contributions to MV-algebras, coherent quantales, and categorical domain theory.

• Algorithms and Complexity
• Graph Theory and Applications
• Computer Networks and Internet
• +3 more

Kavvadias Dimitris is an Assistant Professor in the Department of Mathematics at the University of Patras, specializing in Computational Mathematics and Informatics. His academic journey includes a B.Sc. in Electrical and Computer Engineering from the National Technical University of Athens (1983), M.Sc. in Computer Science from Columbia University (1984), and a Ph.D. in Computer Engineering & Informatics from the University of Patras (1989). He has been affiliated with the University of Patras since 1992, initially as a Lecturer and then as an Assistant Professor since 1997. His research focuses on Algorithms and Complexity, Graph Theory and Applications, Computer Networks, and Scientific Computing. He has contributed to numerous research projects, including studies on parallel algorithms, network reliability, and data mining. His work spans theoretical computer science and practical applications, with a strong emphasis on algorithm design and computational methods. Kavvadias has taught extensively at both undergraduate and postgraduate levels, covering courses such as Discrete Mathematics, Operating Systems, and Algorithm Analysis. He has supervised doctoral theses and diploma projects, including those of H. Staurovoulos and Angeliki Panagopoulou. His involvement in academic organizations includes roles in the ACM, EATCS, and the Hellenic Open University. His publications reflect expertise in hypergraph algorithms, transversal generation, and numerical root finding, with contributions to journals like SIAM and theoretical computer science forums. He has also participated in international conferences and served as a referee for prominent journals and events.

Katia PapakonstantinopoulouView profile

Teaching Professor

• Network Analysis
• Game Theory
• Algorithms
• +4 more

Katia Papakonstantinopoulou serves as a Teaching Professor and Researcher in the Department of Informatics at Athens University of Economics & Business (AUEB). She is an active member of the network analysis group and the Theory, Economics and Systems Laboratory (Main Building, Antoniadou wing, 4th floor), and contributes to the 5G-VINNI research project. Her academic credentials include: B.S. in Informatics and Telecommunications (University of Athens) M.Sc. in Advanced Information Systems (University of Athens) Ph.D. in Computer Science (University of Athens, supervised by Prof. Elias Koutsoupias) Her research integrates Game Theory for modeling selfish network behavior and Information Theory for compact network representations. Current work spans social network analysis, epidemic spread prediction using graph ML, and time series/graph compression techniques. She has significantly advanced lossless floating-point compression (CHimp/Chimp systems) and temporal graph compression. Recent publications (2022-2024) reveal strong focus on data compression efficiency for time-series databases and epidemic modeling, while earlier work (2016-2020) established foundations in community detection and distributed graph processing. Her research consistently bridges theoretical algorithms with practical network applications. Her scientific recognition includes: Doctoral Scholarship from the Greek State Scholarships Foundation She mentors students through research projects in algorithms and network analysis, particularly in the Master of Science in Data Science program (ranked 14th globally in Big Data Management by Eduniversal 2019). Her teaching portfolio includes graduate courses in Social Network Analysis and Algorithms, plus undergraduate instruction in core CS subjects. Her research operations center on the Theory, Economics and Systems Laboratory where she develops compression algorithms and network models, with recent work supporting 5G network slicing economics through the 5G-VINNI project.

Panagiotis RizomiliotisView profile

Assistant Professor

• Cryptography
• IoT Security
• Cloud Security
• +7 more

Panagiotis Rizomiliotis is an Assistant Professor at the Harokopio University of Athens and a Security Researcher with a focus on Cryptography . He also serves as a Member of the Plenary at the Hellenic Authority for Communication Security and Privacy . Education: BSc in Informatics and Telecommunications (1997) from the University of Athens, Greece, with 8.55/10 (Honours) MSc in Electronics and Radioelectrology (1999) from the University of Athens, with 8.05/10 PhD in Cryptography (2005) from the University of Athens, with 10/10 (Honours) Research Interests include cryptography, IoT security, cloud security, database security, and privacy protection. He has contributed to lightweight authentication protocols, hardware-driven security, GDPR compliance, and secure outsourcing of databases. Notable Article Trends show expertise in cryptographic protocols for cloud and IoT environments, security analysis of RFID systems, and mathematical foundations of Boolean functions. His work spans searchable encryption, oblivious RAM, chaos-based optical cryptography, and algebraic immunity. Service Roles include committee/reviewer positions for scientific journals and conferences like ACM CCSW, IEEE GlobeCom, and ACNS. He has also served as an advisor to the Ministry of Administrative Reform and E-Governance of Greece .

Mihalis KolountzakisView profile

Professor

• Harmonic Analysis
• Additive Number Theory
• Combinatorics
• +7 more

Mihalis Kolountzakis is Professor of Mathematics at the University of Crete, Greece, specializing in harmonic analysis, additive number theory, combinatorics, and tiling theory. Since 2006 he holds the rank of Professor in the Department of Mathematics and Applied Mathematics, after serving as Associate Professor from 2000–2006. He has also held visiting positions at Georgia Tech, UIUC, and the Institute for Advanced Study. Education PhD in Mathematics, Stanford University (1994) Graduate study in Mathematics, University of Crete (1988–1989) BSc in Computer Science, University of Crete (1984–1988) Research Interests His work centers on the interplay between Fourier analysis and discrete geometry. Major themes include: Tiling and spectral sets: investigating when a domain admits an orthogonal basis of exponentials (Fuglede’s conjecture) and studying translational tilings by functions and sets. Additive combinatorics & number theory: problems on sumsets, Sidon sets, and additive energy using probabilistic and harmonic-analytic methods. Discrepancy theory: distribution of points and line segments in checkerboard and geometric settings. Computational aspects: algorithms for deciding tiling properties, graph algorithms, and learning symmetric Boolean functions. Publications With over 100 refereed papers, his recent output (2022–2025) continues to advance tiling theory, spectral questions, and additive combinatorics, often combining analytic techniques with discrete methods. Teaching and Service He has taught a wide range of courses including Measure Theory, Harmonic Analysis, Probability, and Discrete Mathematics at both undergraduate and graduate levels. He served as Chair of the Department of Mathematics at the University of Crete during 2013. Contact Email: kolount@gmail.com Office: Γ-213, Department of Mathematics, University of Crete, 70013 Heraklion, Greece Phone: +30-2810393834

Konstantinos TyrosView profile

Associate Professor

• Ramsey Theory
• Density Combinatorics
• Banach Space Geometry
• +2 more

Konstantinos Tyros is Associate Professor in Mathematics at the University of Athens, specializing in combinatorial analysis and Ramsey theory. His research connects density theorems in combinatorics with problems in Banach space geometry and probabilistic methods. Key contributions include density versions of combinatorial theorems (Carlson-Simpson, Hales-Jewett), structure theorems for stochastic processes on discrete cubes, and concentration inequalities for high-dimensional random arrays. His work on spreading models in Banach spaces reveals new structures in functional analysis. He has developed novel approaches to nonlinear spectral gaps and dual Ramsey theory for trees, while advancing the Moser-Tardos algorithmic framework. Honors include technical excellence awards from Greek academic institutions.

• Algorithmic Game Theory
• Approximation Algorithms
• Facility Location Problems
• +2 more

Dimitris Fotakis is Professor of Computer Science at the National Technical University of Athens (NTUA) and Collaborating Senior Researcher at the Archimedes Unit/ATHENA RC. His research in theoretical computer science focuses on algorithmic game theory, approximation algorithms, and facility location problems. He leads research projects including BALSAM (Beyond Worst-Case Analysis in Approximation Algorithms) funded by HFRI. With publications in ICALP, NeurIPS, and STOC, his work develops efficient algorithms for optimization under uncertainty. Fotakis serves on program committees of major conferences including ICALP and SAGT.

• High-Performance Computing
• Parallel Processing
• Code Optimization
• +3 more

Georgios Goumas is an Associate Professor in the Division of Computer Science at the School of Electrical and Computer Engineering, National Technical University of Athens. His research focuses on high-performance computing, parallel systems, and efficient resource management for modern computing platforms. Research domains: Serverless computing scalability and memory management Quantum algorithm design for classification Virtual memory optimization Hardware acceleration for sparse computations NUMA-aware concurrent data structures Recent innovations include DaeMon for disaggregated systems, eBPF-based Linux memory management, and multi-GPU matrix multiplication optimizations. Publications demonstrate consistent advancement in low-level system efficiency across quantum, serverless, and heterogeneous computing domains. Dr. Goumas teaches undergraduate and graduate courses on Operating Systems, Parallel Processing, and Code Optimization Techniques. His lab develops open-source tools like Paralia runtime for auto-tuning linear algebra and FPGA-based accelerators for scientific computing.

Panagiotis NastouView profile

Assistant Professor

• Secure Discrete Systems Modeling
• Graph Theory
• Cryptography
• +5 more

Panagiotis Nastou is an Assistant Professor at the Department of Mathematics , University of the Aegean , with research interests in Secure Discrete Systems Modeling, Graph Theory, Cryptography, Design and Analysis of Algorithms , and Complexity Theory . He has been active in teaching courses such as Discrete Mathematics and Cryptography since 2007 and serves as Director of the Applied Mathematics and Mathematical Modeling Laboratory since 2019. Education : Ph.D., MSc., and BSc. in Computer Engineering and Informatics from Patras University. Membership : Center for Applied Optimization (University of Florida), GDPR TEAM, IEEE, ACM, and Hellenic Technical Chamber. His research bridges theoretical computer science and applied security, focusing on cryptographic protocols, algorithm design, and the application of discrete mathematics to real-world problems. He has contributed to the development of secure systems for critical infrastructure and privacy-preserving frameworks in smart cities. Recent publications (2021-2025) emphasize malware evasion , quantum cryptanalysis , and privacy in IoT environments , utilizing formal methods and combinatorial structures. His work also extends to deep learning for document analysis and consensus algorithms in social networks . He has supervised numerous Master's and undergraduate theses in areas like Zero-Knowledge Proofs , Neural Networks , and Cryptographic Boolean Functions . Administrative roles include representation in the ERASMUS+ program and participation in EU-funded project evaluations.

• Numerical Analysis
• Computer Science
• Partial Differential Equations
• +5 more

Kosmas Iordanidis is a Professor of Mathematics actively involved in teaching courses related to computer science and numerical analysis. His academic contributions include instruction in: Introduction to Computer Science Numerical Analysis II Numerical Solution of Partial Differential Equations (Postgraduate Course) Research interests are evident from his teaching focus, spanning computational mathematics, algorithm design, and numerical methods for differential equations. He has developed extensive educational materials, including lecture notes, slides, and exercises in FORTRAN programming , Boolean Algebra , and Arithmetic Logic Units (ALU). Key technical themes include computer arithmetic, logic function simplification with Karnaugh maps, and numerical solutions for scientific computing. Course materials from 2005–2006 highlight structured teaching across 13 educational weeks, covering topics such as: Computer components and information processing systems Combinational circuits and symbolic languages Microprogramming, memory systems, and high-level language comparisons Applications in BCD arithmetic , Newton-Raphson method , and Gaussian integration