Time optimal algorithms for black hole search in rings B Balamohan, P Flocchini, A Miri, N Santoro Discrete Mathematics, Algorithms and Applications 3 (04), 457-471, 2011 | 25 | 2011 |

On the behavior of a variant of Hofstadter’s Q-sequence B Balamohan, A Kuznetsov, S Tanny J. Integer Sequences 10, 29, 2007 | 25 | 2007 |

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with *O*(1) PebblesB Balamohan, S Dobrev, P Flocchini, N Santoro Structural Information and Communication Complexity: 19th International …, 2012 | 15 | 2012 |

Improving the optimal bounds for black hole search in rings B Balamohan, P Flocchini, A Miri, N Santoro Structural Information and Communication Complexity: 18th International …, 2011 | 13 | 2011 |

Time optimal algorithms for black hole search in rings B Balamohan, P Flocchini, A Miri, N Santoro International Conference on Combinatorial Optimization and Applications, 58-71, 2010 | 12 | 2010 |

Exploring an unknown dangerous graph with a constant number of tokens B Balamohan, S Dobrev, P Flocchini, N Santoro Theoretical Computer Science 610, 169-181, 2016 | 11 | 2016 |

A combinatorial interpretation for certain relatives of the Conolly sequence B Balamohan, Z Li, S Tanny arXiv preprint arXiv:0801.1097, 2008 | 10 | 2008 |

Accelerating the scalar multiplication on genus 2 hyperelliptic curve cryptosystems B Balamohan University of Ottawa (Canada), 2010 | 2 | 2010 |

The crossing number of P (10, 3) is six B Balamohan, RB Richter Ars Combinatoria 85, 65-70, 2007 | 1 | 2007 |

On the behavior of a variant of Hofstadter's-sequence. B Balamohan, A Kuznetsov, S Tanny Journal of Integer Sequences [electronic only] 10 (7), Article 07.7. 1, 29 p …, 2007 | 1 | 2007 |

Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication B Balamohan Université d'Ottawa/University of Ottawa, 2013 | | 2013 |

On the behavior of a variant of Hofstadter's B Balamohan, A Kuznetsov, S Tanny Journal of Integer Sequences [electronic only] 10, 2007 | | 2007 |