Sciweavers

2095 search results - page 324 / 419
» Improved pebbling bounds
Sort
View
PAIRING
2007
Springer
148views Cryptology» more  PAIRING 2007»
16 years 14 days ago
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
This paper puts forward new efficient constructions for public-key broadcast encryption that simultaneously enjoy the following properties: receivers are stateless; encryption is c...
Cécile Delerablée, Pascal Paillier, ...
STACS
2007
Springer
16 years 13 days ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
CGO
2006
IEEE
16 years 12 days ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
FOCS
2006
IEEE
16 years 11 days ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
FOCS
2006
IEEE
16 years 11 days ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys