1087 search results - page 15 / 218 » Distributed Oblivious Transfer |
SODA
2010
ACM
13 years 6 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
CRYPTO
1990
Springer
13 years 11 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plan...
FOCS
2000
IEEE
14 years 4 days ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...