80 search results - page 15 / 16 » stoc 2007 |
JACM
2007
13 years 5 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
SIAMDM
2010
12 years 12 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
ECCC
2007
13 years 5 months ago
2007
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...