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

A logspace algorithm for partial 2-tree canonization V Arvind, B Das, J Köbler Computer Science–Theory and Applications: Third International Computer …, 2008 | 27 | 2008 |

Log-Space Algorithms for Paths and Matchings in *k*-TreesB Das, S Datta, P Nimbhorkar Theory of Computing Systems 53, 669-689, 2013 | 25 | 2013 |

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

The complexity of black-box ring problems V Arvind, B Das, P Mukhopadhyay Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006 | 21 | 2006 |

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 Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai …, 2007 | 20 | 2007 |

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 | 15 | 2010 |

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 | 13 | 2012 |

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

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

On isomorphism and canonization of tournaments and hypertournaments V Arvind, B Das, P Mukhopadhyay Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006 | 9 | 2006 |

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

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

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

Polynomial-time algorithm for isomorphism of graphs with clique-width at most three B Das, MK Enduri, IV Reddy Theoretical Computer Science 819, 9-23, 2020 | 6* | 2020 |

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 | 5 | 2017 |

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

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

On structural parameterizations of firefighting B Das, MK Enduri, M Kiyomi, N Misra, Y Otachi, IV Reddy, S Yoshimura Theoretical Computer Science 782, 79-90, 2019 | 4 | 2019 |