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

• Theoretical Computer Science
• Algorithms
• Computational Complexity
• +۴ مورد دیگر

Nutan Limaye is a Professor at the Department of Theoretical Computer Science , IT University of Copenhagen , specializing in Algorithms , Computational Complexity , and Algebraic Circuits . She actively contributes to research on polynomial complexity, quantum computation, and lower bound techniques. Key Research Areas : Algebraic Circuit Complexity, Polynomial Computation, Graph Isomorphism, Boolean Satisfiability Current Projects : FLows : Formula complexity and lower bounds (2024-2026) DIREC: OnlineAlgo : Digital research initiatives (2022-2025) BARC2 : Basic Algorithms Research Copenhagen (2024-2029) Scientific Recognition includes the FOCS Best Paper Award (2022) . Her work frequently appears in top conferences like CCC , FSTTCS , and SIGACT News , with recent collaborations in Denmark and international institutions. She contributes to public understanding through media appearances on topics like basic computer science research and BARC's initiatives .

• Computer Science
• Electronic Engineering
• Integrated Circuit Testing
• +۶ مورد دیگر

Marcello Dalpasso is an Associate Professor of Computer Science at the School of Engineering, University of Padova, Italy, and a member of the Department of Information Engineering. He has held this position since 2004 after serving as a researcher and teaching assistant at the same university from 1998. Born in Ferrara, Italy (1965) Graduated with highest honors in Electronic Engineering (1990), University of Bologna PhD in Electronic Engineering and Computer Science (1994), Rome His research focuses on integrated circuit testing , fault simulation , and algorithm design . He has developed techniques for IDDQ testing , bridging fault modeling , and Boolean satisfiability applications in digital systems. Other contributions include optimization algorithms for Traveling Salesman Problem (TSP) and efficient data structures. Recent publications highlight his work on Answer Set Programming for timing analysis, Python programming education , and TSP neighborhood exploration . His research spans both theoretical and applied domains, from hardware testing to software development and computational biology. He has co-authored textbooks on Computer Networks , Software Design , and Programming in Java/Python/C++ , serving as a key contributor to educational materials in computer science.

• Algorithms
• Combinatorics
• Complexity Theory
• +۳ مورد دیگر

Sundar Vishwanathan is a Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay (IIT Bombay), where he has established himself as a leading researcher in theoretical computer science. His academic career spans over three decades with consistent contributions to algorithms, combinatorics, and complexity theory. His research interests form a cohesive body of work focused on theoretical foundations of computing: Algorithms (particularly approximation algorithms, online algorithms, and randomized algorithms) Combinatorics and extremal set theory Complexity theory and circuit lower bounds Graph theory and graph algorithms Combinatorial optimization problems Vishwanathan's publication record demonstrates remarkable consistency and depth, with publications spanning from 1990 to 2024. His recent work focuses on graph algorithms (particularly maximum matching problems), approximation algorithms for combinatorial optimization, and circuit complexity. He has developed innovative techniques using linear algebra, combinatorial methods, and probabilistic analysis to solve challenging theoretical problems. His approach often bridges theoretical insights with practical algorithmic considerations. His collaborative work spans multiple research groups, with frequent co-authorships with researchers such as Ashish Chiplunkar, Sumedh Tirodkar, and Sreyash Kenkre. His research has evolved from foundational work in online graph coloring in the 1990s to more specialized topics in combinatorics and recently to circuit lower bounds, showing both depth in core areas and adaptability to evolving research landscapes.

• Combinatorial Optimization
• Quadratic Programming
• Binary Optimization
• +۵ مورد دیگر

Cédric Elloumi is a Professor at the CEDRIC Laboratory within Conservatoire National des Arts et Métiers (CNAM), specializing in combinatorial optimization and mathematical programming. With a continuous publication record since 1992, he has established himself as a leading researcher in quadratic programming, binary optimization, and facility location problems. His research interests focus on developing exact and approximate methods for discrete optimization problems, particularly through convex reformulation techniques. Elloumi has made significant contributions to the p-center and p-median problems, quadratic assignment problems, and more recently, quantum-inspired optimization methods. His work bridges theoretical advancements with practical applications in network design, energy systems, and telecommunications. Analysis of his recent publications (2022-2025) reveals a continued focus on facility location problems, with increasing attention to robust optimization under uncertainty and emerging applications in quantum computing. His research demonstrates consistent methodological innovation, particularly in reformulation techniques that transform difficult non-convex problems into tractable forms. Throughout his career, Elloumi has maintained extensive collaborations with researchers including Billionnet, Lambert, Alès, and Plateau, resulting in numerous publications in top-tier optimization journals such as Journal of Global Optimization, Computers and Operations Research, and Mathematical Programming.

• Computational Complexity
• Algebraic Structures
• Circuit Satisfiability
• +۴ مورد دیگر

Dr. Jacek Krzaczkowski is a Lecturer in the Department of Computer Science Basics at the Faculty of Mathematics, Physics and Computer Science, Maria Curie-Skłodowska University. His research focuses on computational complexity, algebraic structures, and circuit satisfiability. Position: Lecturer Department: Computer Science Basics Key Research Areas: Computational Complexity, Equation Satisfiability, Algebraic Structures His recent work involves analyzing modular circuits, multi-valued logic systems, and equivalence problems in nilpotent and supernilpotent algebras. Scientific activity centers on satisfiability problems for algebraic structures, computational models, and algorithm optimization. Publications list includes 11 documented outputs with a focus on equation solving in algebraic systems and circuit complexity. Notable works include studies on finite automata over algebraic structures and equivalence problems in 2-nilpotent algebras. Research collaborations and citations demonstrate his contributions to theoretical computer science and mathematics. His current Hirsch index (GS Citations) is 6, with total impact factor 2.1 and SNIP 4.604.

Nitin Saurabhمشاهده پروفایل

استادیار

• Theoretical Computer Science
• Complexity Theory
• Analysis of Boolean Functions
• +۲ مورد دیگر

Nitin Saurabh is an Assistant Professor in the Department of Computer Science & Engineering at the Indian Institute of Technology Hyderabad. His research focuses on foundational areas of theoretical computer science, including complexity theory, analysis of Boolean functions, circuit complexity, and algorithm design. Education: Ph.D. from Institute of Mathematical Sciences (IMSc), Chennai Research Interests: Theoretical Computer Science Complexity Theory Analysis of Boolean Functions Circuit Complexity Algorithms

• Theoretical Computer Science
• Computational Complexity Theory
• Computational Number Theory
• +۲ مورد دیگر

Manindra Agrawal is a Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Kanpur (IIT Kanpur), where he has been a faculty member since 1996. His research focuses on theoretical aspects of computer science with particular emphasis on computational complexity theory and computational number theory. Dr. Agrawal completed his B.Tech in Computer Science from IIT Kanpur in 1986 and his PhD in Computer Science from the same institution in 1991. His doctoral thesis, titled "Towards a Characterization of NP-Complete Sets," was supervised by Professor Somenath Biswas. His research interests span computational complexity theory, computational number theory, algebra, and cryptography. Dr. Agrawal is best known for designing the first efficient and deterministic algorithm for testing if a number is prime, a groundbreaking result published in the Annals of Mathematics in 2004 as "PRIMES is in P." This work has had a profound impact on theoretical computer science and number theory, resolving a long-standing open problem in the field. His publication record shows a consistent focus on fundamental problems in theoretical computer science, particularly in complexity theory and number-theoretic algorithms. His work ranges from theoretical foundations like the isomorphism conjecture for constant depth reductions to practical applications such as designing encryption algorithms for the Indian Navy and Air Force. Padma Shri (2013) Infosys Prize (2008) Godel Prize (2006) Shanti Swarup Bhatnagar Award (2003) Clay Research Award (2002) Fellow of the Indian National Science Academy (FNA) Fellow of The World Academy of Sciences (FTWAS) Fellow of the Indian Academy of Engineering (FNAE) Fellow of the Indian Academy of Sciences (FASc) Dr. Agrawal has advised several notable students, including Nitin Saxena and Satyadev Nandkumar, who have made significant contributions to theoretical computer science. His research group has been instrumental in advancing knowledge in computational complexity and number theory. His work on primality testing has not only theoretical significance but has also influenced practical cryptographic applications.

Rolf Drechslerمشاهده پروفایل

استاد

• Formal Verification
• Quantum Computing
• RISC-V Architecture
• +۴ مورد دیگر

Rolf Drechsler is a Full Professor and Head of the Group of Computer Architecture at the University of Bremen's Institute of Computer Science since 2001, and Director of the Cyber-Physical Systems Group at DFKI Bremen since 2011. He holds an adjunct professorship at the Indian Statistical Institute and has been affiliated with Duke University. Education: Diploma (1992) and Dr. phil. nat. (1995) in Computer Science from Goethe University Frankfurt Academic Leadership: Dean of Mathematics and Computer Science Faculty (2018-2025), Vice Rector for Research (2008-2013) His research focuses on formal verification , RISC-V architectures , and quantum/in-memory computing . Recent work explores LLM integration in hardware testing and polynomial-based verification techniques. Publications from 2024-2025 span IEEE Transactions , DATE , and DAC , emphasizing automated verification , quantum circuit mapping , and LLM-driven testbench generation . Scientific Awards IEEE/ACM Best Paper Awards (2013, 2018) Berninghausen-Preis for Innovative Teaching (2018) IEEE Fellow (2015) Founder Award for Solvertec (2013) He has served on program committees for DAC, ICCAD, DATE, and founded graduate schools in Embedded Systems and System Design under Germany's Excellence Initiative.

Simone Severiniمشاهده پروفایل

استاد

• Quantum Computing
• Machine Learning
• Quantum Information
• +۳ مورد دیگر

Simone Severini is a Professor of Physics of Information at the University College London , affiliated with the Department of Computer Science . He is a Royal Society University Research Fellow and contributes to multidisciplinary groups including Intelligent Systems , UCL CS Quantum , UCL Quantum Science and Technology Institute , and CoMPLEX . Research Interests: His work bridges Quantum computing Machine learning Graph theory Quantum information theory Computational biology with a focus on quantum algorithms, classical simulation of quantum systems, and mathematical frameworks for physical correlations. Scientific Contributions: Recent publications span quantum state learning, non-Markovian dynamics, adversarial quantum learning, and graph isomorphism. His projects include Quantum Computing, Information, and Algebras of Operators and the Distributed Information initiative . Awards: Royal Society University Research Fellowship Best Paper Award at FCT2017

• Electronic design automation
• Hardware security
• Optimization
• +۵ مورد دیگر

Dr. Levent Aksoy is a Senior Research Fellow at Tallinn University of Technology, School of Information Technologies, Department of Computer Systems, where he has been working since 2020 (initially as a Post-Doc and since November 2023 as Senior Research Fellow). His academic journey began with a BSc from Yildiz Technical University, followed by MSc and PhD degrees from Istanbul Technical University in Electronics and Communication Engineering. Dr. Aksoy's research primarily focuses on electronic design automation, hardware security, and optimization techniques. His work spans several key areas including logic locking, circuit obfuscation, multiplierless design methods for constant multiplications, and switching lattices for efficient logic implementation. He has published extensively in top-tier IEEE journals and conferences, with a strong emphasis on hardware security mechanisms and efficient circuit design. His recent publications (2020-2025) demonstrate a clear research trajectory toward hardware security, with numerous papers on logic locking techniques, structural analysis attacks, and hardware obfuscation methods. This research direction aligns with his current leadership of the EAGER project on 'Hardware-Efficient Realization of UA Cryptographic Standards' and his involvement in the European Space Agency project on 'End-to-End Supply Chain Protection'. Dr. Aksoy has received multiple awards for his research contributions, including: First place in HELLO: CTF 2022 (2023) Best paper award at DDECS (2022) Best paper award at EUC (2015) As a supervisor, Dr. Aksoy currently guides three students working on hardware security topics, including lightweight cryptography implementations and advanced hardware protection mechanisms. He also serves on PhD and MSc defense committees at Tallinn University of Technology and Linköping University. His professional service includes IEEE membership and reviewing for prestigious IEEE transactions and conferences such as DATE, ICCAD, and ISCAS.

Theodosis Mourouzisمشاهده پروفایل

استادیار

• Information Security
• Cryptography
• Blockchain
• +۴ مورد دیگر

Dr Theodosis Mourouzis serves as an Assistant Professor of Information Management at the University of Nicosia and directs the MSc in Business Intelligence and Data Analytics program within the Department of Information Technologies. Academic Background: PhD in Information Security and Cryptography from University College London (UCL) MSc in Advanced Studies in Mathematics from University of Cambridge BA/MA in Mathematics from University of Cambridge Research Expertise: Dr Mourouzis specializes in information security with deep technical focus on cryptography (including symmetric/asymmetric cryptanalysis) and blockchain ecosystems . His work spans theoretical cryptanalysis of algorithms like GOST and SIMON to practical implementations such as privacy-preserving healthcare blockchain solutions. Current research emphasizes efficient blockchain design and security evaluation frameworks. Publication Trends: His 14 publications (2011-2021) reveal an evolution from foundational cryptanalysis (differential/algebraic attacks on ciphers) toward applied blockchain systems. Key thematic clusters include cryptographic security evaluation (35% of works), blockchain innovation (40%), and authentication systems (25%), demonstrating consistent technical rigor across theoretical and implementation challenges. Academic Leadership: As MSc Director, he oversees program development bridging technical cryptography research with business intelligence applications, indicating strong curriculum design capabilities and industry-academia translation focus.