23 citations · 145 across the 28 of their papers we have counts for
34 papers
Optimal compression with quantum retrieval
Shyam Dhamapurkar, Mohit Garg, Manaswi Paraashar +1
We consider the following data compression problem. Given a string of Hamming weight at most , compress it into a shorter string so that any…
Coupled dynamical phase transitions in driven disk packings
Akash Ghosh, Jaikumar Radhakrishnan, Paul M. Chaikin +2
Under the influence of oscillatory shear, a mono-layer of frictional granular disks exhibits two dynamical phase transitions: a transition from an initially disordered state to an…
Set membership with two classical and quantum bit probes
Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan
We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is…
Generalized Parametric Path Problems
Prerona Chatterjee, Kshitij Gajjar, Jaikumar Radhakrishnan +1
Parametric path problems arise independently in diverse domains, ranging from transportation to finance, where they are studied under various assumptions. We formulate a general pa…
Parametric Shortest Paths in Planar Graphs
Kshitij Gajjar, Jaikumar Radhakrishnan
We construct a family of planar graphs , where has vertices including a source vertex and a sink vertex , and edge weights that change linearly…
Minimizing Branching Vertices in Distance-preserving Subgraphs
Kshitij Gajjar, Jaikumar Radhakrishnan
It is -hard to determine the minimum number of branching vertices needed in a single-source distance-preserving subgraph of an undirected graph. We show that this prob…