Search the dblp DataBase

Publications of Author

1. 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]
   
2. Eric Allender, Samir Datta, Sambuddha Roy
   Topology Inside NC¹. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2005, pp:298-307 [Conf]
   
3. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
   Derandomization and Distinguishing Complexity. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2003, pp:209-220 [Conf]
   
4. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
   Time-Space Tradeoffs in the Counting Hierarchy. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2001, pp:295-302 [Conf]
   
5. Eric Allender, Samir Datta, Sambuddha Roy
   The Directed Planar Reachability Problem. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2005, pp:238-249 [Conf]
   
6. Venkatesan T. Chakaravarthy, Sambuddha Roy
   Oblivious Symmetric Alternation. [Citation Graph (0, 0)][DBLP]
   STACS, 2006, pp:230-241 [Conf]
   
7. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
   Time-Space Tradeoffs in the Counting Hierarchy [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:41, pp:- [Journal]
   
8. Eric Allender, Samir Datta, Sambuddha Roy
   Topology inside NC¹ [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:108, pp:- [Journal]
   
9. Eric Allender, Samir Datta, Sambuddha Roy
   The Directed Planar Reachability Problem [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:148, pp:- [Journal]
   
10. 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]
    
11. Mark Braverman, Raghav Kulkarni, Sambuddha Roy
    Parity Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:222-235 [Conf]
    
12. Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania
    Decision trees for entity identification: approximation algorithms and hardness results. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:53-62 [Conf]
    
13. 
    Effective Decision Support for Workforce Deployment Service Systems. [Citation Graph (, )][DBLP]
    
    
14. 
    Extracting dense communities from telecom call graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    Approximating Decision Trees with Multiway Branches. [Citation Graph (, )][DBLP]
    
    
16. 
    Arthur and Merlin as Oracles. [Citation Graph (, )][DBLP]
    
    
17. 
    Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Finding Irrefutable Certificates for S₂^p via Arthur and Merlin. [Citation Graph (, )][DBLP]
    
    
19. 
    Space-Efficient Counting in Graphs on Surfaces. [Citation Graph (, )][DBLP]
    
    
20. 
    Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [Citation Graph (, )][DBLP]
    
    
21. 
    Parity Problems in Planar Graphs. [Citation Graph (, )][DBLP]