Optimal parallel generation of a computation tree form

DOI10.1145/3318.3478MaRDI QIDQ3678673zbMATH OpenOpenAlexFDO

Authors Ilan Bar-On, Uzi Vishkin

Publication date 1985

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toplas/1985-7/

zbMATH Keywords

computation binary tree representationparallel computationparallel random-access machine

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 4064466
• Rough Sets and Current Trends in Computing
• Tree-based parallel algorithm design
• scientific article; zbMATH DE number 3958748
• Optimal parallel suffix tree construction
• Optimal parallel suffix tree construction
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Parallel algorithms with optimal speedup for bounded treewidth
• An Optimal Parallel Algorithm for Formula Evaluation
• Uniform generation of binary trees in parallel

Cited in

(26)

• Optimal parallel parsing of bracket languages
• Parallel parsing of programming languages
• A new parallel algorithm for parsing arithmetic infix expressions
• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
• Parallel approximation algorithms for bin packing
• Parallel restructuring and evaluation of expressions
• Optimal parallel algorithms for forest and term matching
• Matching parentheses in parallel
• An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
• Almost fully-parallel parentheses matching
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
• The balanced binary tree technique on mesh-connected computers
• Evaluation of linear, quadratic and cubic expressions on a binary tree
• scientific article; zbMATH DE number 3854454 (Why is no real title available?)
• scientific article; zbMATH DE number 4139290 (Why is no real title available?)
• scientific article; zbMATH DE number 3958748 (Why is no real title available?)
• scientific article; zbMATH DE number 4064466 (Why is no real title available?)
• A note on generating finer‐grain parallelism in a representation tree
• Parallel recognition and ranking of context-free languages
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
• A note on the parallel complexity of anti-unification
• Parallel algorithms for merging and sorting
• Parallel computation of arithmetic expressions involving unary functions
• On optimal parallel computations for sequences of brackets
• Parallel general prefix computations with geometric, algebraic, and other applications

This page was built for publication: Optimal parallel generation of a computation tree form

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