Matching parentheses in parallel

DOI10.1016/0166-218X(92)90011-XMaRDI QIDQ1208458zbMATH OpenFDO

Authors Christos Levcopoulos, Ola Petersson

Publication date 16 May 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(92)90011-X

zbMATH Keywords

EREW PRAMarithmetic expression evaluationparenthesis matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Almost fully-parallel parentheses matching
• Publication:4206401
• On optimal parallel computations for sequences of brackets
• scientific article; zbMATH DE number 1979509
• Optimal parallel generation of a computation tree form

Cites work

• scientific article; zbMATH DE number 4126700 (Why is no real title available?)
• A simple parallel tree contraction algorithm
• Optimal bounds for decision problems on the CRCW PRAM
• Optimal parallel generation of a computation tree form
• Parallel Generation of Postfix and Tree Forms
• Parallel Merge Sort
• Parallel Prefix Computation
• Parallel approximation algorithms for bin packing
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Cited in

(5)

• scientific article; zbMATH DE number 1979509 (Why is no real title available?)
• Almost fully-parallel parentheses matching
• scientific article; zbMATH DE number 4126700 (Why is no real title available?)
• Optimal parallel algorithms for rectilinear link-distance problems
• A Linear Parsing Algorithm For Parenthesis Terms

This page was built for publication: Matching parentheses in parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208458)