Sciweavers

2042 search results - page 183 / 409
» Variable Number of
Sort
View
149
Voted
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
15 years 9 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra
DAC
1997
ACM
15 years 9 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 9 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
127
Voted
ASPDAC
2007
ACM
89views Hardware» more  ASPDAC 2007»
15 years 9 months ago
Trace Compaction using SAT-based Reachability Analysis
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
Sean Safarpour, Andreas G. Veneris, Hratch Mangass...
143
Voted
DNA
2000
Springer
148views Bioinformatics» more  DNA 2000»
15 years 8 months ago
A Space-Efficient Randomized DNA Algorithm for k-SAT
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
Kevin Chen, Vijay Ramachandran