scientific article
From MaRDI portal
Publication:3700838
zbMath0578.68041MaRDI QIDQ3700838
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel algorithmspath systemspebble game on directed acyclic graphssimulation of two-way pushdown automata and recursive programs
Related Items
Fast parallel recognition of LR language suffixes ⋮ Optimal parallel parsing of bracket languages ⋮ On the complexity of parallel parsing of general context-free languages ⋮ Parallel time O(log n) recognition of unambiguous context-free languages ⋮ On efficient parallel computations for some dynamic programming problems ⋮ Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition ⋮ Parallel recognition and ranking of context-free languages ⋮ Parallel parsing of tree adjoining grammars on the connection machine ⋮ An NC algorithm for recognizing tree adjoining languages ⋮ A sublinear parallel algorithm for some dynamic programming problems ⋮ Parallel algorithms for a class of graphs generated recursively ⋮ An efficient all-parses systolic algorithm for general context-free parsing ⋮ Optimal parallel algorithms for dynamic expression evaluation and context-free recognition ⋮ On efficient parallel computations of costs of paths on a grid graph ⋮ On the parallel recognition of unambiguous context-free languages ⋮ On the complexity of the recognition of parallel 2D-image languages