Sciweavers

736 search results - page 108 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
14 years 2 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...
PLDI
1999
ACM
14 years 1 months ago
Pointer Analysis for Multithreaded Programs
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
Radu Rugina, Martin C. Rinard
CSL
2008
Springer
13 years 10 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
CDES
2008
123views Hardware» more  CDES 2008»
13 years 10 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
INFORMATICALT
1998
89views more  INFORMATICALT 1998»
13 years 8 months ago
Simply Invertible Matrices and Fast Prediction
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
Valdas Diciunas