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

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.

Ali Vakilianمشاهده پروفایل

عضو هیئت علمی

• Algorithmic Foundations of Machine Learning
• Data Science
• Streaming Algorithms
• +۱۸ مورد دیگر

Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.

Wojciech Rytterمشاهده پروفایل

استاد

• Design and analysis of computer algorithms
• Automata and formal languages
• Parallel algorithms
• +۵ مورد دیگر

Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.

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.

Asaf Ferberمشاهده پروفایل

استادیار

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

Jens Grothمشاهده پروفایل

عضو هیئت علمی

• Cryptography
• Cryptographic Protocols
• Zero-Knowledge Proofs
• +۵ مورد دیگر

Jens Groth is an Honorary Professor at the Department of Computer Science, University College London (UCL), and serves as Chief Scientist at Nexus. His primary research focuses on cryptography, with an emphasis on cryptographic protocols, zero-knowledge proofs, and privacy-preserving technologies. Groth has contributed significantly to advancements in digital signatures, homomorphic encryption, and secure multi-party computation. He holds a leadership role as Program Chair for the 15th IMA International Conference on Cryptography and Coding (2015) and has been a key figure in shaping modern cryptographic standards. His work often bridges theoretical foundations with practical implementations, emphasizing efficiency and security. Groth's research interests include but are not limited to: cryptographic protocol design, lattice-based cryptography, and the application of zero-knowledge proofs in real-world systems such as blockchain and voting systems. His publications span venues like CRYPTO, EUROCRYPT, and ASIACRYPT, reflecting his impact on the field. Notably, he advocates for open access to research and has contributed to strategies ensuring conferences adopt de facto open-access policies. His current focus at Nexus centers on verifiable computation and distributed cryptographic systems.

• Distributed Systems Security
• Distributed Algorithms
• Algorithms in Networking
• +۴ مورد دیگر

Yu Haifeng is a Dean's Chair Associate Professor at the Department of Computer Science, National University of Singapore (NUS) School of Computing. He is a member of the Faculty Teaching Excellence Committee (FTEC) and has made significant contributions to distributed systems, security, and algorithms. Ph.D. (Computer Science, Duke University, 2002) M.S. (Computer Science, Duke University, 1999) B.E. (Computer Science, Shanghai Jiao Tong University, 1997) His research focuses on Distributed Systems Security , particularly blockchains and Sybil attacks, Distributed Algorithms , and Algorithms in Networking . He explores fundamental challenges in dynamic networks, including bandwidth constraints, diameter estimation, and adversarial robustness. Recent publication trends highlight theoretical advancements in blockchain scalability, Byzantine fault tolerance, and dynamic network analysis. His work bridges theoretical computing with practical applications like vehicular communication and disaster recovery systems. Best Paper in ACM SPAA, 2020 Best Paper in ACM SIGCOMM, 2010 Best Paper in ACM/IEEE IPSN, 2009 Best Paper in ACM NSDI, 2006 He has advised students such as Yuda Zhao and Irvan Jahja on projects addressing network diameter estimation and dynamic network challenges. His work has been published in top venues including JACM, Distributed Computing, PODC, and Oakland.

Arpit Agarwalمشاهده پروفایل

استادیار

• Machine Learning
• Artificial Intelligence
• Human-AI Interaction
• +۴ مورد دیگر

Arpit Agarwal is an Assistant Professor in the Department of Computer Science & Engineering at the Indian Institute of Technology, Bombay. He previously held postdoctoral positions at FAIR Labs (Meta) working with Max Nickel and at the Data Science Institute at Columbia University hosted by Prof. Yash Kanoria and Prof. Tim Roughgarden. He completed his PhD from the Department of Computer & Information Science at the University of Pennsylvania under the guidance of Prof. Shivani Agarwal. His research focuses on the intersection of human behavior and machine learning systems, with particular interest in learning from implicit, strategic, and heterogeneous human feedback. His work spans multiple dimensions of human-AI interaction including understanding long-term dynamics between humans and AI systems, designing responsible AI, and studying misalignment between user preferences and system objectives. His research methodology often combines theoretical machine learning with practical applications in recommendation systems and social AI. His recent publications reveal a strong focus on bandit algorithms, preference learning, and recommendation systems, with increasing attention to responsible AI design and human-centered considerations. His work demonstrates expertise in theoretical machine learning with applications to real-world problems, particularly in understanding how humans interact with and are influenced by AI systems over time. Dr. Agarwal teaches advanced courses including CS767 Theoretical Machine Learning (Autumn 2025) and CS6103 Human-Centered AI: From Learning Models to Responsible Systems (Spring 2025), which covers topics such as AI alignment, learning from pairwise comparisons, crowdsourcing, human-in-the-loop decision making, recommendation systems, interpretability, privacy, fairness, causality, and AI governance.

Euiwoong Leeمشاهده پروفایل

استادیار

