( en | de | ru )

 

Disambiguation of "Chakrabarti, Amit"

Author of the publication

copydeleteadd this publication to your clipboard
Vertex Ordering Problems in Directed Graph Streams.

, , , and . SODA, page 1786-1802. SIAM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Regina Amith-Borchart

Menachem Amitai

Samuel Amiteye

Menachem Amitai

Chaitali Chakrabarti

 

Other publications of authors with the same name

Beyond set disjointness: the communication complexity of finding the intersection., , , , and . PODC, page 106-113. ACM, (2014)Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword., and . Comput. Complex., 18 (2): 169-170 (2009)Submodular Maximization Meets Streaming: Matchings, Matroids, and More., and . CoRR, (2013)Time-Space Tradeoffs for the Memory Game., and . CoRR, (2017)A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube., , , and . STOC, page 305-311. ACM, (1999)An optimal lower bound on the communication complexity of gap-hamming-distance., and . STOC, page 51-60. ACM, (2011)When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks., , and . STOC, page 19-26. ACM, (2012)Functional Monitoring without Monotonicity., , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 95-106. Springer, (2009)An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance., and . Electron. Colloquium Comput. Complex., (2010)Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models., , and . ICALP, volume 168 of LIPIcs, page 11:1-11:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)