The problem of pattern matching with scaling is defined. The input for the two-dimensional
version of the problem consists of an n× n “text” matrix and an m× m “pattern” matrix. We …

Finding all occurrences of a non-rectangular pattern of height m and area a in an n× n text
with no more than k mismatch, insertion, and deletion errors is an important problem in …

We give an alphabet-independent deterministic parallel algorithm for finding all occurrences
of a pattern array of size mh x mw in a text array of size nh x nw in the concurrent-read …

Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal
speedup on a CRCW PRAM. It runs in time O (logn) using n/log n processors. This algorithm …

In this paper we present an algorithm for matching two polygonal arcs. We first show how to
match two arcs of the same length by decomposition into pairs of equal length line …

Most known two-dimensional matching algorithms have a rectangular text (image) and
rectangular pattern (template) as their input. These matching algorithms perform a row by …

The computation and communication costs of many secure multiparty protocols would
benefit from a preprocessing that replaces large inputs with much smaller values without …

Dados um texto e um padrão, o problema de busca de padrões em textos consiste em
determinar as posições do texto onde existe uma ocorrência do padrão. Quando o texto e …

Multiparty computation refers to a scenario in which multiple distinct yet connected parties
aim to jointly compute a functionality. Over recent decades, with the rapid spread of the …

The study and comparison of strings of symbols from a (possibly very large) alphabet is
relevant to various areas of computer science. In particular, the problem of finding all …