Algorithms for Search Trees on Message-passing Architectures
| dc.contributor.author | Colbrook, Adrian | en_US |
| dc.contributor.author | Brewer, Eric A. | en_US |
| dc.contributor.author | Dellarocas, Chrysanthos N. | en_US |
| dc.contributor.author | Weihl, William E. | en_US |
| dc.date.accessioned | 2023-03-29T15:18:14Z | |
| dc.date.available | 2023-03-29T15:18:14Z | |
| dc.date.issued | 1991-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149713 | |
| dc.description.abstract | In this paper we describe a new algorithm for maintaining a balanced search tree on a message-passing MIMD architecture; the algorithm is particularly well suited for implementation on a small number of processors. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-517 | |
| dc.title | Algorithms for Search Trees on Message-passing Architectures | en_US |
| dc.identifier.oclc | 24639803 |
