Balasingham Balamohan
Balasingham Balamohan
Ph.D Student, University of Ottawa
Verified email at uottawa.ca
TitleCited byYear
On the behavior of a variant of Hofstadter’s Q-sequence
B Balamohan, A Kuznetsov, S Tanny
J. Integer Sequences 10, 29, 2007
192007
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
152011
Asynchronous exploration of an unknown anonymous dangerous graph with O (1) pebbles
B Balamohan, S Dobrev, P Flocchini, N Santoro
International Colloquium on Structural Information and Communicationá…, 2012
142012
Improving the optimal bounds for black hole search in rings
B Balamohan, P Flocchini, A Miri, N Santoro
International Colloquium on Structural Information and Communicationá…, 2011
112011
A combinatorial interpretation for certain relatives of the Conolly sequence
B Balamohan, Z Li, S Tanny
Journal of Integer Sequences 11 (2), 3, 2008
102008
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
82010
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
52016
Accelerating the scalar multiplication on genus 2 hyperelliptic curve cryptosystems
B Balamohan
University of Ottawa (Canada), 2010
12010
Efficient Mechanisms for Exploration of Dangerous Graphs and for Inter-agent Communication
B Balamohan
UniversitÚ d'Ottawa/University of Ottawa, 2013
2013
The crossing number of P (10, 3) is six
B Balamohan, RB Richter
Ars Combinatoria 85, 65-70, 2007
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
2007
The system can't perform the operation now. Try again later.
Articles 1–11