2095 search results - page 178 / 419 » Improved pebbling bounds |
166
click to vote
ISPDC
2008
IEEE
16 years 28 days ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
141
click to vote
AFRICACRYPT
2008
Springer
16 years 27 days ago
2008
Springer
In this paper, we investigate the security of the Tractable Rationale Maps Signature (TRMS) signature scheme [9] proposed at PKC’05. To do so, we present a hybrid approach for so...
190
click to vote
COCO
2007
Springer
16 years 21 days ago
2007
Springer
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
169
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
141
click to vote
SCN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...