Mahler's expansion and Boolean functions.
Memory elements and partition pairs in the synthesis of sequential circuits
Minimal cycle bases of outerplanar graphs.
Mining online auction social networks for reputation and recommendation
Některé vlastnosti nelineárních obvodu a fyzikální význam jakobiánu
Network tomography.
Neuron circuits with transverse connections
Neuron model with electronic treshold circuit
New bounds for codes identifying vertices in graphs.
New self-checking Booth multipliers
This work presents the first self-checking Booth-3 multiplier and a new self-checking Booth-2 multiplier using parity prediction. We propose a method which combines error-detection of Booth-3 (or Booth-2) decoder cells and parity prediction. Additionally, code disjointness is ensured by reusing logic for partial product generation. Parity prediction is applied to a carry-save-adder with the standard sign-bit extension. In this adder almost all cells have odd fanouts and faults are detected by the...
Note on Hamilton Circuits and Hamilton Paths.
On asymptotic stability of passive linear electrical networks
On Boolean partial differential equations
On cubes and dichotomic trees
On dissections of the n-cube
On free Boolean vectors.
On Golomb birulers and their applications
On identifying codes in the King grid that are robust against edge deletions.
On maximal QROBDD’s of boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
On maximal QROBDD's of Boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).