6 citations · 12 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2008★ 1 cited
Optimum Binary Search Trees on the Hierarchical Memory Model
Shripad Thite
The Hierarchical Memory Model (HMM) of computation is similar to the standard Random Access Machine (RAM) model except that the HMM has a non-uniform memory organized in a hierarch…
cs.DS2008★ 1 cited
Cache-Oblivious Selection in Sorted X+Y Matrices
Mark de Berg, Shripad Thite
Let X[0..n-1] and Y[0..m-1] be two sorted arrays, and define the mxn matrix A by A[j][i]=X[i]+Y[j]. Frederickson and Johnson gave an efficient algorithm for selecting the k-th smal…