7 citations · 22 across the 8 of their papers we have counts for
8 papers
Efficient Spacetime Meshing with Nonlocal Cone Constraints
Shripad Thite
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of the…
Spacetime Meshing for Discontinuous Galerkin Methods
Shripad Thite
Spacetime discontinuous Galerkin (SDG) finite element methods are used to solve such PDEs involving space and time variables arising from wave propagation phenomena in important ap…
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…
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…
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Shripad Thite
Let S = <s_1, s_2, s_3, ..., s_n> be a given vector of n real numbers. The rank of a real z with respect to S is defined as the number of elements s_i in S such that s_i is less th…
On Covering a Graph Optimally with Induced Subgraphs
Shripad Thite
We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness…