Sciweavers

3702 search results - page 80 / 741
» All Pairings Are in a Group
Sort
View
EUROCRYPT
2004
Springer
15 years 10 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 3 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
CPC
2006
110views more  CPC 2006»
15 years 6 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
APAL
2007
75views more  APAL 2007»
15 years 6 months ago
Decidability of the theory of modules over commutative valuation domains
We prove that, if V is an effectively given commutative valuation domain such that its value group is dense and archimedean, then the theory of all V -modules is decidable.
Gennadi Puninski, Vera Puninskaya, Carlo Toffalori
DAM
2006
69views more  DAM 2006»
15 years 6 months ago
On the binary projective codes with dimension 6
All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and different orders of automorphism gro...
Iliya Bouyukliev