Given a string S, the compressed indexing problem is to preprocess S into a compressed representation that supports fast substring queries. The goal is to use little space relative to the compressed size of S while supporting fast queries. We present a compressed index based on the Lempel–Ziv 1977 compression scheme. We obtain the following time-space trade-offs: For constant-sized alphabets (i...

In the limited-workspace model, we assume that the input of size n lies in a random access read-only memory. The output has to be reported sequentially, and it cannot be accessed or modified. In addition, there is a read-write workspace of O(s) words, where s ∈ {1, . . . , n} is a given parameter. In a time-space trade-off, we are interested in how the running time of an algorithm improves as s...

Some studies have found that prospective memory (PM) cues which are emotionally valenced influence age effects in prospective remembering, but it remains unclear whether this effect reflects the operation of processes implemented at encoding or retrieval. In addition, none of the prior ageing studies of valence on PM function have examined potential costs of engaging in different valence condit...

We address the trade-off between the computational resources needed to process a large data set and the number of samples available from the data set. Specifically, we consider the following abstraction: we receive a potentially infinite stream of IID samples from some unknown distribution D, and are tasked with computing some function f(D). If the stream is observed for time t, how much memory...

Theories of the evolution of niche breadth usually depend on the assumption that genotypes that are well adapted to exploit one habitat or resource are not well adapted to others. Such ‘‘trade-offs’’ are often apparent in interspecific comparisons, but have been harder to document at the within-population level. Selection experiments provide a promising means for detecting within-population tra...

We take a first step towards a rigorous asymptotic analysis of graph-based approaches for finding (approximate) nearest neighbors in high-dimensional spaces, by analyzing the complexity of (randomized) greedy walks on the approximate near neighbor graph. For random data sets of size n = 2o(d) on the d-dimensional Euclidean unit sphere, using near neighbor graphs we can provably solve the approx...

Life-history theory is fundamental to understanding how animals allocate resources among survival, development, and reproduction, and among traits within these categories. Immediate trade-offs occur within a short span of time and, therefore, are more easily detected. Trade-offs, however, can also manifest across stages of the life cycle, a phenomenon known as carryover effects. We investigated...

Let S be a planar n-point set. A triangulation for S is a maximal plane straight-line graph with vertex set S. The Voronoi diagram for S is the subdivision of the plane into cells such that each cell has the same nearest neighbors in S. Classically, both structures can be computed in O(n logn) time and O(n) space. We study the situation when the available workspace is limited: given a parameter...

Let P be a planar n-point set in general position. For k ∈ {1, . . . , n − 1}, the Voronoi diagram of order k is obtained by subdividing the plane into regions such that points in the same cell have the same set of nearest k neighbors in P . The (nearest point) Voronoi diagram (NVD) and the farthest point Voronoi diagram (FVD) are the particular cases of k = 1 and k = n − 1, respectively. It is...

Internet transmission and switching facilities are partitioned into different administrative domains. To effect data exchange between domains, domain border routers usually establish pairwise peering sessions and exchange routes at exchange points. At some exchangepoints, border routers peer with a Route Server instead. The Route Server computes a set of routes on behalf of each of its client b...