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

Giovanni De Micheliمشاهده پروفایل

استاد

• Integrated Circuit Design
• Hardware Synthesis
• Logic Optimization
• +۵ مورد دیگر

Giovanni De Micheli is a Full Professor at École Polytechnique Fédérale de Lausanne (EPFL), holding appointments in both the School of Computer and Communication Sciences (IC) and the School of Engineering (STI). He is affiliated with the Integrated Systems Laboratory (LSI) and serves as Scientific Director of EcoCloud. His primary office is located in INF 341 building at EPFL's Lausanne campus where he conducts research and teaching activities. Professor De Micheli's research spans multiple domains in electronic design automation and integrated circuit design. His primary interests include: Integrated Circuit Design and Hardware Synthesis Logic Optimization and Boolean Methods Nanoelectronics and 2D Electronics Quantum Computing and Emerging Technologies Low-Power Electronics and Energy-Efficient Systems Electronic Design Automation for Novel Computing Paradigms His recent publications demonstrate a strong focus on advancing logic synthesis techniques for both conventional and emerging technologies. Professor De Micheli's work bridges theoretical foundations with practical applications, particularly in adapting traditional EDA methods to novel computing paradigms like quantum computing and superconducting electronics. His research group has made significant contributions to the development of efficient algorithms for circuit optimization across multiple technology domains, with particular emphasis on area, power, and delay optimization while maintaining functional correctness. Professor De Micheli has supervised numerous doctoral students throughout his career at EPFL, mentoring over 40 PhD candidates whose research spans various aspects of electronic design automation, circuit design, and emerging technologies. His students have gone on to make significant contributions in both academia and industry. As Scientific Director of EcoCloud, Professor De Micheli leads research initiatives focused on energy-efficient computing systems and sustainable cloud infrastructure. His laboratory, the Integrated Systems Laboratory, serves as a hub for interdisciplinary research connecting computer science, electrical engineering, and materials science, with particular focus on next-generation computing technologies.

Andrew Childsمشاهده پروفایل

استاد

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

Kuldeep S. Meelمشاهده پروفایل

دانشیار

• Automated Reasoning
• Formal Methods
• Artificial Intelligence
• +۶ مورد دیگر

Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.

Daniel M. Kaneمشاهده پروفایل

استاد

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

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

• High-speed data converters
• Wireless transceivers
• Digital phase-locked loops
• +۷ مورد دیگر

Shiyu Su is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. His research focuses on high-speed data converters, wireless transceivers, digital phase-locked loops (PLL), and AI-assisted analog/mixed-signal design automation. He holds a Ph.D. from the University of Southern California (2019) and teaches courses such as ECE 340 (Electronic Circuits 2) and ECE 432 (Radio Frequency Integrated Devices and Circuits). Education: B.S. from Beijing University of Post and Telecommunication (China) and Queen Mary, University of London (UK), 2011; M.S. and Ph.D. from USC, 2013 and 2019, all in electrical engineering. Research Interests: High-speed ADCs/DACs RF/mm-wave transceivers Time-approximation filters (TAF) Analog/mixed-signal design automation Memristor-based computing Biomedical interfaces Key Awards: IEEE SSCS Predoctoral Achievement Award (2017–2018) Best Student Paper Award at IEEE RFIC (2022) Ming Hsieh Institute Scholar (2019–2020) Lab Focus: The Shiyu Su Lab develops integrated circuits for communications, sensing, and computing, with a focus on AI-driven methodologies and digital-analog co-design. Collaborations include work with Prof. Wei Wu (USC) on memristor-based systems.

• Data Science
• Numerical Optimisation
• Medical Imaging
• +۳ مورد دیگر

Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.

Supratik Chakrabortyمشاهده پروفایل

استاد

• Formal Methods
• Formal Verification
• Automated Synthesis
• +۷ مورد دیگر

Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.

Baker Mohammadمشاهده پروفایل

استاد

• Very-Large-Scale Integration (VLSI)
• Hardware Accelerators for Artificial Intelligence
• Hardware Security
• +۷ مورد دیگر

Prof. Baker Mohammad serves as Professor and Director of the System on Chip Lab in the Department of Computer and Information Engineering at Khalifa University. With over 15 years of industrial experience at Intel and Qualcomm designing microprocessors and DSP chips, he bridges academic research with real-world engineering challenges in high-performance computing and low-power systems. His educational background includes: Ph.D. in Electrical and Computer Engineering, University of Texas at Austin (2008) M.S. in Electrical and Computer Engineering, Arizona State University B.S. in Electrical Engineering, University of New Mexico Dr. Mohammad's research spans cutting-edge domains where VLSI design converges with AI acceleration and emerging memory technologies . His work pioneers Memristor applications in environmental sensing (radiation, vacuum, glucose) and neuromorphic computing, while advancing energy harvesting systems for wearable electronics. The integration of in-memory computing with security primitives represents a paradigm shift in hardware design, moving beyond traditional CMOS limitations. His publication trajectory reveals accelerating focus on self-powered neuromorphic systems and RRAM-based architectures, with recent work (2021-2023) emphasizing hardware-software co-design for edge AI. Over 75% of his recent publications involve cross-disciplinary collaborations spanning materials science, chemistry, and biomedical engineering. Notable scientific recognition includes: IEEE TVLSI Best Paper Award 2016 IEEE MWSCAS Myrill B. Reed Best Paper Award Qualcomm Qstar Award for Performance Leadership KUSTAR IP Excellence Award Multiple SRC Techon Best Session Papers As a dedicated mentor, he has supervised over 15 graduate students while securing competitive funding from Khalifa University, ADEK, Qualcomm, Tii, and UAE space agencies. His grant portfolio demonstrates exceptional translational impact, converting fundamental research in memristive devices into drone flight computers and medical sensors. Current projects integrate academic rigor with industrial deployment timelines. The System on Chip Lab operates as a multidisciplinary hub where semiconductor physicists collaborate with AI researchers to develop RISC-V-based secure processors and piezoelectric nanogenerator systems. Recent expansions include partnerships with Tii for aerospace applications and medical device startups for glucose monitoring technology.

Henry Yuenمشاهده پروفایل

دانشیار

• Quantum Computing
• Complexity Theory
• Cryptography
• +۲ مورد دیگر

Henry Yuen is the Srivani Family Associate Professor of Computer Science at Columbia University, with affiliations in the CS Theory group, Data Science Institute, and Columbia Quantum Initiative. His work bridges theoretical computer science and quantum information, focusing on the computational foundations of quantum systems. Yuen received his BA in Mathematics from the University of Southern California (2010) and PhD in Computer Science from MIT (2016). His research explores quantum complexity theory, quantum cryptography, and quantum information through both theoretical frameworks and practical applications. His recent publications reveal a strong focus on quantum pseudorandomness, quantum circuit complexity, and quantum cryptographic primitives. The research trajectory demonstrates increasing sophistication in connecting quantum computational models with fundamental questions in complexity theory, particularly through the lens of quantum interactive proofs and quantum state complexity. His work frequently intersects with operator algebras and quantum information theory, reflecting the interdisciplinary nature of modern quantum computing research. NSF CAREER award Sloan Fellowship Yuen actively mentors graduate students, with several PhD students having graduated to postdoctoral positions or faculty roles. His service includes co-organizing the Columbia CS Theory Seminar and serving on program committees for major conferences including QIP, STOC, and ITCS. He has organized multiple workshops on quantum computing challenges and cryptography. As a member of the Columbia Quantum Initiative, Yuen contributes to Columbia's growing quantum ecosystem, collaborating across departments to advance both theoretical foundations and potential applications of quantum information processing.

Paata Ivanisviliمشاهده پروفایل

دانشیار

• Analysis
• Partial Differential Equations
• Probability
• +۵ مورد دیگر

Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.

Muhammad Rashedمشاهده پروفایل

استادیار

• Electronic Design Automation (EDA)
• In-Memory Computing
• Artificial Intelligence Acceleration
• +۵ مورد دیگر

Dr. Muhammad Rashed is an Assistant Professor in the Department of Computer Science and Engineering at the University of Texas at Arlington, within the College of Engineering. He holds a Ph.D. in Computer Engineering from the University of Central Florida (2024) and a B.S. in Electrical and Electronics Engineering from Bangladesh University of Engineering and Technology (2015). Ph.D. : Computer Engineering, University of Central Florida, 2024 B.S. : Electrical and Electronics Engineering, Bangladesh University of Engineering and Technology, 2015 His research focuses on electronic design automation (EDA), in-memory computing, AI acceleration, and sustainable computing. He explores novel computing paradigms to overcome the limitations of traditional architectures, particularly in data-intensive applications such as AI and scientific computing. His work emphasizes hardware-software co-design and leveraging emerging non-volatile memories for energy-efficient processing. The 15 most recent publications highlight a consistent focus on in-memory computing, particularly in path-based and flow-based architectures, logic synthesis, and AI acceleration. Key themes include optimization, fault tolerance, verification, and the use of advanced data structures like sentential decision diagrams. His work is published in top-tier venues such as DAC, ICCAD, ASP-DAC, and IEEE/ACM journals. Scientific Awards: UTA CARES Grant for OER Creation Research Experiences for Undergraduates (REU) Grant Alireza Seyedi Doctoral Research Innovation Endowed Scholarship David T. & Jane M. Donaldson Memorial Scholarship IEEE/ACM William J. McCalla ICCAD Best Paper Award Nomination Best Research Video Award, Design Automation Conference (DAC) Dr. Rashed advises several graduate and undergraduate students in the NextGen Computing Lab and is involved in research grants including the UTA CARES Grant and REU funding. He actively contributes to academic service through roles such as conference TPC member, journal reviewer (e.g., IEEE TCAD, ACM TODAES), and committee participation in the department and college. His lab, the NextGen Computing Lab, is dedicated to building scalable, energy-efficient computing systems for next-generation AI and scientific workloads, aligning with national initiatives in advanced computing.

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

استاد

• Molecular computing
• Algorithmic self-assembly
• Chemical reaction networks
• +۸ مورد دیگر

David Doty is a Professor in the Department of Computer Science at the University of California, Davis . His research focuses on the intersection of molecular systems and computation , exploring how natural processes like chemical reactions , DNA nanotechnology , and self-assembly can perform computation. He also investigates connections to theoretical computer science, including distributed computing and algorithmic information theory . Doty's work bridges physics , chemistry , and biology through rigorous computational models like the Tile Assembly Model and Population Protocols . His research program includes software development ( scadnano , ppsim ), theoretical analysis, and collaborations with experimentalists. He teaches courses on theory of computation and molecular computing , and has advised numerous students in his research group. His publications cover topics such as algorithmic self-assembly , chemical reaction networks , and thermodynamic binding networks , with a focus on understanding fundamental computational and physical limits. Key software tools developed by his group include scadnano for DNA design and ppsim for population protocol simulations. Doty's recent research trends explore rate-independent chemical computing , error correction , and stochastic modeling in molecular systems. Current academic activity includes teaching ECS 120 (Undergraduate Theory of Computation), ECS 220 (Graduate Theory of Computation), and ECS 232 (Theory of Molecular Computation). He maintains a research lab in 2306 Academic Surge and continues to publish in leading conferences like DNA Computing and CMSB .

Henry D. Pfisterمشاهده پروفایل

استاد

• Information Theory
• Error-Correcting Codes
• Quantum Computing
• +۳ مورد دیگر

Henry D. Pfister is the Addy Family Professor of Electrical and Computer Engineering at Duke University, with a secondary appointment in Mathematics. He holds affiliations with the Pratt School of Engineering and the Duke Quantum Center. His research focuses on information theory, error-correcting codes, quantum computing, and machine learning applications in communications. Pfister earned his Ph.D. from UC San Diego and has held prior roles at Texas A&M University, École Polytechnique Fédérale de Lausanne, and Qualcomm. Education: Ph.D. in Electrical Engineering, UC San Diego (2003); M.S. degrees in Public Policy and Environmental Management from Duke University; J.D. and additional degrees from UNC Chapel Hill. Research interests include Reed-Muller codes, quantum error correction, neural decoders for DNA storage, and capacity-achieving coding schemes. Recent work highlights include proving Reed-Muller codes achieve capacity on binary-erasure channels and developing quantum-enhanced classical communication protocols. Publications span topics like polar codes for quantum channels, belief-propagation algorithms, and neural network-based decoding. Notable grants include NSF funding for DNA storage coding and quantum simulation projects. Pfister has advised over 20 graduate students and is a recipient of the STOC Best Paper Award and NSF CAREER Award.

Abraham Silberschatzمشاهده پروفایل

استاد

• Database Systems
• Operating Systems
• Storage Systems
• +۳ مورد دیگر

Abraham Silberschatz is the Sidney J. Weinberg Professor of Computer Science at Yale University. He previously served as Vice President of the Information Sciences Research Center at Bell Laboratories and held a chaired professorship at the University of Texas at Austin. His research focuses on database systems, operating systems, and network management. Silberschatz has advised over a dozen PhD students, many now in academia and industry. Education: Ph.D., Computer Science, Stony Brook University (SUNY) Research Interests: His work spans database systems, operating systems, storage systems, and network management. Notable contributions include foundational textbooks like Operating System Concepts and Database System Concepts , which have become industry standards. He has also developed innovative systems like DataPlay and contributed to projects such as NetInventory. Publications: His 15+ years of research include influential papers on database architecture, network routing, and distributed systems. Recent work explores leveraging non-volatile memory technologies in systems design. Awards: ACM Karl V. Karlstrom Outstanding Educator Award (1998) IEEE Taylor L. Booth Education Award (2002) VLDB Test of Time Award (2019) Multiple Bell Laboratories President's Awards for innovation Grants & Patents: Recipient of over two dozen grants and over four dozen patents, including foundational IP in multimedia storage and distributed systems. His team's HadoopDB project merged MapReduce and DBMS technologies. Labs/Teams: Collaborates with Prof. Robert Soulé on projects in database systems and networking, focusing on next-gen memory technologies. Active in mentoring graduate students and postdocs in their research group.

• Theoretical Computer Science
• Error-Correcting Codes
• Approximation Algorithms
• +۴ مورد دیگر

Venkatesan Guruswami is a Chancellor's Professor in the Department of Electrical Engineering and Computer Sciences and Professor in the Department of Mathematics at the University of California, Berkeley. He previously served as faculty at Carnegie Mellon University for 13 years and held a Miller Research Fellowship at UC Berkeley. His research focuses on Theoretical Computer Science , particularly in Error-Correcting Codes , Approximation Algorithms , Quantum Computing , and Hardness of Approximation . Guruswami has made groundbreaking contributions to list decoding and quantum code constructions, with works featured in Science Magazine and the Journal of the ACM (where he serves as Editor-in-Chief). Education : B.Tech (1997, IIT Madras), Ph.D. (2001, MIT), Miller Research Fellowship (2001-02, UC Berkeley) Research Areas : Theory of error-correcting codes, approximation algorithms, pseudorandomness, probabilistically checkable proofs, and quantum coding theory Guruswami's recent work explores quantum LDPC codes , parameterized inapproximability , and stream decodable codes . He has received prestigious awards including the NSF CAREER award , David and Lucile Packard Fellowship , and Sloan Research Fellowship . His advising spans a wide range of students and postdocs, with notable contributions to coding theory and computational complexity .