2008 |
18 | EE | Vinayaka Pandit,
Natwar Modani,
Sougata Mukherjea,
Amit Anil Nanavati,
Sambuddha Roy,
Amit Agarwal:
Extracting dense communities from telecom call graphs.
COMSWARE 2008: 82-89 |
17 | EE | Venkatesan T. Chakaravarthy,
Sambuddha Roy:
Arthur and Merlin as Oracles.
MFCS 2008: 229-240 |
16 | EE | Venkatesan T. Chakaravarthy,
Sambuddha Roy:
Finding Irrefutable Certificates for S2p via Arthur and Merlin.
STACS 2008: 157-168 |
15 | EE | Samir Datta,
Raghav Kulkarni,
Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
STACS 2008: 229-240 |
14 | EE | Samir Datta,
Raghav Kulkarni,
Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
CoRR abs/0802.2850: (2008) |
2007 |
13 | EE | Mark Braverman,
Raghav Kulkarni,
Sambuddha Roy:
Parity Problems in Planar Graphs.
IEEE Conference on Computational Complexity 2007: 222-235 |
12 | EE | Venkatesan T. Chakaravarthy,
Vinayaka Pandit,
Sambuddha Roy,
Pranjal Awasthi,
Mukesh K. Mohania:
Decision trees for entity identification: approximation algorithms and hardness results.
PODS 2007: 53-62 |
11 | EE | Mark Braverman,
Raghav Kulkarni,
Sambuddha Roy:
Parity Problems in Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 14(035): (2007) |
2006 |
10 | EE | Eric Allender,
David A. Mix Barrington,
Tanmoy Chakraborty,
Samir Datta,
Sambuddha Roy:
Grid Graph Reachability Problems.
IEEE Conference on Computational Complexity 2006: 299-313 |
9 | EE | Venkatesan T. Chakaravarthy,
Sambuddha Roy:
Oblivious Symmetric Alternation.
STACS 2006: 230-241 |
2005 |
8 | EE | Eric Allender,
Samir Datta,
Sambuddha Roy:
The Directed Planar Reachability Problem.
FSTTCS 2005: 238-249 |
7 | EE | Eric Allender,
Samir Datta,
Sambuddha Roy:
Topology Inside NC¹.
IEEE Conference on Computational Complexity 2005: 298-307 |
6 | EE | Eric Allender,
Samir Datta,
Sambuddha Roy:
The Directed Planar Reachability Problem
Electronic Colloquium on Computational Complexity (ECCC)(148): (2005) |
5 | EE | Eric Allender,
David A. Mix Barrington,
Tanmoy Chakraborty,
Samir Datta,
Sambuddha Roy:
Grid Graph Reachability Problems
Electronic Colloquium on Computational Complexity (ECCC)(149): (2005) |
2004 |
4 | EE | Eric Allender,
Samir Datta,
Sambuddha Roy:
Topology inside NC1
Electronic Colloquium on Computational Complexity (ECCC)(108): (2004) |
2003 |
3 | EE | Eric Allender,
Michal Koucký,
Detlef Ronneburger,
Sambuddha Roy:
Derandomization and Distinguishing Complexity.
IEEE Conference on Computational Complexity 2003: 209-220 |
2001 |
2 | EE | Eric Allender,
Michal Koucký,
Detlef Ronneburger,
Sambuddha Roy,
V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy.
IEEE Conference on Computational Complexity 2001: 295-302 |
1 | EE | Eric Allender,
Michal Koucký,
Detlef Ronneburger,
Sambuddha Roy,
V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 8(41): (2001) |