1552 search results - page 9 / 311 » On the Complexity of Constant Propagation |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
114
click to vote
DAGSTUHL
1996
14 years 10 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
106
click to vote
ISCAS
2011
IEEE
14 years 1 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
IJBC
2008
14 years 9 months ago
2008
nodes and their interactions are abstract edges. This paper attempts to characterize the structural quality of complex software networks. We propose to use a novel statistical meas...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...