The Boolean circuit has been an important model of parallel computation, but not many parallel algorithms have been designed on this model because it is 'awkward to program.' To overcome this drawback, we propose a description language for designing parallel algorithms on the Boolean circuit. This description language is to parallel algorithms what the pseudo-code is to sequential algorithms. Through example codes, we show that the description language is a convenient tool to design parallel algorithms due to its general iterative and recursive structures and the ease of modular design. �� 2009 Elsevier Inc. All rights reserved
Abstract: "Ordered binary decision diagrams [1] are widely used for representing Boolean functions i...
In this paper, we study parallel logic level simulation of combinational VLSI Boolean networks. The ...
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleav...
AbstractThe Boolean circuit has been an important model of parallel computation, but not many parall...
This paper gives an overview of some models of computation which have proved successful in laying a ...
AbstractThe effects of bases of two-input Boolean functions are characterized in terms of their impa...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
* This paper describes a data-parallel algorithm for boolean function manipulation. The algorithm ad...
The effects of bases of two-input boolean functions are characterised in terms of their impact on so...
* This paper describes a data-parallel algorithm for boolean function manipulation. The algorithm a...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
AbstractWe present a relationship between two major models of parallel computation: the one-way cell...
Two ways to exploit chips with a very large number of transistors are multicore processors and progr...
International audienceWe present a relationship between two major models of parallel computation: th...
Abstract: "Ordered binary decision diagrams [1] are widely used for representing Boolean functions i...
In this paper, we study parallel logic level simulation of combinational VLSI Boolean networks. The ...
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleav...
AbstractThe Boolean circuit has been an important model of parallel computation, but not many parall...
This paper gives an overview of some models of computation which have proved successful in laying a ...
AbstractThe effects of bases of two-input Boolean functions are characterized in terms of their impa...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
* This paper describes a data-parallel algorithm for boolean function manipulation. The algorithm ad...
The effects of bases of two-input boolean functions are characterised in terms of their impact on so...
* This paper describes a data-parallel algorithm for boolean function manipulation. The algorithm a...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
AbstractWe present a relationship between two major models of parallel computation: the one-way cell...
Two ways to exploit chips with a very large number of transistors are multicore processors and progr...
International audienceWe present a relationship between two major models of parallel computation: th...
Abstract: "Ordered binary decision diagrams [1] are widely used for representing Boolean functions i...
In this paper, we study parallel logic level simulation of combinational VLSI Boolean networks. The ...
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleav...