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
* This paper describes a data-parallel algorithm for boolean function manipulation. The algorithm a...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
AbstractThe Boolean circuit has been an important model of parallel computation, but not many parall...
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 ...
This paper gives an overview of some models of computation which have proved successful in laying a ...
This paper gives an overview of some models of computation which have proved successful in laying a ...
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...
AbstractThe effects of bases of two-input Boolean functions are characterized in terms of their impa...
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...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...
AbstractThe Boolean circuit has been an important model of parallel computation, but not many parall...
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 ...
This paper gives an overview of some models of computation which have proved successful in laying a ...
This paper gives an overview of some models of computation which have proved successful in laying a ...
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...
AbstractThe effects of bases of two-input Boolean functions are characterized in terms of their impa...
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...
We demonstrate that DNA computers can simulate Boolean circuits with a small overhead. Boolean circu...
Consider a family of boolean circuitsC1,C2,…,Cn,…, constructed by some uniform, effective procedure ...