scientific article; zbMATH DE number 512871

MaRDI QIDQ4281568zbMATH OpenFDO

Authors Peter Bro Miltersen

Publication date 10 March 1994

zbMATH Keywords

complexity measuremodel of retrieval problemsstatic data structure

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• On the bitprobe complexity of two probe adaptive schemes
• A Survey of Data Structures in the Bitprobe Model
• Set membership with a few bit probes
• scientific article; zbMATH DE number 1875423

Cited in

(12)

• On data structures and asymmetric communication complexity
• Dyn-FO: A parallel, dynamic complexity class
• Saving probe bits by cube domination
• Optimal bounds for the predecessor problem and related problems
• The cell probe complexity of succinct data structures
• Integer representations towards efficient counting in the bit probe model
• A Survey of Data Structures in the Bitprobe Model
• Succinct representations of permutations and functions
• Polynomial data structure lower bounds in the group model
• Automata, Languages and Programming
• On the cell probe complexity of polynomial evaluation
• Integer representation and counting in the bit probe model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281568)