2008 |
8 | EE | Vikraman Arvind,
Bireswar Das,
Johannes Köbler:
A Logspace Algorithm for Partial 2-Tree Canonization.
CSR 2008: 40-51 |
7 | EE | Vikraman Arvind,
Bireswar Das:
SZK Proofs for Black-Box Group Problems.
Theory Comput. Syst. 43(2): 100-117 (2008) |
2007 |
6 | EE | Vikraman Arvind,
Bireswar Das,
Johannes Köbler:
The Space Complexity of k -Tree Isomorphism.
ISAAC 2007: 822-833 |
2006 |
5 | EE | Vikraman Arvind,
Bireswar Das,
Partha Mukhopadhyay:
The Complexity of Black-Box Ring Problems.
COCOON 2006: 126-135 |
4 | EE | Vikraman Arvind,
Bireswar Das:
SZK Proofs for Black-Box Group Problems.
CSR 2006: 6-17 |
3 | EE | Vikraman Arvind,
Bireswar Das,
Partha Mukhopadhyay:
On Isomorphism and Canonization of Tournaments and Hypertournaments.
ISAAC 2006: 449-459 |
2004 |
2 | EE | 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) |