A T-decomposition Algorithm with O(n log n) Time and Space Complexity

Yang, J; Speidel, U

dc.contributor.author	Yang, J	en
dc.contributor.author	Speidel, U	en
dc.date.accessioned	2009-04-16T23:17:41Z	en
dc.date.available	2009-04-16T23:17:41Z	en
dc.date.issued	2005-01	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-259 (2005)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3766	en
dc.description.abstract	T-decomposition is an algorithm that parses a finite string into a series of parameters for a recursive string construction algorithm. Initially developed for the communication of coding trees [18, 4], T-decomposition has since been studied within the context of information measures. This involves the parsing of potentially very large strings, which in turn requires algorithms with good time and space complexity. This paper presents a T-decomposition algorithm with O(n log n) time complexity.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	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/secondcgi.pl?serial	en
dc.title	A T-decomposition Algorithm with O(n log n) Time and Space Complexity	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
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en