scientific article

Publication date: 1982

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

sorting lower bounds nearest neighbor indirect addressing symbol table uniform cost

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Related Items (21)

Sorting and searching revisted ⋮ When can we sort in \(o(n\log n)\) time? ⋮ Lower bound arguments with ``inaccessible numbers ⋮ Improved parallel integer sorting without concurrent writing ⋮ Establishing order in planar subdivisions ⋮ Characterizing and efficiently computing quadrangulations of planar point sets ⋮ Improved nonconservative sequential and parallel integer sorting ⋮ New algorithms for binary jumbled pattern matching ⋮ Approximate pattern matching with \(k\)-mismatches in packed text ⋮ A lower bound for the integer element distinctness problem ⋮ Arbitrary sequence RAMs ⋮ Maintaining discrete probability distributions optimally ⋮ Lower bounds for arithmetic problems ⋮ Constant-time sorting ⋮ Sorting in linear time? ⋮ Boolean circuit programming: A new paradigm to design parallel algorithms ⋮ Fusion trees can be implemented with \(AC^0\) instructions only ⋮ Practical algorithms for transposition-invariant string-matching ⋮ Upper bounds for sorting integers on random access machines ⋮ Lower bounds for dynamic algebraic problems ⋮ OptORAMa: optimal oblivious RAM

This page was built for publication: