Find Academic Supervisors

Fendy SantosoView profile

Researcher

• Cybersecurity
• Artificial Intelligence
• Autonomous Systems
• +12 more

Dr. Fendy Santoso is a leading researcher and Cyber-Physical Lead at the Artificial Intelligence and Cyber Futures Institute, Charles Sturt University, Australia. He also holds a Visiting Fellow position at the School of Engineering and Technology, UNSW Canberra, and has held visiting roles at the University of Cambridge and Cranfield University. His work bridges cybersecurity, AI, and autonomous systems, with significant impact in UAV security and cyber-physical resilience. Education: PhD in Electrical Engineering, University of New South Wales (Awarded: 21 Jun 2012) Master of Electrical and Computer Systems Engineering, Monash University (Awarded: 07 Jun 2007) Dr. Santoso’s research focuses on adversarial machine learning, UAV security, intrusion detection in robotic systems, and cyber-secure digital twins. His work integrates AI, control theory, and cybersecurity to enhance the resilience of autonomous systems. He has pioneered research in securing ROS-based platforms and defending against GPS spoofing and DoS attacks in unmanned vehicles. His recent publications (2020–2025) highlight a strong trend in applying deep learning, fuzzy logic, and physics-informed models to detect and mitigate cyberattacks in UAVs and UGVs. Key themes include intrusion detection systems, secure digital twins for agriculture, and intelligent transportation systems enabled by drones. His work is frequently published in IEEE Transactions and top-tier conferences. Scientific Awards and Grants: Vice-Chancellor’s Distinguished Early Career Travel Fellowship, University of Wollongong (2019) ARC Linkage Project Grant (LP230100083) on adversarial machine learning for UAVs (2024) CSIRO-funded AgriTwins project on cyber-secure digital twins for agriculture (2024) Dr. Santoso has secured over AUD 3 million in competitive research funding and actively supervises postgraduate students. He serves as a reviewer for the Australian Research Council and technical program committees of major AI and engineering conferences. His collaborative work spans defence organisations like DSTG and the U.S. Army Ground Vehicle Systems Centre, as well as international academic institutions. He is a Senior Member of IEEE and leads research in labs focused on cyber-physical systems, autonomous robotics, and AI-driven security frameworks. His team develops real-time detection tools for cyberattacks on military and agricultural robots, contributing to critical infrastructure resilience.

• Medical Devices
• Biomedical Engineering
• Wireless Healthcare Technology
• +4 more

John S. Y. Ho is an Associate Professor in the Department of Electrical and Computer Engineering at the National University of Singapore. His research focuses on developing wireless medical devices for real-time monitoring and intervention in treatment-resistant medical conditions. Notably, he has pioneered work on vagus nerve stimulation (VNS) for depression and digital therapeutics. Ho holds a PhD in electrical engineering from Stanford University, where he was a National Defense Science and Engineering Graduate Fellow. Professional accolades include the NRF Fellowship, NUS Young Investigator Award, and recognition on MIT TR35 and Forbes 30 Under 30 Asia lists. His interdisciplinary work bridges engineering and medicine, addressing gaps in mental health treatment through innovative technologies. Education: PhD in Electrical Engineering, Stanford University Research interests center on neurostimulation therapies, depression biomarkers, and clinical outcome measurement. Key projects include large-scale trials evaluating VNS efficacy and digital tools like CT-152 for treatment-resistant depression. His work emphasizes translational research to improve patient care and reduce treatment resistance. Publications highlight advancements in antidepressant pharmacology, metabolomics, and suicide risk assessment. Ho collaborates globally on initiatives like the RECOVER trial (VNS efficacy) and TX-YDSRN (adolescent mental health). Current efforts focus on deploying AI-driven tools for mental health monitoring and optimizing measurement-based care in primary settings. No specific grants or labs are explicitly mentioned in the text.

Jop BriëtView profile

Researcher

• Theoretical Computer Science
• Quantum Information Theory
• Combinatorics
• +3 more

Jop Briët is a Researcher at the Department of Algorithms and Complexity at Centrum Wiskunde & Informatica (CWI) in the Netherlands. His work focuses on theoretical computer science, quantum information theory, combinatorics, and tensor analysis. He has held grants including the Veni Innovational Research Grant from NWO and a Rubicon fellowship. He has authored over 50 publications in leading venues, exploring topics such as Grothendieck inequalities, quantum computing, and additive combinatorics. His research interests span the interplay between combinatorics and computational complexity, with particular emphasis on tensor analysis, probabilistic methods, and algorithm design. Recent work includes studies on Szemerédi’s theorem with random differences and the application of quantum query algorithms to entanglement-based problems. Awards: Outstanding paper award TQC (2020), Andreas Bonn medal (2013), Stieltjesprijs (2011). Professional Activities: Editor for ERCIM News, Board Member of Koninklijk Wiskundig Genootschap, and frequent invited speaker at workshops on quantum computing and combinatorics. Grants: Veni Grant (2014), Rubicon Fellowship (2012). Current teaching includes courses on Additive Combinatorics and Quantum Information Processing, reflecting his commitment to bridging foundational theory with advanced applications in computing and mathematics.

Lai-Sang YoungView profile

Professor

• Dynamical Systems
• Ergodic Theory
• Non-uniform Hyperbolicity
• +7 more

Lai-Sang Young is the Henry & Lucy Moses Professor of Science at the Courant Institute of Mathematical Sciences, New York University. She has held previous positions at Northwestern University, Michigan State University (1980–1986), the University of Arizona (1987–1990), and UCLA (1991–1999). She has also held visiting positions at MSRI, Universitat Bielefeld, the University of Warwick, and the Institute for Advanced Study at Princeton. Her primary research interests lie in dynamical systems and ergodic theory , particularly focusing on strange attractors , non-uniform hyperbolicity , SRB measures , entropy , and statistical properties of chaotic systems . Her work bridges pure mathematics with applications in mathematical physics , probability , and neuroscience . She has made groundbreaking contributions to the understanding of chaotic behavior in deterministic and stochastic systems. The 15 most recent publications highlight her sustained focus on non-uniformly hyperbolic systems , random perturbations , Lyapunov exponents , SRB measures , and nonequilibrium statistical mechanics . Her research spans abstract mathematical theory and its applications to physical and biological models, including neuronal networks and heat conduction. Her scientific awards include: Ruth Lyttle Satter Prize (1993) Guggenheim Fellowship (1997) Election to the American Academy of Arts and Sciences (2004) Noether Lecturer, AWM (2005) Sonia Kovalevsky Lecture, AWM-SIAM (2007) Rolf Schock Prize in Mathematics (2024) She has advised several students and collaborated with prominent mathematicians such as Qiudong Wang, François Ledrappier, and Mark Demers. Her work has been supported by prestigious fellowships and grants, though specific funding sources are not detailed in the provided text. She has not held administrative or part-time roles, and there is no indication of retirement. She leads a research group focused on chaotic and stochastic dynamical systems, contributing to both theoretical advances and interdisciplinary applications.

Andreas StahlView profile

Professor

• Ophthalmology
• Retinopathy of Prematurity
• Angiogenesis
• +3 more

Prof. Dr. med. Andreas Stahl is a faculty member at the University of Greifswald , serving as the Director of the University Eye Clinic . His work integrates clinical practice and research in ophthalmology, with a focus on retinal diseases. University: University of Greifswald Role: Director of the Clinic Contact: clinic-management-eyes@med.uni-greifswald.de Research Interests: Stahl’s research centers on retinopathy of prematurity (ROP) , anti-VEGF therapies , angiogenesis , and diabetic retinopathy . He explores pathophysiological mechanisms and innovative treatments for retinal vascular disorders, collaborating across disciplines to improve neonatal and adult ophthalmological outcomes. Recent Publications: His 2021–2022 work includes clinical decision support tools for ROP screening, comparative studies of ranibizumab and laser therapy, and analyses of retinal vascular occlusion post-COVID vaccination. These reflect his commitment to advancing treatment protocols and understanding disease mechanisms. Teaching: Involved in student education and e-learning development for ophthalmology. Projects: Participates in the INTERREG European Region Pomerania (INT118) initiative.

