Show simple item record

dc.contributor.authorRobertson, Matthew
dc.date.accessioned2015-08-17 12:29:18 (GMT)
dc.date.available2015-08-17 12:29:18 (GMT)
dc.date.issued2015-08-17
dc.date.submitted2015
dc.identifier.urihttp://hdl.handle.net/10012/9535
dc.description.abstractWe address the problem of quickly inverting the standard representation of a permutation on $n$ elements in place. First, we present a naive algorithm to do it using $O(\log n)$ extra bits in $O(n^2)$ time in the worst case. We then improve that algorithm, using a small bit vector, to use $O(\sqrt n)$ extra bits in $O(n \sqrt n)$ time. Using a different approach, we present an algorithm to do it using $O(\sqrt n \log n)$ extra bits in $O(n \log n)$ time. Finally, for our main result, we present a technique that leads to an algorithm to invert the standard representation of a permutation using only $O(\log^2 n)$ extra bits of space in $O(n \log n)$ time in the worst case.en
dc.language.isoenen
dc.publisherUniversity of Waterloo
dc.subjectPermutationen
dc.subjectIn Placeen
dc.subjectInverten
dc.titleInverting Permutations In Placeen
dc.typeMaster Thesisen
dc.pendingfalse
dc.subject.programComputer Scienceen
uws-etd.degree.departmentComputer Science (David R. Cheriton School of)en
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages