| Year |
Citation |
Score |
| 2022 |
Jamalzadeh S, Barker K, González AD, Radhakrishnan S. Protecting infrastructure performance from disinformation attacks. Scientific Reports. 12: 12707. PMID 35882902 DOI: 10.1038/s41598-022-16832-w |
0.315 |
|
| 2018 |
Guo W, Mahendran V, Radhakrishnan S. Join and spilt TCP for SDN networks: Architecture, implementation, and evaluation Computer Networks. 137: 160-172. DOI: 10.1016/J.Comnet.2018.03.022 |
0.392 |
|
| 2015 |
Chen Y, Radhakrishnan S, Dhall S, Karabuk S. The service overlay network design problem for interactive internet applications Computers & Operations Research. 57: 73-82. DOI: 10.1016/J.Cor.2014.11.003 |
0.459 |
|
| 2014 |
Deepalakshmi P, Radhakrishnan S. An ant colony-based, receiver-initiated multicast mesh protocol for collaborative applications of mobile ad hoc networks European Transactions On Telecommunications. 25: 354-369. DOI: 10.1002/ett.2574 |
0.314 |
|
| 2013 |
Chatterjee A, Radhakrishnan S, Antonio JK. Data Structures and Algorithms for Counting Problems on Graphs using GPU International Journal of Networking and Computing. 3: 264-288. DOI: 10.15803/Ijnc.3.2_264 |
0.368 |
|
| 2012 |
Zheng T, Radhakrishnan S, Sarangan V. A switch agent for wireless sensor nodes with dual interfaces: Implementation and evaluation Tsinghua Science and Technology. 17: 586-598. DOI: 10.1109/Tst.2012.6314534 |
0.341 |
|
| 2012 |
Chen YR, Radhakrishnan S, Dhall SK, Karabuk S. On multi-stream multi-source multicast routing Globecom - Ieee Global Telecommunications Conference. 1926-1931. DOI: 10.1016/J.Comnet.2013.05.012 |
0.458 |
|
| 2011 |
Radhakrishnan S, Banik SM, Sarangan V, Sekharan CN. Delay constrained subtree homeomorphism problem with applications Ieee Transactions On Parallel and Distributed Systems. 22: 1978-1985. DOI: 10.1109/Tpds.2011.110 |
0.673 |
|
| 2011 |
Sekharan CN, Banik SM, Radhakrishnan S. On the heterogeneous postal delivery model for multicasting Journal of Communications and Networks. 13: 536-543. DOI: 10.1109/Jcn.2011.6112311 |
0.66 |
|
| 2010 |
Vijayalakshmi K, Radhakrishnan S. A novel hybrid immune-based GA for dynamic routing to multiple destinations for overlay networks Soft Computing. 14: 1227-1239. DOI: 10.1007/s00500-009-0534-x |
0.338 |
|
| 2008 |
Banik SM, Radhakrishnan S, Sarangan V, Sekharan CN. Implementation of distributed floor control protocols on overlay networks Ieee Transactions On Parallel and Distributed Systems. 19: 1057-1070. DOI: 10.1109/Tpds.2007.70807 |
0.679 |
|
| 2008 |
Sarangan V, Devarapalli MR, Radhakrishnan S. A framework for fast RFID tag reading in static and mobile environments Computer Networks. 52: 1058-1073. DOI: 10.1016/J.Comnet.2007.12.002 |
0.332 |
|
| 2008 |
Ravi R, Radhakrishnan S. Provisioning QoS in virtual private network using dynamic scheduling Journal of Computer Science. 4: 1-5. |
0.34 |
|
| 2007 |
Banik SM, Radhakrishnan S, Sekharan CN. Multicast routing with delay and delay variation constraints for collaborative applications on overlay networks Ieee Transactions On Parallel and Distributed Systems. 18: 421-431. DOI: 10.1109/Tpds.2007.45 |
0.698 |
|
| 2006 |
Kim J, Radhakrishnan S, Jang J. Cost Optimization in SIS Model of Worm Infection Etri Journal. 28: 692-695. DOI: 10.4218/Etrij.06.0206.0026 |
0.324 |
|
| 2005 |
Lee M, Radhakrishnan S. Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph Discrete Applied Mathematics. 152: 266-272. DOI: 10.1016/J.Dam.2005.03.010 |
0.328 |
|
| 2003 |
Radhakrishnan S, Racherla G, Sekharan CN, Rao NSV, Batsell SG. Protocol for dynamic ad-hoc networks using distributed spanning trees Wireless Networks. 9: 673-686. DOI: 10.1023/A:1025916720618 |
0.419 |
|
| 2003 |
Rao NSV, Bang Y, Radhakrishnan S, Wu Q, Iyengar SS, Choo H. NetLets: measurement-based routing daemons for low end-to-end delays over networks Computer Communications. 26: 834-844. DOI: 10.1016/S0140-3664(02)00217-7 |
0.446 |
|
| 2003 |
Racherla G, Radhakrishnan S, Sekharan CN. Performance evaluation of wireless TCP with rerouting in mobile networks Computer Communications. 26: 542-551. DOI: 10.1016/S0140-3664(02)00145-7 |
0.365 |
|
| 2002 |
Ali TH, Radhakrishnan S, Pulat S, Gaddipati NC. Relay Network Design In Freight Transportation Systems Transportation Research Part E-Logistics and Transportation Review. 38: 405-422. DOI: 10.1016/S1366-5545(02)00016-9 |
0.428 |
|
| 2000 |
DeBrunner V, DeBrunner L, Wang L, Radhakrishnan S. Error control and concealment for image transmission Ieee Communications Surveys and Tutorials. 3: 2-9. DOI: 10.1109/Comst.2000.5340717 |
0.312 |
|
| 2000 |
Racherla G, Radhakrishnan S, DeBrunner LS. Parameterization of efficient dynamic reconfigurable trees Journal of Systems Architecture. 46: 951-954. DOI: 10.1016/S1383-7621(99)00047-8 |
0.346 |
|
| 2000 |
Bang YC, Radhakrishnan S, Rao NSV, Batsell SG. On update algorithms for quickest paths Computer Communications. 23: 1064-1068. DOI: 10.1016/S0140-3664(00)00158-4 |
0.456 |
|
| 1994 |
Joshi DS, Radhakrishnan S, Chandrasekharan N. The k-neighbor, r-domination problems on interval graphs European Journal of Operational Research. 79: 352-368. DOI: 10.1016/0377-2217(94)90364-6 |
0.309 |
|
| 1993 |
Kazmierczak A, Radhakrishnan S. Optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing Proceedings of the 5th Ieee Symposium On Parallel and Distributed Processing. 486-489. DOI: 10.1109/71.841748 |
0.376 |
|
| 1993 |
Subbiah R, Iyengar SS, Radhakrishnan S, Kashyap RL. An optimal distributed algorithm for recognizing mesh-connected networks Theoretical Computer Science. 120: 261-278. DOI: 10.1016/0304-3975(93)90291-Z |
0.433 |
|
| Show low-probability matches. |