 | 2009 |
|---|
| 11 |       | Tanmoy Chakraborty,
Michael Kearns,
Sanjeev Khanna:
Network bargaining: algorithms and structural results.
ACM Conference on Electronic Commerce 2009: 159-168 |
| 10 | | Tanmoy Chakraborty,
Sanjeev Khanna:
Nash Dynamics in Constant Player and Bounded Jump Congestion Games.
SAGT 2009: 196-207 |
| 9 | | Anand Bhalgat,
Tanmoy Chakraborty,
Sanjeev Khanna:
Nash Dynamics in Congestion Games with Similar Resources.
WINE 2009: 362-373 |
| 8 | | Tanmoy Chakraborty,
Zhiyi Huang,
Sanjeev Khanna:
Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization
CoRR abs/0905.3191: (2009) |
| 7 | | 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) |
| 2008 |
|---|
| 6 | | Tanmoy Chakraborty,
Julia Chuzhoy,
Sanjeev Khanna:
Network design for vertex connectivity.
STOC 2008: 167-176 |
| 5 | | Tanmoy Chakraborty,
Michael Kearns:
Bargaining Solutions in a Social Network.
WINE 2008: 548-555 |
| 2006 |
|---|
| 4 | | Tanmoy Chakraborty,
Samir Datta:
One-Input-Face MPCVP Is Hard for L, But in LogDCFL.
FSTTCS 2006: 57-68 |
| 3 | | Eric Allender,
David A. Mix Barrington,
Tanmoy Chakraborty,
Samir Datta,
Sambuddha Roy:
Grid Graph Reachability Problems.
IEEE Conference on Computational Complexity 2006: 299-313 |
| 2 | | Tanmoy Chakraborty,
Samir Datta:
One-input-face MPCVP is Hard for L, but in LogDCFL.
Electronic Colloquium on Computational Complexity (ECCC) 13(130): (2006) |
| 2005 |
|---|
| 1 | | Eric Allender,
David A. Mix Barrington,
Tanmoy Chakraborty,
Samir Datta,
Sambuddha Roy:
Grid Graph Reachability Problems
Electronic Colloquium on Computational Complexity (ECCC)(149): (2005) |
