Some fast parallel algorithms for parentheses matching (original) (raw)

paper cover icon

Some fast parallel algorithms for parentheses matching

Lecture Notes in Computer Science, 1991

Calvin ChenCalvin Chen

Abstract

The parentheses matching problem is to determine the mate of each parenthesis in a balanced string of n parentheses. In this paper, we present three novel and elegant parallel algorithms for this problem on parallel random-access machine (PRAM) models. Each of ...

Calvin Chen hasn't uploaded this paper.

Let Calvin know you want this paper to be uploaded.

Ask for this paper to be uploaded.