• Alphabet Dependence in Parameterized Matching 

      Amir, Amihood; Farach-Colton, Martin; Muthukrishnan, S. (Georgia Institute of Technology, 1993)
      The classical pattern matching paradigm is that of seeking occurrences of one string in another, where both strings are drawn from an alphabet set ∑. A recently introduced model is that of parameterized pattern matching; ...
    • FA{S,T}ER Scaled Matching 

      Amir, Amihood; Calinescu, Gruia (Georgia Institute of Technology, 1993)
      The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matching, finding ...
    • The Truth, the Whole Truth, and Nothing but the Truth: Alphabet Independent Two Dimensional Witness Table Construction 

      Amir, Amihood; Benson, Gary; Farach-Colton, Martin (Georgia Institute of Technology, 1993)
      The current explosion of stored information necessitates a new model of pattern matching, that of compressed matching. In this model one tries to find all occurrences of a pattern in a compressed text in time proportional ...