scientific article; zbMATH DE number 1263219

zbMath0968.68509MaRDI QIDQ4234091

No author found.

Publication date: 29 June 1999

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

zbMATH Keywords

randomized algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (21)

Rotation and lighting invariant template matching ⋮ Sorting and searching revisted ⋮ Lower bounds for dynamic transitive closure, planar point location, and parentheses matching ⋮ Neighbours on a grid ⋮ Improved parallel integer sorting without concurrent writing ⋮ The range 1 query (R1Q) problem ⋮ An improved Dijkstra's shortest path algorithm for sparse network ⋮ Trans-dichotomous algorithms without multiplication — some upper and lower bounds ⋮ On the approximation of Euclidean SL via geometric method ⋮ A novel quantum anonymous ranking protocol ⋮ New algorithms for binary jumbled pattern matching ⋮ Succinct data structures for flexible text retrieval systems ⋮ Fast Evaluation of Union-Intersection Expressions ⋮ Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem ⋮ Approximating Huffman codes in parallel ⋮ More Efficient Parallel Integer Sorting ⋮ General Document Retrieval in Compact Space ⋮ Improved fast integer sorting in linear space ⋮ Lower bounds for dynamic algebraic problems ⋮ Improving the efficiency of parallel minimum spanning tree algorithms ⋮ OptORAMa: optimal oblivious RAM

This page was built for publication: