Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
Authors: Bilardi, Gianfranco
Preparata, Franco P.
Keywords: computer science
technical report
Issue Date: Apr-1988
Publisher: Cornell University
Abstract: The prefix problem consists of computing all the products $x_{0}x_{1} \ldots x_{j} (j = 0, \ldots,N - 1)$, given a sequence $x =(x_{0},x_{1},\ldots, x_{N-1})$ of elements in a semigroup. It is shown that there are unbounded fan-in and fan-out boolean circuits for the prefix problem with constant depth and linear size if and only if the Cayley graph of the semigroup does not contain a special type of cycle called monoidal cycle.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
88-911.pdf1.21 MBAdobe PDFView/Open
88-911.ps794.43 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us