8 search results - page 2 / 2 » About permutation algebras, (pre)sheaves and named sets |
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
EUROCRYPT
2010
Springer
13 years 9 months ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...