جستجوی استاد راهنمای دانشگاهی

Andrea Coladangeloمشاهده پروفایل

استادیار

• Quantum Computation
• Quantum Cryptography
• Quantum Learning Theory
• +۳ مورد دیگر

Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.

Lijie Chenمشاهده پروفایل

استادیار

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

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

Richard Samworthمشاهده پروفایل

استاد

• Nonparametric Statistics
• High-dimensional Statistics
• Machine Learning
• +۳ مورد دیگر

Professor Richard Samworth is a leading academic at the University of Cambridge , affiliated with the Department of Pure Mathematics and Mathematical Statistics and serving as Director of the Statistical Laboratory . His research focuses on Nonparametric and High-dimensional Statistics , addressing challenges in data analysis, statistical learning, and computational methods. Research Interests : Richard Samworth's work emphasizes Nonparametric Statistics , High-dimensional Data , and Statistical Learning . His research spans topics such as Missing Data , Changepoint Detection , Log-concave Density Estimation , and Subgroup Analysis , with applications in Machine Learning and Data Science . Key methodologies include Score Matching , Random Projections , and Minimax Estimation . Recent publications highlight advancements in Semi-Supervised Learning , Robust Statistical Testing , and High-dimensional PCA with heterogeneous missingness. His work bridges theoretical rigor with practical applications, particularly in Statistical Algorithms and Optimization .

• Quantum-safe cryptography
• Lattice-Based Cryptography
• Post-Quantum Cryptography
• +۴ مورد دیگر

Ron Steinfeld is an Associate Professor in the Department of Software Systems & Cybersecurity at Monash University, Australia. He holds editorial roles in Designs Codes and Cryptography (since 2017) and has served on technical committees for top-tier conferences like ASIACRYPT, CRYPTO, and EUROCRYPT. His research focuses on quantum-safe cryptography, lattice-based cryptography, and blockchain security, with over 80 refereed publications and AUD$4M+ in research funding. Education: BSc Mathematics and Physics (Monash University, 1998) BE (Hons., First Class) Electrical and Computer Systems (Monash University, 2000) PhD Computer Science (Monash University, 2003) Research Interests: Design and analysis of cryptographic algorithms, quantum-safe protocols, lattice-based security foundations, and blockchain applications. His work underpins NIST standard algorithms like Kyber and Dilithium through structured lattice problem research. Recent Articles Trends: Focus on privacy-preserving blockchain protocols, post-quantum signature schemes, encrypted data search, and cryptographic applications in adversarial AI. Recent work includes fair Bitcoin watchtower schemes and genomic database privacy solutions. Awards: ASIACRYPT 2015 Best Paper Award Advising & Grants: Supervises PhD projects on quantum-safe cryptography and blockchain security. Leads initiatives like the AUD$4M ARC-funded Quantum Information Technology project. Collaborates with industry partners including CSIRO/Data61. Labs/Teams: Key contributor to Monash’s cybersecurity and cryptography research groups, involving interdisciplinary projects on materials discovery ( Æinstein initiative) and post-quantum blockchain security.

• Nonparametric Statistics
• High Dimensional Data Analysis
• Statistical Methods in Finance
• +۷ مورد دیگر

Vladimir Spokoiny is a Professor at the Departments of Mathematics and Economics of the Humboldt University of Berlin and Head of the Research Group "Stochastic Algorithms and Nonparametric Statistics" at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) in Berlin, Germany. His research spans multiple areas of statistics, machine learning, and financial mathematics, with significant contributions to nonparametric statistics, high-dimensional data analysis, and statistical methods in finance. Spokoiny received his M.Sc. in applied mathematics from the Moscow Institute of Railway Engineering in 1981 and his Ph.D. in mathematics from Lomonosov Moscow State University in 1988. He completed his Habilitation at Humboldt University in 1996. His academic career includes positions at the All-Union Institute of Railway Transport in Moscow, the Institute for Information Transmission Problems in Moscow, and the Institute for Applied Analysis and Statistics in Berlin before joining the Weierstrass Institute and Humboldt University where he has been a professor since 2002. Spokoiny's research focuses on adaptive nonparametric smoothing and hypothesis testing, high dimensional data analysis, statistical methods in finance, image analysis with applications to medicine, classification, and nonlinear time series. His work often addresses the challenges of nonstationarity in time series data and develops innovative methods for volatility estimation and risk management. He has made significant contributions to the development of adaptive weights smoothing procedures, which have applications in image processing, community detection, and manifold learning. His recent work has expanded into high-dimensional statistics, Bayesian inference, and optimization methods for machine learning, with publications demonstrating novel approaches to Gaussian approximation, Laplace methods, and statistical inference in non-Euclidean spaces. Spokoiny has supervised numerous PhD students including Oliver Reiss, Danilo Mercurio, Ying Chen, Elmar Diederichs, and Mstislav Elagin, whose research has focused on mathematical finance, time series analysis, and statistical methods. He serves as an Associate Editor for The Annals of Statistics (since 2004) and Statistics and Decisions (since 2002), and has previously served on the editorial board of the Journal of Statistical Planning and Inference. His professional activities include reviewing for major statistical journals including Annals of Statistics, Bernoulli, Econometrica, and Journal of American Statistical Association, as well as reviewing grant proposals for the National Science Foundation (USA), German Research Foundation, and Netherlands Organisation for Scientific Research. Spokoiny is a member of several professional societies including the International Statistical Institute, American Statistical Association, Institute of Mathematical Statistics, and Bernoulli Society. He is fluent in Russian (mother tongue), English, and German, and has good knowledge of French. His research group at WIAS focuses on developing novel statistical methodologies with applications across various scientific domains, particularly emphasizing adaptivity and robustness in complex data environments. The group's work has significant implications for financial risk management, medical imaging, and machine learning applications, with recent publications addressing fundamental questions in high-dimensional statistics and nonparametric inference.

Qiang Tangمشاهده پروفایل

دانشیار

• Cryptography
• Blockchain Technology
• Computer Security
• +۳ مورد دیگر

Qiang Tang is currently an Associate Professor (Level D) at the School of Computer Science of The University of Sydney. Previously, he was a Senior Lecturer (2021.1-2024.12) at USYD and an Assistant Professor at the Computer Science Department of New Jersey Institute of Technology (2016.8-2021.1), where he co-directed the JACOBI Blockchain Lab with Prof. Jian Pei and Prof. Zhenfeng Zhang. He completed his PhD at the University of Connecticut under Prof. Aggelos Kiayias and Prof. Alexander Russell, following postdoctoral research at Cornell University with Prof. Elaine Shi. His research spans applied and theoretical cryptography, blockchain technology, privacy, and computer security. His work is supported by ARC, Google, Ethereum Foundation, Stellar Foundation, Protocol Labs, Algorand Foundation, Oracle, and USYD. Previous funding includes NSF, JD.com, AFRL, DoE, and Particl Foundation. His research has led to significant contributions in consensus protocols, distributed randomness generation, secure multi-party computation, and privacy-preserving technologies. Tang's publications reveal a strong focus on practical cryptographic solutions for blockchain and distributed systems. His recent work demonstrates expertise in asynchronous consensus, optimal protocol design, and secure implementations for real-world applications. His research shows consistent innovation in improving efficiency, security, and scalability of distributed systems. Scientific Awards: 2025 DSN Best Paper Award 2024 ICDCS Distinguished Paper Award 2023 SOAR Prize, USYD 2023 Oracle for Research Award 2022 Stellar Foundation Research Awards 2022 Ethereum Academic Award 2019 MIT Technical Review, 35 Chinese Innovators Under 35 Tang actively mentors PhD and Master's students, with several alumni now holding faculty positions or research roles at institutions like City University Hong Kong, Chinese Academy of Sciences, and A*STAR Singapore. He has received significant research funding including a multi-year Google project on End-to-End Secure Cloud and an ARC DP grant on Order Fairness in Decentralized Systems. He leads the research in his lab focusing on blockchain protocols and cryptographic applications, with strong industry connections through collaborations with Google, Ethereum Foundation, Stellar Foundation, and Protocol Labs. His team regularly publishes in top security and cryptography venues including CRYPTO, CCS, USENIX Security, and S&P.

James Andersonمشاهده پروفایل

استادیار

• Optimal Control Theory
• Robust Control
• Mathematical Programming
• +۴ مورد دیگر

James Anderson is an Assistant Professor in the Department of Electrical Engineering at Columbia University, with affiliations to the Data Science Institute (DSI) and multiple research centers including the Computing Systems for Data-Driven Science and Foundations of Data Science. Prior to Columbia, he was a Senior Research Scientist at Caltech’s Computing + Mathematical Sciences division (2016–2019) and held a Junior Research Fellowship at the University of Oxford’s Department of Engineering Science (pre-2012). He earned his DPhil (PhD) in Engineering Science from Oxford in 2012. His research focuses on optimal/robust control theory, mathematical programming, data privacy, and cyber-physical systems, with applications in smart grids, systems biology, and power systems. Recent work emphasizes energy storage strategies, distributed control algorithms, and cybersecurity in critical infrastructure. His publications span advanced control methodologies (e.g., reinforcement learning for LQR problems), energy market dynamics, and resilient system designs. Notable contributions include frameworks for decision-focused energy storage arbitrage and defenses against false data attacks in power grids. He actively collaborates on federated learning approaches for distributed systems and has pioneered techniques for system-level synthesis in cyber-physical architectures. Anderson’s affiliations include the Data Science Institute (DSI) and specialized centers focused on data-driven science and energy systems. His work bridges theoretical control advancements with real-world applications in energy and healthcare.

James Aspnesمشاهده پروفایل

استاد

• Distributed Algorithms
• Computer Science
• Randomized Algorithms
• +۵ مورد دیگر

James Aspnes is the Harold W. Cheel Professor of Computer Science at Yale University, specializing in distributed algorithms and randomized methods. He holds a PhD from Carnegie Mellon University and degrees from MIT. His research focuses on distributed systems, peer-to-peer networks, and sensor networks, emphasizing tools for efficient data management and fault-tolerance. Education: PhD (CMU, 1992), SM & SB (MIT, 1987) Affiliations: Yale since 1993, IBM Almaden Research Center (1992–1993) Research interests include distributed algorithms, randomization, and applications in biology and economics. Notable contributions include skip graphs, population protocols, and consensus algorithms. He has received the ACM-EATCS Dijkstra Prize (2020) and Dylan Hixon Prize (2000). Publications span distributed computing, algorithms, and cryptography. Recent work explores consensus protocols and privacy in population models. Grants include NSF awards totaling over $2M. Active in editorial roles (Algorithmica, Distributed Computing) and conference organization (PODC 2005, DCOSS 2007).

Serge Fehrمشاهده پروفایل

استاد

• Cryptology
• Post-Quantum Cryptography
• Information-Theoretic Cryptography
• +۵ مورد دیگر

Serge Fehr is a Senior Researcher in the Cryptology Group at CWI (Centrum Wiskunde & Informatica) in Amsterdam and a part-time Professor at the Mathematical Institute of Leiden University. His research focuses on foundational aspects of cryptology, including post-quantum cryptography, information-theoretic security, zero-knowledge proofs, and secure multiparty computation. He participates in AMSec (Amsterdam Cyber Security Center) and leads work packages in the NWO-funded HAPKIDO consortium. Education: M.Sc. in Mathematics from ETH Zürich (1998) Ph.D. in Cryptography from ETH Zürich and University of Aarhus (2003) Postdoc at Macquarie University (2003-2004) Research Interests: Post-quantum cryptographic primitives (e.g., digital signatures, lattice-based schemes) Quantum-resistant protocols (e.g., non-resignable signatures, Fiat-Shamir transforms) Foundational security proofs in the quantum random oracle model (QROM) Secure multiparty computation and privacy-preserving healthcare systems Key Activities: Editorial Board Member: Journal of Cryptology , IEEE Transactions on Information Theory Program Committee Co-Chair: EUROCRYPT 2025 Steering Committee Member: Beyond IID Information Theory, QCrypt Co-organizer: Symposium Series on Post-Quantum Cryptography Grants/Awards: NWO Cybersecurity consortium grant (HAPKIDO - 2021) NWO Veni Grant (2005) NWO Open & Free Competition Grants (2008, 2013) Students/Advising: Supervised or served on committees for over 15 Ph.D. students, including work on post-quantum signatures, MPC applications, and lattice-based cryptography. Labs/Teams: Active in CWI’s Cryptology Group and Leiden’s Mathematical Institute, collaborating with industry partners (e.g., KPN, Microsoft) in cybersecurity initiatives.

