Bit-Probe Lower Bounds for Succinct Data Structures

SIAM Journal on Computing- United States

doi 10.1137/090766619

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Cell Probe Lower Bounds and Approximations for Range Mode

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Lower Bounds for Measurable Chromatic Numbers

Geometric and Functional Analysis
GeometryAnalysisTopology
2009English

Improved Lower Bounds for Multicovering Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1999English

Lower Bounds for Monotone Span Programs

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
1996English

New Lower Bounds for Hopcroft's Problem

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy