Publications
dblp, google scholar
Gabriel Mersy, Zhuo Wang, Stavros Sintos, and Sanjay Krishnan. Optimizing Collections of Bloom Filters within a Space Budget. International Conference on Very Large Data Bases (VLDB), 2024.
Yash Kurkure, Miles Shamo, Joseph Wiseman, Sainyam Galhotra, and Stavros Sintos. Faster Algorithms for Fair Max-Min Diversification in R^d. ACM SIGMOD International Conference on Management of Data (SIGMOD), 2024. (full version)
Nima Shahbazi, Stavros Sintos, and Abolfazl Asudeh. FairHash: A Fair and Memory/Time-efficient Hashmap. ACM SIGMOD International Conference on Management of Data (SIGMOD), 2024. (full version)
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, and Jun Yang. On Reporting Durable Patterns in Temporal Proximity Graphs. ACM Symposium on Principles of Database Systems (PODS), 2024. (full version)
Xiao Hu, and Stavros Sintos. Finding Smallest Witnesses for Conjunctive Queries. International Conference on Database Theory (ICDT), 2024. (full version) (Best Paper Award)
Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos, and Jun Yang. Computing Data Distribution from Query Selectivities. International Conference on Database Theory (ICDT), 2024. (full version)
Sanjay Krishnan, and Stavros Sintos. Range Entropy Queries and Partitioning. International Conference on Database Theory (ICDT), 2024. (full version)
Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, and Stavros Sintos. Fast Approximation Algorithms for Piercing Boxes by Points. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024. (full version)
Bruno Barbarioli, Gabriel Mersy, Stavros Sintos, and Sanjay Krishnan. Hierarchical Residual Encoding for Multiresolution Time Series Compression. ACM SIGMOD International Conference on Management of Data (SIGMOD), 2023.
Xi Liang, Stavros Sintos, and Sanjay Krishnan. JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing. IEEE International Conference on Data Engineering (ICDE), 2023. (full version)
Jin Jin Zhao, Ted Shaowang, Stavros Sintos, and Sanjay Krishnan. Towards Causal Query Answering for Debugging Video Analytics Systems. Workshop on Human-In-the-Loop Data Analytics (HILDA), 2022.
Xiao Hu, Stavros Sintos, Junyang Gao, Pankaj K. Agarwal, and Jun Yang. Computing Complex Temporal Join Queries Efficiently. ACM SIGMOD International Conference on Management of Data (SIGMOD), 2022. (full version)
Neeraj Kumar, Stavros Sintos, and Subhash Suri. The Maximum Exposure Problem. Computational Geometry: Theory and Applications (CGTA), Vol. 104, 2022
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, and Jun Yang. Dynamic Enumeration of Similarity Joins. International Colloquium on Automata, Languages and Programming (ICALP), 2021. (full version)
Xi Liang, Stavros Sintos, Zechao Shang, and Sanjay Krishnan. Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing. ACM SIGMOD International Conference on Management of Data (SIGMOD), 2021. (full version)
Junyang Gao, Stavros Sintos, Pankaj K. Agarwal, and Jun Yang. Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions. IEEE International Conference on Data Engineering (ICDE), 2021. (full version)
Pankaj K. Agarwal, Stavros Sintos, and Alex Steiger. Efficient Indexes for Diverse Top-k Range Queries. ACM Symposium on Principles of Database Systems (PODS), 2020.
Brett Walenz, Stavros Sintos, Sudeepa Roy, and Jun Yang. Learning to Sample: Counting with Complex Queries. International Conference on Very Large Data Bases (VLDB), 2019. (full version)
Stavros Sintos, Pankaj K. Agarwal, and Jun Yang. Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise. International Conference on Very Large Data Bases (VLDB), 2019. (full version)
Neeraj Kumar, Stavros Sintos, and Subhash Suri. The Maximum Exposure Problem. International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2019. (full version)
Nirman Kumar, Benjamin Raichel, Stavros Sintos, and Gregory Van Buskirk. Approximating Distance Measures for the Skyline. International Conference on Database Theory (ICDT), 2019. (full version)
Pankaj K. Agarwal, Neeraj Kumar, Stavros Sintos, and Subhash Suri. Computing Shortest Paths in the Plane with Removable Obstacles. Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2018.
Nirman Kumar, and Stavros Sintos. Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems. Algorithm Engineering and Experiments (ALENEX), 2018.
Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, and Subhash Suri. Range-Max Queries on Uncertain Data. Invited paper in special issue of Journal of Computer and System Sciences, Vol. 94, 2018.
Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, and Subhash Suri. Efficient Algorithms for k-Regret Minimizing Sets. International Symposium on Experimental Algorithms (SEA), 2017.
Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, and Subhash Suri. Range-Max Queries on Uncertain Data. ACM Symposium on Principles of Database Systems (PODS), 2016.
Stavros Sintos, and Panayiotis Tsaparas. Using Strong Triadic Closure to Characterize Ties in Social Networks. ACM International Conference on Knowledge Discovery and Data Mining (KDD), 2014.