Publication:4252751
From MaRDI portal
zbMath0938.68602MaRDI QIDQ4252751
No author found.
Publication date: 26 April 2000
68P10: Searching and sorting
Related Items
Predecessor queries in dynamic integer sets, Sorting and searching revisted, Lower bounds for dynamic transitive closure, planar point location, and parentheses matching, Trans-dichotomous algorithms without multiplication — some upper and lower bounds, On data structures and asymmetric communication complexity, Improved parallel integer sorting without concurrent writing, On the existence and construction of non-extreme \((a,b)\)-trees., Optimal bounds for the predecessor problem and related problems, Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem, On the difficulty of range searching.