|
Search the dblp DataBase
Tanmoy Chakraborty:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Grid Graph Reachability Problems. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:299-313 [Conf]
- Tanmoy Chakraborty, Samir Datta
One-Input-Face MPCVP Is Hard for L, But in LogDCFL. [Citation Graph (0, 0)][DBLP] FSTTCS, 2006, pp:57-68 [Conf]
- Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Grid Graph Reachability Problems [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:149, pp:- [Journal]
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization. [Citation Graph (, )][DBLP]
A behavioral study of bargaining in social networks. [Citation Graph (, )][DBLP]
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. [Citation Graph (, )][DBLP]
Network bargaining: algorithms and structural results. [Citation Graph (, )][DBLP]
Network design for vertex connectivity. [Citation Graph (, )][DBLP]
Bargaining Solutions in a Social Network. [Citation Graph (, )][DBLP]
Nash Dynamics in Congestion Games with Similar Resources. [Citation Graph (, )][DBLP]
Nash Dynamics in Constant Player and Bounded Jump Congestion Games. [Citation Graph (, )][DBLP]
Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization [Citation Graph (, )][DBLP]
Selective Call Out and Real Time Bidding [Citation Graph (, )][DBLP]
Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions [Citation Graph (, )][DBLP]
One-input-face MPCVP is Hard for L, but in LogDCFL. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|