| 2011 |
|---|
| 69 | Algorithms for distributed functional monitoring. Graham Cormode, S. Muthukrishnan, Ke Yi. ACM Transactions on Algorithms (7): 21 (2011). Cited by 12Web SearchBibTeXDownload |
| 68 | Approximate Range Searching in External Memory. Micha Streppel, Ke Yi. Algorithmica (59): 115-128 (2011). Web SearchBibTeXDownload |
| 67 | Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. Zengfeng Huang, Ke Yi, Qin Zhang. CoRR (abs/1108.3413) (2011). Web SearchBibTeXDownload |
| 66 | Semantics of Ranking Queries for Probabilistic Data. Jeffrey Jestes, Graham Cormode, Feifei Li, Ke Yi. IEEE Trans. Knowl. Data Eng. (23): 1903-1917 (2011). Web SearchBibTeXDownload |
| 65 | The World in a Nutshell: Concise Range Queries. Ke Yi, Xiang Lian, Feifei Li, Lei Chen. IEEE Trans. Knowl. Data Eng. (23): 139-154 (2011). Web SearchBibTeXDownload |
| 64 | Optimal sampling algorithms for frequency estimation in distributed data. Zengfeng Huang, Ke Yi, Yunhao Liu, Guihai Chen. INFOCOM 2011, 1997-2005. Web SearchBibTeXDownload |
| 63 | Tracking distributed aggregates over time-based sliding windows. Graham Cormode, Ke Yi. PODC 2011, 213-214. Web SearchBibTeXDownload |
| 62 | Beyond simple aggregates: indexing for summary queries. Zhewei Wei, Ke Yi. PODS 2011, 117-128. Web SearchBibTeXDownload |
| 61 | Building Wavelet Histograms on Large Data in MapReduce. Jeffrey Jestes, Ke Yi, Feifei Li. PVLDB (5): 109-120 (2011). Web SearchBibTeXDownload |
| 60 | Verifying Computations with Streaming Interactive Proofs. Graham Cormode, Justin Thaler, Ke Yi. PVLDB (5): 25-36 (2011). Web SearchBibTeXDownload |
| 59 | Flexible aggregate similarity search. Yang Li, Feifei Li, Ke Yi, Bin Yao, Min Wang. SIGMOD Conference 2011, 1009-1020. Web SearchBibTeXDownload |
| 58 | Sampling based algorithms for quantile computation in sensor networks. Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu. SIGMOD Conference 2011, 745-756. Web SearchBibTeXDownload |
| 2010 |
|---|
| 57 | I/O-efficient batched union-find and its applications to terrain analysis. Pankaj K. Agarwal, Lars Arge, Ke Yi. ACM Transactions on Algorithms (7): 11 (2010). Cited by 16Web SearchBibTeXDownload |
| 56 | Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis. ACM Trans. Database Syst. (35) (2010). Web SearchBibTeXDownload |
| 55 | Clustering with diversity. Jian Li, Ke Yi, Qin Zhang. CoRR (abs/1004.2968) (2010). Web SearchBibTeXDownload |
| 54 | The hardness and approximation algorithms for l-diversity. Xiaokui Xiao, Ke Yi, Yufei Tao. EDBT 2010, 135-146. Web SearchBibTeXDownload |
| 53 | Verifying Computations with Streaming Interactive Proofs. Graham Cormode, Justin Thaler, Ke Yi. Electronic Colloquium on Computational Complexity (ECCC) (17): 159 (2010). Web SearchBibTeXDownload |
| 52 | Clustering with Diversity. Jian Li, Ke Yi, Qin Zhang. ICALP (1) 2010, 188-200. Web SearchBibTeXDownload |
| 51 | Correlation hiding by independence masking. Yufei Tao, Jian Pei, Jiexing Li, Xiaokui Xiao, Ke Yi, Zhengzheng Xing. ICDE 2010, 964-967. Web SearchBibTeXDownload |
| 50 | Cache-oblivious hashing. Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang. PODS 2010, 297-304. Web SearchBibTeXDownload |
| 49 | Optimal sampling from distributed streams. Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang. PODS 2010, 77-86. Web SearchBibTeXDownload |
| 48 | Tree Indexing on Solid State Drives. Yinan Li, Bingsheng He, Jun Yang, Qiong Luo, Ke Yi. PVLDB (3): 1195-1206 (2010). Web SearchBibTeXDownload |
| 47 | Probabilistic string similarity joins. Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi. SIGMOD Conference 2010, 327-338. Web SearchBibTeXDownload |
| 46 | Logging every footstep: quantile summaries for the entire history. Yufei Tao, Ke Yi, Cheng Sheng, Jian Pei, Feifei Li. SIGMOD Conference 2010, 639-650. Web SearchBibTeXDownload |
| 45 | On the Cell Probe Complexity of Dynamic Membership. Ke Yi, Qin Zhang. SODA 2010, 123-133. Web SearchBibTeXDownload |
| 44 | Top-k queries on temporal data. Feifei Li, Ke Yi, Wangchao Le. VLDB J. (19): 715-733 (2010). Web SearchBibTeXDownload |
| 43 | Sliding-window top-k queries on uncertain streams. Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin. VLDB J. (19): 411-435 (2010). Cited by 13Web SearchBibTeXDownload |
| 2009 |
|---|
| 42 | Small synopses for group-by query verification on outsourced data streams. Ke Yi, Feifei Li, Graham Cormode, Marios Hadjieleftheriou, George Kollios, Divesh Srivastava. ACM Trans. Database Syst. (34) (2009). Web SearchBibTeXDownload |
| 41 | Optimal External Memory Planar Point Enclosure. Lars Arge, Vasilis Samoladas, Ke Yi. Algorithmica (54): 337-352 (2009). Cited by 8Web SearchBibTeXDownload |
| 40 | The Hardness and Approximation Algorithms for L-Diversity. Xiaokui Xiao, Ke Yi, Yufei Tao. CoRR (abs/0912.5426) (2009). Web SearchBibTeXDownload |
| 39 | Semantics of Ranking Queries for Probabilistic Data and Expected Ranks. Graham Cormode, Feifei Li, Ke Yi. ICDE 2009, 305-316. Cited by 10Web SearchBibTeXDownload |
| 38 | Tree Indexing on Flash Disks. Yinan Li, Bingsheng He, Qiong Luo, Ke Yi. ICDE 2009, 1303-1306. Cited by 5Web SearchBibTeXDownload |
| 37 | A Concise Representation of Range Queries. Ke Yi, Xiang Lian, Feifei Li, Lei Chen. ICDE 2009, 1179-1182. Web SearchBibTeXDownload |
| 36 | Indexing uncertain data. Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi. PODS 2009, 137-146. Cited by 1Web SearchBibTeXDownload |
| 35 | Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes. Ke Yi. PODS 2009, 187-196. Web SearchBibTeXDownload |
| 34 | Optimal tracking of distributed heavy hitters and quantiles. Ke Yi, Qin Zhang. PODS 2009, 167-174. Web SearchBibTeXDownload |
| 33 | Quality and efficiency in high dimensional nearest neighbor search. Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis. SIGMOD Conference 2009, 563-576. Cited by 2Web SearchBibTeXDownload |
| 32 | Ranking distributed probabilistic data. Feifei Li, Ke Yi, Jeffrey Jestes. SIGMOD Conference 2009, 361-374. Web SearchBibTeXDownload |
| 31 | Multi-dimensional online tracking. Ke Yi, Qin Zhang. SODA 2009, 1098-1107. Web SearchBibTeXDownload |
| 30 | Dynamic external hashing: the limit of buffering. Zhewei Wei, Ke Yi, Qin Zhang. SPAA 2009, 253-259. Web SearchBibTeXDownload |
| 2008 |
|---|
| 29 | The priority R-tree: A practically efficient and worst-case optimal R-tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. ACM Transactions on Algorithms (4) (2008). Cited by 63Web SearchBibTeXDownload |
| 28 | Optimal Tracking of Distributed Heavy Hitters and Quantiles. Ke Yi, Qin Zhang. CoRR (abs/0812.0209) (2008). Web SearchBibTeXDownload |
| 27 | Dynamic External Hashing: The Limit of Buffering. Zhewei Wei, Ke Yi, Qin Zhang. CoRR (abs/0811.3062) (2008). Web SearchBibTeXDownload |
| 26 | Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries. Ke Yi. CoRR (abs/0811.4346) (2008). Web SearchBibTeXDownload |
| 25 | Randomized Synopses for Query Assurance on Data Streams. Ke Yi, Feifei Li, Marios Hadjieleftheriou, George Kollios, Divesh Srivastava. ICDE 2008, 416-425. Cited by 3Web SearchBibTeXDownload |
| 24 | Efficient Processing of Top-k Queries in Uncertain Databases. Ke Yi, Feifei Li, George Kollios, Divesh Srivastava. ICDE 2008, 1406-1408. Cited by 32Web SearchBibTeXDownload |
| 23 | Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations. Ke Yi, Feifei Li, George Kollios, Divesh Srivastava. IEEE Trans. Knowl. Data Eng. (20): 1669-1682 (2008). Cited by 14Web SearchBibTeXDownload |
| 22 | Sliding-window top-k queries on uncertain streams. Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin. PVLDB (1): 301-312 (2008). Cited by 13Web SearchBibTeXDownload |
| 21 | Finding frequent items in probabilistic data. Qin Zhang, Feifei Li, Ke Yi. SIGMOD Conference 2008, 819-832. Web SearchBibTeXDownload |
| 20 | Algorithms for distributed functional monitoring. Graham Cormode, S. Muthukrishnan, Ke Yi. SODA 2008, 1076-1085. Cited by 12Web SearchBibTeXDownload |
| 19 | A dynamic data structure for top-k queries on uncertain data. Jiang Chen, Ke Yi. Theor. Comput. Sci. (407): 310-317 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 18 | TerraStream: from elevation data to watershed hierarchies. Andrew Danner, Thomas Mĝlhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová. GIS 2007, 28. Cited by 17Web SearchBibTeXDownload |
| 17 | Dynamic Structures for Top- k Queries on Uncertain Data. Jiang Chen, Ke Yi. ISAAC 2007, 427-438. Web SearchBibTeXDownload |
| 16 | Approximate Range Searching in External Memory. Micha Streppel, Ke Yi. ISAAC 2007, 536-548. Web SearchBibTeXDownload |
| 15 | Restricted strip covering and the sensor cover problem. Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi. SODA 2007, 1056-1063. Cited by 8Web SearchBibTeXDownload |
| 14 | Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams. Feifei Li, Ke Yi, Marios Hadjieleftheriou, George Kollios. VLDB 2007, 147-158. Cited by 14Web SearchBibTeXDownload |
| 2006 |
|---|
| 13 | Restricted Strip Covering and the Sensor Cover Problem. Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi. CoRR (abs/cs/0605102) (2006). Web SearchBibTeXDownload |
| 12 | I/O-efficient batched union-find and its applications to terrain analysis. Pankaj K. Agarwal, Lars Arge, Ke Yi. Symposium on Computational Geometry 2006, 167-176. Cited by 16Web SearchBibTeXDownload |
| 2005 |
|---|
| 11 | I/O-Efficient Construction of Constrained Delaunay Triangulations. Pankaj K. Agarwal, Lars Arge, Ke Yi. ESA 2005, 355-366. Cited by 11Web SearchBibTeXDownload |
| 10 | BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data. Adam Silberstein, Hao He, Ke Yi, Jun Yang. ICDE 2005, 285-296. Cited by 41Web SearchBibTeXDownload |
| 9 | Optimal Lexicographic Shaping of Aggregate Streaming Data. Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi. IEEE Trans. Computers (54): 398-408 (2005). Web SearchBibTeXDownload |
| 8 | An optimal dynamic interval stabbing-max data structure?. Pankaj K. Agarwal, Lars Arge, Ke Yi. SODA 2005, 803-812. Cited by 9Web SearchBibTeXDownload |
| 2004 |
|---|
| 7 | The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. Cache-Oblivious and Cache-Aware Algorithms 2004. Web SearchBibTeXDownload |
| 6 | Optimal External Memory Planar Point Enclosure. Lars Arge, Vasilis Samoladas, Ke Yi. ESA 2004, 40-52. Cited by 8Web SearchBibTeXDownload |
| 5 | The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. SIGMOD Conference 2004, 347-358. Web SearchBibTeXDownload |
| 4 | Incremental Maintenance of XML Structural Indexes. Ke Yi, Hao He, Ioana Stanoi, Jun Yang. SIGMOD Conference 2004, 491-502. Cited by 30Web SearchBibTeXDownload |
| 2003 |
|---|
| 3 | I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi. ESA 2003, 7-18. Cited by 4Web SearchBibTeXDownload |
| 2 | Efficient Maintenance of Materialized Top-k Views. Ke Yi, Hai Yu, Jun Yang, Gangqiang Xia, Yuguo Chen. ICDE 2003, 189-200. Cited by 46Web SearchBibTeXDownload |
| 2002 |
|---|
| 1 | Lexicographically optimal smoothing for broadband traffic multiplexing. Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi. PODC 2002, 68-77. Web SearchBibTeXDownload |
