The Complexity of Splay Trees and Skip Lists

Simple item page
dc.contributor.advisorDodds, Reg
dc.contributor.authorSayed, Hassan Adelyar.
dc.contributor.otherFaculty of Science
dc.date.accessioned2013-11-26T18:29:22Z
dc.date.accessioned2024-10-30T14:00:45Z
dc.date.available2010/01/14 01:08
dc.date.available2010/01/14
dc.date.available2013-11-26T18:29:22Z
dc.date.available2024-10-30T14:00:45Z
dc.date.issued2008
dc.descriptionMagister Scientiae - MScen_US
dc.description.abstractOur main results are that splay trees are faster for sorted insertion, where AVL trees are faster for random insertion. For searching, skip lists are faster than single class top-down splay trees, but two-class and multi-class top-down splay trees can behave better than skip lists.en_US
dc.description.countrySouth Africa
dc.identifier.urihttps://hdl.handle.net/10566/16948
dc.language.isoenen_US
dc.publisherUniversity of the Western Capeen_US
dc.rights.holderUniversity of the Western Capeen_US
dc.subjectBinary Search Treesen_US
dc.subjectBalanced Treesen_US
dc.subjectAVL Treesen_US
dc.subjectSelf-adjusting Treesen_US
dc.subjectBottom-up Splay Treesen_US
dc.titleThe Complexity of Splay Trees and Skip Listsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Sayed_MSC_2008.pdf
Size:
2.78 MB
Format:
Adobe Portable Document Format
Download

Collections

Magister Scientiae - MSc (Computer Science)