Matching parentheses in parallel

DOI10.1016/0166-218X(92)90011-XzbMath0774.68052MaRDI QIDQ1208458

Christos Levcopoulos, Ola Petersson

Publication date: 16 May 1993

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

zbMATH Keywords

EREW PRAMarithmetic expression evaluationparenthesis matching

Mathematics Subject Classification ID

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

Related Items (1)

Optimal parallel algorithms for rectilinear link-distance problems

Cites Work

• Parallel approximation algorithms for bin packing
• Parallel Generation of Postfix and Tree Forms
• Optimal parallel generation of a computation tree form
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Parallel Merge Sort
• Parallel Prefix Computation
• Optimal bounds for decision problems on the CRCW PRAM
• A simple parallel tree contraction algorithm
• Unnamed Item

This page was built for publication: Matching parentheses in parallel