Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (Q1183475): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127498852, #quickstatements; #temporary_batch_1722266931810 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90082-s / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023588769 / rank | |||
Normal rank | |||
Latest revision as of 12:02, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses |
scientific article |
Statements
Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (English)
0 references
28 June 1992
0 references
list ranking
0 references
lowest common ancestors
0 references
tree
0 references
reconfigurable buses
0 references
