Affiliation:
1. Courant Institute of Mathematical Sciences
2. Tel Aviv Univ., Tel Aviv, Israel
Abstract
Given a general arithmetic expression, we find a computation binary tree representation in
O
(log
n
) time using
n
/log
n
processors on a concurrent-read, exclusive-write, parallel random-access machine.
A new algorithm is introduced for this purpose. Unlike previous serial and parallel solutions, it is not based on using a stack.
Publisher
Association for Computing Machinery (ACM)
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献