Compressed Suffix Trees with Full Functionality.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 4, p. 589, doi. 10.1007/s00224-006-1198-x
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2007 AND VI 41 AND IP 4
Results: 7
1
2
The Hardness of Approximating Spanner Problems.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 4, p. 691, doi. 10.1007/s00224-006-1266-2
- By:
- Publication type:
- Article
3
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 4, p. 753, doi. 10.1007/s00224-006-1301-3
- By:
- Publication type:
- Article
4
Formal Efficiency Analysis for Tree Transducer Composition.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 4, p. 619, doi. 10.1007/s00224-006-1235-9
- By:
- Publication type:
- Article
5
The Convergence of Realistic Distributed Load-Balancing Algorithms.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 4, p. 609, doi. 10.1007/s00224-006-1214-1
- By:
- Publication type:
- Article
6
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 4, p. 731, doi. 10.1007/s00224-006-1296-9
- By:
- Publication type:
- Article
7
Bounded-Diameter Minimum-Cost Graph Problems.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 4, p. 779, doi. 10.1007/s00224-006-1305-z
- By:
- Publication type:
- Article