Sciweavers

137 search results - page 18 / 28
» Probabilistic algorithm for finding roots of linearized poly...
Sort
View
CHES
2009
Springer
141views Cryptology» more  CHES 2009»
14 years 8 months ago
Fault Attacks on RSA Signatures with Partially Unknown Messages
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
Jean-Sébastien Coron, Antoine Joux, Ilya Ki...
CORR
2008
Springer
227views Education» more  CORR 2008»
13 years 7 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 7 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 9 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
RECOMB
2006
Springer
14 years 7 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...