Now showing items 1-5 of 5
Solving Geometric Problems in Space-Conscious Models
(University of Waterloo, 2009-01-26)
When dealing with massive data sets, standard algorithms may easily ``run out of memory''. In this thesis, we design efficient algorithms in space-conscious models. In particular, in-place algorithms, multi-pass algorithms, ...
Efficient Evaluation of Set Expressions
(University of Waterloo, 2014-04-17)
In this thesis, we study the problem of evaluating set expressions over sorted sets in the comparison model. The problem arises in the context of evaluating search queries in text database systems; most text search engines ...
Resource-Efficient Communication in the Presence of Adversaries
(University of Waterloo, 2011-08-19)
This dissertation presents algorithms for achieving communication in the presence of adversarial attacks in large, decentralized, resource-constrained networks. We consider abstract single-hop communication settings where ...
Integrating Skips and Bitvectors for List Intersection
(University of Waterloo, 2014-11-20)
This thesis examines space-time optimizations of in-memory search engines. Search engines can answer queries quickly, but this is accomplished using significant resources in the form of multiple machines running concurrently. ...
Space Efficient Data Structures and Algorithms in the Word-RAM Model
(University of Waterloo, 2018-04-30)
In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement is an important research topic. One way ...