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

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.

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

Andrej Bogdanov is a Professor at the University of Ottawa in the School of Electrical Engineering and Computer Science . He earned his B.S. and M.Eng. from MIT and Ph.D. from UC Berkeley . Before joining Ottawa, he held positions at the Chinese University of Hong Kong , ITCS (Tsinghua) , DIMACS (Rutgers) , and the Institute for Advanced Study . He has served as a Visiting Professor at the Tokyo Institute of Technology (2013) and the Simons Institute (2017, 2021). Research Interests : Computational complexity, cryptography foundations, pseudorandomness, one-way functions, property testing, quantum algorithms, and sublinear-time algorithms. Teaching : Courses on Discrete Mathematics, Great Algorithms, Computational Complexity, and Cryptography at University of Ottawa, Chinese University of Hong Kong, and Rutgers University. Publications : 15+ recent works in TCC , CRYPTO , ICALP , RANDOM , and journals like Journal of Cryptology and Theory of Computing . Service : Program co-chair for SAC 2026 , and committee member for major conferences including CRYPTO , TCC , Eurocrypt , and FOCS . Advising : 12 current and former Ph.D./M.Phil. students, with postdoctoral advisees at institutions like IIT Palakkad and Academia Sinica . His work bridges theoretical computer science with applications in cryptography, quantum computing, and network security.

• Cryptography
• Computational Complexity
• Pseudorandomness
• +۶ مورد دیگر

Sepehr Assadi is an Associate Professor and Faculty of Mathematics Research Chair at the Cheriton School of Computer Science , University of Waterloo, since 2023. His research focuses on theoretical computer science , particularly algorithm design and complexity theory for modern computation models like streaming , distributed , and sublinear time algorithms. Recognized with the 2025 Presburger Award for groundbreaking work in multi-pass streaming lower bounds Developed hierarchical embedding technique for optimal lower bounds in graph streaming Key contributions to maximal independent set , maximum matching , and minimum spanning tree problems His work has been cited over 2,500 times (h-index: 30). He has served on program committees for major conferences (FOCS, STOC, COLT) and mentors students in graph algorithms and complexity theory . Awards include Sloan Research Fellowship , NSERC Discovery Grant , and Google Research Scholar Award .

• Theoretical Computer Science
• Algorithm Design
• Complexity Theory
• +۷ مورد دیگر

Gramoz Goranci is an Assistant Professor (tenure-track) of Algorithms in the Department of Computer Science at the University of Vienna. He leads research in algorithm design with strong interdisciplinary connections to optimization, graph theory, and machine learning. He is a member of the Research Group Theory and Applications of Algorithms and a board member of the Research Network Data Science. His research focuses on the design of fast dynamic algorithms for large-scale optimization problems, combining techniques from combinatorial data structures, algorithmic graph theory, numerical linear algebra, and metric embeddings. His work emphasizes both theoretical guarantees and practical efficiency. The recent publications highlight a consistent trend in dynamic and incremental graph algorithms, particularly in shortest paths, connectivity, flow, and facility location problems. His work increasingly bridges theoretical computer science with applications in machine learning and high-dimensional data. Keywords across publications include dynamic algorithms, graph sparsification, electrical flows, and optimization in metric spaces. FWF ESPRIT grant (supporting PostDoc Peter Kiss) He advises a growing team of researchers, including PostDoc Peter Kiss and PhD students Eva Szilagyi and Ali Momeni Mohammadabadi. His research is supported by independent funding and collaborations with leading institutions like ETH Zürich, University of Toronto, and UC Berkeley's Simons Institute. He has served on program committees of top conferences including FOCS, STOC, SODA, ICML, ESA, and ALENEX. He is actively involved in the academic community through seminars and talks at institutions such as ETH Zürich, University of Warwick, and Google Research. His team contributes to foundational work in dynamic graph algorithms and their applications in data science.

• Algorithm Design
• Dynamic Algorithms
• Graph Theory
• +۷ مورد دیگر

Eric Blais is an Associate Professor in the Department of Computer Science at the University of Waterloo. His research focuses on randomized algorithms, sublinear-time algorithms, and complexity theory, with particular emphasis on property testing and algorithmic efficiency. He holds a Ph.D. from Carnegie Mellon University, an M.Sc. from McGill University, and a B.Math from the University of Waterloo. His work explores theoretical foundations of algorithms, including minimax theorems, VC dimension analysis, and convexity testing. Recent contributions span graph testing via container methods, randomized composition techniques, and polynomial lower bounds for monotonicity testing. His research also intersects with practical applications in graphics processing and database systems. No scientific awards are explicitly listed in the provided text. His advising record is not detailed here, but he has contributed to conference proceedings like APPROX/RANDOM and ITCS. His work often bridges theoretical insights with real-world algorithmic challenges, emphasizing both foundational results and applied system optimizations.

• Randomized Algorithms
• Sublinear-Time Algorithms
• Complexity Theory
• +۳ مورد دیگر

Valerie King is a Professor in the Department of Computer Science at the University of Victoria, Canada. Her research focuses on graph algorithms, randomized algorithms, probabilistic analysis, and fault-tolerant distributed computing. She holds a PhD from UC Berkeley. Her work emphasizes scalable and secure distributed systems, with contributions to consensus protocols, network algorithms, and adversarial resilience. Dr. King's research bridges theoretical foundations and practical applications in computing systems. Education: PhD in Computer Science from UC Berkeley. Research Interests: Graph algorithms, randomized algorithms, fault-tolerant distributed computing, and algorithmic defense mechanisms against cyberattacks. Her work often addresses challenges in network security, consensus protocols, and efficient distributed algorithms. Key research trends in her articles include Byzantine agreement protocols, communication-efficient distributed algorithms, and sublinear-time graph algorithms. She explores geometric network models, secure multi-party computation, and energy-efficient communication strategies. Her contributions span algorithm design, complexity analysis, and practical implementations in adversarial environments. Advising and Grants: While specific student names or grant details are not listed here, her extensive publication record reflects sustained research activity in distributed systems and algorithms. She contributes to foundational research in theoretical computer science with applications to real-world distributed networks. Labs/Teams: Affiliated with the Computer Science department at UVic, collaborating on projects related to distributed computing and algorithmic security. Her work often involves interdisciplinary approaches to network resilience and computational efficiency.

• Graph Algorithms
• Randomized Algorithms
• Probabilistic Analysis
• +۳ مورد دیگر