Pages that link to "Item:Q1195156"
From MaRDI portal
The following pages link to A fast cost-optimal parallel algorithm for the lowest common ancestor problem (Q1195156):
Displaying 8 items.
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- The level ancestor problem simplified (Q596133) (← links)
- Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (Q1183475) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- Fast smallest lowest common ancestor computation based on stable match (Q2434584) (← links)
- A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree (Q2923974) (← links)
- On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152) (← links)
- Parallel dynamic lowest common ancestors (Q5054770) (← links)