534 search results - page 6 / 107 » One more bit is enough |
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
106
click to vote
ALGORITHMICA
2005
14 years 11 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
110
click to vote
TCC
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
105
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— In Multiple-Input Multiple-Output (MIMO) wireless systems, since different signals are transmitted by different antennas simultaneously, interference occurs between the...