16 citations · 18 across the 3 of their papers we have counts for
3 papers
cs.CC2017★ 16 cited
Barriers for Rank Methods in Arithmetic Complexity
Klim Efremenko, Ankit Garg, Rafael Oliveira +1
Arithmetic complexity is considered simpler to understand than Boolean complexity, namely computing Boolean functions via logical gates. And indeed, we seem to have significantly m…
cs.OS2017★ 2 cited
Adapting the DMTCP Plugin Model for Checkpointing of Hardware Emulation
Rohan Garg, Kapil Arya, Jiajun Cao +5
Checkpoint-restart is now a mature technology. It allows a user to save and later restore the state of a running process. The new plugin model for the upcoming version 3.0 of DMTCP…
cs.CC2015
Near-optimal bounds on bounded-round quantum communication complexity of disjointness
Mark Braverman, Ankit Garg, Young Kun Ko +2
We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with rounds, we prove a lower bound of $\…