dc.contributor.author |
Gibbons, J. |
en |
dc.date.accessioned |
2009-04-08T04:02:49Z |
en |
dc.date.available |
2009-04-08T04:02:49Z |
en |
dc.date.issued |
1992-06 |
en |
dc.identifier.citation |
Computer Science Technical Reports 061 (1992) |
en |
dc.identifier.issn |
1173-3500 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3464 |
en |
dc.description.abstract |
An accumulation is a higher-order operation over structured objects of some
type; it leaves the `shape' of an object unchanged, but replaces each element of that object
with some accumulated information about the other elements. Upwards and downwards
accumulations on trees are two instances of this scheme; they replace each element of a tree
with some function – in fact, some homomorphism – of that element's descendants and of its
ancestors, respectively. These two operations can be thought of as passing information up
and down the tree. We describe these two accumulations, and show how together they solve
the so-called `prefix sums' problem. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Computer Science Technical Reports |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/csTRcgi.pl?serial |
en |
dc.title |
Upwards and Downwards Accumulations on Trees |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |