686 search results - page 24 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
132
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
In the last decade, instruction-set simulators have become an essential development tool for the design of new programmable architectures. Consequently, the simulator performance ...
110
click to vote
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
100
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
137
click to vote
CASES
2005
ACM
15 years 5 months ago
2005
ACM
Computer security becomes increasingly important with continual growth of the number of interconnected computing platforms. Moreover, as capabilities of embedded processors increa...
119
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...