default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTanmoy Chakraborty 0001
Person information
- affiliation: Harvard University
Other persons with the same name
- Tanmoy Chakraborty 0002
![[0000-0002-0210-0369]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0210-0369")
— Indian Institute of Technology Delhi, India (IIT Delhi) (and 3 more) - Tanmoy Chakraborty 0003 — West Bengal University of Technology, Kolkata, India
- Tanmoy Chakraborty 0004 — Manipal University Jaipur, Rajasthan, India
- Tanmoy Chakraborty 0005 — Techno Main Salt Lake, Department of Computer Science and Engineering, Kolkata, India
- Tanmoy Chakraborty 0006 — Indian Institute of Science Education and Research (IISER) Kolkata, India
- Tanmoy Chakraborty 0007 — Sharda University, Department of Chemistry and Biochemistry, India
- Tanmoy Chakraborty 0008 — Khulna University of Engineering & Technology, Bangladesh
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j3]Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna:
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization. SIAM J. Comput. 42(6): 2424-2451 (2013)- 2012
- [c15]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Mechanism Design for a Risk Averse Seller. WINE 2012: 198-211 - 2011
- [j2]Tanmoy Chakraborty, Dulal C. Ghosh:
Correlation of the Drug Activities of Some Anti-Tubercular Chalcone Derivatives in Terms of the Quantum Mechanical Reactivity Descriptors. Int. J. Chemoinformatics Chem. Eng. 1(2): 53-65 (2011) - [c14]Tanmoy Chakraborty, Michael J. Kearns:
Market making and mean reversion. EC 2011: 307-314 - [i6]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Mechanism Design with Risk Aversion. CoRR abs/1107.4722 (2011) - 2010
- [c13]Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna:
Dynamic and non-uniform pricing strategies for revenue maximization. BQGT 2010: 20:1 - [c12]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. EC 2010: 73-82 - [c11]Tanmoy Chakraborty, J. Stephen Judd, Michael J. Kearns, Jinsong Tan:
A behavioral study of bargaining in social networks. EC 2010: 243-252 - [c10]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Selective Call Out and Real Time Bidding. WINE 2010: 145-157 - [c9]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions. WINE 2010: 158-169 - [i5]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Selective Call Out and Real Time Bidding. CoRR abs/1002.3102 (2010) - [i4]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions. CoRR abs/1008.1616 (2010)
2000 – 2009
- 2009
- [j1]Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675-723 (2009) - [c8]Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna:
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization. FOCS 2009: 495-504 - [c7]Tanmoy Chakraborty, Sanjeev Khanna:
Nash Dynamics in Constant Player and Bounded Jump Congestion Games. SAGT 2009: 196-207 - [c6]Tanmoy Chakraborty, Michael J. Kearns, Sanjeev Khanna:
Network bargaining: algorithms and structural results. EC 2009: 159-168 - [c5]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Nash Dynamics in Congestion Games with Similar Resources. WINE 2009: 362-373 - [i3]Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna:
Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization. CoRR abs/0905.3191 (2009) - 2008
- [c4]Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna:
Network design for vertex connectivity. STOC 2008: 167-176 - [c3]Tanmoy Chakraborty, Michael J. Kearns:
Bargaining Solutions in a Social Network. WINE 2008: 548-555 - 2006
- [c2]Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Grid Graph Reachability Problems. CCC 2006: 299-313 - [c1]Tanmoy Chakraborty, Samir Datta:
One-Input-Face MPCVP Is Hard for L, But in LogDCFL. FSTTCS 2006: 57-68 - [i2]Tanmoy Chakraborty, Samir Datta:
One-input-face MPCVP is Hard for L, but in LogDCFL. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i1]Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Grid Graph Reachability Problems. Electron. Colloquium Comput. Complex. TR05 (2005)
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-12-23 20:31 CET 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:
