On optimal parallel computations for sequences of brackets

DOI10.1016/0304-3975(91)90326-WzbMATH Open0732.68046MaRDI QIDQ808700FDOQ808700

Authors: Krzysztof Diks, Wojciech Rytter 

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Publication:4206401
• Matching parentheses in parallel
• Optimal parallel parsing of bracket languages
• Almost fully-parallel parentheses matching
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition

zbMATH Keywords

parallel algorithmCREW PRAMEREW PRAMparallel computationsparallel access machine

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Parallel Evaluation of General Arithmetic Expressions
• A simple parallel tree contraction algorithm
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• Optimal parallel generation of a computation tree form
• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
• Optimal parallel parsing of bracket languages
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• A new parallel algorithm for parsing arithmetic infix expressions
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• Title not available (Why is that?)
• Parallel recognition and ranking of context-free languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching parentheses in parallel
• Optimal parallel parsing of bracket languages

This page was built for publication: On optimal parallel computations for sequences of brackets

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