General space-time tradeoffs via relational queries

DOI10.1007/978-3-031-38906-1_21arXiv2109.10889MaRDI QIDQ6179422

Shaleen Deep, Xiao Hu, Paraschos Koutris

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.10889

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast set intersection and two-patterns matching
• Structural tractability of enumerating CSP solutions
• On hardness of several string indexing problems
• Conditional lower bounds for space/time tradeoffs
• Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
• Size Bounds and Query Plans for Relational Joins
• The Space-Stretch-Time Tradeoff in Distance Oracles
• Clustered Integer 3SUM via Additive Combinatorics
• Graph minors. II. Algorithmic aspects of tree-width
• Worst-case Optimal Join Algorithms
• Counting Triangles under Updates in Worst-Case Optimal Time
• Distance Oracles beyond the Thorup--Zwick Bound
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries

This page was built for publication: General space-time tradeoffs via relational queries