Optimal parallel generation of a computation tree form
DOI10.1145/3318.3478zbMATH Open0564.68037OpenAlexW1981796679MaRDI QIDQ3678673FDOQ3678673
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/
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) Algorithms in computer science (68W99) Theory of operating systems (68N25)
Cited In (25)
- 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
- A new parallel algorithm for parsing arithmetic infix expressions
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
- Optimal parallel algorithms for forest and term matching
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- The balanced binary tree technique on mesh-connected computers
- Title not available (Why is that?)
- Parallel recognition and ranking of context-free languages
- Parallel approximation algorithms for bin packing
- Parallel parsing of programming languages
- Title not available (Why is that?)
- Almost fully-parallel parentheses matching
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- Parallel restructuring and evaluation of expressions
- Title not available (Why is that?)
- Parallel general prefix computations with geometric, algebraic, and other applications
- Title not available (Why is that?)
- Matching parentheses in parallel
- A note on generating finer‐grain parallelism in a representation tree
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
- On optimal parallel computations for sequences of brackets
- Evaluation of linear, quadratic and cubic expressions on a binary tree
- Optimal parallel parsing of bracket languages
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)
