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 NC1, and an O(log N)-depth, O(N2log N)-size circuit for this problem was described. The size is reduced here to O(N logk 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, N2-processor algorithm, is also presented.
ASJC Scopus subject areas
- Control and Systems Engineering
- Industrial and Manufacturing Engineering
- Electrical and Electronic Engineering