Ke Yi 易珂
Office: Room 3552 (via lifts 25, 26)
[CV] [Publications] [Programming team]
Algorithms on massive data; databases; data summarization; algorithms on distributed data; data streams; external memory algorithms; data structures; 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
Tracking Distributed Data
Computing Statistical Summaries over Massive Distributed Data
Dynamic Indexability and the Optimality of B-trees and Hash Tables
An overview article in Chinese: 大数据算法
Students and Postdocs
I am currently working with the following great students:
Former students and postdocs:
Awards and Grants
Courses taught in the past:
COMP 3711: Design and Analysis of Algorithms
COMP 3721: Theory of Computation
COMP 573: Computational Geometry
COMP 6311D: Hot Topics on Big Data: Algorithms, Analytics and Applications
COMP 670S: Data Stream Algorithms
COMP 670R: Hashing
COMP 670Q: I/O-Efficient Algorithms and Data Structures
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