Back to authors
Stavros Sintos
- Author ID
- o0000-0002-2114-8886
- ORCID
-
0000-0002-2114-8886
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- University of Illinois Chicago
- Pagerank
- 0.16582318
- Overall Rank
- 374 | 98.28%
- Paper Count
- 23
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing all 23 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 6,202 |
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing |
2021 |
SIGMOD |
11 |
5.8494367e-05 |
| 6,686 |
Hierarchical Residual Encoding for Multiresolution Time Series Compression |
2023 |
SIGMOD |
5 |
5.7066636e-05 |
| 7,152 |
Learning to Sample: Counting with Complex Queries |
2020 |
VLDB |
6 |
5.5959861e-05 |
| 7,362 |
Optimizing Collections of Bloom Filters within a Space Budget |
2024 |
VLDB |
4 |
5.540567e-05 |
| 7,518 |
Computing A Well-Representative Summary of Conjunctive Query Results |
2024 |
PODS |
6 |
5.5023404e-05 |
| 7,616 |
Computing Complex Temporal Join Queries Efficiently |
2022 |
SIGMOD |
6 |
5.4822011e-05 |
| 7,784 |
Efficient Indexes for Diverse Top-k Range Queries |
2020 |
PODS |
5 |
5.4520677e-05 |
| 8,285 |
Subset Sampling over Joins |
2026 |
PODS |
2 |
5.3612232e-05 |
| 8,841 |
On Reporting Durable Patterns in Temporal Proximity Graphs |
2024 |
PODS |
1 |
5.2655908e-05 |
| 9,393 |
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise |
2019 |
VLDB |
1 |
5.1843659e-05 |
| 10,380 |
Coresets for Robust Query Optimization |
2026 |
PODS |
0 |
4.9769913e-05 |
| 10,382 |
Faster Relational Algorithms Using Geometric Data Structures |
2026 |
PODS |
0 |
4.9769913e-05 |
| 10,405 |
Clustering with Set Outliers and Applications in Relational Clustering |
2026 |
PODS |
2 |
4.9769913e-05 |
| 10,464 |
Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor |
2026 |
SIGMOD |
1 |
4.9769913e-05 |
| 10,528 |
Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,706 |
On Fair Epsilon Net and Geometric Hitting Set |
2026 |
VLDB |
1 |
4.9769913e-05 |
| 11,090 |
A Theoretical Framework for Distribution-Aware Dataset Search |
2025 |
PODS |
0 |
4.9769913e-05 |
| 11,104 |
Smallest Synthetic Witnesses for Conjunctive Queries |
2025 |
PODS |
0 |
4.9769913e-05 |
| 11,497 |
k-Clustering with Comparison and Distance Oracles |
2024 |
PODS |
0 |
4.9769913e-05 |
| 11,498 |
Improved Approximation Algorithms for Relational Clustering |
2024 |
PODS |
4 |
4.9769913e-05 |
| 11,525 |
FairHash: A Fair and Memory/Time-efficient Hashmap |
2024 |
SIGMOD |
3 |
4.9769913e-05 |
| 11,526 |
Faster Algorithms for Fair Max-Min Diversification in Rd |
2024 |
SIGMOD |
2 |
4.9769913e-05 |
| 12,328 |
Range-Max Queries on Uncertain Data |
2016 |
PODS |
0 |
4.9769913e-05 |
Frequent Co-authors
Co-authored at least 5 papers.