3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.CC2012★ 3 cited
Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming
Amit Chakrabarti, Ranganath Kondapally, Zhenghui Wang
Three decades of research in communication complexity have led to the invention of a number of techniques to lower bound randomized communication complexity. The majority of these…
cs.DM2012
When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks
Amit Chakrabarti, Lisa Fleischer, Christophe Weibel
Let be a supply graph and a demand graph defined on the same set of vertices. An assignment of capacities to the edges of and demands to the edges of is…