Show simple item record

dc.contributor.advisorVanDoren, James R.
dc.contributor.authorMitchell, Dale Leroy, Jr.
dc.date.accessioned2015-10-19T18:21:02Z
dc.date.available2015-10-19T18:21:02Z
dc.date.issued1975-07-01
dc.identifier.urihttps://hdl.handle.net/11244/20093
dc.description.abstractThis thesis presents a probabilistic method for analyzing search trees and applies this method to some constrained classes of limited branching search trees. It is hoped that this method of analysis may help in gaining insight into the expected behavior of search trees when they are utilized as storage structures in information storage and retrieval.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titleProbabilistic Method for Analyzing Search Trees
dc.typetext
dc.contributor.committeeMemberHedrick, G. E.
dc.contributor.committeeMemberGrace, D. W.
osu.filenameThesis-1975-M681p.pdf
osu.accesstypeOpen Access
dc.description.departmentComputing and Information Sciences
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record