Uriel FeigeView profile

Professor

• Algorithms
• Computational Complexity
• Algorithmic Game Theory
• +4 more

Uriel Feige is a Professor in the Department of Computer Science and Applied Mathematics at the Weizmann Institute of Science. Born in Jerusalem, he earned his BSc from the Technion and his MSc and PhD from the Weizmann Institute under the guidance of Adi Shamir. After postdoctoral research at Princeton University and IBM T.J. Watson Research Center, he joined the Weizmann Institute in 1992. From 2004-2007, he worked with Microsoft Research's Theory Group and continues to serve as a visiting researcher there. Education: BSc: Technion MSc: Weizmann Institute of Science (under Adi Shamir) PhD: Weizmann Institute of Science (under Adi Shamir) Professor Feige's research focuses on algorithms, computational complexity, and algorithmic game theory. His work spans approximation algorithms, hardness results, and beyond worst-case analysis of combinatorial optimization problems. He has made significant contributions to the understanding of random walks on graphs, particularly in analyzing cover times and developing approximation algorithms. His research also extends to allocation problems and fairness in algorithmic game theory, while previously working on cryptography and other theoretical topics. Professor Feige's publications reveal consistent contributions to theoretical computer science with a strong emphasis on fundamental algorithmic problems. His work bridges theoretical foundations with practical implications, particularly in approximation algorithms where he has established both upper and lower bounds for various problems. Many papers focus on the interplay between graph structure and algorithmic performance. Scientific Awards: 2001 Godel Prize 2005 SIAM Outstanding Paper Prize Professor Feige has advised numerous students documented in technical reports on his website. His research has been supported by various grants enabling his theoretical contributions. He actively teaches courses including algorithms, linear programming, combinatorial optimization, approximation algorithms, and algorithmic game theory through 2024-2025. Professor Feige maintains an active research program within the Department of Computer Science and Applied Mathematics at the Weizmann Institute, where his work intersects with multiple research groups focusing on theoretical computer science and algorithms.

Rocco ServedioView profile

Professor

• computational complexity theory
• computational learning theory
• property testing
• +2 more

Rocco Servedio is a Professor in the Department of Computer Science at Columbia University. He earned his PhD from Harvard University under the supervision of Leslie Valiant, with a thesis on efficient algorithms in computational learning theory. Prior to joining Columbia, he was an NSF postdoctoral fellow at Harvard University. His research spans computational complexity theory, computational learning theory, property testing, analysis of Boolean functions, and randomness in computing. He has made significant contributions to the theoretical foundations of computer science, particularly in understanding the power and limitations of efficient algorithms for learning and testing. His work bridges theoretical computer science with practical applications in algorithm design and analysis. Professor Servedio has been recognized with numerous awards including: Alfred P. Sloan Research Fellowship NSF CAREER Award Columbia University Presidential Teaching Award Best paper or best student paper awards from STOC, FOCS, COLT, and CCC conferences His research has been supported by grants such as the NSF CAREER award, and he has served as a visiting scientist for programs including Sublinear Algorithms (Summer 2024), Analysis and TCS: New Frontiers (Summer 2023), and Real Analysis in Computer Science (Fall 2013). These appointments reflect his active engagement with the broader theoretical computer science community and ongoing contributions to cutting-edge research initiatives.

• Theoretical Computer Science
• Algorithm Design
• Distributed Computing
• +6 more

Yannic Maus is a University Professor at the Faculty of Computer Science and Biomedical Engineering at Graz University of Technology (TU Graz), Austria, where he heads the newly founded Institute of Algorithms and Theory (established in 2025). He also serves as co-leader of one of the five fields of expertise at TU Graz (FoE Information, Communication & Computation). His academic journey includes: PhD in Computer Science from University of Freiburg, Germany (2014-2018) MSc in Mathematics from RWTH Aachen, Germany BSc in Mathematics and Computer Science from RWTH Aachen, Germany (with a year at National University of Singapore) Professor Maus specializes in theoretical computer science and algorithm design, with a particular focus on distributed computing. His research spans distributed graph algorithms, efficient algorithms, data structures, complexity theory, and geometric algorithms. He approaches problems with both theoretical rigor and practical applications in mind, seeking clean mathematical solutions to questions motivated by real-world systems. His recent publications show a strong focus on distributed and parallel algorithms, particularly in graph theory. The research trends include distributed graph coloring, symmetry breaking, vertex cover problems, and massively parallel computing models. His work often bridges theoretical computer science with practical distributed systems considerations, with applications to large-scale networks and highly parallel systems. Professor Maus has received numerous accolades for his research: 2020 Principles of Distributed Computing Doctoral Dissertation Award Wolfgang-Gentner-Nachwuchsförderpreis 2019 GI Dissertationspreis 2018 Best Paper Awards at SIROCCO 2016, DISC 2016, and DISC 2017 Professor Maus actively mentors PhD students and has secured significant research funding, including FWF grants P36280-N (2023-2027), DOC 183 (2024-2028), I6915 (2024-2028), and FFG grant No. 59263962. His research group maintains strong international collaborations with institutions across Germany, Finland, Iceland, Israel, and beyond, providing students with opportunities for international research visits. He leads the Algorithms & Complexity research group at TU Graz, which includes PhD students Manuel Jakob, Florian Schager, Malte Baumecker, and Kritika Kashyap, as well as postdoc Tijn de Vos. The group is actively involved in theoretical computer science research with a focus on distributed and parallel algorithms, particularly for large-scale networks and highly parallel systems.

• Probabilistic combinatorics
• Extremal combinatorics
• Graph theory
• +4 more

Ross J. Kang is a Canadian mathematician currently serving as an Associate Professor at the Korteweg–de Vries Institute for Mathematics within the Faculty of Science at the University of Amsterdam since 2022. He is an active member of the Discrete Mathematics and Quantum Information group and the NETWORKS consortium. Previously, he held positions as Assistant/Associate Professor at Radboud University Nijmegen (2014-2022), Assistant Professor at Utrecht University (2013), and Researcher at Centrum Wiskunde & Informatica (2012-2013). His academic journey includes postdoctoral positions at Durham University (2010-2012) and McGill University (2008-2010), where he was advised by Bruce Reed and Louigi Addario-Berry. DPhil in Mathematics, University of Oxford (2008) - Thesis: 'Improper colourings of graphs', advised by Colin McDiarmid BSc (Hons) in Mathematics and Computer Science, University of Victoria (2003) - Governor General's Silver Academic Medal recipient Ross J. Kang's research focuses on probabilistic and extremal combinatorics, random discrete structures, graph coloring, geometric graphs, and algorithms. His work bridges theoretical mathematics with practical applications, exploring fundamental questions in discrete mathematics. He has made significant contributions to understanding graph coloring problems, particularly in the contexts of list coloring, distance coloring, and strong coloring. His research often employs probabilistic methods to establish bounds and structural properties in graph theory. Kang's work on the hard-core model, local occupancy method, and triangle-free graphs has advanced our understanding of the interplay between local constraints and global structure in discrete systems. Analysis of his recent publications reveals a strong emphasis on graph coloring problems, particularly list coloring variants and their extensions. His work frequently explores the relationship between graph structure (such as degree constraints, girth, or forbidden subgraphs) and coloring properties. A notable trend is his development and application of the local occupancy method to establish improved bounds for chromatic numbers in various graph classes. His research also demonstrates a consistent interest in extremal problems, seeking optimal configurations under specific constraints, particularly in the context of triangle-free graphs and geometric representations. NWO Open Competition M-1 grant entitled 'Asymptotic triangle-free structure (3Free)', 2022-2026 NWO Vidi grant entitled 'On the edge: theory and techniques at the frontiers of edge-colouring', 2017-2023 NWO Veni grant entitled 'Generalised colouring for random graph models', 2012-2015 Van Gogh travel grants (2020-2021 with Marthe Bonamy; 2016-2017 with Louis Esperet) Governor General's Silver Academic Medal (2003) Ross J. Kang has successfully supervised multiple PhD students including Eoin Hurley (defending May 2025), Stijn Cambie (defended April 2022), and François Pirot (winner of 2020 prix Charles Delorme). His research is supported by significant grants from the Netherlands Organisation for Scientific Research (NWO), including the prestigious Open Competition M-1 grant. Kang is actively involved in the academic community through his editorial role at Combinatorial Theory, co-organization of conferences like the Dutch Days of Combinatorics, and leadership in initiatives such as Innovations in Graph Theory, a diamond open access journal he helped launch in August 2023. As a member of the Discrete Mathematics and Quantum Information group at the University of Amsterdam and the NETWORKS consortium, Kang collaborates with researchers across various institutions. He has established strong international connections through his Van Gogh travel grants and participation in collaborative projects like the Sparse (Graphs) Coalition sessions. His research group focuses on theoretical aspects of discrete mathematics with connections to quantum information science, and he maintains active collaborations with researchers across Europe and North America.

Roland KetzmerickView profile

Professor

• Quantum Chaos
• Hamiltonian Systems
• Floquet Systems
• +3 more

Roland Ketzmerick is a Professor of Computational Physics at Technische Universität Dresden since 2002, with a Max Planck Fellow position at the Max Planck Institute for the Physics of Complex Systems (2010–2020). He was spokesperson for the DFG Forschergruppe FOR760 on Scattering Systems with Complex Dynamics (2010–2013). His research focuses on quantum chaos in mixed systems, power-law trapping in Hamiltonian systems, Floquet systems , Hamiltonian ratchets , mesoscopic physics , fractal spectra , and Bloch electrons in magnetic fields . His work bridges classical and quantum dynamics, exploring tunneling, wavefunction statistics, and nonequilibrium phenomena. His publications demonstrate a strong emphasis on chaotic resonance states , dynamical tunneling , multifractal analysis , and quantum transport in complex systems. Recent articles (2022–2025) address dielectric cavities, ultracold atom entanglement, and 4D Hamiltonian structures. Scientific Awards : Otto-Klung-Prize (1999)

Zhenke WuView profile

Associate Professor

• Bayesian Statistics
• Precision Medicine
• Latent Variable Models
• +5 more

Zhenke Wu is an Associate Professor (with tenure) in the Department of Biostatistics at the University of Michigan School of Public Health. He holds affiliate appointments at the Michigan Institute for Data and AI in Society (MIDAS) and leads the Michigan Statistics for Individualized-healthcare Lab (MiSIL). His research bridges statistical methodology and public health applications, with particular focus on precision medicine. Educational background includes: PhD in Biostatistics from Johns Hopkins University (2014) BS in Mathematics from Fudan University (2009) Dr. Wu's methodological research focuses on: Structured Bayesian latent variable models for disease subtyping and clustering Causal inference methods for sequential interventions in mobile health studies Reinforcement learning frameworks for personalized health interventions Scalable computation for high-dimensional biomedical data His applied work spans infectious diseases, mental health, autoimmune disorders, and cancer through collaborations with multiple research consortia including the Intern Health Study and UZIMA-DS project in Africa. Recent publications demonstrate strong focus on Bayesian methods, causal inference, and reinforcement learning applications in digital health. Article themes include mobile health interventions, synthetic EHR development, fair machine learning algorithms, and novel approaches for longitudinal and survival data analysis. Methodological innovations consistently address challenges in precision medicine and individualized health decision-making. Dr. Wu leads several collaborative initiatives including the Precision Health Use Case for mental health treatment (PROMPT) and partners with the Rogel Cancer Center. He advises multiple PhD students and postdoctoral researchers in statistical methodology development and health applications.

• Formal Verification
• Software Testing
• Programming Languages
• +6 more

Alastair F. Donaldson is a Professor and Director of Research in the Department of Computing at Imperial College London, where he leads the FastPL research group. His academic career spans over a decade at Imperial, progressing from Lecturer (2011-2014) to Senior Lecturer (2014-2017), Reader (2017-2020), and Professor (2020-present). He has also held significant industry positions, including Founder and Director of GraphicsFuzz Ltd. (acquired by Google in 2018), Senior Software Engineer at Google (2018-2021), and Visiting Researcher at both Google and Microsoft Research Redmond. Donaldson earned his PhD from the University of Glasgow under Alice Miller, following a BSc (hons, First Class) in Computing Science and Mathematics. His postdoctoral work included an EPSRC Postdoctoral Research Fellowship at the University of Oxford and a Research Fellowship at Wolfson College Oxford. His research focuses on formal analysis, software testing and programming languages techniques for improving software reliability, with special emphasis on high-performance systems. Donaldson's work bridges theoretical foundations with practical applications, particularly in compiler testing, GPU programming verification, and metamorphic testing. His research has significantly influenced both academia and industry, as evidenced by the acquisition of his startup GraphicsFuzz by Google. Analysis of his recent publications reveals a strong focus on fuzz testing techniques applied across diverse domains including compilers, GPUs, cryptographic protocols, and large language models. His work consistently combines formal methods with practical testing approaches, addressing challenges in compiler correctness, memory models, and API verification across multiple platforms. 2017 BCS Roger Needham Award EPSRC Early Career Fellowship Best Paper Award, EuroSys 2024 Best Paper Award, MET 2021 Best Paper Award, IWOCL 2019 Best Paper Award, IISWC 2019 Best Paper Award, ICST 2016 ACM SIGSOFT Distinguished Paper Award, ISSTA 2023 ACM SIGSOFT Distinguished Paper Award, FSE 2017 ACM SIGPLAN Most Influential OOPSLA Paper Award, 2022 (for GPUVerify) As Director of Research in the Department of Computing, Donaldson oversees research strategy and development. His FastPL research group investigates novel techniques for programming, testing and reasoning about high performance systems. He has served on numerous program committees and held leadership roles including PLDI Steering Committee Chair (2022-2025) and PACM-PL Advisory Board member. His industry engagement includes testifying as an Expert Witness in the IBM UK Ltd v LzLabs GmbH & Ors case. The FastPL research group, which Donaldson leads, focuses on formal analysis, software testing and programming languages. The group has made significant contributions to compiler testing, GPU verification, and metamorphic testing techniques, with practical impact demonstrated by the acquisition of GraphicsFuzz. Current research directions include fuzzing for zero-knowledge proof circuits, randomized testing of decompilers, and systematic testing of large language models for code generation.

• Networked Epidemic Modeling
• Graph Signal Processing
• Control Systems
• +2 more

Victor M. Preciado is a Professor in the Department of Electrical and Systems Engineering at the University of Pennsylvania. His research focuses on network science , control theory , and graph signal processing . Research Interests: Modeling and controlling spreading processes on complex networks Optimization algorithms for time-varying systems Applications in public health and cyber-physical security Selected Publications: Recent work includes machine learning for operator inference (2022), hybrid systems stability analysis (2021), and pandemic modeling frameworks (2021). Earlier contributions focus on spectral analysis of epidemics (2009-2016) and geometric optimization (2014).

Massimo FranceschettiView profile

Professor

• Mathematical Engineering
• Networked Control Systems
• Information Theory
• +7 more

Massimo Franceschetti is a Professor in the Department of Electrical and Computer Engineering at the University of California, San Diego (UCSD), with faculty affiliation at Calit2. His research spans mathematical engineering, focusing on control, communication, computation, and sensing, particularly in complex networks and systems. He integrates tools from statistical physics, wave propagation, and information theory to analyze and design networked systems. Born in Naples, Italy, he studied at the University of Naples Federico II and the University of Edinburgh (European exchange program), graduating in 1997. He earned his M.Sc. (1999) and PhD (2003) from Caltech, where he received the Walker von Brimer Award and the C.H. Wiltz Prize for outstanding research and thesis. After postdoctoral work at UC Berkeley (2003-2004), he joined UCSD as faculty and held visiting positions at Vrije Universiteit Amsterdam, EPFL (Switzerland), and the University of Trento (Italy). He became an IEEE Fellow in 2018 and was nominated a Guggenheim Fellow in 2019. His research includes networked control systems , stochastic geometry , electromagnetic information theory , and social dynamical systems . Recent work explores non-invasive emotional contagion in social networks, quantum limits on information entropy, and the physics of wave propagation. His publications bridge information theory , machine learning , and network science , often applying percolation theory and random walks to explain scaling laws and wireless signal behavior. Scientific accolades include the S.A. Schelkunoff Transactions Prize , IEEE Communications Society Best Tutorial Paper Award , and the IEEE Ruberti Young Researcher Prize . He co-authored two books: Random Networks for Communication (2007) and Wave Theory of Information (2018). His students have pursued careers in academia (e.g., IIT-Bombay, Notre Dame) and industry (e.g., Google, IBM, Tesla). He teaches courses on network science , information theory , and control systems , emphasizing data-driven analysis and the physical foundations of communication. His group’s work impacts cyber-physical systems , quantum network coding , and epidemic modeling on networks .

Thuy T. LeView profile

Professor

• Digital System Design
• Computer Architecture
• Hardware Accelerators
• +6 more

Thuy T. Le is a Professor of Electrical Engineering at San Jose State University's College of Engineering. With a distinguished career spanning several decades, he teaches graduate and undergraduate courses in digital system design, computer architecture, microprocessor systems, and related fields. His academic journey began with earning B.S., M.S., and Ph.D. degrees from the University of California, Berkeley. Professor Le's research interests encompass a broad spectrum of cutting-edge technological domains. His primary focus areas include System-on-Chip (SoC) and Embedded System Design, Hardware Accelerators for complex algorithms, Quantum Computing, implementation of Probability theory and Monte Carlo simulation, and radiation effects on electronic devices and systems. His work bridges traditional electrical engineering with emerging computational paradigms, demonstrating a consistent ability to adapt to evolving technological landscapes while maintaining strong foundations in core engineering principles. Analysis of Professor Le's publication record reveals a consistent trajectory from nuclear reactor physics and computational methods toward modern hardware acceleration and quantum computing. His early work focused on nuclear reactor simulation and radiation shielding, then evolved to parallel computing and distributed systems, and has recently centered on hardware acceleration for complex algorithms, quantum computing applications, and AI hardware. This progression demonstrates his ability to transition between major technological paradigms while maintaining expertise in computational methods and hardware implementation. Professor Le has demonstrated significant leadership in professional service, having served as keynote speaker, general chair, technical program chair, session chair, reviewer, and committee member for numerous international conferences. His service extends beyond academia through his role as Co-Founder and Advisor of the Vietnamese Strategic Ventures Network and Chairman of the Board of the United States–Vietnam Foundation. In his educational role, Professor Le has made substantial contributions to engineering curriculum development and assessment. He has taught a wide range of courses including EE271 (Advanced Digital System Design), EE210, EE250, and various project/thesis courses. His research advising spans digital system design, ASIC, SOC, and hardware accelerators. He has also collaborated with local companies on projects related to high-performance system architectures, parallel algorithms, digital arithmetic, and System-on-Chip verification.