Shripad Thite
California Institute of Technology
33 Papers
202 Citations
Shripad Thite is an academic researcher from California Institute of Technology. The author has contributed to research in topics: Discontinuous Galerkin method & Spacetime. The author has an hindex of 11, co-authored 33 publications. Previous affiliations of Shripad Thite include Google & University of Illinois at Urbana–Champaign.
Chat about Author
Papers
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks
TL;DR: This work is the first attempt at characterizing an important "maximum" measure of wireless network capacity, and can be used to shed light on previous topology formation protocols like Span and GAF that attempt to produce "good" or "capacity-preserving" topologies, while allowing nodes to alternate between sleep and awake states.
195
Strong edge coloring for channel assignment in wireless radio networks
Christopher L. Barrett,Gabriel Istrate,V.S.A. Kumar,Madhav V. Marathe,Shripad Thite,Sunil Thulasidasan +5 more
- 13 Mar 2006
TL;DR: Efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks are given that are equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network.
An h-adaptive spacetime-discontinuous Galerkin method for linear elastodynamics
TL;DR: An h-adaptive version of the spacetime-discontinuous Galerkin (SDG) finite element method for linearized elastodynamics, which inherits key properties of the basic SDG formulation, including element-wise balance of linear and angular momentum, complexity that is linear in the number of elements and oscillationfree shock capturing.
65
Capturing a Convex Object With Three Discs
TL;DR: This paper characterize the set of positions of a third robot, the so-called capture region, that prevent P from escaping to infinity via continuous rigid motion, and shows that the computation of the capture region reduces to a visibility problem.
51
Walking your dog in the woods in polynomial time
Erin Wolf Chambers,Éric Colin de Verdière,Jeff Erickson,Sylvain Lazard,Francis Lazarus,Shripad Thite +5 more
- 09 Jun 2008
TL;DR: A polynomial-time algorithm is described to compute the homotopic Fréchet distance between two given polygonal curves in the plane minus a given set of obstacles, which are either points or polygons.