A tree-partitioning technique with applications to expression evaluation and term matching

A tree-partitioning technique is proposed and applied to expression evaluation and term matching. It was shown recently that the problem of evaluating an arithmetic expression is in NC¹, and an O(log N)-depth, O(N² log N)-size circuit for this problem was described. The size is reduced to O(N log^k N) while O (log N) depth is maintained. An O(log N)-time, O(N)-processor CREW (concurrent read, exclusive write) algorithm for term matching, which improves the previous O(log N)-time, N²-processor algorithm, is also presented