Amit Chakrabarti

1. Submodular maximization meets streaming: matchings, matroids, and more
   2015/03/30 by Amit Chakrabarti, Sagar Kale · 6 citations
   Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Cryptography and Data Security
2. 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)
3. Submodular Maximization Meets Streaming: Matchings, Matroids, and More
   2013/09/09 by Amit Chakrabarti, Chakrabarti, Amit, Sagar Kale +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
4. Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms
   2022/12/20 by Sepehr Assadi, Assadi, Sepehr, Amit Chakrabarti +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
5. When the Cut Condition is Enough: A Complete Characterization for\n Multiflow Problems in Series-Parallel Networks
   2012/03/19 by Amit Chakrabarti, Chakrabarti, Amit, Lisa Fleischer +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