The bit probe complexity measure revisited (original) (raw)
Related papers
On data structures and asymmetric communication complexity
1995
The Cell Probe Complexity of Succinct Data Structures
2003
Exact query complexity of some special classes of Boolean functions
On the Complexity of Search Queries
Fundamentals of Information Systems, 1999
Integer Representation and Counting in the Bit Probe Model
Algorithmica, 2008
Integer Representations towards Efficient Counting in the Bit Probe Model
2011
The Power of Many Samples in Query Complexity
Electron. Colloquium Comput. Complex., 2020
On the complexity of data disjunctions
Theoretical Computer Science, 2002
IEEE Transactions on Software Engineering, 1976
A Trichotomy in the Data Complexity of Certain Query Answering for Conjunctive Queries
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
Theory of Computing Systems, 2012
On the complexity of queries in the logical data model
1988
Efficient error-correcting data structures
2009
Data structures, minimization and complexity of boolean functions
1996
Space Complexity Vs. Query Complexity
computational complexity, 2008
The Complexity of Boolean Functions in Different Characteristics
computational complexity, 2010
Query Complexity Lower Bounds for Reconstruction of Codes
Electron. Colloquium Comput. Complex., 2010
Frequency Computation and Bounded Queries (Conference Paper)
1995
06111 Executive Summary -- Complexity of Boolean Functions
Quadratically Tight Relations for Randomized Query Complexity
Theory of Computing Systems
Constant-Time Retrieval with O(log m) Extra Bits
2019
Explicit Deterministic Constructions for Membership in the Bitprobe Model
Proceedings of the 9th Annual European Symposium on Algorithms, 2001
Inherent Complexity of Recursive Queries
Journal of Computer and System Sciences, 2002
Error-Correcting Data Structures
SIAM Journal on Computing, 2013
A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys
2012
3 On the Logical Depth Function and the Running Time of Shortest Programs
2016
Lower bounds on information complexity via zero-communication protocols and applications
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), 2012
Lifting randomized query complexity to randomized communication complexity
arXiv (Cornell University), 2017
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
Springer eBooks, 2013
Dagstuhl Seminar on The Complexity of Boolean Functions
Compression of Boolean Functions
Electron. Colloquium Comput. Complex., 2013
2020
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory - ICDT '12, 2012
Compressed Data Structures: Dictionaries and Data-Aware Measures
2006