Find Academic Supervisors

Vladimir ShpilrainView profile

Professor

• Post-Quantum Cryptography
• Computational Complexity
• Group Theory
• +4 more

Vladimir Shpilrain is a Professor in the Department of Mathematics at The City College of New York (CUNY). His primary research focuses on post-quantum cryptography, computational complexity, and algorithmic problems in group theory. He is a leading figure in applying algebraic methods to cryptographic protocols and has contributed to foundational work in non-commutative cryptography. His academic affiliations include the Algebraic Cryptography Center and collaborative projects at the intersection of mathematics and computer science. Shpilrain has authored over 100 publications, including two influential books on combinatorial and computational group theory. His work bridges pure mathematics (e.g., combinatorial group theory, affine algebraic geometry) with applied areas like secure communication and blockchain technology. He holds patents for cryptographic systems and has advised numerous students in interdisciplinary research areas. Shpilrain teaches advanced courses in linear algebra, probability theory, and cryptography. His research is supported by grants exploring post-quantum security, Cayley hash functions, and delegation protocols. Collaborations span global institutions, emphasizing both theoretical rigor and practical applications in information security.

Feng WangView profile

Assistant Professor

• Next Generation Internet
• Network Performance Measurement
• Big Data Verification
• +6 more

Dr. Feng Wang is an Assistant Professor in the School of Engineering at Liberty University, specializing in network reliability, interdomain routing, and software-defined networking. His research addresses challenges in next-generation internet architectures, network performance measurement, and secure IoT device management. Education: B.E. in Electrical and Computer Engineering from Zhejiang University (China) M.S. in Electrical and Computer Engineering from Yanshan University (China) Ph.D. in Electrical and Computer Engineering from the University of Massachusetts, Amherst Research focuses on: - Detecting transient routing failures and improving network performance through real-time diagnostic systems (e.g., collaboration with AT&T). - Designing scalable addressing schemes for IoT and wireless sensor networks. - Developing intrusion detection systems (e.g., MOCA framework) and network anomaly mitigation techniques. His publications (2015-2023) emphasize network security, routing protocol optimization, and scalable internet architectures. Notable work includes BGP rerouting solutions, real-time routing failure diagnosis, and variable-length addressing for 6LoWPAN. No scientific awards were explicitly listed in the provided texts. Collaborations include Agilent, AT&T, and Intel, focusing on practical network reliability and security solutions. Dr. Wang has advised no listed students or managed grants in the provided texts. His research extends to lab implementations of lightweight routers (SoC-based) and stability-aware protocols for RPL networks.

Filip TurobośView profile

Assistant Professor

• Mathematical Analysis
• Automotive Safety Engineering
• Transportation Systems
• +3 more

Filip Turoboś is an Assistant Professor at the Division of Insurance and Capital Markets , Lodz University of Technology . His academic profile indicates active research engagement without mention of part-time status, retirement, or former institutional affiliations. Research Focus: Dr. Turoboś demonstrates interdisciplinary expertise spanning: Mathematical Analysis : Including semimetric spaces, fixed-point theorems, and topological extensions Automotive Safety Engineering : Specializing in precrash velocity modeling using machine learning and optimization techniques Urban Mobility & Transport : Analyzing behavioral patterns during crises (e.g., pandemics) and regulatory impacts Emerging Technologies : Blockchain applications in security and ontological ecosystems Publication Trends (2020-2024): Recent works cluster into three dominant themes: Mathematical foundations of generalized metric spaces and functional analysis (30% of publications) Data-driven transportation studies focusing on pandemic-related behavioral shifts and urban policy effects (40%) Automotive crash reconstruction using AI/statistical methods and blockchain cryptography (30%)

Flaminia LuccioView profile

Associate Professor

• Computer Security
• Cryptography
• Distributed Systems
• +3 more

Flaminia Luccio is an Associate Professor at Ca' Foscari University of Venice, affiliated with the Department of Environmental Sciences, Computer Science and Statistics. Her research focuses on computer security, cryptography, distributed systems, and usability engineering. She has contributed to projects like the SAFE PLACE IoT security initiative and the FWS firewall analysis tool. Luccio teaches courses such as Cryptography and Advanced Algorithms at both undergraduate and graduate levels. Research: Her work spans formal verification of cryptographic protocols, secure IoT implementations, and usable security solutions for QR codes and biometric authentication. She has led projects involving secure hardware configuration for cloud environments and resilient firewall management systems. Recent contributions address side-channel vulnerabilities and malware detection through machine learning. Teaching: Courses include Cryptography (Master's), Algorithms and Data Structures (Bachelor's), and Web Technologies for Tourism (Master's). Teaching materials are accessible via her departmental website and personal profile. Collaborations: Collaborates with researchers like Riccardo Focardi on cybersecurity frameworks. Engages in interdisciplinary projects combining accessibility with technology, such as improving tourism websites for users with disabilities.

William KuszmaulView profile

Assistant Professor

• Theory
• Algorithms and Complexity
• Randomized Algorithms
• +3 more

William Kuszmaul is an Assistant Professor in the Computer Science Department at Carnegie Mellon University. His research focuses on designing and analyzing randomized algorithms and data structures, with a particular emphasis on hashing techniques, algorithm complexity, and data structure optimization. He holds a PhD from MIT, advised by Charles E. Leiserson, and previously served as the Rabin Postdoc of Theoretical Computer Science at Harvard University. His research interests include theory and algorithms and complexity , with recent work addressing optimal bounds for open addressing, efficient cuckoo hashing, and tight analyses of linear probing. Notable contributions include studies on list labeling, minimal perfect hashing, and distributed load balancing under dependency constraints. Kuszmaul has advised students Jingxun Liang and Renfei Zhou in his current role. His publications span 2023–2025, reflecting a focus on foundational algorithmic problems with applications in memory management, parallel computing, and data structure efficiency. Key themes include optimizing hash table performance, analyzing algorithmic phase transitions, and establishing theoretical limits for dynamic retrieval systems. No scientific awards are explicitly listed in the provided materials. His academic trajectory includes postdoctoral work at Harvard and doctoral research at MIT, supported by the John and Fannie Hertz Fellowship. Current courses listed include 15-151 (Fall 2025) and 15-756 (Fall 2024) , suggesting involvement in both introductory and advanced computer science education.

Somindu Chaya RamannaView profile

Assistant Professor

• Cryptography
• Cryptographic Protocols
• Algorithmic Game Theory
• +3 more

Somindu Chaya Ramanna is an Assistant Professor in the Department of Computer Science and Engineering at IIT Kharagpur. Previously, he held a postdoctoral position at ENS de Lyon (2015–2016) and served as an assistant professor on contract at IIT Bhubaneswar. His research focuses on cryptography, computational number theory, and algorithmic game theory. He completed his Ph.D. at the Indian Statistical Institute under Prof. Palash Sarkar. Education: Ph.D. in Cryptography, Indian Statistical Institute, Kolkata (Advisor: Prof. Palash Sarkar) Postdoc at ENS de Lyon, France (2015–2016) Research Interests: Design and analysis of cryptographic primitives Functional encryption schemes Algorithmic game theory applications Computational number theory algorithms Efficient cryptographic protocols Teaching & Courses: Algorithmic Game Theory (CS60025) Foundations of Cryptography (CS60088) Computational Number Theory (CS60094) Randomised Algorithm Design (CS60029)

• Algorithms
• Data Structures
• Combinatorics
• +9 more

Conrado Martinez Parra is a Professor in the Department of Computer Science at the Faculty of Computer Science, Universitat Politècnica de Catalunya (UPC). He is a core member of the ALBCOM research group, which focuses on Algorithmics, Bioinformatics, Complexity, and Formal Methods. Affiliation : Department of Computer Science, Faculty of Computer Science (FIB), UPC Research Group : ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals Email : conrado@cs.upc.edu ORCID : 0000-0003-1302-9067 Researcher ID : G-4629-2015 His research spans theoretical computer science with a strong emphasis on the design and analysis of algorithms and data structures. His work includes average-case analysis of algorithms, combinatorial generation, probabilistic methods in algorithmics, and applications in information retrieval and data stream processing. He has extensively studied multidimensional data structures such as quadtrees, K-d trees, and skip lists, analyzing their performance under various query models including partial match and orthogonal range searches. His recent publications reveal a sustained focus on algorithmic efficiency, sampling techniques, and probabilistic modeling in data structures. Trends indicate a deep engagement with randomized algorithms, unbiased estimation, and cache-efficient selection methods, reflecting both theoretical rigor and practical applicability in modern computing environments. Scientific Contributions Extensive publication record spanning over three decades, from 1989 to 2024. Active in major algorithmic conferences such as ANALCO, AofA, and AAAI. Contributions to foundational algorithm analysis including Hoare’s FIND, Quickselect variants, and deletion in binary search trees. Collaborative research with prominent figures in theoretical computer science across Europe. Professor Martinez Parra has advised or collaborated with several doctoral students, including Gustavo Lau, whose thesis on partial match queries he supervised. He has participated in numerous competitive R&D projects funded by national and regional programs, focusing on large-scale information processing and graph-based computing models. His work is supported by long-standing grants from Spanish and Catalan research councils. He is affiliated with the ALBCOM research group, a leading team in algorithmic research at UPC, contributing to both theoretical advances and practical implementations in combinatorics and data structure optimization.

Santosh ChandrasekharView profile

Academic

• Computer Science Education
• Security Education
• Teaching Strategies
• +3 more

Santosh Chandrasekhar serves as an Assistant Teaching Professor in the Department of Electrical Engineering and Computer Science at the University of California, Merced, within the School of Engineering. His academic position focuses on teaching excellence and curriculum development in computer science education. Dr. Chandrasekhar's research interests include: Development of effective teaching strategies for undergraduate computer science courses Development of a security education program for undergraduate students His scholarly work demonstrates significant contributions to computer security education and cryptographic research. His publications span from 2007 to 2017, showing a clear progression from fundamental cryptographic techniques to applied security solutions in modern computing environments. His research exhibits consistent focus on developing efficient, scalable security protocols that balance robust protection with practical implementation considerations. Dr. Chandrasekhar's publication record reveals expertise in trapdoor hash functions, proxy signatures, cloud security frameworks, and authentication protocols. His work addresses security challenges across multiple domains including cloud computing, ubiquitous computing environments, and mobile ad hoc networks, demonstrating both theoretical depth and practical application. As a teaching professor, he is deeply involved in undergraduate instruction and curriculum development, with particular emphasis on integrating security concepts throughout the computer science program at UC Merced.

Davide AnconaView profile

Associate Professor

• Formal Methods
• Runtime Verification
• Programming Languages
• +3 more

Davide Ancona is an Associate Professor at the University of Genoa, Italy, in the Department of Computer Science, Bioengineering, Robotics, and Systems Engineering (DIBRIS). He holds key governance roles: Member of the School Council, School of Mathematical, Physical and Natural Sciences Member of the Department Board, DIBRIS His teaching portfolio spans Internet of Things, Healthcare IoT, Wearable Devices, Programming Languages, and Pervasive Computing across Computer Science and Bioengineering degree programs. His research concentrates on: Formal Methods and Programming Languages (specializing in corecursive streams and type systems) Runtime Verification for software correctness and multi-agent systems Internet of Things applications in healthcare contexts His work bridges theoretical foundations with practical verification tools for critical systems. Analysis of his 2023-2024 publications reveals: Foundational advances in corecursive stream equivalence and expressivity Novel applications of logic programming to runtime monitoring Techniques for verifying mutable object behavior in Java Extensions to robotic multi-agent frameworks like JaCaMo These contributions demonstrate a cohesive trajectory from theoretical programming language research to real-world IoT and healthcare validation systems.

Szymon GłąbView profile

Professor

• Mathematical Analysis
• Set Theory
• Functional Analysis
• +6 more

Dr. DSc, Eng Szymon Głąb is a research and teaching university professor at the Department of Applications of Modern Mathematical Analysis, Lodz University of Technology. His work bridges abstract mathematical analysis with applied problems in computer science and topology. Fields of Interest Mathematical Analysis Set Theory Functional Analysis Algebrability Measure Theory Density Operators His research focuses on the interplay between set theory, measure theory, and functional analysis, particularly in characterizing small sets (e.g., Haar-null sets, meager ideals) and studying algebrability of non-measurable functions. Recent publications highlight his contributions to inverse Fraïssé limits, duality for posets, and topological properties of ideals. Notable collaborations include advising Jarosław Swaczyna (2020) on Haar-I sets, Jacek Marchwicki (2018) on conditionally convergent series, and contributing to blockchain applications in computer science.

Daisaku YokoyamaView profile

Assistant Professor

• Parallel and Distributed Processing
• Combinatorial Search
• Game Tree Search
• +4 more

Daisaku Yokoyama is an Assistant Professor at the Institute of Industrial Science, University of Tokyo, where he works in Department 3 of the Kitsuregawa-Toyoda Laboratory. His research focuses on parallel and distributed processing, combinatorial search, game tree search, and other search processes. He is also involved in the development of "Gekisashi," a computer shogi (Japanese chess) player. His academic background includes: March 1998: Graduated from the Department of Electronic and Information Engineering, Faculty of Engineering, The University of Tokyo March 2000: Completed Master's course in Information Engineering at the University of Tokyo 2002.3: Graduated from the Doctoral Program in Information Engineering, Graduate School of Engineering, The University of Tokyo September 2006: Obtained a PhD in Science from the Graduate School of Frontier Sciences, University of Tokyo Daisaku Yokoyama's research interests primarily center around parallel and distributed computing systems, with a particular focus on combinatorial search algorithms and game tree search techniques. His work bridges theoretical computer science with practical applications, especially in the domain of computer shogi where he has developed "Gekisashi." Beyond game AI, his research has expanded into big data analytics, particularly in transportation systems where he analyzes passenger flows in metro networks and driver behavior using vehicle recorder data. His work demonstrates a consistent thread of applying parallel processing techniques to solve computationally intensive problems across various domains. Yokoyama's publication record shows a clear evolution from foundational work in parallel combinatorial optimization (PopKern library) to more applied research in computer shogi and eventually to big data applications in transportation systems. His early work established frameworks for parallel search algorithms, while more recent publications demonstrate applications of these techniques to real-world problems involving massive datasets from metro systems and vehicle recorders. His research consistently emphasizes the importance of domain-specific knowledge in optimizing parallel algorithms. His notable scientific achievements include: DBSJ Best Paper Award 2014 for "Application and Evaluation of a Bayesian-Based Monte Carlo Tree Search Algorithm to Shogi" Game Programming Workshop Excellent Paper Award (awarded twice) Throughout his career, Yokoyama has been actively involved in academic service, serving on editorial boards, program committees, and as an organizer for numerous conferences and workshops related to programming, parallel computing, and game AI. His work on the Gekisashi shogi engine represents a long-term research project that has evolved from basic search algorithms to sophisticated AI systems, demonstrating both theoretical rigor and practical implementation skills. He is part of the Kitsuregawa-Toyoda Laboratory at the Institute of Industrial Science, University of Tokyo, which focuses on advanced computing systems, database technologies, and large-scale data processing. The laboratory provides a collaborative environment for research spanning theoretical computer science to real-world applications in transportation analytics and game AI.

Chethan KamathView profile

Assistant Professor

• Cryptography
• Theoretical Computer Science
• Foundations of Cryptography
• +5 more

Chethan Kamath is an Assistant Professor in the Department of Computer Science and Engineering at IIT Bombay, where he is a member of the Theory Group and Trust Lab. His primary research focus is on cryptography, particularly its foundations, with broader interests extending to theoretical computer science. His educational journey includes: PhD from IST Austria (2014-2020) under Krzysztof Pietrzak, with thesis titled "On the Average-Case Hardness of Total Search Problems" Master's in CS from IISc Bangalore (2010-2013) under Sanjit Chatterjee, with thesis titled "Constructing Provably Secure Identity-Based Signature Schemes" Bachelor's in CS from University of Kerala (2005-2009) at TKM College of Engineering, Kollam Dr. Kamath's research interests span the theoretical foundations of cryptography, with particular focus on secure computation, complexity theory, and cryptographic hardness assumptions. His work often bridges theoretical computer science with practical cryptographic applications, exploring the boundaries of what can be efficiently computed while maintaining security guarantees. His research frequently addresses fundamental questions about the relationship between cryptographic primitives and complexity classes, especially the PPAD and TFNP complexity classes. His recent publications demonstrate a consistent focus on foundational aspects of cryptography, with particular emphasis on secure computation (garbled circuits, Yao's protocol), proofs systems (proofs of work, proofs of exponentiation), and complexity-theoretic aspects of cryptographic primitives. A notable trend is his exploration of the connections between complexity classes like PPAD and cryptographic assumptions, as well as his work on verifiable delay functions and their underlying number-theoretic assumptions. His research often employs tools from algorithmic graph theory (treewidth, separators) to analyze cryptographic protocols. His notable scientific achievement includes: Azrieli Fellowship during his post-doc at Tel Aviv University Dr. Kamath actively mentors students and researchers, currently advising several PhD and MS students at IIT Bombay, often in collaboration with Sruthi Sekar. His service to the academic community includes extensive program committee memberships for major conferences including Crypto, Eurocrypt, and TCC, demonstrating his standing in the cryptographic research community. He has co-organized educational events like the "Introduction to Cryptography" school as part of the ACM India Summer School 2025 and the "Theoretical Foundations of Cryptography" school as part of the ACM India Summer School 2024. He leads research activities within the Trust Lab at IIT Bombay, which focuses on theoretical and applied aspects of cryptography and security. The lab actively recruits MS/PhD students and post-docs, with ongoing research in foundational cryptography and its applications to secure computation, verifiable delay functions, and complexity-theoretic aspects of cryptographic security.

