The SCEAS System
| |||||||

## Search the dblp DataBase
Sambuddha Roy:
[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] - Eric Allender, Samir Datta, Sambuddha Roy
**Topology Inside NC¹.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:298-307 [Conf] - 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] - 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] - Eric Allender, Samir Datta, Sambuddha Roy
**The Directed Planar Reachability Problem.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2005, pp:238-249 [Conf] - Venkatesan T. Chakaravarthy, Sambuddha Roy
**Oblivious Symmetric Alternation.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:230-241 [Conf] - 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] - Eric Allender, Samir Datta, Sambuddha Roy
**Topology inside NC**[Citation Graph (0, 0)][DBLP]^{1} Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:108, pp:- [Journal] - 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] - 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] - 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] - 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] **Effective Decision Support for Workforce Deployment Service Systems.**[Citation Graph (, )][DBLP]**Extracting dense communities from telecom call graphs.**[Citation Graph (, )][DBLP]**Approximating Decision Trees with Multiway Branches.**[Citation Graph (, )][DBLP]**Arthur and Merlin as Oracles.**[Citation Graph (, )][DBLP]**Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.**[Citation Graph (, )][DBLP]**Finding Irrefutable Certificates for S**[Citation Graph (, )][DBLP]_{2}^{p}via Arthur and Merlin.**Space-Efficient Counting in Graphs on Surfaces.**[Citation Graph (, )][DBLP]**Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs**[Citation Graph (, )][DBLP]**Parity Problems in Planar Graphs.**[Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.021secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |