<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T19:57:41Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/13609" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/13609</identifier><datestamp>2025-03-26T23:37:00Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Munro, J. Ian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="e62b32cb-c8d5-4100-b0bb-f2a5ac6997f4" confidence="600">Sinnamon, Corwin</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-08-20T14:33:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-08-20T14:33:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018-08-20</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2018-07-27</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/13609</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis presents two new representations of distributive lattices with an eye towards efficiency in both time and space. Distributive lattices are a well-known class of partially-ordered sets having two natural operations called meet and join.&#xd;
&#xd;
Improving on all previous results, we develop an efficient data structure for distributive lattices that supports meet and join operations in O(log n) time, where n is the size of the lattice. The structure occupies O(n log n) bits of space, which is as compact as any known data structure and within a logarithmic factor of the information-theoretic lower bound by&#xd;
enumeration.&#xd;
&#xd;
The second representation is a bitstring encoding of a distributive lattice that uses approximately 1.26n bits. This is within a small constant factor of the best known upper and lower bounds for this problem. A lattice can be encoded or decoded in O(n log n) time.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">succinct data structure</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">compact data structure</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">lattice</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">distributive lattice</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">partially-ordered set</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">persistence</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Efficient Representation and Encoding of Distributive Lattices</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Munro, J. Ian</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>