@inbook {17620,
	title = {Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems},
	booktitle = {Algorithms and ComputationAlgorithms and Computation},
	series = {Lecture Notes in Computer Science},
	volume = {4288},
	year = {2006},
	month = {2006///},
	pages = {628 - 637},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {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.
},
	isbn = {978-3-540-49694-6},
	url = {http://dx.doi.org/10.1007/11940128_63},
	author = {Ambainis,Andris and Gasarch,William and Srinivasan, Aravind and Utis,Andrey},
	editor = {Asano,Tetsuo}
}
