Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ke Yi
2010 – today
- 2013
[j28]Ke Yi, Qin Zhang: Optimal Tracking of Distributed Heavy Hitters and Quantiles. Algorithmica 65(1): 206-223 (2013)- [j27]Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi: Efficient external memory structures for range-aggregate queries. Comput. Geom. 46(3): 358-370 (2013)
- [c50]Charalampos Papamanthou, Elaine Shi, Roberto Tamassia, Ke Yi: Streaming Authenticated Data Structures. EUROCRYPT 2013: 353-370
- [c49]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang: Nearest neighbor searching under uncertainty II. PODS 2013: 115-126
- [c48]Lu Wang, Ge Luo, Ke Yi, Graham Cormode: Quantiles over data streams: an experimental study. SIGMOD Conference 2013: 737-748
- [c47]Zhewei Wei, Ke Yi: The Space Complexity of 2-Dimensional Approximate Range Counting. SODA 2013: 252-264
- [e1]Graham Cormode, Ke Yi, Antonios Deligiannakis, Minos N. Garofalakis (Eds.): Proceedings of the First International Workshop on Big Dynamic Distributed Data, Riva del Garda, Italy, August 30, 2013. CEUR Workshop Proceedings 1018, CEUR-WS.org 2013
- 2012
- [j26]Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang: Continuous sampling from distributed streams. J. ACM 59(2): 10 (2012)
- [j25]
- [j24]Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi: An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. SIAM J. Comput. 41(1): 104-127 (2012)
- [j23]
- [j22]
- [j21]Pankaj K. Agarwal, Siu-Wing Cheng, Ke Yi: Range searching on uncertain data. ACM Transactions on Algorithms 8(4): 43 (2012)
- [c46]Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, Ke Yi: Mergeable summaries. PODS 2012: 23-34
- [c45]Zengfeng Huang, Ke Yi, Qin Zhang: Randomized algorithms for tracking distributed count, frequencies, and ranks. PODS 2012: 295-306
- [c44]Graham Cormode, Ke Yi: Tracking Distributed Aggregates over Time-Based Sliding Windows. SSDBM 2012: 416-430
- [i12]Zhewei Wei, Ke Yi: The Space Complexity of 2-Dimensional Approximate Range Counting. CoRR abs/1207.4382 (2012)
- [i11]Zhewei Wei, Ke Yi: Equivalence between Priority Queues and Sorting in External Memory. CoRR abs/1207.4383 (2012)
- 2011
- [j20]Micha Streppel, Ke Yi: Approximate Range Searching in External Memory. Algorithmica 59(2): 115-128 (2011)
- [j19]Ke Yi, Nan Hao, Sang-Jo Yoo: Cooperative Incumbent System Protection MAC Protocol for Multi-channel Ad-hoc Cognitive Radio Networks. TIIS 5(11): 1976-1996 (2011)
- [j18]Graham Cormode, Justin Thaler, Ke Yi: Verifying Computations with Streaming Interactive Proofs. PVLDB 5(1): 25-36 (2011)
- [j17]Jeffrey Jestes, Ke Yi, Feifei Li: Building Wavelet Histograms on Large Data in MapReduce. PVLDB 5(2): 109-120 (2011)
- [j16]Graham Cormode, S. Muthukrishnan, Ke Yi: Algorithms for distributed functional monitoring. ACM Transactions on Algorithms 7(2): 21 (2011)
- [j15]Ke Yi, Xiang Lian, Feifei Li, Lei Chen: The World in a Nutshell: Concise Range Queries. IEEE Trans. Knowl. Data Eng. 23(1): 139-154 (2011)
- [j14]Jeffrey Jestes, Graham Cormode, Feifei Li, Ke Yi: Semantics of Ranking Queries for Probabilistic Data. IEEE Trans. Knowl. Data Eng. 23(12): 1903-1917 (2011)
- [c43]Zengfeng Huang, Ke Yi, Yunhao Liu, Guihai Chen: Optimal sampling algorithms for frequency estimation in distributed data. INFOCOM 2011: 1997-2005
- [c42]Graham Cormode, Ke Yi: Tracking distributed aggregates over time-based sliding windows. PODC 2011: 213-214
- [c41]
- [c40]Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu: Sampling based algorithms for quantile computation in sensor networks. SIGMOD Conference 2011: 745-756
- [c39]Yang Li, Feifei Li, Ke Yi, Bin Yao, Min Wang: Flexible aggregate similarity search. SIGMOD Conference 2011: 1009-1020
- [i10]Zengfeng Huang, Ke Yi, Qin Zhang: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. CoRR abs/1108.3413 (2011)
- [i9]Graham Cormode, Justin Thaler, Ke Yi: Verifying Computations with Streaming Interactive Proofs. CoRR abs/1109.6882 (2011)
- [i8]Jeffrey Jestes, Ke Yi, Feifei Li: Building Wavelet Histograms on Large Data in MapReduce. CoRR abs/1110.6649 (2011)
- 2010
- [j13]Yinan Li, Bingsheng He, Jun Yang, Qiong Luo, Ke Yi: Tree Indexing on Solid State Drives. PVLDB 3(1): 1195-1206 (2010)
- [j12]Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-efficient batched union-find and its applications to terrain analysis. ACM Transactions on Algorithms 7(1): 11 (2010)
- [j11]Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis: Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM Trans. Database Syst. 35(3) (2010)
- [j10]Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin: Sliding-window top-k queries on uncertain streams. VLDB J. 19(3): 411-435 (2010)
- [j9]
- [c38]Xiaokui Xiao, Ke Yi, Yufei Tao: The hardness and approximation algorithms for l-diversity. EDBT 2010: 135-146
- [c37]
- [c36]Yufei Tao, Jian Pei, Jiexing Li, Xiaokui Xiao, Ke Yi, Zhengzheng Xing: Correlation hiding by independence masking. ICDE 2010: 964-967
- [c35]Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang: Optimal sampling from distributed streams. PODS 2010: 77-86
- [c34]
- [c33]Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi: Probabilistic string similarity joins. SIGMOD Conference 2010: 327-338
- [c32]Yufei Tao, Ke Yi, Cheng Sheng, Jian Pei, Feifei Li: Logging every footstep: quantile summaries for the entire history. SIGMOD Conference 2010: 639-650
- [c31]
- [i7]
- [i6]Graham Cormode, Justin Thaler, Ke Yi: Verifying Computations with Streaming Interactive Proofs. Electronic Colloquium on Computational Complexity (ECCC) 17: 159 (2010)
2000 – 2009
- 2009
- [j8]Lars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. Algorithmica 54(3): 337-352 (2009)
- [j7]Ke Yi, Feifei Li, Graham Cormode, Marios Hadjieleftheriou, George Kollios, Divesh Srivastava: Small synopses for group-by query verification on outsourced data streams. ACM Trans. Database Syst. 34(3) (2009)
- [c30]Graham Cormode, Feifei Li, Ke Yi: Semantics of Ranking Queries for Probabilistic Data and Expected Ranks. ICDE 2009: 305-316
- [c29]Ke Yi, Xiang Lian, Feifei Li, Lei Chen: A Concise Representation of Range Queries. ICDE 2009: 1179-1182
- [c28]
- [c27]
- [c26]
- [c25]Ke Yi: Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes. PODS 2009: 187-196
- [c24]Feifei Li, Ke Yi, Jeffrey Jestes: Ranking distributed probabilistic data. SIGMOD Conference 2009: 361-374
- [c23]Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis: Quality and efficiency in high dimensional nearest neighbor search. SIGMOD Conference 2009: 563-576
- [c22]
- [c21]
- [i5]Xiaokui Xiao, Ke Yi, Yufei Tao: The Hardness and Approximation Algorithms for L-Diversity. CoRR abs/0912.5426 (2009)
- 2008
- [j6]Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin: Sliding-window top-k queries on uncertain streams. PVLDB 1(1): 301-312 (2008)
- [j5]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Transactions on Algorithms 4(1) (2008)
- [j4]Jiang Chen, Ke Yi: A dynamic data structure for top-k queries on uncertain data. Theor. Comput. Sci. 407(1-3): 310-317 (2008)
- [j3]Ke Yi, Feifei Li, George Kollios, Divesh Srivastava: Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations. IEEE Trans. Knowl. Data Eng. 20(12): 1669-1682 (2008)
- [c20]Ke Yi, Feifei Li, Marios Hadjieleftheriou, George Kollios, Divesh Srivastava: Randomized Synopses for Query Assurance on Data Streams. ICDE 2008: 416-425
- [c19]Ke Yi, Feifei Li, George Kollios, Divesh Srivastava: Efficient Processing of Top-k Queries in Uncertain Databases. ICDE 2008: 1406-1408
- [c18]Qin Zhang, Feifei Li, Ke Yi: Finding frequent items in probabilistic data. SIGMOD Conference 2008: 819-832
- [c17]Graham Cormode, S. Muthukrishnan, Ke Yi: Algorithms for distributed functional monitoring. SODA 2008: 1076-1085
- [r1]
- [i4]Zhewei Wei, Ke Yi, Qin Zhang: Dynamic External Hashing: The Limit of Buffering. CoRR abs/0811.3062 (2008)
- [i3]Ke Yi: Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries. CoRR abs/0811.4346 (2008)
- [i2]Ke Yi, Qin Zhang: Optimal Tracking of Distributed Heavy Hitters and Quantiles. CoRR abs/0812.0209 (2008)
- 2007
- [c16]Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová: TerraStream: from elevation data to watershed hierarchies. GIS 2007: 28
- [c15]
- [c14]
- [c13]Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted strip covering and the sensor cover problem. SODA 2007: 1056-1063
- [c12]Feifei Li, Ke Yi, Marios Hadjieleftheriou, George Kollios: Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams. VLDB 2007: 147-158
- 2006
- [c11]Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-efficient batched union-find and its applications to terrain analysis. Symposium on Computational Geometry 2006: 167-176
- [i1]Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted Strip Covering and the Sensor Cover Problem. CoRR abs/cs/0605102 (2006)
- 2005
- [j2]Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Optimal Lexicographic Shaping of Aggregate Streaming Data. IEEE Trans. Computers 54(4): 398-408 (2005)
- [c10]Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-Efficient Construction of Constrained Delaunay Triangulations. ESA 2005: 355-366
- [c9]Adam Silberstein, Hao He, Ke Yi, Jun Yang: BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data. ICDE 2005: 285-296
- [c8]Pankaj K. Agarwal, Lars Arge, Ke Yi: An optimal dynamic interval stabbing-max data structure? SODA 2005: 803-812
- 2004
- [c7]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004
- [c6]Lars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. ESA 2004: 40-52
- [c5]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358
- [c4]Ke Yi, Hao He, Ioana Stanoi, Jun Yang: Incremental Maintenance of XML Structural Indexes. SIGMOD Conference 2004: 491-502
- 2003
- [c3]Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi: I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA 2003: 7-18
- [c2]Ke Yi, Hai Yu, Jun Yang, Gangqiang Xia, Yuguo Chen: Efficient Maintenance of Materialized Top-k Views. ICDE 2003: 189-200
- 2002
- [c1]Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Lexicographically optimal smoothing for broadband traffic multiplexing. PODC 2002: 68-77
- 2001
- [j1]Mohamed Zribi, Ke Yi, N. Sundarajan: Experimental evaluation of a variable structure controller for constrained robots. Int. J. Systems Science 32(7): 867-878 (2001)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:57 CEST by the dblp team