Pages that link to "Item:Q4485190"

The following pages link to Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190):

Displaying 9 items.

• Finding dominators via disjoint set union (Q396673) (← links)
• Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
• The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
• Calculational derivation of pointer algorithms from tree operations (Q1283882) (← links)
• The nearest common ancestor in a dynamic tree (Q1821561) (← links)
• The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
• Fast Algorithms for Finding Nearest Common Ancestors (Q3319776) (← links)
• A Data Structure for Nearest Common Ancestors with Linking (Q4554935) (← links)
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)