44 search results - page 5 / 9 » focs 2003 |
FOCS
2003
IEEE
15 years 2 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...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
117
click to vote
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...