Linear-time Breadth First Tree Algorithms : An exercise in the arithmetic of folds and zips

Jones, G.; Gibbons, J.

dc.contributor.author	Jones, G.	en
dc.contributor.author	Gibbons, J.	en
dc.date.accessioned	2009-04-08T04:02:56Z	en
dc.date.available	2009-04-08T04:02:56Z	en
dc.date.issued	1993-05	en
dc.identifier.citation	Computer Science Technical Reports 071 (1993)	en
dc.identifier.issn	1173-3500	en
dc.identifier.uri	http://hdl.handle.net/2292/3470	en
dc.description.abstract	This paper is about an application of the mathematics of the zip, reduce (fold) and accumulate (scan) operations on lists. It gives an account of the derivation of a linear-time breadth-first tree traversal algorithm, and of a subtle and efficient breadth-first tree labelling algorithm.	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	Linear-time Breadth First Tree Algorithms : An exercise in the arithmetic of folds and zips	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