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

S. Rao Kosaraju, Arthur L. Delcher

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)163-172
Number of pages10
JournalIEEE Transactions on Industry Applications
Volume27
Issue number1 pt 1
StatePublished - Jan 1 1991
Event1989 Industry Applications Society Annual Meeting - San Diego, CA, USA
Duration: Oct 1 1989Oct 5 1989

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A tree-partitioning technique with applications to expression evaluation and term matching'. Together they form a unique fingerprint.

Cite this