On dynamic bit-probe complexity

DOI10.1007/11523468_78MaRDI QIDQ5716844zbMATH OpenOpenAlexFDO

Authors Corina E. Ptraşcu, Mihai Patrascu

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On dynamic bit-probe complexity
• scientific article; zbMATH DE number 512871
• On the bitprobe complexity of two probe adaptive schemes
• Bit-probe lower bounds for succinct data structures
• Bit-probe lower bounds for succinct data structures
• On the probe complexity of local computation algorithms
• On the bitprobe complexity of two probe adaptive schemes storing two elements
• scientific article; zbMATH DE number 3878850
• Cell-probe lower bounds for bit stream computation
• Dynamic random probing expansion with quasi linear asymptotic complexity

Cited in

(9)

• Saving probe bits by cube domination
• On dynamic bit-probe complexity
• On the complexity of non-unique probe selection
• Dynamic word problems
• Explicit deterministic constructions for membership in the bitprobe model
• scientific article; zbMATH DE number 7471669 (Why is no real title available?)
• Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
• Integer Representation and Counting in the Bit Probe Model
• Integer representation and counting in the bit probe model

This page was built for publication: On dynamic bit-probe complexity

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