9 citations · 10 across the 18 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication
Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen
The conjectured hardness of Boolean matrix-vector multiplication has been used with great success to prove conditional lower bounds for numerous important data structure problems,…
cs.DS2017
Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path
Diptarka Chakraborty, Debarati Das
In this paper we address the problem of computing a sparse subgraph of a weighted directed graph such that the exact distances from a designated source vertex to all other vertices…