scientific article; zbMATH DE number 512871
From MaRDI portal
Publication:4281568
zbMath0799.68048MaRDI QIDQ4281568
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (10)
The cell probe complexity of succinct data structures ⋮ Integer representation and counting in the bit probe model ⋮ Polynomial Data Structure Lower Bounds in the Group Model ⋮ Dyn-FO: A parallel, dynamic complexity class ⋮ Succinct representations of permutations and functions ⋮ Integer representations towards efficient counting in the bit probe model ⋮ On the cell probe complexity of polynomial evaluation ⋮ On data structures and asymmetric communication complexity ⋮ A Survey of Data Structures in the Bitprobe Model ⋮ Optimal bounds for the predecessor problem and related problems
This page was built for publication:
