%0 Book Section
%B Algorithms and ComputationAlgorithms and Computation
%D 2006
%T Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
%A Ambainis,Andris
%A Gasarch,William
%A Srinivasan, Aravind
%A Utis,Andrey
%E Asano,Tetsuo
%X A sub-area of discrepancy theory that has received much attention in computer science re-cently, is that of explicit constructions of low-discrepancy point sets for various types of rectangle families in high dimension. This research has led to interesting applications in error-control cod- ing, distributed protocols, Web document filtering, derandomization, and other areas. We give a short survey of this area here.
%B Algorithms and ComputationAlgorithms and Computation
%S Lecture Notes in Computer Science
%I Springer Berlin / Heidelberg
%V 4288
%P 628 - 637
%8 2006///
%@ 978-3-540-49694-6
%G eng
%U http://dx.doi.org/10.1007/11940128_63