S. M. Nagabhushan Kaliyur

According to our database1, S. M. Nagabhushan Kaliyur authored at least 2 papers between 2003 and 2006.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
An entropy-constrained algorithm for routing of communication networks.
Comput. Commun., 2006

2003
Evaluation of neural and entropy-constrained routing of communication networks.
Proceedings of the International Joint Conference on Neural Networks, 2003


  Loading...