276 search results - page 26 / 56 » Lower bounds for the complexity of linear functionals in the... |
POPL
2005
ACM
14 years 7 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
TCS
2008
13 years 7 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
ICITS
2009
13 years 5 months ago
2009
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
JOC
2006
13 years 7 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...