Sciweavers

5153 search results - page 79 / 1031
» Introduction to Randomized Algorithms
Sort
View
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
15 years 3 months ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...
SODA
2010
ACM
168views Algorithms» more  SODA 2010»
15 years 7 months ago
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
ARC
2008
Springer
87views Hardware» more  ARC 2008»
14 years 11 months ago
Online Hardware Task Scheduling and Placement Algorithm on Partially Reconfigurable Devices
In this paper, we propose an online hardware task scheduling and placement algorithm and evaluate it performance. Experimental results on large random task set show that our algori...
Thomas Marconi, Yi Lu 0004, Koen Bertels, Georgi G...
SODA
2010
ACM
186views Algorithms» more  SODA 2010»
14 years 8 months ago
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
RSA
2006
91views more  RSA 2006»
14 years 9 months ago
Average case analysis of the Boyer-Moore algorithm
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
Tsung-Hsi Tsai