default search action
Stavros Sintos
Person information
- affiliation: University of Illinois at Chicago, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Pankaj K. Agarwal
, Xiao Hu
On Reporting Durable Patterns in Temporal Proximity Graphs. Proc. ACM Manag. Data 2(2): 81 (2024) - [j11]Nima Shahbazi
FairHash: A Fair and Memory/Time-efficient Hashmap. Proc. ACM Manag. Data 2(3): 136 (2024) - [j10]Yash Kurkure
Faster Algorithms for Fair Max-Min Diversification in Rd. Proc. ACM Manag. Data 2(3): 137 (2024) - [j9]Sainyam Galhotra, Rahul Raychaudhury, Stavros Sintos:
k-Clustering with Comparison and Distance Oracles. Proc. ACM Manag. Data 2(5): 212:1-212:26 (2024) - [j8]Aryan Esmailpour, Stavros Sintos:
Improved Approximation Algorithms for Relational Clustering. Proc. ACM Manag. Data 2(5): 213:1-213:27 (2024) - [j7]Pankaj K. Agarwal, Aryan Esmailpour, Xiao Hu, Stavros Sintos, Jun Yang:
Computing A Well-Representative Summary of Conjunctive Query Results. Proc. ACM Manag. Data 2(5): 217:1-217:27 (2024) - [j6]Gabriel Mersy, Zhuo Wang, Stavros Sintos, Sanjay Krishnan:
Optimizing Collections of Bloom Filters within a Space Budget. Proc. VLDB Endow. 17(11): 3551-3564 (2024) - [c18]Sanjay Krishnan, Stavros Sintos:
Range Entropy Queries and Partitioning. ICDT 2024: 6:1-6:21 - [c17]Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos, Jun Yang:
Computing Data Distribution from Query Selectivities. ICDT 2024: 18:1-18:20 - [c16]Xiao Hu, Stavros Sintos:
Finding Smallest Witnesses for Conjunctive Queries. ICDT 2024: 24:1-24:20 - [c15]Pankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos:
Fast Approximation Algorithms for Piercing Boxes by Points. SODA 2024: 4892-4908 - [i18]Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos, Jun Yang:
Computing Data Distribution from Query Selectivities. CoRR abs/2401.06047 (2024) - [i17]Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang:
On Reporting Durable Patterns in Temporal Proximity Graphs. CoRR abs/2403.16312 (2024) - [i16]Yash Kurkure, Miles Shamo, Joseph Wiseman, Sainyam Galhotra, Stavros Sintos:
Faster Algorithms for Fair Max-Min Diversification in Rd. CoRR abs/2404.04713 (2024) - [i15]Mohsen Dehghankar, Rahul Raychaudhury, Stavros Sintos, Abolfazl Asudeh:
Fair Set Cover. CoRR abs/2405.11639 (2024) - [i14]Jinjin Zhao, Ted Shaowang
Towards Causal Physical Error Discovery in Video Analytics Systems. CoRR abs/2405.17686 (2024) - [i13]Aryan Esmailpour, Stavros Sintos:
Improved Approximation Algorithms for Relational Clustering. CoRR abs/2409.18498 (2024) - 2023
- [j5]Bruno Barbarioli
Hierarchical Residual Encoding for Multiresolution Time Series Compression. Proc. ACM Manag. Data 1(1): 99:1-99:26 (2023) - [c14]Xi Liang, Stavros Sintos, Sanjay Krishnan:
JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing. ICDE 2023: 572-584 - [e1]Floris Geerts
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2023, Seattle, WA, USA, June 18-23, 2023. ACM 2023 [contents] - [i12]Abolfazl Asudeh, Nima Shahbazi, Stavros Sintos:
A Fair and Memory/Time-efficient Hashmap. CoRR abs/2307.11355 (2023) - [i11]Pankaj K. Agarwal, Sariel Har-Peled
Fast Approximation Algorithms for Piercing Boxes by Points. CoRR abs/2311.02050 (2023) - [i10]Xiao Hu, Stavros Sintos:
Finding Smallest Witnesses for Conjunctive Queries. CoRR abs/2311.18157 (2023) - [i9]Sanjay Krishnan, Stavros Sintos:
Range Entropy Queries and Partitioning. CoRR abs/2312.15959 (2023) - 2022
- [j4]Neeraj Kumar
The maximum exposure problem. Comput. Geom. 104: 101861 (2022) - [c13]Ted Shaowang
Towards causal physical error discovery in video analytics systems. HILDA@SIGMOD 2022: 10:1-10:6 - [c12]Xiao Hu, Stavros Sintos, Junyang Gao, Pankaj K. Agarwal, Jun Yang:
Computing Complex Temporal Join Queries Efficiently. SIGMOD Conference 2022: 2076-2090 - [i8]Xi Liang, Stavros Sintos, Sanjay Krishnan:
JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing. CoRR abs/2204.09235 (2022) - 2021
- [c11]Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang:
Dynamic Enumeration of Similarity Joins. ICALP 2021: 11:1-11:19 - [c10]Junyang Gao, Stavros Sintos, Pankaj K. Agarwal, Jun Yang:
Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions. ICDE 2021: 720-731 - [c9]Xi Liang, Stavros Sintos, Zechao Shang, Sanjay Krishnan:
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing. SIGMOD Conference 2021: 1129-1141 - [i7]Neeraj Kumar, Stavros Sintos, Subhash Suri:
The Maximum Exposure Problem. CoRR abs/2102.03455 (2021) - [i6]Junyang Gao, Stavros Sintos, Pankaj K. Agarwal, Jun Yang:
Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions. CoRR abs/2102.12072 (2021) - [i5]Xi Liang, Stavros Sintos, Zechao Shang, Sanjay Krishnan:
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing. CoRR abs/2103.15994 (2021) - [i4]Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang:
Dynamic Enumeration of Similarity Joins. CoRR abs/2105.01818 (2021) - 2020
- [c8]Pankaj K. Agarwal, Stavros Sintos, Alex Steiger:
Efficient Indexes for Diverse Top-k Range Queries. PODS 2020: 213-227
2010 – 2019
- 2019
- [j3]Stavros Sintos, Pankaj K. Agarwal, Jun Yang:
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise. Proc. VLDB Endow. 12(13): 2408-2421 (2019) - [j2]Brett Walenz, Stavros Sintos, Sudeepa Roy, Jun Yang:
Learning to Sample: Counting with Complex Queries. Proc. VLDB Endow. 13(3): 390-402 (2019) - [c7]Neeraj Kumar, Stavros Sintos, Subhash Suri:
The Maximum Exposure Problem. APPROX-RANDOM 2019: 19:1-19:20 - [c6]Nirman Kumar, Benjamin Raichel, Stavros Sintos, Gregory Van Buskirk:
Approximating Distance Measures for the Skyline. ICDT 2019: 10:1-10:20 - [i3]Brett Walenz, Stavros Sintos, Sudeepa Roy, Jun Yang:
Learning to Sample: Counting with Complex Queries. CoRR abs/1906.09335 (2019) - [i2]Stavros Sintos, Pankaj K. Agarwal, Jun Yang:
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise. CoRR abs/1909.05380 (2019) - 2018
- [j1]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos
Range-max queries on uncertain data. J. Comput. Syst. Sci. 94: 118-134 (2018) - [c5]Nirman Kumar, Stavros Sintos:
Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems. ALENEX 2018: 62-74 - [c4]Pankaj K. Agarwal, Neeraj Kumar, Stavros Sintos, Subhash Suri:
Computing Shortest Paths in the Plane with Removable Obstacles. SWAT 2018: 5:1-5:15 - 2017
- [c3]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. SEA 2017: 7:1-7:23 - [i1]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. CoRR abs/1702.01446 (2017) - 2016
- [c2]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Range-Max Queries on Uncertain Data. PODS 2016: 465-476 - 2014
- [c1]Stavros Sintos, Panayiotis Tsaparas
Using strong triadic closure to characterize ties in social networks. KDD 2014: 1466-1475
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-09 22:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: