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

S. Rao Kosaraju, Arthur L. Delcher

Research output: Contribution to journalArticle

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 1991

Fingerprint

Networks (circuits)

ASJC Scopus subject areas

  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Cite this

A tree-partitioning technique with applications to expression evaluation and term matching. / Kosaraju, S. Rao; Delcher, Arthur L.

In: IEEE Transactions on Industry Applications, Vol. 27, No. 1 pt 1, 01.1991, p. 163-172.

Research output: Contribution to journalArticle

Kosaraju, S. Rao ; Delcher, Arthur L. / A tree-partitioning technique with applications to expression evaluation and term matching. In: IEEE Transactions on Industry Applications. 1991 ; Vol. 27, No. 1 pt 1. pp. 163-172.
@article{f26b14a83c0f4f12a03fd7fe8f88324a,
title = "A tree-partitioning technique with applications to expression evaluation and term matching",
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.",
author = "Kosaraju, {S. Rao} and Delcher, {Arthur L.}",
year = "1991",
month = "1",
language = "English (US)",
volume = "27",
pages = "163--172",
journal = "IEEE Transactions on Industry Applications",
issn = "0093-9994",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1 pt 1",

}

TY - JOUR

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

AU - Kosaraju, S. Rao

AU - Delcher, Arthur L.

PY - 1991/1

Y1 - 1991/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025839537&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025839537&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0025839537

VL - 27

SP - 163

EP - 172

JO - IEEE Transactions on Industry Applications

JF - IEEE Transactions on Industry Applications

SN - 0093-9994

IS - 1 pt 1

ER -