We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
Algebras and coalgebras are fundamental notions for large parts of mathematics. The basic constructions from universal algebra are now expressed in the language of categories and ...
The University of Calgary is attacking the problems of spam and spyware from the angle of education. "Spam and Spyware" is a computer science course offered at both the ...
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
g Information with Partial Period Correlations (extendedabstract) Andrew Klapper Mark Goresky Northeastern University, College of Computer Science, Boston, MA 02115, U.S.A.