• Approximation Algorithms
• Hardness of Approximation
• Discrete Optimization
• +۳ مورد دیگر

Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.

• Fast graph algorithms in different computation models
• Robust algorithms against adaptive adversaries
• Continuous optimization for combinatorial problems
• +۳ مورد دیگر

Thatchaphol Saranurak is an Assistant Professor at the University of Michigan , specifically in the Computer Science and Engineering Division . Prior to this, he earned his PhD in Computer Science from KTH Royal Institute of Technology in 2018 under Danupon Nanongkai , followed by a postdoctoral research assistant professorship at Toyota Technological Institute at Chicago (2018-2020). Research Focus : His work bridges fundamental problems in graph theory, including Dynamic graph algorithms for max-flow and min-cut Expander graph decompositions and their applications Robust algorithms against adaptive adversaries Continuous optimization for combinatorial problems Scientific Contributions : He has made breakthroughs in deterministic graph algorithms, notably improving vertex connectivity bounds, developing near-linear time Gomory-Hu trees, and advancing dynamic matching algorithms. His research has been recognized by Sloan Research Fellowship NSF CAREER Award Presburger Award 2023 Teaching : He teaches courses like Expander and Graph Algorithms and Introduction to Algorithms (Winter 23, Winter 25). His lecture videos and notes are publicly available. Collaborations : He works with leading researchers including Sayan Bhattacharya , Joakim Blikstad , and Jason Li , with affiliations to institutions like TTIC , KTH , and SODA conferences.

Artur Czumajمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Randomized Algorithms
• +۹ مورد دیگر

Artur Czumaj is a Professor in the Department of Computer Science at the University of Warwick and serves as the Director of the Centre for Discrete Mathematics and its Applications (DIMAP). He is a member of the Division of Theory and Foundations (FoCS) and holds affiliations with the Alan Turing Institute, the Warwick Data Science Institute (WDSI), and the Warwick Centre for Doctoral Training in Mathematics of Real-world Systems (MathSys). Previously, he served as Head of Department and President of the European Association for Theoretical Computer Science (EATCS) from 2020 to 2024. His research lies at the core of theoretical computer science, focusing on the design and analysis of algorithms, particularly randomized, sublinear, parallel, and distributed algorithms. His work spans graph theory, combinatorics, computational geometry, algorithmic game theory, and property testing. He has led major research initiatives funded by EPSRC, IBM, the Royal Society, and Weizmann-UK grants. The trends in his recent publications highlight a strong emphasis on sublinear algorithms, dynamic graph algorithms, and property testing, with recurring themes in randomized methods, graph processing, and efficient data structures. His work bridges foundational theory with applications in data summarization, network analysis, and computational geometry. EPSRC grants: EP/D063191/1, EP/G064679/1, EP/G069034/1, EP/J021814/1, EP/N011163/1, EP/V01305X/1, EPSRC studentship IBM Faculty Award Royal Society International Exchanges Scheme Weizmann-UK Making Connections Grants on combinatorial and algorithmic primitives and the interplay between algorithms and randomness Peter Davies received the 2020 Warwick Faculty of Science Thesis Prize under his supervision Artur Czumaj has supervised numerous PhD students, including Anna Adamaszek, Michal Adamaszek, Sam Coy, Peter Davies, Michail Fasoulakis, Jan Hladky, Wang Xin, and Hairong Zhao. His research has been supported by sustained grant funding, reflecting his leadership in theoretical computer science. He has organized major workshops at Dagstuhl, Oberwolfach, Simons Institute, and the University of Warwick, and has served on the steering committees of HALG and as PC Chair for SODA 2018 and ICALP 2020. He is actively involved in organizing key research events, including the Simons Institute Special Semester on Sublinear Algorithms (2024), the Workshop on Sublinear Graph Simplification (2024), and the Computational Complexity Conference (CCC 2023) at Warwick. He also co-organizes the Warwick-Weizmann workshops and the IGAFIT Algorithmic Postdocs Workshop, fostering international collaboration in algorithms research.

• Sublinear-time algorithms
• Error-correcting codes
• Computational complexity
• +۳ مورد دیگر

Elena Grigorescu is a Professor at the University of Waterloo, Department of Computer Science. She holds a Ph.D. from the Massachusetts Institute of Technology (2010), an M.S. from MIT (2006), and a B.A. from Bard College (2004). Her research focuses on sublinear-time algorithms, error-correcting codes, computational complexity, and learning theory. She explores foundational aspects of algorithms with constraints on time/space, privacy-preserving computation, and applications in graph theory and optimization. Her work includes advancements in spanner algorithms for network design, differential privacy in sublinear-time settings, and learning-augmented approaches for online optimization. Recent publications address trace reconstruction, privacy-utility trade-offs, and combinatorial optimization techniques. Grigorescu is actively involved in conferences like APPROX/RANDOM and IEEE Foundations of Computer Science, contributing to algorithmic theory and practical implementations. Her research emphasizes theoretical rigor while addressing real-world challenges in data analysis and distributed systems. No awards or formal advisees are explicitly listed in the provided information.

Sofya Raskhodnikovaمشاهده پروفایل

استاد

• Sublinear-time algorithms
• Data Privacy
• Approximation Algorithms
• +۳ مورد دیگر

Sofya Raskhodnikova is a Professor in the Department of Computer Science at Boston University, part of the College of Arts and Sciences. She holds a Ph.D. from MIT and has held positions at Penn State University and postdoctoral fellowships at the Hebrew University of Jerusalem and the Weizmann Institute of Science. Her research focuses on sublinear-time algorithms, data privacy, approximation algorithms, and complexity theory. She is a recipient of the NSF CAREER Award and has contributed significantly to the theoretical foundations of privacy-preserving computation and algorithm design. Education: Ph.D. in Computer Science from MIT (2003), postdoctoral research at Hebrew University of Jerusalem and Weizmann Institute of Science (2003–2006). Visiting positions at UCLA, Harvard University, and the Simons Institute for the Theory of Computing. Research Interests: Sofya’s work bridges theoretical computer science and practical applications, emphasizing algorithms that operate efficiently on large datasets. Key areas include property testing (e.g., monotonicity, sortedness), differential privacy, and sublinear-time algorithms. She explores how algorithms can analyze data while preserving privacy guarantees and minimizing computational resources. Publications: Over 50 peer-reviewed articles in top venues such as STOC, FOCS, and SODA, with recent contributions focusing on dynamic graph algorithms under privacy constraints and robust property testing against adversarial noise. Professional Activities: Editor for ACM Transactions on Computation Theory and Algorithmica ; program committee chair for WOLA 2021 and CSR 2022; active in mentoring initiatives like Sigma Camp and Artemis. Advising & Students: Current advisees include Ephraim Linder and Debanuj Nayak. Notable alumni include Iden Kalemaj (Meta Research) and Nithin Varma (Max Planck Institute). She has supervised over 15 Ph.D. students and postdocs, fostering a collaborative research environment.

Elad Hazanمشاهده پروفایل

استاد

• Machine Learning
• Mathematical Optimization
• Control Theory
• +۴ مورد دیگر

Elad Hazan is a Professor of Computer Science at Princeton University and co-founder/director of Google AI Princeton. His research focuses on algorithmic foundations of machine learning and optimization, with significant contributions to online learning, nonstochastic control, and adaptive gradient methods. Princeton University (Faculty) Google AI Princeton (Co-founder & Director) His work bridges mathematical optimization, control theory, and computational complexity. Key contributions include the AdaGrad algorithm, sublinear-time optimization methods, and spectral filtering techniques for sequence modeling. Recent research emphasizes efficient neural architectures and provable guarantees in online control. Scientific awards include the Bell Labs Prize, IBM Goldberg Best Paper Award (twice), Google Research Award (twice), European Research Council grant, Marie Curie fellowship, and ACM Fellowship. He has served as program chair for COLT 2015 and on the Association for Computational Learning steering committee. His publications highlight trends in online convex optimization, spectral methods for dynamical systems, and adaptive gradient algorithms. Collaborations span Princeton, Google Brain Research, and interdisciplinary projects in robotics and AI safety.

• Theoretical Computer Science
• Distributed Algorithms
• Parallel Algorithms
• +۳ مورد دیگر

Yi-Jun Chang is an Assistant Professor in the Department of Computer Science at the National University of Singapore (NUS). He previously held a Junior Fellow position at the Institute for Theoretical Studies, ETH Zurich (2019–2021), and earned his Ph.D. in Computer Science and Engineering from the University of Michigan (2019). His research focuses on theoretical computer science, particularly distributed, parallel, and sublinear graph algorithms. Ph.D., University of Michigan (2019) M.S., National Taiwan University (2015) B.S., National Taiwan University (2013) Chang’s research explores the complexity and optimization of algorithms in distributed systems, including leader election, graph shattering, expander decomposition, and subgraph detection. His work addresses fundamental challenges in time-energy trade-offs, communication efficiency, and deterministic vs. randomized approaches in models like LOCAL and CONGEST. Recent publications highlight advancements in distributed triangle enumeration, optimal coloring, shortest path computation, and certification in bounded pathwidth graphs. Awards include the PODC 2019 Best Paper and Best Student Paper Awards, followed by the 2020 PODC Doctoral Dissertation Award. PODC 2019 Best Paper Award PODC 2019 Best Student Paper Award 2020 PODC Doctoral Dissertation Award Chang teaches courses such as CS3230 (Design and Analysis of Algorithms) and CS5275 (The Algorithm Designer's Toolkit). He advises Ph.D. students Hung Thuan Nguyen and Haoran Zhou, and has collaborated with postdoctoral researchers including Gopinath Mishra and Dean Leitersdorf.