Sciweavers

1132 search results - page 101 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ISAAC
2009
Springer
130views Algorithms» more  ISAAC 2009»
16 years 29 days ago
Counting in the Presence of Memory Faults
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
Gerth Stølting Brodal, Allan Grønlun...
CRYPTO
2000
Springer
108views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
Abstract. This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators ha...
Muxiang Zhang, Agnes Hui Chan
DM
2010
79views more  DM 2010»
15 years 6 months ago
Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
Steve Kirkland
SAC
2002
ACM
15 years 6 months ago
On optimal temporal locality of stencil codes
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
Claudia Leopold
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
16 years 1 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem