Experimental evaluation of a variable structure controller for constrained robots. - Mohamed Zribi; Ke Yi 001; N. Sundarajan (Int. J. Syst. Sci., 2001)

Lexicographically optimal smoothing for broadband traffic multiplexing. - Stergios V. Anastasiadis; Peter J. Varman; Jeffrey Scott Vitter; Ke Yi 001 (PODC, 2002)

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. - Pankaj K. Agarwal; Lars Arge; Jun Yang 001; Ke Yi 001 (ESA, 2003)

Efficient Maintenance of Materialized Top-k Views. - Ke Yi 001; Hai Yu 005; Jun Yang 001; Gangqiang Xia; Yuguo Chen (ICDE, 2003)

Incremental Maintenance of XML Structural Indexes. - Ke Yi 001; Hao He 006; Ioana Stanoi; Jun Yang 001 (SIGMOD Conference, 2004)

I/O-Efficient Construction of Constrained Delaunay Triangulations. - Pankaj K. Agarwal; Lars Arge; Ke Yi 001 (ESA, 2005)

BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data. - Adam Silberstein; Hao He 006; Ke Yi 001; Jun Yang 001 (ICDE, 2005)

An optimal dynamic interval stabbing-max data structure? - Pankaj K. Agarwal; Lars Arge; Ke Yi 001 (SODA, 2005)

Optimal Lexicographic Shaping of Aggregate Streaming Data. - Stergios V. Anastasiadis; Peter J. Varman; Jeffrey Scott Vitter; Ke Yi 001 (IEEE Trans. Computers, 2005)

TerraStream: from elevation data to watershed hierarchies. - Andrew Danner; Thomas Mølhave; Ke Yi 001; Pankaj K. Agarwal; Lars Arge; Helena Mitásová (GIS, 2007)

Dynamic Structures for Top- k Queries on Uncertain Data. - Jiang Chen; Ke Yi 001 (ISAAC, 2007)

Restricted strip covering and the sensor cover problem. - Adam L. Buchsbaum; Alon Efrat; Shaili Jain; Suresh Venkatasubramanian; Ke Yi 001 (SODA, 2007)

Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams. - Feifei Li 001; Ke Yi 001; Marios Hadjieleftheriou; George Kollios (VLDB, 2007)

Randomized Synopses for Query Assurance on Data Streams. - Ke Yi 001; Feifei Li 001; Marios Hadjieleftheriou; George Kollios; Divesh Srivastava (ICDE, 2008)

Efficient Processing of Top-k Queries in Uncertain Databases. - Ke Yi 001; Feifei Li 001; George Kollios; Divesh Srivastava (ICDE, 2008)

Finding frequent items in probabilistic data. - Qin Zhang 001; Feifei Li 001; Ke Yi 001 (SIGMOD Conference, 2008)

Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries - Ke Yi 001 (CoRR, 2008)

Sliding-window top-k queries on uncertain streams. - Cheqing Jin; Ke Yi 001; Lei Chen 002; Jeffrey Xu Yu; Xuemin Lin 001 (Proc. VLDB Endow., 2008)

The priority R-tree: A practically efficient and worst-case optimal R-tree. - Lars Arge; Mark de Berg; Herman J. Haverkort; Ke Yi 001 (ACM Trans. Algorithms, 2008)

A dynamic data structure for top-k queries on uncertain data. - Jiang Chen; Ke Yi 001 (Theor. Comput. Sci., 2008)

Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations. - Ke Yi 001; Feifei Li 001; George Kollios; Divesh Srivastava (IEEE Trans. Knowl. Data Eng., 2008)

R-Trees. - Ke Yi 001 (Encyclopedia of Algorithms, 2008)

Semantics of Ranking Queries for Probabilistic Data and Expected Ranks. - Graham Cormode; Feifei Li 001; Ke Yi 001 (ICDE, 2009)

Tree Indexing on Flash Disks. - Yinan Li; Bingsheng He; Qiong Luo 001; Ke Yi 001 (ICDE, 2009)

A Concise Representation of Range Queries. - Ke Yi 001; Xiang Lian 001; Feifei Li 001; Lei Chen 002 (ICDE, 2009)

Indexing uncertain data. - Pankaj K. Agarwal; Siu-Wing Cheng; Yufei Tao 001; Ke Yi 001 (PODS, 2009)

Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes. - Ke Yi 001 (PODS, 2009)

Ranking distributed probabilistic data. - Feifei Li 001; Ke Yi 001; Jeffrey Jestes (SIGMOD Conference, 2009)

Quality and efficiency in high dimensional nearest neighbor search. - Yufei Tao 001; Ke Yi 001; Cheng Sheng 001; Panos Kalnis (SIGMOD Conference, 2009)

Multi-dimensional online tracking. - Ke Yi 001; Qin Zhang 001 (SODA, 2009)

Dynamic external hashing: the limit of buffering. - Zhewei Wei; Ke Yi 001; Qin Zhang 001 (SPAA, 2009)

Optimal External Memory Planar Point Enclosure. - Lars Arge; Vasilis Samoladas; Ke Yi 001 (Algorithmica, 2009)

Small synopses for group-by query verification on outsourced data streams. - Ke Yi 001; Feifei Li 001; Graham Cormode; Marios Hadjieleftheriou; George Kollios; Divesh Srivastava (ACM Trans. Database Syst., 2009)

The hardness and approximation algorithms for l-diversity. - Xiaokui Xiao; Ke Yi 001; Yufei Tao 001 (EDBT, 2010)

Clustering with Diversity. - Jian Li 015; Ke Yi 001; Qin Zhang 001 (ICALP (1), 2010)

Correlation hiding by independence masking. - Yufei Tao 001; Jian Pei 001; Jiexing Li; Xiaokui Xiao; Ke Yi 001; Zhengzheng Xing (ICDE, 2010)

Optimal sampling from distributed streams. - Graham Cormode; S. Muthukrishnan 001; Ke Yi 001; Qin Zhang 001 (PODS, 2010)

Probabilistic string similarity joins. - Jeffrey Jestes; Feifei Li 001; Zhepeng Yan; Ke Yi 001 (SIGMOD Conference, 2010)

Logging every footstep: quantile summaries for the entire history. - Yufei Tao 001; Ke Yi 001; Cheng Sheng 001; Jian Pei 001; Feifei Li 001 (SIGMOD Conference, 2010)

On the Cell Probe Complexity of Dynamic Membership. - Ke Yi 001; Qin Zhang 001 (SODA, 2010)

Verifying Computations with Streaming Interactive Proofs. - Graham Cormode; Justin Thaler; Ke Yi 001 (Electron. Colloquium Comput. Complex., 2010)

Tree Indexing on Solid State Drives. - Yinan Li; Bingsheng He; Jun Yang 001; Qiong Luo 001; Ke Yi 001 (Proc. VLDB Endow., 2010)

I/O-efficient batched union-find and its applications to terrain analysis. - Pankaj K. Agarwal; Lars Arge; Ke Yi 001 (ACM Trans. Algorithms, 2010)

Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. - Yufei Tao 001; Ke Yi 001; Cheng Sheng 001; Panos Kalnis (ACM Trans. Database Syst., 2010)

Sliding-window top-k queries on uncertain streams. - Cheqing Jin; Ke Yi 001; Lei Chen 002; Jeffrey Xu Yu; Xuemin Lin 001 (VLDB J., 2010)

Top-k queries on temporal data. - Feifei Li 001; Ke Yi 001; Wangchao Le (VLDB J., 2010)

Optimal sampling algorithms for frequency estimation in distributed data. - Zengfeng Huang; Ke Yi 001; Yunhao Liu 001; Guihai Chen (INFOCOM, 2011)

Tracking distributed aggregates over time-based sliding windows. - Graham Cormode; Ke Yi 001 (PODC, 2011)

Beyond simple aggregates: indexing for summary queries. - Zhewei Wei; Ke Yi 001 (PODS, 2011)

Sampling based algorithms for quantile computation in sensor networks. - Zengfeng Huang; Lu Wang 002; Ke Yi 001; Yunhao Liu 001 (SIGMOD Conference, 2011)

Flexible aggregate similarity search. - Yang Li 106; Feifei Li 001; Ke Yi 001; Bin Yao 002; Min Wang 001 (SIGMOD Conference, 2011)

Approximate Range Searching in External Memory. - Micha Streppel; Ke Yi 001 (Algorithmica, 2011)

Cooperative Incumbent System Protection MAC Protocol for Multi-channel Ad-hoc Cognitive Radio Networks. - Ke Yi 001; Nan Hao; Sang-Jo Yoo (KSII Trans. Internet Inf. Syst., 2011)

Building Wavelet Histograms on Large Data in MapReduce. - Jeffrey Jestes; Ke Yi 001; Feifei Li 001 (Proc. VLDB Endow., 2011)

Algorithms for distributed functional monitoring. - Graham Cormode; S. Muthukrishnan 001; Ke Yi 001 (ACM Trans. Algorithms, 2011)

Semantics of Ranking Queries for Probabilistic Data. - Jeffrey Jestes; Graham Cormode; Feifei Li 001; Ke Yi 001 (IEEE Trans. Knowl. Data Eng., 2011)

The World in a Nutshell: Concise Range Queries. - Ke Yi 001; Xiang Lian 001; Feifei Li 001; Lei Chen 002 (IEEE Trans. Knowl. Data Eng., 2011)

Continuous sampling from distributed streams. - Graham Cormode; S. Muthukrishnan 001; Ke Yi 001; Qin Zhang 001 (J. ACM, 2012)

Dynamic Indexability and the Optimality of B-Trees. - Ke Yi 001 (J. ACM, 2012)

Large-Scale Distributed Computation (NII Shonan Meeting 2012-1). - Graham Cormode; S. Muthukrishnan 001; Ke Yi 001 (NII Shonan Meet. Rep., 2012)

An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. - Pankaj K. Agarwal; Lars Arge; Haim Kaplan; Eyal Molad; Robert Endre Tarjan; Ke Yi 001 (SIAM J. Comput., 2012)

The priority R-tree. - Ke Yi 001 (ACM SIGSPATIAL Special, 2012)

Range searching on uncertain data. - Pankaj K. Agarwal; Siu-Wing Cheng; Ke Yi 001 (ACM Trans. Algorithms, 2012)

Multidimensional online tracking. - Ke Yi 001; Qin Zhang 001 (ACM Trans. Algorithms, 2012)

Streaming Authenticated Data Structures. - Charalampos Papamanthou; Elaine Shi; Roberto Tamassia; Ke Yi 001 (EUROCRYPT, 2013)

Voice over the dins: Improving wireless channel utilization with collision tolerance. - Xiaoyu Ji 001; Yuan He 004; Jiliang Wang; Kaishun Wu; Ke Yi 001; Yunhao Liu 001 (ICNP, 2013)

Quantiles over data streams: an experimental study. - Lu Wang 002; Ge Luo 001; Ke Yi 001; Graham Cormode (SIGMOD Conference, 2013)

The Space Complexity of 2-Dimensional Approximate Range Counting. - Zhewei Wei; Ke Yi 001 (SODA, 2013)

Optimal Tracking of Distributed Heavy Hitters and Quantiles. - Ke Yi 001; Qin Zhang 001 (Algorithmica, 2013)

Efficient external memory structures for range-aggregate queries. - Pankaj K. Agarwal; Lars Arge; Sathish Govindarajan; Jun Yang 001; Ke Yi 001 (Comput. Geom., 2013)

Mergeable summaries. - Pankaj K. Agarwal; Graham Cormode; Zengfeng Huang; Jeff M. Phillips; Zhewei Wei; Ke Yi 001 (ACM Trans. Database Syst., 2013)

Equivalence between Priority Queues and Sorting in External Memory. - Zhewei Wei; Ke Yi 001 (ESA, 2014)

Robust set reconciliation. - Di Chen; Christian Konrad 001; Ke Yi 001; Wei Yu; Qin Zhang 001 (SIGMOD Conference, 2014)

Cache-Oblivious Hashing. - Rasmus Pagh; Zhewei Wei; Ke Yi 001; Qin Zhang 001 (Algorithmica, 2014)

Tracking the Frequency Moments at All Times. - Zengfeng Huang; Wai Ming Tai; Ke Yi 001 (CoRR, 2014)

Indexing for summary queries: Theory and practice. - Ke Yi 001; Lu Wang 002; Zhewei Wei (ACM Trans. Database Syst., 2014)

Enhancing wifi-based localization with visual clues. - Han Xu 011; Zheng Yang 002; Zimu Zhou; Longfei Shangguan; Ke Yi 001; Yunhao Liu 001 (UbiComp, 2015)

Piecewise linear approximation of streaming time series data with max-error guarantees. - Ge Luo 001; Ke Yi 001; Siu-Wing Cheng; Zhenguo Li; Wei Fan 001; Cheng He; Yadong Mu (ICDE, 2015)

STORM: Spatio-Temporal Online Reasoning and Management of Large Spatio-Temporal Data. - Robert Christensen; Lu Wang 002; Feifei Li 001; Ke Yi 001; Jun Tang; Natalee Villa (SIGMOD Conference, 2015)

Persistent Data Sketching. - Zhewei Wei; Ge Luo 001; Ke Yi 001; Xiaoyong Du 001; Ji-Rong Wen (SIGMOD Conference, 2015)

Spatial Online Sampling and Aggregation. - Lu Wang 002; Robert Christensen; Feifei Li 001; Ke Yi 001 (Proc. VLDB Endow., 2015)

Indoor localization via multi-modal sensing on smartphones. - Han Xu 011; Zheng Yang 002; Zimu Zhou; Longfei Shangguan; Ke Yi 001; Yunhao Liu 001 (UbiComp, 2016)

Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins. - Xiao Hu 005; Ke Yi 001 (PODS, 2016)

Wander Join: Online Aggregation via Random Walks. - Feifei Li 001; Bin Wu 003; Ke Yi 001; Zhuoyue Zhao 001 (SIGMOD Conference, 2016)

Wander Join: Online Aggregation for Joins. - Feifei Li 001; Bin Wu 003; Ke Yi 001; Zhuoyue Zhao 001 (SIGMOD Conference, 2016)

Research Directions for Principles of Data Management (Abridged). - Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull 001; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; et al. (SIGMOD Rec., 2016)

Nearest-Neighbor Searching Under Uncertainty II. - Pankaj K. Agarwal; Boris Aronov; Sariel Har-Peled; Jeff M. Phillips; Ke Yi 001; Wuzhou Zhang (ACM Trans. Algorithms, 2016)

Counting Triangles in Large Graphs by Random Sampling. - Bin Wu 003; Ke Yi 001; Zhenguo Li (IEEE Trans. Knowl. Data Eng., 2016)

Exact and approximate flexible aggregate similarity search. - Feifei Li 001; Ke Yi 001; Yufei Tao 001; Bin Yao 002; Yang Li 106; Dong Xie 001; Min Wang 001 (VLDB J., 2016)

Quantiles over data streams: experimental comparisons, new analyses, and further improvements. - Ge Luo 001; Lu Wang 002; Ke Yi 001; Graham Cormode (VLDB J., 2016)

R-Trees. - Ke Yi 001 (Encyclopedia of Algorithms, 2016)

TUM: Towards ubiquitous multi-device localization for cross-device interaction. - Han Xu 011; Zheng Yang 002; Zimu Zhou; Ke Yi 001; Chunyi Peng 001 (INFOCOM, 2017)

