Sambuddha Roy, Ph.D.
Affiliations: | 2006 | Rutgers University, New Brunswick, New Brunswick, NJ, United States |
Area:
Computer ScienceGoogle:
"Sambuddha Roy"Parents
Sign in to add mentor| Eric Allender | grad student | 2006 | Rutgers, New Brunswick | |
| (Complexity theoretic aspects of planar restrictions and obliviousness.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chakaravarthy VT, Choudhury AR, Gupta S, et al. (2018) Improved algorithms for resource allocation under varying capacity Journal of Scheduling. 21: 313-325 |
| Bera SK, Gupta S, Kumar A, et al. (2014) Approximation algorithms for the partition vertex cover problem Theoretical Computer Science. 555: 2-8 |
| Chakaravarthy VT, Pandit V, Roy S, et al. (2011) Decision trees for entity identification: Approximation algorithms and hardness results Acm Transactions On Algorithms. 7 |
| Allender E, Koucký M, Ronneburger D, et al. (2011) The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory Journal of Computer and System Sciences. 77: 14-40 |
| Chakaravarthy VT, Roy S. (2011) Arthur and Merlin as Oracles Computational Complexity. 20: 505-558 |
| Chakaravarthy VT, Roy S. (2009) Approximating maximum weight K-colorable subgraphs in chordal graphs Information Processing Letters. 109: 365-368 |
| Allender E, Barrington DAM, Chakraborty T, et al. (2009) Planar and grid graph reachability problems Theory of Computing Systems. 45: 675-723 |
| Braverman M, Kulkarni R, Roy S. (2009) Space-Efficient counting in graphs on surfaces Computational Complexity. 18: 601-649 |
| Roy S, Steiger W. (2007) Some combinatorial and algorithmic applications of the borsuk-ulam theorem Graphs and Combinatorics. 23: 331-341 |