69 citations · 153 across the 16 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DS2009★ 8 cited
The Euler Path to Static Level-Ancestors
Amir M. Ben-Amram
Suppose that a rooted tree T is given for preprocessing. The Level-Ancestor Problem is to answer quickly queries of the following form. Given a vertex v and an integer i > 0, find…
cs.LO2009★ 12 cited
Ranking Functions for Size-Change Termination II
Amir M. Ben-Amram, Chin Soon Lee
Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program…