5 citations · 6 across the 3 of their papers we have counts for
5 papers · 1 filter
An Associativity Threshold Phenomenon in Set-Associative Caches
Michael A. Bender, Rathish Das, Martín Farach-Colton +1
In an -way set-associative cache, the cache is partitioned into disjoint sets of size , and each item can only be cached in one set, typically selected via a hash function. S…
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…