This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

The subject of this dissertation is the construction of two taxonomies and a toolkit of
algorithms solving two different but closely related problems from the domain of regular tree …

Vulnerability signatures offer better precision and flexibility than exploit signatures when
detecting network attacks. We show that it is possible to detect vulnerability signatures in …

This thesis is submitted in partial fulfillment of the requirements for the degree of Doctor of
Philosophy (Ph. D) in the FASTAR group of the Department of Computer Science, University …

Software variants of a Software Product Line (SPL) consist of a set of artifacts specified by
features. Variability models document the valid relationships between features and their …

A factor oracle is a data structure for weak factor recognition. It is an automaton built on a
string p of length m that is acyclic, recognizes at least all factors of p, has m+ 1 states which …

A new taxonomy of sublinear (multiple) keyword pattern matching algorithms is presented.
Based on an earlier taxonomy by the second and third authors, this new taxonomy includes …

We discuss TABASCO, a method for constructing Domain-Specific Toolkits (DSTs). We
present TABASCO in the context of domain engineering and generative programming. We …

Earlier publications provided an abstract specification of a family of single keyword pattern
matching algorithms 18 which search unexamined portions of the text in a divide-and …

This work introduces a new multi-pattern matching algorithm that performs searching of fixed-
length strings on text files very fast by benefiting from bit-parallelism. The algorithm is given …