Towards optimal set-disjointness and set-intersection data structures
From MaRDI portal
Cites work
- 3SUM, 3XOR, triangles
- A new infinity of distance oracles for sparse graphs
- Arboricity and Subgraph Listing Algorithms
- Color-distance oracles and snippets
- Combinatorial Pattern Matching
- Conditional lower bounds for space/time tradeoffs
- Data structure lower bounds for document indexing problems
- Distance oracles beyond the Thorup-Zwick bound
- Dynamic set intersection
- Equivalences between triangle and range query problems
- Fast Evaluation of Union-Intersection Expressions
- Fast set intersection and two-patterns matching
- Fast sparse matrix multiplication
- Faster algorithms for rectangular matrix multiplication
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Forbidden patterns
- Higher lower bounds from the 3SUM conjecture
- How hard is it to find (honest) witnesses?
- scientific article; zbMATH DE number 2119687 (Why is no real title available?)
- scientific article; zbMATH DE number 1445373 (Why is no real title available?)
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Linear-space data structures for range mode query in arrays
- Listing triangles
- Matrix multiplication via arithmetic progressions
- Mind the gap: essentially optimal algorithms for online dictionary matching with one gap
- Multiplying matrices faster than coppersmith-winograd
- On hardness of jumbled indexing
- Popular conjectures imply strong lower bounds for dynamic problems
- Powers of tensors and fast matrix multiplication
- Space-efficient frameworks for top-k string retrieval
- Towards polynomial lower bounds for dynamic problems
- Two-dimensional range diameter queries
Cited in
(2)
This page was built for publication: Towards optimal set-disjointness and set-intersection data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842498)