David MaloneView profile

Professor

• Mathematical Modeling
• WiFi Networks
• Power Line Communications (PLC)
• +5 more

David Malone is a Professor and Director of the Hamilton Institute at Maynooth University, affiliated with the Department of Mathematics & Statistics. His research focuses on networking security, wireless network modeling (802.11 and IPv6), power line communications, and password security analysis. Education: B.A.(mod), M.Sc., Ph.D. in Mathematics from Trinity College Dublin Research Interests: Mathematical modeling of networks, WiFi/PLC measurement, password security, IPv6 administration, and wireless network optimization Email: david.malone@mu.ie Recent publications analyze non-cryptographic hash functions, password guessing algorithms, and network security protocols. He has supervised numerous Ph.D. and M.Sc. students in networking and security domains.

Muhammad AsifView profile

Associate Professor

• Machine Learning
• Data Fusion
• Software Engineering
• +6 more

Muhammad Asif is Tenured Associate Professor of Computer Science and Chairman at National Textile University, Faisalabad. His career spans roles as Director of Graduate Studies and Research at NTU, a visiting researcher at Japan's National Institute of Information, and a software engineer for Pakistan Air Force projects. Ph.D. and MS from Asian Institute of Technology (2012, 2009) via HEC foreign scholarship Over 200 impact factors from top journals Secured 300+ million PKR in research funding Research Interests: Machine Learning & Data Fusion Neural Networks & Sentiment Analysis Computer Vision & Cybersecurity Educational Technology & AI Applications Recent publications show trends in multimodal AI systems , steganography security , and education-technology integration . His work spans from 2023–2025 , with a focus on meta-learning , image analysis , and sentiment modeling . Scientific Recognition: HEC Foreign Scholarship High-impact publications across multiple domains Editorial roles in IEEE Access , PLOS One , and PeerJ Computer Science Administrative Roles: Chairman, Department of Computer Science (NTU) Permanent advisor at Punjab Public Service Commission Program evaluator for National Computing Education Accreditation Council

Janoš VidaliView profile

Assistant Professor

• Cryptography
• Graph Theory
• Discrete Geometry
• +3 more

Assistant Professor at the University of Ljubljana's Faculty of Computer and Information Science (FRI) specializing in theoretical computer science and discrete mathematics. His research bridges cryptography, graph theory, and metric geometry with practical applications in algorithm design and security protocols. Research Focus: Primary interests include cryptography (hash function analysis), graph theory (combinatorial structures, graph databases), and discrete geometry (metric cones, polyhedral combinatorics). His work demonstrates strong interdisciplinary connections between theoretical mathematics and computational problem-solving. Publication Trends: Recent publications reveal a consistent focus on combinatorial structures with applications in both cryptography and geometry. His research combines rigorous mathematical proofs with computational implementations, particularly evident in metric space analysis and graph-theoretical frameworks. Projects: Leads significant open-source initiatives including gap-graphs (computational graph theory) and GraphZOO (graph database), alongside the Kriptogram crypto portal for cryptographic education in Slovene. Teaching: Maintains office hours by appointment with focus on advanced mathematical and cryptographic concepts. Integrates research directly into teaching through computational projects and open-source tools development.