534 search results - page 88 / 107 » One more bit is enough |
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Algebraic side-channel attacks have been recently introduced as a powerful cryptanalysis technique against block ciphers. These attacks represent both a target algorithm and its ph...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
ISCA
2007
IEEE
14 years 2 months ago
2007
IEEE
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
AINA
2009
IEEE
14 years 1 months ago
2009
IEEE
Nowadays more and more devices of daily life are connected to each other and are integrated into massively distributed networks of embedded devices. These devices range from consu...