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

Aristides Efthymiouمشاهده پروفایل

استادیار

• Microarchitecture of Computer Systems
• Digital Systems Design
• VLSI Circuits
• +۲ مورد دیگر

Aristides Efthymiou is an Assistant Professor at the Department of Computer Engineering and Informatics, University of Ioannina. He holds a PhD from the University of Manchester (2002) and has held academic positions at the University of Edinburgh (2004–2011) and research roles at the Institute of Microelectronics, National Center for Scientific Research 'Demokritos,' and Integrated Systems Development SA. His research focuses on microarchitecture, digital systems design, and VLSI circuits. Education: Bachelor's and postgraduate diploma in Computer Science, University of Crete (1993–1995) PhD in Computer Science, University of Manchester (2002) Research interests include approximate computing, visible light communications (VLC), and energy-efficient circuit design. He is a member of the VLSI Systems and Computer Architecture Laboratory (VCAS), contributing to projects like the Artemis Program on supply chain traceability. His work spans over 25 international publications, emphasizing hardware optimization and signal processing in VLC systems. Awards: None explicitly mentioned. Lab and Team: Leads the VCAS lab, collaborating with faculty members like Professors George Tsiatouchas and Chrysovalantis Kavousianos. Supervises doctoral candidates in areas like approximate multipliers and VLC systems.

Giorgos Siligardosمشاهده پروفایل

مدرس

• Number Theory
• Financial Mathematics

Giorgos Siligardos is a Lecturer at the Department of Mathematics, University of Crete, holding a PhD in Mathematics since 2000. His research spans Number Theory and interdisciplinary applications in financial markets. Research Interests: Focused on embedding problems in dihedral class fields and quadratic forms, alongside empirical studies in market efficiency and risk management. His work bridges theoretical mathematics and quantitative finance. Publication Trends: Recent articles (2018–2011) address financial risk, banking, and market anomalies, while older publications (2000–2003) emphasize computational number theory and algebraic structures.

Katia Papakonstantinopoulouمشاهده پروفایل

استاد آموزشی

• Network Analysis
• Game Theory
• Algorithms
• +۴ مورد دیگر

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.

Konstantinos Efstathiouمشاهده پروفایل

استاد

• Computer Architecture
• Computer Arithmetic
• VLSI System Design
• +۳ مورد دیگر

Konstantinos Efstathiou is a Professor at the Department of Informatics and Computer Engineering, University of West Attica, Greece. He holds a PhD in Computer Science from the University of Thessaloniki, an MSc in Electronic Engineering, and a Bachelor's in Physics, both from the University of Athens. Previously, he worked as a professor at the Technological and Educational Institute of Athens and held engineering roles at the Hellenic Air Force Research Center, Greek Government's Informatics Development Department, and Hellenic Telecommunication Organization's Data Communication Department. Education: Bachelor's Degree in Physics, University of Athens MSc in Electronic Engineering, University of Athens PhD in Computer Science, University of Thessaloniki Research Interests: Focus on Computer Architecture, Computer Arithmetic, VLSI System Design and Testing, Nanotechnologies, and Telecommunication Systems. He owns an International Patent and has authored numerous articles in international journals and conferences. Professional Activities: Serves as an invited reviewer for international conferences/journals and a member of program committees for international conferences.

Koutsianas Angelosمشاهده پروفایل

استادیار

• Arithmetic Geometry
• Computational Algebraic Number Theory
• Elliptic Curves
• +۵ مورد دیگر

Angelos Koutsianas is an Assistant Professor at the Department of Mathematics of Aristotle University of Thessaloniki, Greece, affiliated with the Section of Algebra, Number Theory and Mathematical Logic within the School of Science . His research focuses on Arithmetic Geometry, Computational Number Theory, Elliptic Curves, and Diophantine Equations, with applications in cryptography and modular forms. Education: PhD in Mathematics (2016), University of Warwick, UK. Doctoral Thesis: Applications of S-unit Equations to the Arithmetic of Elliptic Curves under Prof. John Cremona. Degree in Mathematics (2012), National and Kapodistrian University of Athens, Greece. Diploma in Electrical & Computer Engineering (2009), National Technical University of Athens, Greece. Professional Experience: Assistant Professor, AUTh (Nov 2021–present). Associate Researcher, Blaise Pascal Mathematics Laboratory (2020–2021). Postdoctoral Fellowships: University of British Columbia (2018–2020), University of Piraeus (2017–2018), Universitat Ulm (2016–2017). Research Trends: His work bridges theoretical arithmetic geometry with computational methods, addressing problems in elliptic curves, rational points, and Diophantine equations. Recent publications explore modular methods, conductor/discriminant calculations for Picard curves, and applications of S-unit equations. Grants & Activities: His research is funded by AUTh's Special Account for Research. Co-organizes the 2nd Greek Number Theory Meeting (2024). Active in international collaborations on computational number theory and arithmetic geometry.

Charalambous Charaمشاهده پروفایل

استاد

• Commutative Algebra
• Algebraic Geometry
• Toric Ideals
• +۵ مورد دیگر

Charalambous Chara is a Professor in the Department of Mathematics at Aristotle University of Thessaloniki (AUTH) since 2011. She earned her PhD in Mathematics from the University of Illinois at Urbana-Champaign (1990) and holds a BSc in Mathematics from AUTH (1984). Her research focuses on Commutative Algebra , with emphasis on Toric Ideals, Multigraded Modules, and Betti Numbers. She has held visiting positions at Brandeis University and Columbia University, and worked at the State University of New York at Albany (1990–2004). Her work is supported by grants from the US National Science Foundation (NSF), the Pythagoras program, and the EDBM103 program (NSRF). Her professional roles include serving as Dean of the Faculty of Sciences and Chair of the Department of Mathematics at AUTH. She has organized international/national conferences and workshops, and co-authored six textbooks. Her editorial roles include membership in the Bulletin of the Hellenic Mathematical Society. She has reviewed proposals for the NSF and prestigious journals, contributing to the field's academic rigor. Research highlights include over 30 peer-reviewed articles (>400 citations), with notable works on minimal generating sets of lattice ideals and topological constructions for multigraded modules. Her recent studies explore deformation theory, equivariant Hilbert series, and syzygies of polynomial rings.

Georgios Fotiadisمشاهده پروفایل

استادیار

• Agroforestry
• Phytosociology
• Plant Diversity
• +۴ مورد دیگر

Georgios Fotiadis is an Assistant Professor in the Faculty of Plant Sciences at the Agricultural University of Athens (AUA), specializing in Forest Botany and Geobotany. He holds a Ph.D. in Phytosociology from Aristotle University of Thessaloniki (AUTh) and has contributed to over 20 international journal publications and 11 scientific book chapters. His research spans agroforestry systems, plant diversity in Mediterranean grasslands, climate change adaptation, and habitat conservation. Education: Ph.D. (2004), M.Sc. (2000) from AUTh; B.Sc. (1998) in Forestry. Research Programs: AF4EU (2023-2025), eco2adapt (2022-2027), AGFORWARD (2014-2017). Key Projects: Studies on valonia oak silvopastoral systems, Prespa National Park biodiversity, and ultramafic grasslands. His recent work focuses on agroforestry resilience, TNFS-secure cryptographic pairings, and vegetation analysis tools like sPlot. He has taught Botany courses at universities and TEIs in Greece, with a teaching emphasis on plant morphology and Mediterranean ecosystems.

David Greggمشاهده پروفایل

استاد

• Software performance optimization
• Embedded systems
• Accelerating deep neural networks on embedded systems
• +۱۲ مورد دیگر

David Gregg is a Professor in the Department of Computer Science at Trinity College Dublin's School of Computer Science and Statistics, where he serves as Global Director for Computer Science (since 2020) and previously as Head of the Discipline of Software and Systems (2018-2022). His research focuses on software performance optimization and embedded systems, with particular expertise in accelerating deep neural networks on resource-constrained platforms. He teaches Systems Programming (CS2014/5) and Concurrent Systems I (CS3014). Gregg's research spans multiple areas of computer systems including: Compiler optimization and program analysis Processor microarchitecture and parallelism (multi-core, vector, instruction-level) Computer arithmetic and domain-specific languages Low-energy embedded systems and FPGA implementations Deep neural network acceleration He has served on numerous program committees including PACT, PLDI, CC, and other major computer systems conferences, and has been on the Board of Distinguished Reviewers for ACM TACO multiple times. Professor Gregg has advised numerous PhD and MSc students, many of whom have gone on to prominent positions at companies like Intel-Movidius, Google, Amazon, and Synopsys. He leads the triNNity project which includes optimized libraries and compilers for implementing convolutional neural networks on CPUs.

Tobias Grosserمشاهده پروفایل

دانشیار

• Compilers
• Programming Language Design
• Performance Programming
• +۸ مورد دیگر

Tobias Grosser is an Associate Professor in the Department of Computer Science and Technology at the University of Cambridge. His research focuses on compiler technology, programming language design, and performance programming, with applications spanning hardware design, climate science, and quantum computing. He leads a research group developing innovative compiler frameworks and tools that bridge theoretical foundations with practical applications. Dr. Grosser completed his undergraduate studies in Computer Science at the University of Passau in Germany and pursued his PhD at École Normale Supérieure Paris as a Google PhD Fellow. Prior to joining Cambridge, he served as a Reader at the University of Edinburgh and held an Ambizione Fellowship at ETH Zurich. His research program centers on rethinking performance programming by re-connecting developers and compilers. He aims to make compilation more modular, predictable, automatic, and trustworthy while bringing open-source compiler innovation to increasingly diverse targets from GPUs to FPGAs and custom hardware. His work spans multiple domains including polyhedral compilation, constraint solving, quantum computing, and hardware design automation. Dr. Grosser is particularly interested in breaking down barriers between compilers and programmers by enabling their interaction through the programming language environment. His recent publications demonstrate a strong focus on compiler infrastructure development, particularly around the MLIR framework. He has pioneered work on Presburger arithmetic optimization with the FPL library, developed new intermediate representations for hardware description and quantum computing, and created tools for compiler education and prototyping like xDSL. His research shows a consistent theme of creating practical, high-performance compiler technologies that address real-world challenges across multiple domains. HiPEAC Technology Transfer Award 2021 for "Fast linear programming through transprecision computing on small and sparse data" OOPSLA 2021 Distinguished Paper Award for "FPL: Fast Presburger arithmetic through transprecision" Dr. Grosser actively mentors PhD students and postdoctoral researchers, currently supervising a team of over a dozen researchers working on various aspects of compiler technology. His group collaborates with industry partners including ARM and Xilinx, and maintains strong ties with the LLVM and MLIR open-source communities. He has secured funding for multiple research projects including work on verified compilation with Lean-MLIR, quantum compiler development, and hardware design automation. His research group operates at the intersection of multiple projects including Open-Source Electronic Design Automation, Seamless design of Smart Edge Processors, Lean-MLIR for verified compilation, FPL for fast Presburger arithmetic, and compilation frameworks for quantum computers. They maintain strong community engagement through regular Compiler Social events in Cambridge and active participation in LLVM developer meetings.

Zachary Kincaidمشاهده پروفایل

دانشیار

• Programming Languages
• Formal Methods
• Program Analysis
• +۳ مورد دیگر

Zachary Kincaid is an Associate Professor in the Department of Computer Science within the School of Engineering and Applied Science at Princeton University. His research spans programming languages, formal methods, and program analysis, with a focus on making analysis techniques more compositional and robust. He maintains an active research program with numerous publications in top-tier conferences including PLDI, POPL, OOPSLA, and CAV. His research interests include program analysis, logic, and programming languages, with particular emphasis on static analysis, verification, and automated reasoning. His work develops theoretical foundations for program analysis while creating practical tools that can be applied to real-world software systems. He has made significant contributions to termination analysis, invariant generation, and the application of algebraic methods to program verification. Analysis of his recent publications shows a consistent focus on improving the precision and scalability of program analysis techniques. His work frequently bridges theoretical computer science with practical implementation, developing novel algorithms for static analysis while also implementing them in tools like the Duet program analyzer. His research spans multiple subfields including termination analysis, invariant generation, recurrence relations, and algebraic methods for program analysis. Professor Kincaid has advised several PhD students to completion, including Shaowei Zhu (PhD 2024, now a researcher at Amazon) and Charlie Murphy (PhD 2023, now a postdoc at University of Wisconsin–Madison). He currently advises Jake Silverman, Nicolas Koh, and Nikhil Pimpalkhare. He teaches courses at Princeton including COS 320 (Compiling Techniques), COS 516/ELE 516 (Automated Reasoning about Software), and COS 217 (Introduction to Programming Systems). His teaching reflects his research interests, focusing on the theoretical foundations and practical implementation of programming language tools and techniques.

• Optimization
• Computational Mathematics
• Machine Learning
• +۹ مورد دیگر

Dimitris G. Sotiropoulos is a researcher at the Department of Mathematics, University of Patras . His work spans optimization , numerical analysis , and machine learning , with a focus on developing advanced algorithms for nonlinear systems , neural network training , and global optimization . Key research contributions include: Innovations in BFGS and conjugate gradient methods for large-scale optimization. Applications of interval arithmetic to discrete minimax problems and parameterized equations. Hybrid genetic algorithms for global optimization of multimodal functions. His publications (1997–2010) reflect expertise in computational mathematics and algorithm design , with applications in biomedical data classification and computational geometry. Articles emphasize memory efficiency , nonlinear programming , and validated numerics . Collaborations include researchers in optimization theory , neural networks , and numerical methods across multiple Greek institutions.

Andreas Göbelمشاهده پروفایل

استاد

• Computational Counting
• Randomness in Computation
• Computational Complexity
• +۴ مورد دیگر

Andreas Göbel is a Professor and Chair of Algorithm Engineering at the Hasso Plattner Institute (HPI). His research focuses on computational counting, randomness in computation, computational complexity, graph theory, and stochastic processes. He has contributed extensively to understanding diffusion processes, clique structures in networks, and algorithmic approaches to statistical physics problems. His work bridges theoretical computer science with practical algorithm design. Recent contributions include analyzing SIRS process survival times, clique dynamics in geometric random graphs, and non-linear information diffusion models. He has published widely in top-tier conferences such as IJCAI, AAAI, and SODA. Göbel teaches courses including Probability and Computing, Algorithmix, and Theoretical Foundations of Cryptography. His research group explores both foundational aspects of algorithms and real-world applications, particularly in network science and combinatorial optimization.

• Combinatorics
• Functional Analysis
• Ramsey Theory
• +۵ مورد دیگر

Pandelis Dodos is a Professor in the Department of Mathematics at the National and Kapodistrian University of Athens, Greece. His research focuses on combinatorics, functional analysis, and their intersections, particularly Ramsey theory, Banach space geometry, and descriptive set theory. He holds a PhD from the National Technical University of Athens (2003) and a Habilitation à Diriger des Recherches from Université Pierre et Marie Curie (2009). His work bridges analysis and combinatorics, addressing problems in nonlinear spectral gaps, forbidden intersection configurations, and high-dimensional random arrays. He leads the ANACOMB project (Hellenic Foundation for Research and Innovation), exploring combinatorial problems via analytical methods. Notable collaborations include researchers such as V. Kanellopoulos, K. Tyros, and S. Todorcevic. His contributions include monographs on Ramsey theory and Banach spaces, as well as over 50 peer-reviewed articles. Education: MSc Electrical Engineering (NTUA, 1997) PhD Mathematics (NTUA, 2003) Habilitation (UPMC Paris 6, 2009) His research projects include the ANACOMB initiative, investigating density Hales-Jewett conjectures and concentration inequalities. He advises PhD candidate Stamatis Skouras and collaborates with institutions like Texas A&M and Charles University. His work frequently intersects with theoretical computer science and probability theory. Awards: None explicitly listed, but recognized through extensive international collaboration and editorial roles in journals like Mathematische Annalen and Transactions of the AMS . Grants & Labs: ANACOMB (HFRI-FM20-02717), leading a multinational team addressing analytic combinatorics. Active in organizing workshops like COMPRAAthens 2024 .

• Computational number theory
• Cryptography

