Chakrabarti, Amit

1. An Optimal Lower Bound on the Communication Complexity of\n Gap-Hamming-Distance
   2010/09/17 by Amit Chakrabarti, Oded Regev, Chakrabarti, Amit +1 · 4 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning and Algorithms #Metric Geometry (math.MG)
2. Submodular Maximization Meets Streaming: Matchings, Matroids, and More
   2013/09/09 by Amit Chakrabarti, Sagar Kale, Chakrabarti, Amit +1 · 4 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
3. Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms
   2022/12/20 by Sepehr Assadi, Amit Chakrabarti, Assadi, Sepehr +5 · 4 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Stochastic Gradient Optimization Techniques
4. Adversarially Robust Coloring for Graph Streams
   2021/09/23 by Chakrabarti, Amit, Ghosh, Prantar, Stoeckl, Manuel · 3 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
5. Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models
   2019/05/02 by Bera, Suman K., Chakrabarti, Amit, Ghosh, Prantar · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
6. Vertex Ordering Problems in Directed Graph Streams
   2021/05/18 by Chakrabarti, Amit, Ghosh, Prantar, McGregor, Andrew +1 · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
7. When the Cut Condition is Enough: A Complete Characterization for\n Multiflow Problems in Series-Parallel Networks
   2012/03/19 by Amit Chakrabarti, Lisa Fleischer, Chakrabarti, Amit +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Interconnection Networks and Systems
8. Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming
   2012/05/04 by Chakrabarti, Amit, Kondapally, Ranganath, Wang, Zhenghui · 1 citation
   #Computational Complexity (cs.CC) #E.4 #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR)
9. Finding missing items requires strong forms of randomness
   2023/10/05 by Chakrabarti, Amit, Stoeckl, Manuel · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences