Balasingham Balamohan

According to our database, Balasingham Balamohan authored at least 5 papers between 2011 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Exploring an unknown dangerous graph with a constant number of tokens.

Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro

Theor. Comput. Sci., 2016

2012

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles.

Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro

Proceedings of the Structural Information and Communication Complexity, 2012

2011

ACCELERATING THE SCALAR MULTIPLICATION ON GENUS 2 HYPERELLIPTIC CURVE CRYPTOSYSTEMS.

Balasingham Balamohan

IACR Cryptol. ePrint Arch., 2011

Time Optimal Algorithms for Black Hole Search in Rings.

Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro

Discret. Math. Algorithms Appl., 2011

Improving the Optimal Bounds for Black Hole Search in Rings.

Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro

Proceedings of the Structural Information and Communication Complexity, 2011