Browsing Mathematics (Faculty of) by Subject "lower bounds"
Now showing items 1-4 of 4
-
The Fence Complexity of Persistent Sets
(University of Waterloo, 2021-09-21)This thesis studies fence complexity of concurrent sets in a non-volatile shared memory model. I consider the case where CPU registers and cache memory remain volatile while main memory is non-volatile. Flush instructions ... -
Learning Quantum States Without Entangled Measurements
(University of Waterloo, 2021-10-22)How many samples of a quantum state are required to learn a complete description of it? As we will see in this thesis, the fine-grained answer depends on the measurements available to the learner, but in general it is at ... -
Packing Unit Disks
(University of Waterloo, 2008-08-27)Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Richard Rado conjectured 1/4 and proved 1/4.41. In this thesis, we consider ... -
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
(University of Waterloo, 2008-01-23)The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices ...