Pages that link to "Item:Q5712144"
From MaRDI portal
The following pages link to Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting (Q5712144):
Displaying 27 items.
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Substring range reporting (Q517792) (← links)
- Towards optimal range medians (Q541663) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Path queries on functions (Q1740690) (← links)
- Color-spanning localized query (Q1998849) (← links)
- Data structures for categorical path counting queries (Q2089697) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Join-reachability problems in directed graphs (Q2254502) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Low space data structures for geometric range mode query (Q2345452) (← links)
- Biased range trees (Q2428657) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Counting Subgraphs in Relational Event Graphs (Q2803823) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods (Q2917432) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- (Q5009573) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- (Q5874525) (← links)
- (Q6065422) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
