TY - CHAP T1 - Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems T2 - Algorithms and ComputationAlgorithms and Computation Y1 - 2006 A1 - Ambainis,Andris A1 - Gasarch,William A1 - Srinivasan, Aravind A1 - Utis,Andrey ED - Asano,Tetsuo AB - 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. JA - Algorithms and ComputationAlgorithms and Computation T3 - Lecture Notes in Computer Science PB - Springer Berlin / Heidelberg VL - 4288 SN - 978-3-540-49694-6 UR - http://dx.doi.org/10.1007/11940128_63 ER -