63 search results - page 7 / 13 » Boolean Functions for Finite-Tree Dependencies |
IACR
2011
12 years 7 months ago
2011
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
VMCAI
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
CAISE
2006
Springer
13 years 11 months ago
2006
Springer
Static function hierarchies and models of the dynamic behaviour are typically used in e-commerce systems. Issues to be verifies are the completeness and correctness of the static f...
BMCBI
2008
13 years 7 months ago
2008
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
TVLSI
1998
13 years 7 months ago
1998
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...