Pages that link to "Item:Q3192001"
From MaRDI portal
The following pages link to Tight(er) worst-case bounds on dynamic searching and priority queues (Q3192001):
Displayed 14 items.
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Adjacency queries in dynamic sparse graphs (Q846004) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Improved bounds for finger search on a RAM (Q1950391) (← links)
- Two-dimensional packet classification and filter conflict resolution in the internet (Q2272209) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space (Q2300729) (← links)
- Rotation and lighting invariant template matching (Q2373879) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem (Q2466000) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
- Optimal finger search trees in the pointer machine (Q5917584) (← links)