Yi, Ke "Kevin" - Department of Computer Science and Engineering, Hong Kong University of Science and Technology

• Cache-Oblivious Hashing Rasmus Pagh
• Sampling Based Algorithms for Quantile Computation in Sensor Networks
• Indexing Uncertain Data Pankaj K. Agarwal
• Finding Frequent Items in Probabilistic Data Feifei Li2
• I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis
• I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries
• Optimal Tracking of Distributed Heavy Hitters and Hong Kong, China
• Ranking Distributed Probabilistic Data Jeffrey Jestes1
• I/O-Efficient Construction of Constrained Delaunay Triangulations
• Efficient Maintenance of Materialized Top-k Views Ke Yi, Hai Yu, Jun Yang
• Optimal External Memory Planar Point Enclosure
• Algorithms for Distributed Functional Monitoring Graham Cormode
• Clustering with Diversity , and Qin Zhang2
• Semantics of Ranking Queries for Probabilistic Data
• Approximate Range Searching in External Memory
• Indexing Uncertain Data Siu-Wing Cheng
• Multi-Dimensional Online Tracking Ke Yi Qin Zhang
• Probabilistic String Similarity Joins Jeffrey Jestes Feifei Li Zhepeng Yan Ke Yi
• Probabilistic String Similarity Joins Zhepeng Yan Ke Yi
• On the Cell Probe Complexity of Dynamic Membership Hong Kong University of Science and Technology
• On the Cell Probe Complexity of Dynamic Membership
• Dynamic External Hashing: The Limit of Buffering Zhewei Wei Ke Yi Qin Zhang
• Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes
• Dynamic Indexability Lower Bounds for Dynamic
• Dynamic Structures for Top-k Queries on Uncertain Data
• An Information-Theoretic Approach to Detecting Changes in Multi-Dimensional Data Streams
• An Optimal Dynamic Interval Stabbing-Max Data Structure? Pankaj K. Agarwal
• The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
• I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis
• The Hardness and Approximation Algorithms for L-Diversity
• Beyond Simple Aggregates: Indexing for Summary Zhewei Wei Ke Yi
• Algorithms for Distributed Functional Monitoring Graham Cormode
• Tree Indexing on Flash Disks Yinan Li, Bingsheng He, Qiong Luo, and Ke Yi
• A Concise Representation of Range Queries Ke Yi1 Xiang Lian1 Feifei Li2 Lei Chen1
• Beyond Simple Aggregates: Indexing for Summary Queries
• Building Wavelet Histograms on Large Data in MapReduce Jeffrey Jestes1
• Optimal Tracking of Distributed Heavy Hitters and Quantiles yike@cse.ust.hk
• AN OPTIMAL DYNAMIC DATA STRUCTURE FOR STABBING-SEMIGROUP QUERIES
• Multi-Dimensional Online Tracking Ke Yi and Qin Zhang
• Continuous Sampling from Distributed Streams Graham Cormode
• I/O-Efficient Construction of Constrained Delaunay Triangulations
• Dynamic Indexability and the Optimality of B-trees Hong Kong University of Science and Technology