Sambuddha Roy
Sambuddha Roy
Unaffiliated - Deep Learning Consultant/Practitioner
Verifierad e-postadress på in.ibm.com
Titel
Citeras av
Citeras av
År
Decision trees for entity identification: Approximation algorithms and hardness results
VT Chakaravarthy, V Pandit, S Roy, P Awasthi, M Mohania
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on …, 2007
90*2007
Planar and grid graph reachability problems
E Allender, DA Mix Barrington, T Chakraborty, S Datta, S Roy
Theory of Computing Systems 45 (4), 675-723, 2009
552009
RESPONSE OF SUMMER SESAME (SESAMUM-INDICUM) TO IRRIGATION, ROW SPACING AND PLANT-POPULATION
DK Majumdar, SK Roy
Indian Journal of Agronomy 37 (4), 758-762, 1992
361992
The directed planar reachability problem
E Allender, S Datta, S Roy
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005
352005
The Directed Planar Reachability Problem
E Allender, S Datta, S Roy
FSTTCS 2005, 0
35*
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
E Allender, M Koucký, D Ronneburger, S Roy
Journal of Computer and System Sciences 77 (1), 14-40, 2011
332011
Oblivious symmetric alternation
V Chakaravarthy, S Roy
STACS 2006, 230-241, 2006
212006
Approximating decision trees with multiway branches
VT Chakaravarthy, V Pandit, S Roy, Y Sabharwal
International Colloquium on Automata, Languages, and Programming, 210-221, 2009
192009
Extracting dense communities from telecom call graphs
V Pandit, N Modani, S Mukherjea, AA Nanavati, S Roy, A Agarwal
2008 3rd International Conference on Communication Systems Software and …, 2008
172008
Some combinatorial and algorithmic applications of the Borsuk–Ulam theorem
S Roy, W Steiger
Graphs and Combinatorics 23 (1), 331-341, 2007
172007
Derandomization and distinguishing complexity
E Allender, M Koucky, D Ronneburger, S Roy
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003
172003
Effective decision support for workforce deployment service systems
K Dixit, M Goyal, P Gupta, N Kambhatla, RM Lotlikar, D Majumdar, ...
2009 IEEE International Conference on Services Computing, 104-111, 2009
112009
Improved algorithms for resource allocation under varying capacity
VT Chakaravarthy, AR Choudhury, S Gupta, S Roy, Y Sabharwal
European Symposium on Algorithms, 222-234, 2014
102014
Approximation algorithms for the partition vertex cover problem
SK Bera, S Gupta, A Kumar, S Roy
Theoretical Computer Science 555, 2-8, 2014
92014
Parity problems in planar graphs
M Braverman, R Kulkarni, S Roy
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
92007
Topology inside NC1
E Allender, S Datta, S Roy
Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE …, 2005
9*2005
Approximating maximum weight K-colorable subgraphs in chordal graphs
VT Chakaravarthy, S Roy
Information processing letters 109 (7), 365-368, 2009
72009
Arthur and Merlin as oracles
VT Chakaravarthy, S Roy
computational complexity 20 (3), 505, 2011
62011
Effective decision support systems for workforce deployment
V Chenthamarakshan, K Dixit, M Gattani, M Goyal, P Gupta, N Kambhatla, ...
IBM Journal of Research and Development 54 (6), 5: 1-5: 15, 2010
62010
Density functions subject to a co-matroid constraint
VT Chakaravarthy, N Modani, SR Natarajan, S Roy, Y Sabharwal
arXiv preprint arXiv:1207.5215, 2012
52012
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20