scientific article; zbMATH DE number 4011928

MaRDI QIDQ3761691zbMATH OpenFDO

Authors A. Gibbons, Wojciech Rytter

Publication date 1986

zbMATH Keywords

algebraic expressionsdeterministic parallel algorithmparallel random access machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(13)

• Optimal parallel parsing of bracket languages
• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
• On efficient parallel computations for some dynamic programming problems
• Parallel restructuring and evaluation of expressions
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
• A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
• A parallel algorithm for the minimization of finite state automata
• Optimal parallel colouring algorithms for totally decomposable graphs
• Balancing Expression Dags for More Efficient Lazy Adaptive Evaluation
• ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
• How to draw a series-parallel digraph
• Parallel recognition of complement reducible graphs and cotree construction

This page was built for publication:

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