Output-optimal Parallel Algorithms for Similarity Joins. - Xiao Hu 005; Yufei Tao 001; Ke Yi 001 (PODS, 2017)

Two-Level Sampling for Join Size Estimation. - Yu Chen; Ke Yi 001 (SIGMOD Conference, 2017)

Processing Big Data Streams (NII Shonan Meeting 2017-7). - Vladimir Braverman; David P. Woodruff; Ke Yi 001 (NII Shonan Meet. Rep., 2017)

The Communication Complexity of Distributed epsilon-Approximations. - Zengfeng Huang; Ke Yi 001 (SIAM J. Comput., 2017)

Wander Join and XDB: Online Aggregation via Random Walks. - Feifei Li 001; Bin Wu 003; Ke Yi 001; Zhuoyue Zhao 001 (SIGMOD Rec., 2017)

On Improving Wireless Channel Utilization: A Collision Tolerance-Based Approach. - Xiaoyu Ji 001; Yuan He 004; Jiliang Wang; Kaishun Wu; Daibo Liu; Ke Yi 001; Yunhao Liu 001 (IEEE Trans. Mob. Comput., 2017)

Join Algorithms: From External Memory to the BSP. - Ke Yi 001 (ICDT, 2018)

Random Sampling over Joins Revisited. - Zhuoyue Zhao 001; Robert Christensen; Feifei Li 001; Xiao Hu 005; Ke Yi 001 (SIGMOD Conference, 2018)

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). - Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull 001; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; et al. (Dagstuhl Manifestos, 2018)

Tight Space Bounds for Two-Dimensional Approximate Range Counting. - Zhewei Wei; Ke Yi 001 (ACM Trans. Algorithms, 2018)

Streaming HyperCube: A Massively Parallel Stream Join Algorithm. - Yuan Qiu 002; Serafeim Papadias; Ke Yi 001 (EDBT, 2019)

Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation. - Zengfeng Huang; Ziyue Huang; Yilei Wang; Ke Yi 001 (NeurIPS, 2019)

Instance and Output Optimal Parallel Algorithms for Acyclic Joins. - Xiao Hu 005; Ke Yi 001 (PODS, 2019)

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. - Zengfeng Huang; Ke Yi 001; Qin Zhang 001 (Algorithmica, 2019)

Communication-Efficient Weighted Sampling and Quantile Summary for GBDT. - Ziyue Huang; Ke Yi 001 (CoRR, 2019)

Technical Perspective: Online Model Management via Temporally Biased Sampling. - Ke Yi 001 (SIGMOD Rec., 2019)

Output-Optimal Massively Parallel Algorithms for Similarity Joins. - Xiao Hu 005; Ke Yi 001; Yufei Tao 001 (ACM Trans. Database Syst., 2019)

Random Sampling and Size Estimation Over Cyclic Joins. - Yu Chen; Ke Yi 001 (ICDT, 2020)

Worst-Case Optimal Join Algorithms (Invited Talk). - Ke Yi 001 (ISAAC, 2020)

Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries. - Xiao Hu 005; Ke Yi 001 (PODS, 2020)

Querying Shared Data with Security Heterogeneity. - Yang Cao 012; Wenfei Fan; Yanghao Wang; Ke Yi 001 (SIGMOD Conference, 2020)

Maintaining Acyclic Foreign-Key Joins under Updates. - Qichen Wang 001; Ke Yi 001 (SIGMOD Conference, 2020)

Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks. - Zengfeng Huang; Ke Yi 001; Qin Zhang 001 (Algorithmica, 2020)

Infnote: A Decentralized Information Sharing Platform Based on Blockchain. - Haoqian Zhang; Yancheng Zhao; Abhishek Paryani; Ke Yi 001 (CoRR, 2020)

Massively Parallel Join Algorithms. - Xiao Hu 005; Ke Yi 001 (SIGMOD Rec., 2020)

Approximate Range Counting Under Differential Privacy. - Ziyue Huang; Ke Yi 001 (SoCG, 2021)

