query about paper

[vimalk78]

hi,

I am referring to the paper at the following link : https://www.ics.uci.edu/~eppstein/261/BenFar-LCA-00.pdf

i had two queries about the paper in the section 3 "A Faseter RMQ Algorithm"

1. missing indexing into array A. should it be M[i,j] = M[i,j-1] if A[M[i,j-1]] <= A[M[i+2^(j-1)-1,j-1]]
2. does the i+2^(j-1)-1 index implies an overlap between previously computed ranges? will the below not work? M[i,j] = M[i,j-1] if A[M[i,j-1]] <= A[M[i+2^(j-1),j-1]]

thanks,

[leifwalsh]

Regarding #1, I think you're right. You may want to email the authors.

Regarding #2, I'm not absolutely sure, a worked example might help. You might be right but I'm not 100% sure.