| Using strong triadic closure to characterize ties in social networks S Sintos, P Tsaparas Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014 | 82 | 2014 |
| Efficient algorithms for k-regret minimizing sets PK Agarwal, N Kumar, S Sintos, S Suri International Symposium on Experimental Algorithms (SEA), 2017 | 54 | 2017 |
| Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems N Kumar, S Sintos 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018 | 30 | 2018 |
| Learning to Sample: Counting with Complex Queries B Walenz, S Sintos, S Roy, J Yang Proceedings of the VLDB Endowment 13 (3), 389-401, 2019 | 24 | 2019 |
| Combining aggregation and sampling (nearly) optimally for approximate query processing X Liang, S Sintos, Z Shang, S Krishnan Proceedings of the 2021 International Conference on Management of Data, 1129 …, 2021 | 23 | 2021 |
| Range-max queries on uncertain data PK Agarwal, N Kumar, S Sintos, S Suri Journal of Computer and System Sciences 94, 118-134, 2018 | 20 | 2018 |
| Range-max queries on uncertain data PK Agarwal, N Kumar, S Sintos, S Suri Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 17 | 2016 |
| Efficient indexes for diverse top-k range queries PK Agarwal, S Sintos, A Steiger Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 13 | 2020 |
| Computing shortest paths in the plane with removable obstacles PK Agarwal, N Kumar, S Sintos, S Suri 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018 | 12 | 2018 |
| Computing complex temporal join queries efficiently X Hu, S Sintos, J Gao, PK Agarwal, J Yang Proceedings of the 2022 International Conference on Management of Data, 2076 …, 2022 | 9 | 2022 |
| Durable top-k instant-stamped temporal records with user-specified scoring functions J Gao, S Sintos, PK Agarwal, J Yang 2021 IEEE 37th International Conference on Data Engineering (ICDE), 720-731, 2021 | 8 | 2021 |
| Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise S Sintos, PK Agarwal, J Yang Proceedings of the VLDB Endowment 12 (13), 2408-2421, 2019 | 7 | 2019 |
| Hierarchical residual encoding for multiresolution time series compression B Barbarioli, G Mersy, S Sintos, S Krishnan Proceedings of the ACM on Management of Data 1 (1), 1-26, 2023 | 6 | 2023 |
| Dynamic enumeration of similarity joins PK Agarwal, X Hu, S Sintos, J Yang arXiv preprint arXiv:2105.01818, 2021 | 6 | 2021 |
| The maximum exposure problem N Kumar, S Sintos, S Suri arXiv preprint arXiv:2102.03455, 2021 | 3 | 2021 |
| Approximating distance measures for the skyline N Kumar, B Raichel, S Sintos, G Van Buskirk 22nd International Conference on Database Theory (ICDT 2019), 2019 | 3 | 2019 |
| University of Ioannina A Nindos Greece, 0 | 3 | |
| Range Entropy Queries and Partitioning S Krishnan, S Sintos arXiv preprint arXiv:2312.15959, 2023 | 1 | 2023 |
| JanusAQP: Efficient partition tree maintenance for dynamic approximate query processing X Liang, S Sintos, S Krishnan 2023 IEEE 39th International Conference on Data Engineering (ICDE), 572-584, 2023 | 1 | 2023 |
| FairHash: A Fair and Memory/Time-efficient Hashmap N Shahbazi, S Sintos, A Asudeh Proceedings of the ACM on Management of Data 2 (3), 1-29, 2024 | | 2024 |
Pankaj K. AgarwalDuke University在 cs.duke.edu 的电子邮件经过验证
