An optimal parallel algorithm for arithmetic expression parsing

W. Deng, S. S. Iyengar · 2003

The paper discusses an optimal parallel algorithm for tree form generation of arithmetic expressions on an SIMD-SM EREW model. The main idea is how to avoid the read conflict posted by Bar-On and Vishkin's algorithm (1985) by modifying their parenthesis pairing algorithm.>

Read the paper · More papers on PaperTik