Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
162,376
Space-efficient algorithms for document retrieval
- IN PROC. CPM, VOLUME 4580 OF LNCS
, 2007
"... We study the Document Listing problem, where a collection D of documents d1,..., dk of total length � di = n is to be pre-i processed, so that one can later efficiently list all the ndoc documents containing a given query pattern P of length m as a substring. Muthukrishnan (SODA 2002) gave an opti ..."
Abstract
-
Cited by 45 (2 self)
- Add to MetaCart
We study the Document Listing problem, where a collection D of documents d1,..., dk of total length � di = n is to be pre-i processed, so that one can later efficiently list all the ndoc documents containing a given query pattern P of length m as a substring. Muthukrishnan (SODA 2002) gave
A space efficient algorithm for group structure computation
- Math. Comp
, 1998
"... Abstract. We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order. We estimate the computational complexity by counting the group operations such as multiplications and equality ..."
Abstract
-
Cited by 16 (3 self)
- Add to MetaCart
Abstract. We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order. We estimate the computational complexity by counting the group operations such as multiplications and equality
Sparse RNA folding: Time and space efficient algorithms
- IN: CPM
, 2009
"... The classical algorithm for RNA single strand folding requires O(nZ) time and O(n²) space, where n denotes the length of the input sequence and Z is a sparsity parameter which satisfies n ≤ Z ≤ n 2. We show how to reduce the space complexity of this algorithm. The space reduction is based on the o ..."
Abstract
-
Cited by 13 (7 self)
- Add to MetaCart
on the observation that some solutions for subproblems are not examined after a certain stage of the algorithm, and may be discarded from memory. This yields an O(nZ) time and O(Z) space algorithm, which outputs both the cardinality of the optimal folding as well as a corresponding secondary structure. The space-efficient
Space Efficient Algorithms for Series-Parallel Graphs
- IN 18TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS), NUMBER 2010 IN LECTURE NOTES IN COMPUTER SCIENCE
, 2001
"... The subclass of directed series-parallel graphs plays an important role in computer science. To determine whether a graph is series-parallel is a well studied problem in algorithmic graph theory. Fast sequential and parallel algorithms for this problem have been developed in a sequence of papers ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
of papers. For series-parallel graphs methods are also known to solve the reachability and the decomposition problem time efficiently. However, no dedicated results have been obtained for the space complexity of these problems -- the topic of this paper. For this special class of graphs, we develop
A space-efficient algorithm for segment intersection
- In Proc. 15th Canad. Conf. Comput. Geom
, 2003
"... We examine the space requirement for the classic linesegment intersection problem. Using so-called implicit data structures, we show how to make the standard sweep-line algorithm run in O((n + k) log 2 n) time with only O(log 2 n) extra space, where n is the number of line segments and k is the numb ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
We examine the space requirement for the classic linesegment intersection problem. Using so-called implicit data structures, we show how to make the standard sweep-line algorithm run in O((n + k) log 2 n) time with only O(log 2 n) extra space, where n is the number of line segments and k
Space-Efficient Algorithms for Klee’s Measure Problem
, 2005
"... We give space-efficient geometric algorithms for three related problems. Given a set of n axis-aligned rectangles in the plane, we calculate the area covered by the union of these rectangles (Klee’s measure problem) in O(n 3/2 log n) time with O(√n) extra space. If the input can be destroyed and the ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
We give space-efficient geometric algorithms for three related problems. Given a set of n axis-aligned rectangles in the plane, we calculate the area covered by the union of these rectangles (Klee’s measure problem) in O(n 3/2 log n) time with O(√n) extra space. If the input can be destroyed
Space efficient algorithms for directed series-parallel graphs
, 2002
"... The subclass of directed series-parallel graphs plays an important role in computer science. Whether a given graph is series-parallel is a well studied problem in algorithmic graph theory, for which fast sequential and parallel algorithms have been developed in a sequence of papers. Also methods are ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
are known to solve the reachability and the decomposition problem for series-parallel graphs time efficiently. However, no dedicated results have been obtained for the space complexity of these problems when restricted to series-parallel graphs – the topic of this paper. Deterministic algorithms
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
, 2010
"... We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source vertices embedded on a surface (orientable or non-orientable) of genus g = g(n). We give a log-space reduction that on in ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
of Savitch’s theorem on the reduced instance we get a deterministic O(log n + log 2 (m + g))-space algorithm for the reachability problem for graphs in G(m, g). By setting m and g to be 2O(√log n) we get that the reachability problem for directed acyclic graphs with 2O(√log n) O( sources embedded on surfaces
Space efficient algorithms for ordered tree comparison
- Proc. of 16th International Symposium of Algorithms and Computation (ISAAC), Lecture Notes in Computer Science
"... Abstract In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexity. We present new algorithms for computing the constrained ordered tree edit distance and the alignment of (ord ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexity. We present new algorithms for computing the constrained ordered tree edit distance and the alignment
Results 1 - 10
of
162,376
