scientific article; zbMATH DE number 1306898

zbMath0938.68602MaRDI QIDQ4252751

No author found.

Publication date: 26 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (10)

Predecessor queries in dynamic integer sets ⋮ Sorting and searching revisted ⋮ Lower bounds for dynamic transitive closure, planar point location, and parentheses matching ⋮ Improved parallel integer sorting without concurrent writing ⋮ Trans-dichotomous algorithms without multiplication — some upper and lower bounds ⋮ Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem ⋮ On the difficulty of range searching. ⋮ On data structures and asymmetric communication complexity ⋮ On the existence and construction of non-extreme \((a,b)\)-trees. ⋮ Optimal bounds for the predecessor problem and related problems

This page was built for publication: