@inproceedings{972fcca58ec741fcb47d100498daed98,

title = "Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses",

abstract = "Parallel parenthesis-matching algorithm has in the past been used to design parallel algorithms for generation of computation tree forms and parsing. In this paper we present a parallel parenthesis-matching algorithm. A variant of binary search tree is constructed in parallel. The search tree is used to find the matching of each parenthesis. The algorithm takes O(log n) time on a (n / log n)-processor CREW-PRAM. We also present an O(log n)-time parallel algorithm for generation of random sequences of parentheses. These two algorithms can be used to design an O(log n)-time parallel algorithm for generation of a class of random permutations.",

author = "Dilip Sarkar and Narsingh Deo",

year = "1988",

month = jan,

day = "1",

doi = "10.1007/3-540-18991-2_57",

language = "English (US)",

isbn = "9783540189916",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "970--984",

editor = "Papatheodorou, {Theodore S.} and Polychronopoulos, {Constantine D.} and Houstis, {Elias N.}",

booktitle = "Supercomputing - 1st International Conference, Proceedings",

address = "Germany",

note = "1st International Conference on Supercomputing, 1987 ; Conference date: 08-06-1987 Through 12-06-1987",

}