 | 2012 |
| 17 |  | R. Ashok Kumar,
K. Ganesan:
A novel dynamic pricing scheme for contributing peers in the VoD system.
Multimedia Tools Appl. 58(3): 613-632 (2012) |
| 2010 |
| 16 |  | R. Ashok Kumar,
K. Ganesan:
Video segmentation using Metropolis Hastings Algorithm for the VCR operations.
IJAMC 4(3): 274-297 (2010) |
| 2009 |
| 15 |  | R. Ashok Kumar,
K. Ganesan:
A Reliable Replication Strategy for VoD System using Markov Chain
CoRR abs/0912.1011: (2009) |
| 14 |  | R. Ashok Kumar,
K. Hareesh,
K. Ganesan,
D. H. Manjaiah:
M-chaining scheme for VoD application on cluster-based Markov process.
IJAMC 3(3): 277-289 (2009) |
| 2006 |
| 13 |  | K. Ganesan,
R. Muthukumar,
K. Murali:
Look-up Table Based Chaotic Encryption of Audio Files.
APCCAS 2006: 1951-1954 |
| 12 |  | K. Ganesan,
R. Anandan:
Version Control using Cryptographic Access Control.
ICIT 2006: 192-196 |
| 11 |  | K. Ganesan,
P. Veeramani:
Fuzzy linear programs with trapezoidal fuzzy numbers.
Annals OR 143(1): 305-315 (2006) |
| 2005 |
| 10 |  | K. Ganesan,
P. Veeramani:
On Arithmetic Operations of Interval Numbers.
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 13(6): 619-632 (2005) |
| 2000 |
| 9 |  | K. Ganesan,
Taghi M. Khoshgoftaar,
Edward B. Allen:
Verifying Requirements Through Mathematical Modelling and Animation.
International Journal of Software Engineering and Knowledge Engineering 10(2): 139-152 (2000) |
| 1998 |
| 8 |  | S. M. Smith,
K. Ganesan,
P. E. An,
S. E. Dunn:
Strategies for simultaneous multiple autonomous underwater vehicle operation and control.
Int. J. Systems Science 29(10): 1045-1063 (1998) |
| 1996 |
| 7 |  | C. Vasudevan,
K. Ganesan:
Case-based path planning for autonomous underwater vehicles.
Auton. Robots 3(2-3): 79-89 (1996) |
| 1994 |
| 6 |  | K. Ganesan:
One-Way Functions and the Isomorphism Conjecture.
Theor. Comput. Sci. 129(2): 309-321 (1994) |
| 1992 |
| 5 |  | K. Ganesan:
One-way Functions and Isomorphism Conjecture.
FSTTCS 1992: 152-163 |
| 4 |  | K. Ganesan,
Steven Homer:
Complete Problems and Strong Polynomial Reducibilities.
SIAM J. Comput. 21(4): 733-742 (1992) |
| 1991 |
| 3 |  | K. B. Lakshmanan,
Bala Ravikumar,
K. Ganesan:
Coping with Erroneous Information while Sorting.
IEEE Trans. Computers 40(9): 1081-1084 (1991) |
| 1989 |
| 2 |  | K. Ganesan,
Steven Homer:
Complete Problems and Strong Polynomial Reducibilities.
STACS 1989: 240-250 |
| 1987 |
| 1 |  | Bala Ravikumar,
K. Ganesan,
K. B. Lakshmanan:
On Selecting the Largest Element in Spite of Erroneous Information.
STACS 1987: 88-99 |