Konstantinos Draziotis is an Associate Professor at the Department of Informatics, School of Informatics, Aristotle University of Thessaloniki. His academic career at the university began as a Lecturer from 2013 to 2019, and he has been serving as an Associate Professor since 2019. His educational background includes a PhD in Mathematics from Aristotle University of Thessaloniki (2005) and a Bachelor's Degree in Mathematics from the same institution (1998). Draziotis specializes in Computational Number Theory and Cryptography , with a particular focus on Diophantine equations, elliptic curves, and cryptanalysis of digital signature schemes. His research bridges theoretical mathematics with practical cryptographic applications, especially in analyzing the security of cryptographic protocols and developing mathematical methods for solving complex number-theoretic problems. He has developed a Greek-language textbook on Introduction to Cryptography with Creative Commons licensing, demonstrating his commitment to accessible education in this field. His recent publications demonstrate a strong trend toward cryptanalysis of digital signature schemes (particularly DSA and ECDSA), lattice-based attacks , and number-theoretic approaches to cryptographic problems . His work spans both theoretical aspects of number theory (Diophantine equations, integer points on curves) and practical applications in cryptography (cryptosystem attacks, knapsack problems). The interdisciplinary nature of his research connects deep mathematical theory with real-world security applications, with publications consistently appearing in reputable journals like Information and Computation, Advances in Mathematics of Communications, and Theoretical Computer Science. Draziotis leads a crypto research group at the Aristotle University of Thessaloniki and actively contributes to open-source cryptographic and mathematical software ecosystems. His academic service includes participation in departmental administrative functions as indicated by various announcements on examination schedules, graduation ceremonies, and departmental operations visible on his website. He maintains collaborations with researchers including Dimitrios Poulakis, Marios Adamoudis, and Anastasia Papadopoulou, among others, reflecting an active research network in both Greek and international academic communities.

Raphaël Monatمشاهده پروفایل

پژوهشگر

• Static program analysis
• Abstract interpretation
• Formal methods
• +۵ مورد دیگر

Raphaël Monat is a Research Scientist in the SyCoMoRES team at Inria Lille since September 2022, with an affiliation at the University of Lille. His work focuses on formal methods and static program analysis, with particular applications to computational law and realistic software systems. He is one of the core maintainers of the Mopsa static analysis framework and has developed tools for analyzing the French tax code. Monat holds a Ph.D. in computer science from Sorbonne Université, advised by Antoine Miné, where he worked on the static analysis of Python and Python+C programs within the ERC MOPSA project. Prior to his position at Inria, he completed research internships at MPI-SWS in Saarbrücken, University of Oxford, and École Normale Supérieure in Paris. His primary research interest lies in improving software quality through automated program verification, with a focus on making static analysis applicable to realistic systems. Monat has a particular interest in computational law, especially the implementation of tax and benefit systems. He is currently developing formal methods tools for Catala, a domain-specific language for legislative texts, in collaboration with Aymeric Fromherz. His work emphasizes the practical application of theoretical concepts in abstract interpretation to real-world problems. Monat's publication record demonstrates a consistent focus on advancing static analysis techniques, particularly for Python and C programs, and applying them to computational law. His recent work shows an increasing emphasis on compositional analysis, concolic execution for legal computations, and improving the maintainability of academic static analyzers. The integration of formal methods with legislative implementations represents a distinctive thread throughout his research career. SV-Comp 2025 Silver Medal in "Software Systems" category Amazon Research Award, Fall 2024 ETAPS 2024 best tool paper award SV-Comp 2024 Gold Medal SV-Comp 2023 Bronze Medal ECOOP 2023 Distinguished Artifact Reviewer Award SOAP 2020 Best Presentation Award Monat actively mentors students, currently supervising two PhD candidates (Milla Valnet and Pierre Goutagny) and having previously guided several Master's students. He has secured significant funding for his research, including an ANR Young Researcher Grant for the RAISIN project on Resource-Aware Conservative Static Analysis starting in Fall 2024, and the Inria-AEx AVoCAT project for Automated Verification of Catala programs. Monat is a core contributor to the Mopsa static analysis platform, which has achieved notable success in the Software Verification Competition (SV-Comp). He also co-developed Mlang, a modern compiler for the French tax code that is being transitioned to production use by the French tax administration. His work bridges theoretical formal methods with practical applications in public administration.