Pages that link to "Item:Q528853"
From MaRDI portal
The following pages link to On Cartesian trees and range minimum queries (Q528853):
Displaying 14 items.
- Dynamic path queries in linear space (Q1799220) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- LZRR: LZ77 parsing with right reference (Q2672241) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- (Q4969037) (← links)
- Cartesian Tree Matching and Indexing (Q5088906) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. (Q5874551) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
- Approximate Cartesian tree matching: an approach using swaps (Q6545412) (← links)
- Enumerating \(m\)-length walks in directed graphs with constant delay (Q6547915) (← links)
