150 search results - page 15 / 30 » Oblivious Transfer Is Symmetric |
FOCS
2003
IEEE
14 years 24 days 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
13 years 12 months 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 ...
ACS
2005
13 years 7 months ago
2005
We develop a symmetric analog of brace algebras and discuss the relation of such algebras to L-algebras. We give an alternate proof that the category of symmetric brace algebras is...
COLING
1992
13 years 8 months ago
1992