Sciweavers

147 search results - page 17 / 30
» A Distributed and Oblivious Heap
Sort
View
GRID
2007
Springer
14 years 1 months ago
Pluggable grid services
— This paper introduces a new concept of pluggable grid service, that provides seamless access to computational grids, based on aspect-oriented techniques. Pluggable grid service...
João Luís Sobral
ICPADS
1998
IEEE
14 years 1 days ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
ECCC
2007
185views more  ECCC 2007»
13 years 7 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
ECCC
2011
282views ECommerce» more  ECCC 2011»
13 years 2 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
13 years 11 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel