Cell-probe lower bounds for the partial match problem
نویسندگان
چکیده
منابع مشابه
Cell-Probe Lower Bounds for Prefix Sums
We prove that to store n bits x ∈ {0, 1}n so that each prefix sum (a.k.a. rank) query Sum(i) := ∑ k≤i xk can be answered by non-adaptively probing q cells of lg n bits, one needs memory n + n/ log n. This matches a recent upper bound of n+ n/ log n by Pǎtraşcu (FOCS 2008), also non-adaptive. We also obtain a n + n/ log O(q) n lower bound for storing a string of balanced brackets so that each Ma...
متن کاملLower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What is the predecessor of x in S?” can be answered efficiently. We study this problem in the cell probe model introduced by Yao [Yao81]. Recently, Beame and Fich [BF99] obtained optimal bounds on the number of probes needed b...
متن کاملCell-Probe Lower Bounds for Bit Stream Computation
We revisit the complexity of online computation in the cell probe model. We consider a class of problems where we are first given a fixed pattern F of n symbols and then one symbol arrives at a time in a stream. After each symbol has arrived we must output some function of F and the n-length suffix of the arriving stream. Cell probe bounds of Ω(δ lgn/w) have previously been shown for both convo...
متن کاملCell-Probe Lower Bounds for Prefix Sums and Matching Brackets
We prove that to store strings x ∈ {0, 1}n so that each prefix sum (a.k.a. rank) query Sum(i) := ∑ k≤i xk can be answered by non-adaptively probing q cells of lg n bits, one needs memory n + n/ lg n. This matches a recent upper bound of n + n/ lg n by Pǎtraşcu (FOCS 2008), also non-adaptive. We also obtain a lg |Bal|+ n/ log2O(q) n lower bound for storing strings of balanced brackets x ∈ Bal ⊆ ...
متن کاملCell Probe Lower Bounds and Approximations for Range Mode
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] must return the mode of the subarray A[i], A[i+ 1], . . . , A[j]. We prove that any data structure that uses S memory cells of w bits needs Ω( log n log(Sw/n) ) time to answer a range mode query. Secondly, we consider th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2004
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.04.006