• Cryptography
• Computational Number Theory
• Computer Algebra
• +۳ مورد دیگر

Damien Stehlé is a Professor at the École Normale Supérieure de Lyon (ENS Lyon), affiliated with the Laboratoire LIP (CNRS, ENSL, INRIA, UCBL, U. Lyon) and a member of the AriC team. He is also a member of the Institut Universitaire de France. His research focuses on cryptography, computational number theory, and computer algebra, particularly lattice-based cryptography and its applications in post-quantum security. He has held editorial roles at the Journal of Cryptology and Designs, Codes and Cryptography, and served on committees for major conferences like ASIACRYPT and CRYPTO. His work has led to advancements in lattice reduction algorithms, cryptographic protocols (e.g., signatures, encryption schemes), and security proofs in the quantum random oracle model. Stehlé has supervised numerous PhD students, including Alice Pellet-Mary and Miruna Rosca, and has contributed to open-source lattice reduction software like fplll. His awards include Best Paper Awards at ASIACRYPT 2021 and 2015. He teaches advanced courses on post-quantum cryptography and cryptanalysis at the Master’s level.

• Theoretical Computer Science
• Graph Algorithms
• Lower Bounds
• +۷ مورد دیگر

Nicole Wein is an Assistant Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan, where she is a member of the Theory of Computation Lab within the Computer Science and Engineering Division. Her research focuses on theoretical computer science, particularly graph algorithms and lower bounds across various domains including distance-estimation, dynamic, parameterized, distributed, and online algorithms. Education: PhD in Computer Science from MIT, advised by Virginia Vassilevska Williams Master's in Computer Science from Stanford University B.S. in Computer Science/Mathematics from Harvey Mudd College Nicole's research centers on theoretical aspects of graph algorithms and computational complexity. She investigates fundamental questions about how algorithms can efficiently handle changing data, extract information from graphs in linear time, and understand the structure of shortest paths, especially in directed graphs. Her work spans multiple algorithmic paradigms including dynamic algorithms that adapt to changing inputs, parameterized approaches for hard problems, and fine-grained complexity that establishes precise relationships between problem difficulty. Analysis of Nicole's recent publications reveals a strong focus on graph algorithms, particularly shortest path problems, spanners, and hardness results. Her work often bridges theoretical insights with practical implications, developing novel techniques for distance estimation, dynamic graph processing, and approximation algorithms. A significant portion of her research examines the structural properties of graphs that enable or constrain efficient computation, with applications across computer science. Nicole actively mentors students at various levels. She currently advises PhD student Jubayer Nirjhor and has worked with undergraduate researchers including Sam Hiken (now a pre-doc at MIT), Michael Wang, and Tony Zhang. Her teaching includes foundational courses like EECS 376: Foundations of Computer Science and specialized courses such as EECS 598: Graph Algorithms. Nicole contributes to the academic community through service as a program committee member for major conferences including SOSA 2025, FOCS 2025, SODA 2025, and others. She co-organized the June 2023 DIMACS workshop on Modern Techniques in Graph Algorithms and previously organized Algorithms Office Hours at MIT to improve communication between theory and applications of algorithms.

• Cryptography
• Blockchain Technology
• Cybersecurity
• +۴ مورد دیگر

Sri AravindaKrishnan Thyagarajan is a Lecturer at The University of Sydney's School of Computer Science, specializing in cryptography. He focuses on enhancing security and fairness in distributed systems, blockchains, and multi-party computations with applications in post-quantum cryptography. His work spans top-tier conferences like ACM CCS and IEEE SP. Education: B.Tech, Computer Science & Engineering, National Institute of Technology Trichy, India (2011–2015) M.Sc., Computer Science, Saarland University, Germany (2015–2016) Ph.D., Applied Cryptography, Friedrich Alexander Universität Erlangen-Nürnberg, Germany (2016–2021) Research Interests: Cryptography (classical and post-quantum), blockchain security, cryptocurrencies, fairness in multi-party computations, privacy-preserving protocols, and decentralized systems. Recent Articles: Focus on cryptographic protocols for blockchains, threshold cryptography, verifiable randomness, and secure atomic swaps. Recent work includes advancements in post-quantum signatures, distributed randomness generation, and privacy-preserving payment systems. Awards: Nominated for GI Dissertationspreis 2021 Advising & Grants: Advising Ankit Kapoor. Active in program committees for CCS, IEEE SP, and FC. Currently Program Chair for Crypto Valley Conference 2025. Labs/Teams: Part of the Sydney Blockchain Centre and cybersecurity cluster at the University of Sydney. Collaborates globally with institutions like NTT Research, Carnegie Mellon University, and Bocconi University.

• Adaptive nonparametric statistics
• High-dimensional data analysis
• Financial time series modeling
• +۵ مورد دیگر

Prof. Vladimir Spokoiny is a leading figure in stochastic algorithms and nonparametric statistics at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) and Humboldt University of Berlin . His work bridges mathematical statistics with practical applications in finance, medicine, and machine learning. Born in 1959 in Moscow, USSR PhD from Lomonosov Moscow State University (1988) Habilitation from Humboldt University (1996) Head of WIAS research group since 2000 Professor at Humboldt University since 2002 Spokoiny's research focuses on adaptive nonparametric methods, high-dimensional data analysis, and statistical finance. His innovations in local homogeneity testing and propagation-separation methods have advanced volatility modeling, image analysis, and manifold learning. He employs Bayesian optimization frameworks and stochastic control techniques for financial instrument pricing. Recent scientific contributions include generalized bootstrap procedures for Bures-Wasserstein barycenters (2024), dimension-free Laplace approximation bounds (2023), and structure-adaptive manifold estimation (2022). His 19+ PhD students and editorial roles in top journals like The Annals of Statistics demonstrate sustained academic impact. International Statistical Institute member American Statistical Association fellow Institute of Mathematical Statistics member Bernoulli Society member

• Optimization for Machine Learning
• Collaborative Learning
• Federated Learning
• +۶ مورد دیگر

Sebastian U. Stich is a tenured Professor at CISPA Helmholtz Center for Information Security and a member of the European Lab for Learning and Intelligent Systems (ELLIS). His research focuses on optimization for machine learning, collaborative learning (distributed, federated, and decentralized methods), efficient optimization techniques, adaptive stochastic methods, and privacy/security in machine learning. Recent appointments include ERC Consolidator Grant 2024 for the CollectiveMinds project. Key contributions in federated/decentralized learning, uncertainty estimation, and communication-efficient optimization. Active in workshop organization, including the Optimization for Machine Learning workshop at NeurIPS 2024. Teaching modern optimization methods at Saarland University (2023-2025). His work has been recognized with awards such as the Google Research Scholar Award (2023) and Meta Privacy-Enhancing Technologies Award (2022) . His research group includes postdocs Dr. Anton Rodomanov and Dr. Rotem Mulayoff, and PhD students Xiaowen Jiang and Yuan Gao.

Stuart Kurtzمشاهده پروفایل

استاد

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

Stuart Kurtz is a Professor in Computer Science and the College at the University of Chicago, and serves as Master of the Physical Sciences Collegiate Division. He holds the endowed position of George and Elizabeth Yovovich Professor. His research focuses on theoretical computer science, including computational complexity theory, randomness in computation, type theory, and formal logic. He has contributed to foundational areas such as the Berman-Hartmanis Isomorphism Conjecture and the computational properties of random sets. Kurtz is affiliated with the Theoretical Computer Science and Programming Languages Groups at the University of Chicago. He has been recognized with the 2009 Quantrell Award for teaching excellence. His service roles include Director of Undergraduate Studies and Department Chair in Computer Science. He actively mentors Ph.D. students and has advised multiple graduates in complexity theory and related fields. His academic background includes a Mathematics Ph.D. from the University of Illinois, supervised by Carl Jockusch. He approaches type theory as an intersection of formal logic and functional programming. Research interests span measure-theoretic randomness, computational logic, and complexity class separations. His recent work explores connections between theoretical computer science and interdisciplinary fields like physics and statistics. In teaching, Kurtz has instructed courses such as Formal Language Theory, Discrete Mathematics, and Honors Intro Programming. His service contributions include roles in the Computation Institute and Toyota Technological Institute at Chicago. His lab affiliations and collaborative work reflect a strong commitment to advancing theoretical foundations in computer science.