 | 2011 |
| 18 |  | Bireswar Das,
Manjish Pal,
Vijay Visavaliya:
The Entropy Influence Conjecture Revisited
CoRR abs/1110.4301: (2011) |
| 17 |  | Bireswar Das,
Manjish Pal,
Vijay Visavaliya:
The Entropy Influence Conjecture Revisited.
Electronic Colloquium on Computational Complexity (ECCC) 18: 146 (2011) |
| 2010 |
| 16 |  | Vikraman Arvind,
Bireswar Das,
Johannes Köbler,
Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
FSTTCS 2010: 327-337 |
| 15 |  | Bireswar Das,
Samir Datta,
Prajakta Nimbhorkar:
Log-space Algorithms for Paths and Matchings in k-trees.
STACS 2010: 215-226 |
| 14 |  | Bireswar Das,
Jacobo Torán,
Fabian Wagner:
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs.
STACS 2010: 227-238 |
| 13 |  | Bireswar Das,
Jacobo Torán,
Fabian Wagner:
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
CoRR abs/1001.0383: (2010) |
| 12 |  | Vikraman Arvind,
Bireswar Das,
Partha Mukhopadhyay:
Isomorphism and canonization of tournaments and hypertournaments.
J. Comput. Syst. Sci. 76(7): 509-523 (2010) |
| 2009 |
| 11 |  | Bireswar Das,
Samir Datta,
Prajakta Nimbhorkar:
Log-space Algorithms for Paths and Matchings in k-trees
CoRR abs/0912.4602: (2009) |
| 10 |  | Vikraman Arvind,
Bireswar Das,
Johannes Köbler,
Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Electronic Colloquium on Computational Complexity (ECCC) 16: 93 (2009) |
| 9 |  | Bireswar Das,
Jacobo Torán,
Fabian Wagner:
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 16: 94 (2009) |
| 2008 |
| 8 |  | Vikraman Arvind,
Bireswar Das,
Johannes Köbler:
A Logspace Algorithm for Partial 2-Tree Canonization.
CSR 2008: 40-51 |
| 7 |  | Vikraman Arvind,
Bireswar Das:
SZK Proofs for Black-Box Group Problems.
Theory Comput. Syst. 43(2): 100-117 (2008) |
| 2007 |
| 6 |  | Vikraman Arvind,
Bireswar Das,
Johannes Köbler:
The Space Complexity of k -Tree Isomorphism.
ISAAC 2007: 822-833 |
| 2006 |
| 5 |  | Vikraman Arvind,
Bireswar Das,
Partha Mukhopadhyay:
The Complexity of Black-Box Ring Problems.
COCOON 2006: 126-135 |
| 4 |  | Vikraman Arvind,
Bireswar Das:
SZK Proofs for Black-Box Group Problems.
CSR 2006: 6-17 |
| 3 |  | Vikraman Arvind,
Bireswar Das,
Partha Mukhopadhyay:
On Isomorphism and Canonization of Tournaments and Hypertournaments.
ISAAC 2006: 449-459 |
| 2004 |
| 2 |  | Rani Siromoney,
Bireswar Das:
Plasmids to Solve #3SAT.
Aspects of Molecular Computing 2004: 361-366 |
| 2003 |
| 1 |  | Rani Siromoney,
Bireswar Das:
DNA algorithm for breaking a propositional logic based cryptosystem.
Bulletin of the EATCS 79: 170-177 (2003) |