scientific article; zbMATH DE number 432808
From MaRDI portal
Publication:3138942
Cited in
(8)- Exponentially decreasing number of operations in balanced trees
- Using persistent data structures for adding range restrictions to searching problems
- The online house numbering problem: min-max online list labeling
- Orthogonal range searching for text indexing
- A constant update time finger search tree
- The matroid cup game
- Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier
- Improved dynamic graph coloring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138942)