scientific article; zbMATH DE number 1383709

zbMath0946.68156MaRDI QIDQ4719333

Sarnath Ramnath, Venkatesh Raman

Publication date: 17 October 2000

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

zbMATH Keywords

limited storage algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (11)

Strictly in-place algorithms for permuting and inverting permutations ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Constant work-space algorithms for facility location problems ⋮ Prune-and-search with limited workspace ⋮ Approximation in (Poly-) logarithmic space ⋮ Selection from read-only memory with limited workspace ⋮ Approximation in (Poly-) Logarithmic Space ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Finding median in read-only memory on integer input ⋮ Computing the Burrows-Wheeler transform in place and in small space ⋮ Selecting small ranks in EREW PRAM

This page was built for publication: