default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChinmoy Dutta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Itai Ashlagi, Maximilien Burq, Chinmoy Dutta
, Patrick Jaillet, Amin Saberi, Chris Sholley:
Edge-Weighted Online Windowed Matching. Math. Oper. Res. 48(2): 999-1016 (2023)- 2021
- [c9]Chinmoy Dutta:
When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing. AAAI 2021: 90-98
2010 – 2019
- 2019
- [c8]Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley:
Edge Weighted Online Windowed Matching. EC 2019: 729-742 - 2018
- [i9]Chinmoy Dutta, Chris Sholley:
Online Matching in a Ride-Sharing Platform. CoRR abs/1806.10327 (2018) - [i8]Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley:
Maximum Weight Online Matching with Deadlines. CoRR abs/1808.03526 (2018) - [i7]Chinmoy Dutta:
When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing. CoRR abs/1809.02680 (2018) - 2015
- [j1]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-Branching Random Walks on Graphs. ACM Trans. Parallel Comput. 2(3): 20:1-20:29 (2015) - [i6]Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan:
How Hard is Computing Parity with Noisy Communications? CoRR abs/1502.02290 (2015) - [i5]Chinmoy Dutta, Jaikumar Radhakrishnan:
A Sampling Technique of Proving Lower Bounds for Noisy Computations. CoRR abs/1503.00321 (2015) - 2014
- [i4]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola:
Global Information Sharing under Network Dynamics. CoRR abs/1409.7771 (2014) - 2013
- [c7]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola:
On the Complexity of Information Spreading in Dynamic Networks. SODA 2013: 717-736 - [c6]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-branching random walks on graphs. SPAA 2013: 176-185 - 2012
- [c5]Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan:
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. FOCS 2012: 81-90 - [c4]Chinmoy Dutta, Jaikumar Radhakrishnan:
More on a Problem of Zarankiewicz. ISAAC 2012: 257-266 - [i3]Chinmoy Dutta, Jaikumar Radhakrishnan:
More on a Problem of Zarankiewicz. CoRR abs/1201.1377 (2012) - 2011
- [i2]Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan:
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. CoRR abs/1111.4766 (2011) - [i1]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun:
Information Spreading in Dynamic Networks. CoRR abs/1112.0384 (2011)
2000 – 2009
- 2008
- [c3]Chinmoy Dutta, Jaikumar Radhakrishnan:
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. FOCS 2008: 394-402 - [c2]Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan:
A tight lower bound for parity in noisy communication networks. SODA 2008: 1056-1065 - 2006
- [c1]Chinmoy Dutta, Jaikumar Radhakrishnan:
Tradeoffs in Depth-Two Superconcentrators. STACS 2006: 372-383
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
