Minimal parallel prefix circuits
Igor' Sergeevich Sergeev · Moscow University Mathematics Bulletin · 2011
The exact complexity of the minimal prefix circuit of width m and depth [log2 m] is obtained in the case when m is a power of two. New upper bounds for the complexity of prefix circuits are obtained under various depth restrictions and separately for circuits of XOR-gates.