Instance-optimal Mean Estimation Under Differential Privacy. - Ziyue Huang; Yuting Liang; Ke Yi 001 (NeurIPS, 2021)

Residual Sensitivity for Differentially Private Multi-Way Joins. - Wei Dong 007; Ke Yi 001 (SIGMOD Conference, 2021)

Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries. - Yuan Qiu 002; Yilei Wang; Ke Yi 001; Feifei Li 001; Bin Wu 003; Chaoqun Zhan (SIGMOD Conference, 2021)

Secure Yannakakis: Join-Aggregate Queries over Private Data. - Yilei Wang; Ke Yi 001 (SIGMOD Conference, 2021)

Secure Machine Learning over Relational Data. - Qiyao Luo; Yilei Wang; Zhenghang Ren; Ke Yi 001; Kai Chen 005; Xiao Wang (CoRR, 2021)

Cquirrel: Continuous Query Processing over Acyclic Relational Schemas. - Qichen Wang 001; Chaoqi Zhang 002; Danish Alsayed; Ke Yi 001; Bin Wu 003; Feifei Li 001; Chaoqun Zhan (Proc. VLDB Endow., 2021)

Shifted Inverse: A General Mechanism for Monotonic Functions under User Differential Privacy. - Juanru Fang; Wei Dong 007; Ke Yi 001 (CCS, 2022)

Frequency Estimation in the Shuffle Model with Almost a Single Message. - Qiyao Luo; Yilei Wang; Ke Yi 001 (CCS, 2022)

Releasing Private Data for Numerical Queries. - Yuan Qiu 002; Wei Dong 007; Ke Yi 001; Bin Wu 003; Feifei Li 001 (KDD, 2022)

Differentially Private Covariance Revisited. - Wei Dong 007; Yuting Liang; Ke Yi 001 (NeurIPS, 2022)

A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries. - Wei Dong 007; Ke Yi 001 (PODS, 2022)

Query Evaluation by Circuits. - Yilei Wang; Ke Yi 001 (PODS, 2022)

Differential Privacy on Dynamic Data. - Yuan Qiu 002; Ke Yi 001 (CoRR, 2022)

Intersection joins under updates. - Yufei Tao 001; Ke Yi 001 (J. Comput. Syst. Sci., 2022)

Frequency Estimation Under Multiparty Differential Privacy: One-shot and Streaming. - Ziyue Huang; Yuan Qiu 002; Ke Yi 001; Graham Cormode (Proc. VLDB Endow., 2022)

Persistent Summaries. - Tianjing Zeng; Zhewei Wei; Ge Luo 001; Ke Yi 001; Xiaoyong Du 001; Ji-Rong Wen (ACM Trans. Database Syst., 2022)

Concentrated Geo-Privacy. - Yuting Liang; Ke Yi 001 (CCS, 2023)

Universal Private Estimators. - Wei Dong 007; Ke Yi 001 (PODS, 2023)

SparkSQL+: Next-generation Query Planning over Spark. - Binyang Dai; Qichen Wang 001; Ke Yi 001 (SIGMOD Conference Companion, 2023)

Continual Observation under User-level Differential Privacy. - Wei Dong 007; Qiyao Luo; Ke Yi 001 (SP, 2023)

Efficient Oblivious Sorting and Shuffling for Hardware Enclaves. - Tianyao Gu; Yilei Wang; Bingnan Chen; Afonso Tinoco; Elaine Shi; Ke Yi 001 (IACR Cryptol. ePrint Arch., 2023)

Better than Composition: How to Answer Multiple Relational Queries under Differential Privacy. - Wei Dong 007; Dajun Sun; Ke Yi 001 (Proc. ACM Manag. Data, 2023)

Change Propagation Without Joins. - Qichen Wang 001; Xiao Hu 005; Binyang Dai; Ke Yi 001 (Proc. VLDB Endow., 2023)

Conjunctive Queries with Comparisons. - Qichen Wang 001; Ke Yi 001 (SIGMOD Rec., 2023)

R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys. - Wei Dong 007; Juanru Fang; Ke Yi 001; Yuchao Tao; Ashwin Machanavajjhala (SIGMOD Rec., 2023)

Secure Sampling for Approximate Multi-party Query Processing. - Qiyao Luo; Yilei Wang; Ke Yi 001; Sheng Wang 011; Feifei Li 001 (Proc. ACM Manag. Data, 2023)

Query Evaluation under Differential Privacy. - Wei Dong 007; Ke Yi 001 (SIGMOD Rec., 2023)

Confidence Intervals for Private Query Processing. - Dajun Sun; Wei Dong 007; Ke Yi 001 (Proc. VLDB Endow., 2023)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy. - Wei Dong 007; Qiyao Luo; Giulia Fanti; Elaine Shi; Ke Yi 001 (CCS, 2024)

Smooth Sensitivity for Geo-Privacy. - Yuting Liang; Ke Yi 001 (CCS, 2024)

The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024. - Martin Grohe; Jan Van den Bussche; Ke Yi 001 (PODS Companion, 2024)

Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy. - Wei Dong 007; Qiyao Luo; Giulia Fanti; Elaine Shi; Ke Yi 001 (CoRR, 2024)

Secure Query Processing with Linear Complexity. - Qiyao Luo; Yilei Wang; Wei Dong 007; Ke Yi 001 (CoRR, 2024)

Continual Observation of Joins under Differential Privacy. - Wei Dong 007; Zijun Chen; Qiyao Luo; Elaine Shi; Ke Yi 001 (Proc. ACM Manag. Data, 2024)

Reservoir Sampling over Joins. - Binyang Dai; Xiao Hu 005; Ke Yi 001 (Proc. ACM Manag. Data, 2024)

Implementation of Flexway O-Sort: Enclave-Friendly and Optimal Oblivious Sorting. - Tianyao Gu; Afonso Tinoco de Faria Cecílio dos Santos; Yilei Wang; Bingnan Chen; Ke Yi 001; Elaine Shi (Zenodo, 2024)

Privacy Amplification by Sampling under User-level Differential Privacy. - Juanru Fang; Ke Yi 001 (Proc. ACM Manag. Data, 2024)

DOP-SQL: A General-purpose, High-utility, and Extensible Private SQL System. - Jianzhe Yu; Wei Dong 007; Juanru Fang; Dajun Sun; Ke Yi 001 (Proc. VLDB Endow., 2024)

Personalized Truncation for Personalized Privacy. - Dajun Sun; Wei Dong 007; Yuan Qiu 002; Ke Yi 001 (Proc. ACM Manag. Data, 2024)

Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys. - Wei Dong 007; Juanru Fang; Ke Yi 001; Yuchao Tao; Ashwin Machanavajjhala (ACM Trans. Database Syst., 2024)

Implementation of Flexway O-Sort: Enclave-Friendly and Optimal Oblivious Sorting. - Tianyao Gu; Afonso Tinoco de Faria Cecílio dos Santos; Yilei Wang; Bingnan Chen; Ke Yi 001; Elaine Shi (Zenodo, 2025)

RM2: Answer Counting Queries Efficiently under Shuffle Differential Privacy. - Qiyao Luo; Jianzhe Yu; Wei Dong 007; Quanqing Xu; Chuanhui Yang; Ke Yi 001 (Proc. ACM Manag. Data, 2025)

Approximate DBSCAN under Differential Privacy. - Yuan Qiu 002; Ke Yi 001 (Proc. ACM Manag. Data, 2025)

Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees. - Qichen Wang 001; Bingnan Chen; Binyang Dai; Ke Yi 001; Feifei Li 001; Liang Lin (Proc. ACM Manag. Data, 2025)

Approximate DBSCAN under Differential Privacy. - Yuan Qiu 001; Ke Yi 001 (CoRR, 2025)