SIGCOMM
Also, see our PODC'22 paper for a deeper theoretical exploration of dcPIM.
STOC
Also, see our NSDI'19 paper that motivated this work.
PODC
Also, see our SIGCOMM'22 paper that motivated this work.
HotNets
Also, see our SIGCOMM'21 paper that motivated this work.
NSDI
Also, see our STOC'22 paper for a deeper theoretical exploration of latency-throughput tradeoff in reconfigurable circuit-switched networks.
NSDI
The first distributed data store to provide a smooth and dynamic tradeoff between storage and performance (applications can increase the storage for individual shards to increase throughput for that shard, or vice versa). Builds on top of Succinct and supports the same functionality, API and abstractions (unstructured data, key-value stores, document stores, tables) as Succinct. Efficiently handles spatially and temporally skewed workloads without any prior knowledge of the workload.
HotNets (Obsolete; see the more recent NSDI'16 version.)
ESA (Also as an invited talk at ISMP'12, session on combinatorial optimization)
Conditionally settles the space-stretch-time tradeoff for distance oracles with super-constant query time. Even a small improvement in the query time of the presented oracles will lead to a faster combinatorial algorithm for Boolean Matrix Multiplication, a long standing open problem.
PhD Thesis, UIUC
The links to papers are provided for quick dissemination of research work. The copyright is either with the publishing societies (IEEE, ACM, etc.) or with the Author(s).