scientific article; zbMATH DE number 1875423
From MaRDI portal
Publication:4796182
zbMath1006.68523MaRDI QIDQ4796182
S. Srinivasa Rao, Venkatesh Raman
Publication date: 2 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610290
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
The cell probe complexity of succinct data structures ⋮ Integer representation and counting in the bit probe model ⋮ Storing four elements in the two query bitprobe model ⋮ On the bitprobe complexity of two probe adaptive schemes ⋮ Lower bounds for restricted schemes in the two-adaptive bitprobe model ⋮ Revisiting explicit adaptive two-probe schemes ⋮ Integer Representation and Counting in the Bit Probe Model ⋮ Determining membership with 2 simultaneous queries ⋮ Two improved schemes in the bitprobe model ⋮ Improved bounds for two query adaptive bitprobe schemes storing five elements ⋮ Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes ⋮ Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements ⋮ A Survey of Data Structures in the Bitprobe Model
This page was built for publication:
