Go to main content

PDF

Description

A scheme for maintaining a balanced search tree on O(lg N) parallel processors is described. O(lg N) search, insert, and delete operations are allowed to run concurrently, with each operation executing in O(lg N) timesteps. The scheme is based on pipelined versions of top-down 2-3-4 tree manipulation algorithms.

Details

Files

Statistics

from
to
Export
Download Full History
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS