Results 1 
2 of
2
Derivation of a Parallel String Matching Algorithm
 Information Processing Letters
, 2001
"... We derive an ecient parallel algorithm to nd all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [2, 3] is central ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We derive an ecient parallel algorithm to nd all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [2, 3] is central to the development of the algorithm and its algebraic manipulations. 1
GeneratingFunctions of Interconnection Networks
, 2000
"... Generating functions have long been used to analyze properties of sequences of numbers. In this note, we use generating functions to analyze a class of combinatorial objects, called interconnection networks. In particular, we prove that two families of interconnection networks are isomorphic by show ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Generating functions have long been used to analyze properties of sequences of numbers. In this note, we use generating functions to analyze a class of combinatorial objects, called interconnection networks. In particular, we prove that two families of interconnection networks are isomorphic by showing that the corresponding generating functions are isomorphic. 1