Zero knowledge and circuit minimization E Allender, B Das Information and Computation 256, 2-8, 2017 | 52 | 2017 |

A logspace algorithm for partial 2-tree canonization V Arvind, B Das, J Köbler International Computer Science Symposium in Russia, 40-51, 2008 | 26 | 2008 |

Log-space algorithms for paths and matchings in k-trees B Das, S Datta, P Nimbhorkar Theory of Computing Systems 53 (4), 669-689, 2013 | 23 | 2013 |

Restricted space algorithms for isomorphism on bounded treewidth graphs B Das, J Torán, F Wagner Information and Computation 217, 71-83, 2012 | 20 | 2012 |

The Space Complexity of *k*-Tree IsomorphismV Arvind, B Das, J Köbler International Symposium on Algorithms and Computation, 822-833, 2007 | 19 | 2007 |

The complexity of black-box ring problems V Arvind, B Das, P Mukhopadhyay International Computing and Combinatorics Conference, 126-135, 2006 | 17 | 2006 |

Colored hypergraph isomorphism is fixed parameter tractable V Arvind, B Das, J Köbler, S Toda IARCS Annual Conference on Foundations of Software Technology and …, 2010 | 14 | 2010 |

Colored hypergraph isomorphism is fixed parameter tractable V Arvind, B Das, J Köbler, S Toda Algorithmica 71 (1), 120-138, 2015 | 12 | 2015 |

CNF and DNF succinct graph encodings B Das, P Scharpfenecker, J Torán Information and Computation 253, 436-447, 2017 | 9 | 2017 |

On isomorphism and canonization of tournaments and hypertournaments V Arvind, B Das, P Mukhopadhyay International Symposium on Algorithms and Computation, 449-459, 2006 | 9 | 2006 |

Succinct encodings of graph isomorphism B Das, P Scharpfenecker, J Torán International Conference on Language and Automata Theory and Applications …, 2014 | 8 | 2014 |

The isomorphism problem for k-trees is complete for logspace V Arvind, B Das, J Köbler, S Kuhnert Information and Computation 217, 1-11, 2012 | 8 | 2012 |

The entropy influence conjecture revisited B Das, M Pal, V Visavaliya arXiv preprint arXiv:1110.4301, 2011 | 8 | 2011 |

DNA algorithm for breaking A propositional logic based cryptosystem R Siromoney, B Das Bulletin of the EATCS 79, 170-177, 2003 | 8 | 2003 |

On structural parameterizations of graph motif and chromatic number B Das, MK Enduri, N Misra, IV Reddy Conference on Algorithms and Discrete Applied Mathematics, 118-129, 2017 | 7 | 2017 |

Nearly linear time isomorphism algorithms for some nonabelian group classes B Das, S Sharma Theory of Computing Systems 65 (3), 497-514, 2021 | 5 | 2021 |

Polynomial-time algorithm for isomorphism of graphs with clique-width at most three B Das, MK Enduri, IV Reddy International Computing and Combinatorics Conference, 55-66, 2016 | 5* | 2016 |

Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs B Das, MK Enduri, IV Reddy International Workshop on Algorithms and Computation, 329-334, 2015 | 4 | 2015 |

Isomorphism and canonization of tournaments and hypertournaments V Arvind, B Das, P Mukhopadhyay Journal of Computer and System Sciences 76 (7), 509-523, 2010 | 4 | 2010 |

SZK proofs for black-box group problems V Arvind, B Das Theory of Computing Systems 43 (2), 100-117, 2008 | 4 | 2008 |