Are bitvectors optimal?

Cached

Download Links

by H. Buhrman , P. B. Miltersen , J. Radhakrishnan , S. Venkatesh
Citations:54 - 7 self

Active Bibliography

Limitations of Non-Uniform Computational Models – Amit Chakrabarti - 2002
28 Cell probe complexity - a survey – Peter Bro Miltersen
14 Tables Should Be Sorted (on Random Access Machines) – Faith Fich, Peter Bro Miltersen - 1995
3 Dispersing Hash Functions – Rasmus Pagh - 2000
49 LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME – Rasmus Pagh - 2001
8 The quantum complexity of set membership – Jaikumar Radhakrishnan, Pranab Sen, S. Venkatesh - 2000
Lower bounds for predecessor searching in the cell probe model ∗ – unknown authors - 2003
21 An optimal randomised cell probe lower bounds for approximate nearest neighbor searching – Amit Chakrabarti, Oded Regev
27 Lower bounds for predecessor searching in the cell probe model – Pranab Sen, et al. - 2008
11 Cell-Probe Lower Bounds for the Partial Match Problem – T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani - 2003
An Improved Upper Bound of the Rate of Eucledian Superimposed Codes – Zoltán Füredi, Miklós Ruszinkó - 1997
1 Optimal Monotone Encodings – Noga Alon, Rani Hod
Regular union and cover free families – Zoltán Füredi Miklós Ruszinkó Furedi
3 Tracing many users with almost no rate penalty – Noga Alon, Vera Asodi - 2007
On the upper bounds of the minimum number of rows of disjunct matrices – Yongxi Cheng, Ding-zhu Du, Guohui Lin - 2009
20 Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses – Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
18 Membership in Constant Time and Minimum Space – Andrej Brodnik, J. Ian Munro - 1994
Information Processing Letters 83 (2002) 267--274 – Www Elsevier Com, Amnon Ta-shma
Derandomizing Algorithms on Product Distributions – Ariel Gabizon, Avinatan Hassidim