Optimal parallel generation of a computation tree form

DOI10.1145/3318.3478zbMath0564.68037OpenAlexW1981796679MaRDI QIDQ3678673

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

parallel computationparallel random-access machinecomputation binary tree representation

Mathematics Subject Classification ID

Related Items (18)

Optimal parallel parsing of bracket languages ⋮ Almost fully-parallel parentheses matching ⋮ Parallel parsing of programming languages ⋮ The balanced binary tree technique on mesh-connected computers ⋮ The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time ⋮ Parallel approximation algorithms for bin packing ⋮ Parallel recognition and ranking of context-free languages ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ Parallel restructuring and evaluation of expressions ⋮ Optimal parallel algorithms for forest and term matching ⋮ Parallel algorithms for separation of two sets of points and recognition of digital convex polygons ⋮ A note on the parallel complexity of anti-unification ⋮ Matching parentheses in parallel ⋮ Parallel algorithms for merging and sorting ⋮ Optimal parallel algorithms for dynamic expression evaluation and context-free recognition ⋮ A note on optimal parallel transformations of regular expressions to nondeterministic finite automata ⋮ An optimal parallel algorithm to convert a regular expression into its Glushkov automaton ⋮ On optimal parallel computations for sequences of brackets

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