The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2013)
Berkeley, CA USA
Oct. 26, 2013 to Oct. 29, 2013
ISSN: 0272-5428
pp: 290-299
Paul Beame , Comput. Sci. & Eng., Univ. of Washington, Seattle, WA, USA
Raphael Clifford , Dept. of Comput. Sci., Univ. of Bristol, Bristol, UK
Widad Machmouchi , Comput. Sci. & Eng., Univ. of Washington, Seattle, WA, USA
We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of input data, including frequency moments, element distinctness, and order statistics, that are simple to calculate for sorted data. We develop a randomized algorithm for the element distinctness problem whose time T and space S satisfy T ∈ Õ (n3/2/S1/2), smaller than previous lower bounds for comparison-based algorithms, showing that element distinctness is strictly easier than sorting for randomized branching programs. This algorithm is based on a new time and space efficient algorithm for finding all collisions of a function f from a finite set to itself that are reachable by iterating f from a given set of starting points. We further show that our element distinctness algorithm can be extended at only a polylogarithmic factor cost to solve the element distinctness problem over sliding windows, where the task is to take an input of length 2n-1 and produce an output for each window of length n, giving n outputs in total. In contrast, we show a time-space tradeoff lower bound of T ∈ Ω(n2/S) for randomized branching programs to compute the number of distinct elements over sliding windows. The same lower bound holds for computing the low-order bit of F0 and computing any frequency moment Fk, 1. This shows that those frequency moments and the decision problem F0 mod 2 are strictly harder than element distinctness. We complement this lower bound with a T ∈ Õ(n2/S) comparison-based deterministic RAM algorithm for exactly computing Fk over sliding windows, nearly matching both our lower bound for the sliding-window version and the comparison-based lower bounds for the single-window version. We further exhibit a quantum algorithm for F0 over sliding windows with T ∈ O(n3/2/S1/2). Finally, we consider the computations of order statistics over sliding windows.
Random access memory, Sorting, Complexity theory, Algorithm design and analysis, Computer science, Educational institutions, Standards

P. Beame, R. Clifford and W. Machmouchi, "Element Distinctness, Frequency Moments, and Sliding Windows," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science(FOCS), Berkeley, CA USA, 2014, pp. 290-299.
932 ms
(Ver 3.3 (11022016))