Thumbnail
Access Restriction
Subscribed

Author Atallah, Mikhail J. ♦ Goodrich, Michael T. ♦ Kosaraju, S. Rao
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Divide-and-conquer ♦ Off-line evaluation ♦ Parallel computation ♦ Parallel data structures
Abstract Given an off-line sequence $\textit{S}$ of $\textit{n}$ set-manipulation operations, we investigate the parallel complexity of evaluating $\textit{S}$ (i.e., finding the response to every operation in $\textit{S}$ and returning the resulting set). We show that the problem of evaluating $\textit{S}$ is in $\textit{NC}$ for various combinations of common set-manipulation operations. Once we establish membership in $\textit{NC}$ (or, if membership in $\textit{NC}$ is obvious), we develop techniques for improving the time and/or processor complexity.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-11-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 6
Page Count 40
Starting Page 1049
Ending Page 1088


Open content in new tab

   Open content in new tab
Source: ACM Digital Library