| No. |
Title |
Author |
Year |
| 1 |
The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems |
Fan, Austen Z. et al. |
2023 |
| 2 |
Certifiable Robustness for Nearest Neighbor Classifiers |
Fan, Austen Z. et al. |
2022 |
| 3 |
Enumeration Algorithms for Conjunctive Queries with Projection |
Deep, Shaleen et al. |
2021 |
| 4 |
Locality-Aware Distribution Schemes |
Sundarmurthy, Bruhathi et al. |
2021 |
| 5 |
Ranked Enumeration of Conjunctive Query Results |
Deep, Shaleen et al. |
2021 |
| 6 |
Consistent Query Answering for Primary Keys in Logspace |
Koutris, Paraschos et al. |
2019 |
| 7 |
Distribution Policies for Datalog |
Ketsman, Bas et al. |
2018 |
| 8 |
m-tables: Representing Missing Data |
Sundarmurthy, Bruhathi et al. |
2017 |
| 9 |
The Design of Arbitrage-Free Data Pricing Schemes |
Deep, Shaleen et al. |
2017 |
| 10 |
Worst-Case Optimal Algorithms for Parallel Query Processing |
Koutris, Paraschos et al. |
2016 |
| 11 |
Answering Conjunctive Queries with Inequalities |
Koutris, Paraschos et al. |
2015 |
