Sciweavers

8431 search results - page 107 / 1687
» Algorithmically Independent Sequences
Sort
View
WADS
1999
Springer
88views Algorithms» more  WADS 1999»
15 years 2 months ago
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences
Michael T. Goodrich, John G. Kloss II
SODA
1994
ACM
61views Algorithms» more  SODA 1994»
14 years 11 months ago
Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time
Kurt Mehlhorn, R. Sundar, Christian Uhrig
BMCBI
2006
100views more  BMCBI 2006»
14 years 10 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
LATIN
2004
Springer
15 years 3 months ago
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...