Lower bounds for predecessor searching in the cell probe model

Lower bounds for predecessor searching in the cell probe model (2008)

Cached

Download Links

[www.cs.uvic.ca]

by Pranab Sen, et al.

Citations:

19 - 0 self

BibTeX

@MISC{Sen08lowerbounds,
    author = {Pranab Sen and et al.},
    title = {Lower bounds for predecessor searching in the cell probe model },
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

6517	Elements of information theory - Cover, Thomas - 1991
734	A fast quantum mechanical algorithm for database search - Grover - 1996
536	Communication complexity - Kushilevitz, Nisan - 1997
533	Approximate nearest neighbors: towards removing the curse of dimensionality - Indyk, Motwani - 1998
318	Probabilistic computations: Towards a unified measure of complexity - Yao - 1977
267	circuit complexity - Yao - 1993
207	Storing a sparse table with O(1) worst case access time - Fredman, Komlós, et al. - 1984
181	Design and implementation of an efficient priority queue - Boas, Kaas, et al. - 1977
173	Efficient search for approximate nearest neighbor in high dimensional spaces - Kushilevitz, Ostrovsky, et al. - 1998
135	Surpassing the information theoretic bound with fusion trees - Fredman, Willard - 1993
120	Should tables be sorted - Yao - 1981
100	Exponential lower bound for 2-query locally decodable codes via a quantum argument - Kerenidis, Wolf
99	Emde Boas. Preserving order in a forest in less than logarithmic time and linear - van - 1977
97	Quantum circuits with mixed states - Aharonov, Kitaev, et al. - 1998
79	Quantum entanglement and the communication complexity of the inner product function - Cleve, Dam, et al. - 1998
74	On data structures and asymmetric communication complexity - Miltersen, Nisan, et al. - 1998
73	Private vs. common random bits in communication complexity - Newman - 1991
63	Fidelity for mixed quantum states - Jozsa - 1994
52	Quantum Communication - Kremer - 1995
49	Are bitvectors optimal - Buhrman, Miltersen, et al. - 2002
46	A lower bound for finding predecessors in Yao’s cell probe model - Ajtai - 1988
44	Optimal bounds for the predecessor problem and related problems - Beame, Fich
41	Lower bounds for union-split-find related problems on random access machines - Miltersen - 1994
35	Faster deterministic sorting and searching in linear space - Andersson - 1996
32	Interaction in quantum communication and the complexity of set disjointness - Klauck, Nayak, et al. - 2001
27	Time-space trade-offs for predecessor search - Pătra¸scu, Thorup - 2006
22	Quantum complexities of ordered searching, sorting, and element distinctness - Hyer, Neerbek, et al. - 102
22	The communication complexity of threshold gates - Nisan - 1993
21	An optimal randomised cell probe lower bound for approximate nearest neighbour searching - Chakrabarti, Regev - 2004
20	Invariant quantum algorithms for insertion into an ordered list - Farhi, Goldstone, et al.
19	Mathematical Techniques for Quantum Communication Theory”, lanl e-print server: quant-ph/9604001 - Fuchs, Caves
17	A direct sum theorem in communication complexity via message compression - Jain, Radhakrishnan, et al. - 2003
17	Quantum communication complexity - Klauck - 2000
13	Log-logarithmic worst case range queries are possible in space - Willard - 1983
13	New bounds in cell probe model - Xiao - 1992
12	Prior Entanglement, Message Compression and Privacy in Quantum Communication - Jain, Radhakrishnan, et al. - 2005
10	A strong lower bound for approximate nearest neighbor searching - Liu
8	Lower bounds in the quantum cell probe model - Venkatesh, Sen
5	Shannon’s information methods for lower bounds for probabilistic communication complexity - Smirnov - 1988
4	Ecole d’Ete de Probabilites de Saint-Flour VII-1977 - DACUNHA-CASTELLE - 1978
1	Interactive communication on noisy channels, Bachelor’s thesis - Maneva - 2001
1	Lower bounds for randomized predecessor search, unpublished manuscript - Pătra¸scu, Thorup - 2006