A FAST COMPACT REPRESENTATION OF TREES USING HASH TABLES

Simple item page
dc.contributor.authorCleary, John G.eng
dc.contributor.authorDarragh, John J.eng
dc.date.accessioned2008-02-27T16:55:29Z
dc.date.available2008-02-27T16:55:29Z
dc.date.computerscience1999-05-27eng
dc.date.issued1984-09-01eng
dc.description.abstractA new representation of trees using hash tables is described. Like the usual pointer representation leaves can be reached or inserted in a time proportional to the depth of the tree. Each node uses only the space for its data plus an overhead of $10~+~left ceiling {log sub 2 n} right ceiling$ bits, where $n$ is the number of children allowed on each node. A parent node is accessible from its child, allowing an algorithm to be exhibited for traversing a tree using a small constant amount of storage and without modifying the tree itself. Expressions are given for the space and time required for traversal of trees, as well as, space and timing data from an actual implementation.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1984-162-20eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30527
dc.identifier.urihttp://hdl.handle.net/1880/45807
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleA FAST COMPACT REPRESENTATION OF TREES USING HASH TABLESeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications