Results 11 -
12 of
12
Algorithms for Transposition Invariant String Matching (Extended Abstract)
- Journal of Algorithms
, 2002
"... Given strings A and B over an alphabet Σ ⊆ U, where U is some numerical universe closed... ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
Given strings A and B over an alphabet Σ ⊆ U, where U is some numerical universe closed...
TWO-WAY CHAINING WITH REASSIGNMENT
"... Abstract. We present an algorithm for hashing ⌊ αn ⌋ elements into a table with n separate chains that requires O(1) deterministic worst-case insert time, and O(1) expected worst-case search time for constant α. We exploit the connection between two-way chaining and random graph theory in our techni ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Abstract. We present an algorithm for hashing ⌊ αn ⌋ elements into a table with n separate chains that requires O(1) deterministic worst-case insert time, and O(1) expected worst-case search time for constant α. We exploit the connection between two-way chaining and random graph theory in our techniques.
