Ke Yi 易珂
Office: Room 3552 (via lifts 25, 26)
Algorithms on big data; databases; data streams; data summarization; sampling; data structures; algorithms on distributed data; external memory algorithms; data mining; computational geometry.
Exploiting the rich interdependence between theory and practice is the main theme of my research. I always strive to design algorithms with nice theoretical guarantees that also work well in practice. I like simple algorithms with nontrivial and elegant analyses. I like theories that bring insights to how things should be done in practice (this includes lower bounds!).
I belong to both the Theoretical Computer Science group and the Database group at HKUST.
Overview slides on some topics of my recent interests
Random Sampling on Big Data: Techniques and Applications
Summarizing Distributed Data
Tracking Distributed Data
Dynamic Indexability and the Optimality of B-trees and Hash Tables
An overview article in Chinese: 大数据算法
Students and Postdocs
Former students and postdocs:
COMP 3711: Design and Analysis of Algorithms
Courses taught in the past:
COMP 3711: Design and Analysis of Algorithms (08F, 09S, 09F, 11F, 12F, 14F, 15S, 15F)
COMP 3721: Theory of Computation (11S, 12S, 13S)
COMP 5711: Advanced Algorithms (14F, 15F)
COMP 573: Computational Geometry (10S)
COMP 6311D: Hot Topics on Big Data: Algorithms, Analytics and Applications (13F)
COMP 670S: Data Stream Algorithms (10F)
COMP 670R: Hashing (09F)
COMP 670Q: I/O-Efficient Algorithms and Data Structures (08S)
I am the coach of the HKUST programming team. Contact me if you are interested in solving challenging algorithmic problems (and traveling to places for free!).
Email: user name in the email@example.com
Phone: +852-2358 8770
Fax: +852-2358 1477