Mayer, C., Zhang, H., Abo Khamis, M., Deeds, K., Olteanu, D., & Suciu, D. (2026). CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations. Proceedings of the ACM on Management of Data, 4(1), Article 19, 1-27. https://doi.org/10.1145/3786633
Huang, Y.-H., Gong, C., Shaji, S., Yan, A. R., Harka, L., Du, A., Gopal, A. S., Klein, S. J., Shen, S. Z., Phillips, M. E., Owens, T., Deeds, K., & Lee, B. C. G. (2026). GovScape: A Public Multimodal Search System for 70 Million Pages of Government PDFs. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations), 231-241. https://doi.org/10.18653/v1/2026.acl-demo.23
Deeds, K., Suciu, D., Balazinska, M., & Cai, W. (2025). Degree Sequence Bounds. ACM Transactions on Database Systems, 51(1), Article 4, 1-27. https://doi.org/10.1145/3716378
Deeds, K., Merkl, T. C., Pichler, R., & Suciu, D. (2025). The Space-Time Complexity of Sum-Product Queries. Proceedings of the ACM on Management of Data, 3(5), Article 283, 1-21. https://doi.org/10.1145/3767719
Kyle Deeds and Timo Camillo Merkl. Partition Constraints for Conjunctive Queries: Bounds and Worst-Case Optimal Joins. In 28th International Conference on Database Theory (ICDT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 328, pp. 17:1-17:18
Kyle Deeds, Willow Ahrens, Magda Balazinska, and Dan Suciu. 2025. Galley: Modern Query Optimization for Sparse Tensor Programs. Proc. ACM Manag. Data 3, 3 (SIGMOD), Article 164 (June 2025), 24 pages. https://doi.org/10.1145/3725301
Kyle Deeds, Diandre Sabale, Moe Kayali, and Dan Suciu. Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation. PVLDB, 18(2): 130 - 143, 2024. doi:10.14778/3705829.3705834
Willow Ahrens, Teodoro Fields Collin, Radha Patel, Kyle Deeds, Changwan Hong, and Saman Amarasinghe. 2025. Finch: Sparse and Structured Tensor Programming with Control Flow. Proc. ACM Program. Lang. 9, OOPSLA1, Article 117 (April 2025), 31 pages. https://doi.org/10.1145/3720473." .
Deeds, K., & Wu. Z., The Case for Cardinality Bounds: Principled Conservatism in Query Optimization. Sept. 9th 2023. ACM SIGMOD Blog.
Deeds, K., Suciu, D., & Balazinska, M. (2022). SafeBound: A Practical System for Generating Cardinality Bounds. arXiv preprint arXiv:2211.09864.
Deeds, K., Suciu, D., Balazinska, M., & Cai, W. (2022). Degree sequence bound for join cardinality estimation. arXiv preprint arXiv:2201.04166.
Deeds, K., Hentschel, B., & Idreos, S. (2020). Stacked filters: learning to filter by structure. Proceedings of the VLDB Endowment, 14(4), 600-612.
Dohmann, Jeremy, and Kyle Deeds. "A Fast Filtering Algorithm for Massive Context-free Grammars." Proceedings of the 2020 ACM Southeast Conference. 2020.
Talk at Northeastern University, Boston, Massachusetts
Talk at Massachusetts Institute of Technology, Cambridge, Massachusetts
Talk at University of Massachusetts, Amherst, Amherst, Massachusetts
Talk at Boston University, Boston, Massachusetts
Talk at Microsoft Research, Redmond, Washington
Talk at RelationalAI, San Francisco, California