On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56563676, #quickstatements; #temporary_batch_1705957399925 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0217079 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046946959 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Finding Lowest Common Ancestors: Simplification and Parallelization |
scientific article |
Statements
On Finding Lowest Common Ancestors: Simplification and Parallelization (English)
0 references
1988
0 references
lowest common ancestor problem
0 references
parallel algorithms
0 references
free algorithms
0 references
