5 citations · 6 across the 3 of their papers we have counts for
6 papers
External-memory dictionaries with worst-case update cost
Rathish Das, John Iacono, Yakov Nekrich
The -tree [Brodal and Fagerberg 2003] is a simple I/O-efficient external-memory-model data structure that supports updates orders of magnitude faster than B-tree with a query…
Shortest Beer Path Queries in Interval Graphs
Rathish Das, Meng He, Eitan Kondratovsky +3
Our interest is in paths between pairs of vertices that go through at least one of a subset of the vertices known as beer vertices. Such a path is called a beer path, and the beer…
Fast Stencil Computations using Fast Fourier Transforms
Zafar Ahmad, Rezaul Chowdhury, Rathish Das +3
Stencil computations are widely used to simulate the change of state of physical systems across a multidimensional grid over multiple timesteps. The state-of-the-art techniques in…
Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics
Zafar Ahmad, Rezaul Chowdhury, Rathish Das +3
The binary-forking model is a parallel computation model, formally defined by Blelloch et al. very recently, in which a thread can fork a concurrent child thread, recursively and a…
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization
Esther M. Arkin, Rathish Das, Jie Gao +4
Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are conside…
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths
Rathish Das, Shih-Yu Tsai, Sharmila Duppala +5
A determinacy race occurs if two or more logically parallel instructions access the same memory location and at least one of them tries to modify its content. Races often lead to n…