Kyle Deeds

Orcid: 0000-0003-2267-3276

Affiliations:
  • University of Washington, Seattle, WA, USA


According to our database1, Kyle Deeds authored at least 20 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Degree Sequence Bounds.
ACM Trans. Database Syst., March, 2026

Query Decompositions and All That (Invited Talk).
Proceedings of the 29th International Conference on Database Theory, 2026

2025
The Space-Time Complexity of Sum-Product Queries.
Proc. ACM Manag. Data, November, 2025

GovScape: A Public Multimodal Search System for 70 Million Pages of Government PDFs.
CoRR, November, 2025

Galley: Modern Query Optimization for Sparse Tensor Programs.
Proc. ACM Manag. Data, June, 2025

Finch: Sparse and Structured Tensor Programming with Control Flow: The Artifact.
Dataset, February, 2025

Finch: Sparse and Structured Tensor Programming with Control Flow: The Artifact.
Dataset, January, 2025

Finch: Sparse and Structured Tensor Programming with Control Flow: The Artifact.
Dataset, January, 2025

Finch: Sparse and Structured Tensor Programming with Control Flow: The Artifact.
Dataset, January, 2025

Finch: Sparse and Structured Tensor Programming with Control Flow.
Proc. ACM Program. Lang., 2025

Reproducibility Report for ACM SIGMOD 2025 Paper: 'An Elephant Under the Microscope: Analyzing the Interaction of Optimizer Components in PostgreSQL'.
Proceedings of the Reproducibility Reports of the 2025 International Conference on Management of Data, 2025

Partition Constraints for Conjunctive Queries: Bounds and Worst-Case Optimal Joins.
Proceedings of the 28th International Conference on Database Theory, 2025

2024
Pessimistic Cardinality Estimation.
SIGMOD Rec., December, 2024

COLOR: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation.
Proc. VLDB Endow., October, 2024

Finch: Sparse and Structured Array Programming with Control Flow.
CoRR, 2024

Reproducibility Report for ACM SIGMOD 2024 Paper: 'Query Refinement for Diverse Top-<i>k</i> Selection'.
Proceedings of the Reproducibility Reports of the 2024 International Conference on Management of Data, 2024

2023
SafeBound: A Practical System for Generating Cardinality Bounds.
Proc. ACM Manag. Data, 2023

Degree Sequence Bound for Join Cardinality Estimation.
Proceedings of the 26th International Conference on Database Theory, 2023

2020
Stacked Filters: Learning to Filter by Structure.
Proc. VLDB Endow., 2020

A Fast Filtering Algorithm for Massive Context-free Grammars.
Proceedings of the 2020 ACM Southeast Conference, 2020


  Loading...