Home Research-feed Channel Rankings GCT THU AI TR Open Data Must Reading

views: 18

Chinmoy Dutta

Department Of Computer Science and Engineering, Indian Institute of Technology, Kanpur

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers17 papers

Sort

By YearBy Citation

When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing

arXiv: Data Structures and Algorithms, (2018)

EIBibtex

Maximum Weight Online Matching with Deadlines

Itai Ashlagi,Maximilien Burq,Chinmoy Dutta,Patrick Jaillet,Amin Saberi, Chris Sholley

arXiv: Data Structures and Algorithms, (2018)

Cited by1EIBibtex

Online Matching in a Ride-Sharing Platform

Chinmoy Dutta, Chris Sholley

arXiv: Data Structures and Algorithms, (2018)

Cited by1EIBibtex

How Hard is Computing Parity with Noisy Communications

Chinmoy Dutta,Yashodhan Kanoria,D. Manjunath,Jaikumar Radhakrishnan

CoRR, (2015)

Cited by1EIBibtex

Global Information Sharing under Network Dynamics

Chinmoy Dutta,Gopal Pandurangan,Rajmohan Rajaraman,Zhifeng Sun,Emanuele Viola

CoRR, (2014)

Cited by2EIBibtex

Coalescing-branching random walks on graphs

Chinmoy Dutta,Gopal Pandurangan,Rajmohan Rajaraman,Scott T. Roche

SPAA, no. 3 (2013): 176-185

Cited by14EIBibtex

On the complexity of information spreading in dynamic networks

Rajmohan Rajaraman,Gopal Pandurangan,Emanuele Viola,Chinmoy Dutta,Zhifeng Sun

(2013)

Cited by24Bibtex

On the complexity of information spreading in dynamic networks

Chinmoy Dutta,Gopal Pandurangan,Rajmohan Rajaraman,Zhifeng Sun,Emanuele Viola

SODA, pp.717-736, (2013)

Cited by71EIBibtex

More on a Problem of Zarankiewicz

Chinmoy Dutta,Jaikumar Radhakrishnan

ALGORITHMS AND COMPUTATION, ISAAC 2012, (2012): 257-266

Cited by1EIBibtex

On Zarankiewicz Problem and Depth-Two Superconcentrators

Chinmoy Dutta,Jaikumar Radhakrishnan

(2012)

Bibtex

Split and Join: Strong Partitions and Universal Steiner Trees for Graphs

Costas Busch,Chinmoy Dutta,Jaikumar Radhakrishnan,Rajmohan Rajaraman,Srivathsan Srinivasagopalan

foundations of computer science, (2012): 81-90

Cited by4EIWOSBibtex

Information Spreading in Dynamic Networks

Chinmoy Dutta,Gopal Pandurangan,Rajmohan Rajaraman,Zhifeng Sun

CoRR, (2011)

Cited by13EIBibtex

On Strong Graph Partitions and Universal Steiner Trees

Costas Busch,Chinmoy Dutta,Jaikumar Radhakrishnan,Rajmohan Rajaraman,Srivathsan Srinivasagopalan

(2011)

Bibtex

Lower Bounds for Noisy Wireless Networks using Sampling Algorithms

Chinmoy Dutta,Jaikumar Radhakrishnan

FOCS, pp.394-402, (2008)

Cited by4EIWOSBibtex

A tight lower bound for parity in noisy communication networks

Chinmoy Dutta,Yashodhan Kanoria,D. Manjunath,Jaikumar Radhakrishnan

SODA, pp.1056-1065, (2008)

Cited by35EIBibtex

Tradeoffs in depth-two superconcentrators

Chinmoy Dutta,Jaikumar Radhakrishnan

STACS, (2006): 372-383

Cited by4EIBibtex

Enhancing bandwidth utilization in Bluetooth using optimal SAR

Ashish Agarwal,Chinmoy Dutta,Dheeraj Sanghi

ICCC '02 Proceedings of the 15th international conference on Computer communication, pp.19-25, (2002)

EIBibtex

View All

Base Info Papers Patents Projects