Results 1  10
of
430
Functional Programming in Sublinear Space
"... Abstract. We consider the problem of functional programming with data in external memory, in particular as it appears in sublinear space computation. Writing programs with sublinear space usage often requires one to use special implementation techniques for otherwise easy tasks, e.g. one cannot comp ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Abstract. We consider the problem of functional programming with data in external memory, in particular as it appears in sublinear space computation. Writing programs with sublinear space usage often requires one to use special implementation techniques for otherwise easy tasks, e.g. one cannot
Longest Common Extensions in Sublinear Space
"... Abstract. The longest common extension problem (LCE problem) is to construct a data structure for an input string T of length n that supports LCE(i, j) queries. Such a query returns the length of the longest common prefix of the suffixes starting at positions i and j in T. This classic problem has a ..."
Abstract
 Add to MetaCart
a wellknown solution that uses O(n) space and O(1) query time. In this paper we show that for any tradeoff parameter 1 ≤ τ ≤ n, the problem can be solved in O(n τ) space and O(τ) query time. This significantly improves the previously best known timespace tradeoffs, and almost matches the best
Checking ValueSensitive Data Structures in Sublinear Space
, 2007
"... Checking valuesensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in combination with other techniques, a previous method for checking valueinsensitive data structures in log space can be e ..."
Abstract
 Add to MetaCart
Checking valuesensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in combination with other techniques, a previous method for checking valueinsensitive data structures in log space can
Type Inference for Sublinear Space Functional Programming
"... Abstract. We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming language with primitives that support the implementation of such algorithms. We have shown that IntML can express al ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
has a long tradition in complexity theory; it comprises in particular the complexity classes LOGSPACE and NLOGSPACE of algorithms with logarithmic space usage. By comparison, questions about the programming language aspects of these classes have received little study.
Sublinear Space Algorithms for the Longest Common Substring Problem
"... Abstract. Given m documents of total length n, we consider the problem of finding a longest string common to at least d ≥ 2 of the documents. This problem is known as the longest common substring (LCS) problem and has a classic O(n) space and O(n) time solution (Weiner [FOCS’73], Hui [CPM’92]). Ho ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Given m documents of total length n, we consider the problem of finding a longest string common to at least d ≥ 2 of the documents. This problem is known as the longest common substring (LCS) problem and has a classic O(n) space and O(n) time solution (Weiner [FOCS’73], Hui [CPM’92
RealTime String Matching in Sublinear Space
 IN CPM
, 2004
"... We study a problem of efficient utilisation of extra memory space in realtime string matching. We propose, for any constant " > 0, a realtime string matching algorithm claiming O(m ) extra space, where m is the size of a pattern. All ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study a problem of efficient utilisation of extra memory space in realtime string matching. We propose, for any constant " > 0, a realtime string matching algorithm claiming O(m ) extra space, where m is the size of a pattern. All
Some Observations on 1Inkdot Alternating MultiCounter Automata with Sublinear Space
, 2000
"... This paper investigates some fundamental properties of 2way alternating multicounter automata (2amca's) with only existential (universal) states which have sublinear space and 1 inkdot. It is shown that for any function ..."
Abstract
 Add to MetaCart
This paper investigates some fundamental properties of 2way alternating multicounter automata (2amca's) with only existential (universal) states which have sublinear space and 1 inkdot. It is shown that for any function
A Sublinear Space, Polynomial Time Algorithm for Directed st Connectivity
 IN PROCEEDINGS, STRUCTURE IN COMPLEXITY THEORY, SEVENTH ANNUAL CONFERENCE
, 1992
"... Directed st connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the first known deterministic sublinear space, polynomial time algorithm for directed st connectivity. For nvertex graphs, our algorithm can use as little as ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
Directed st connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the first known deterministic sublinear space, polynomial time algorithm for directed st connectivity. For nvertex graphs, our algorithm can use as little
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
, 2013
"... For a set of n points in IR d, and parameters k and ε, we present a data structure that answers (1 + ε, k)ANN queries in logarithmic time. Surprisingly, the space used by the datastructure is Õ(n/k); that is, the space used is sublinear in the input size if k is sufficiently large. Our approach pr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
For a set of n points in IR d, and parameters k and ε, we present a data structure that answers (1 + ε, k)ANN queries in logarithmic time. Surprisingly, the space used by the datastructure is Õ(n/k); that is, the space used is sublinear in the input size if k is sufficiently large. Our approach
Results 1  10
of
430