|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 38 publication records. Showing 38 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania |
Decision trees for entity identification: Approximation algorithms and hardness results.  |
ACM Transactions on Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Arthur and Merlin as Oracles. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy |
Approximation Algorithms for Edge Partitioned Vertex Cover Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy |
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Neha Sengupta |
Maximizing throughput of jobs with multiple resource requirements. |
HiPC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal |
Resource Allocation for Covering Time Varying Demands. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Gyana R. Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar |
Minimum Cost Resource Allocation for Meeting Job Requirements. |
IPDPS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pradipta De, Sambuddha Roy |
VMSpreader: Multi-tier application resiliency through virtual machine striping. |
Integrated Network Management |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy |
Contact Center Scheduling with Strict Resource Requirements. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal |
Scheduling Resources for Throughput Maximization. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijil Chenthamarakshan, Kashyap Dixit, M. Gattani, Munish Goyal, Pranav Gupta, Nanda Kambhatla, Rohit Lotlikar, Debapriyo Majumdar, Gyana R. Parija, Sambuddha Roy, Soujanya Soni, Karthik Visweswariah |
Effective decision support systems for workforce deployment. |
IBM Journal of Research and Development |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal |
Finding Independent Sets in Unions of Perfect Graphs. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Approximating maximum weight K-colorable subgraphs in chordal graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Arthur and Merlin as Oracles. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy |
The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy |
Space-Efficient Counting in Graphs on Surfaces. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy |
Planar and Grid Graph Reachability Problems. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs |
| 1 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal |
Approximating Decision Trees with Multiway Branches. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kashyap Dixit, Munish Goyal, Pranav Gupta, Nanda Kambhatla, Rohit Lotlikar, Debapriyo Majumdar, Gyana R. Parija, Sambuddha Roy, Soujanya Soni |
Effective Decision Support for Workforce Deployment Service Systems. |
IEEE SCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Arthur and Merlin as Oracles. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Finding Irrefutable Certificates for S2p via Arthur and Merlin. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vinayaka Pandit, Natwar Modani, Sougata Mukherjea, Amit Anil Nanavati, Sambuddha Roy, Amit Agarwal |
Extracting dense communities from telecom call graphs. |
COMSWARE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy |
Parity Problems in Planar Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania |
Decision trees for entity identification: approximation algorithms and hardness results. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
decision tree, ramsey theory |
| 1 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy |
Parity Problems in Planar Graphs. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Oblivious Symmetric Alternation. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy |
Grid Graph Reachability Problems. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy |
Grid Graph Reachability Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
The Directed Planar Reachability Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
Topology Inside NC¹. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
The Directed Planar Reachability Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Samir Datta, Sambuddha Roy |
Topology inside NC1 |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy |
Derandomization and Distinguishing Complexity. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay |
Time-Space Tradeoffs in the Counting Hierarchy |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay |
Time-Space Tradeoffs in the Counting Hierarchy. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #38 of 38 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")