By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kosaraju, S.R. ; Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA ; Delcher, A.L.

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(N2 log N)-size circuit for this problem was described. The size is reduced 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

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990