On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4096795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Finding Lowest Common Ancestors: Simplification and Parallelization |
scientific article; zbMATH DE number 4096795 |
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
0.9670252
0 references
0.92757297
0 references
0.9006971
0 references
0.8958385
0 references
0.89453083
0 references
0.89358795
0 references
0.8917338
0 references
