Stavros Sintos

Orcid: 0000-0002-2114-8886

Affiliations:
  • University of Illinois at Chicago, IL, USA


According to our database1, Stavros Sintos authored at least 23 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Reporting Durable Patterns in Temporal Proximity Graphs.
CoRR, 2024

Fast Approximation Algorithms for Piercing Boxes by Points.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Range Entropy Queries and Partitioning.
Proceedings of the 27th International Conference on Database Theory, 2024

Computing Data Distribution from Query Selectivities.
Proceedings of the 27th International Conference on Database Theory, 2024

Finding Smallest Witnesses for Conjunctive Queries.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
Hierarchical Residual Encoding for Multiresolution Time Series Compression.
Proc. ACM Manag. Data, 2023

A Fair and Memory/Time-efficient Hashmap.
CoRR, 2023

JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
The maximum exposure problem.
Comput. Geom., 2022

Towards causal physical error discovery in video analytics systems.
Proceedings of the HILDA@SIGMOD 2022: Proceedings of the Workshop on Human-In-the-Loop Data Analytics, 2022

Computing Complex Temporal Join Queries Efficiently.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Dynamic Enumeration of Similarity Joins.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Efficient Indexes for Diverse Top-k Range Queries.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2019
Learning to Sample: Counting with Complex Queries.
Proc. VLDB Endow., 2019

Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise.
Proc. VLDB Endow., 2019

Approximating Distance Measures for the Skyline.
Proceedings of the 22nd International Conference on Database Theory, 2019

2018
Range-max queries on uncertain data.
J. Comput. Syst. Sci., 2018

Computing Shortest Paths in the Plane with Removable Obstacles.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Faster Approximation Algorithm for the <i>k</i>-Regret Minimizing Set and Related Problems.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Efficient Algorithms for k-Regret Minimizing Sets.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2014
Using strong triadic closure to characterize ties in social networks.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014


  Loading...