| Online routing in triangulations A Aggarwal, CP Rangan, P Bose, P Morin Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999 | 269 | 1999 |
| Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots A Aggarwal, CP Rangan, P Flocchini, G Prencipe, N Santoro, P Widmayer Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999 | 188 | 1999 |
| A unified approach to domination problems on interval graphs G Ramalingam, CP Rangan Information Processing Letters 27 (5), 271-274, 1988 | 176 | 1988 |
| Linear algorithm for optimal path cover problem on interval graphs SR Arikati, CP Rangan Information Processing Letters 35 (3), 149-153, 1990 | 147 | 1990 |
| Upper bounds for MaxSat: Further improved A Aggarwal, CP Rangan, N Bansal, V Raman Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999 | 125 | 1999 |
| Optimal perfectly secure message transmission K Srinathan, A Narayanan, CP Rangan Annual International Cryptology Conference, 545-561, 2004 | 109 | 2004 |
| On perfectly secure communication over arbitrary networks MVNA Kumar, PR Goundan, K Srinathan, CP Rangan Proceedings of the twenty-first annual symposium on Principles of …, 2002 | 106 | 2002 |
| Algorithmic aspects of clique-transversal and clique-independent sets V Guruswami, CP Rangan Discrete Applied Mathematics 100 (3), 183-202, 2000 | 106 | 2000 |
| Round-optimal and efficient verifiable secret sharing M Fitzi, J Garay, S Gollakota, CP Rangan, K Srinathan Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006 …, 2006 | 98 | 2006 |
| Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007, Dagstuhl Castle, Germany, December 17-19, 2007 … N Fuhr Springer Science & Business Media, 2008 | 95* | 2008 |
| Rational secret sharing with repeated games S Maleka, A Shareef, CP Rangan Information Security Practice and Experience: 4th International Conference …, 2008 | 95 | 2008 |
| Tree 3-spanners on interval, permutation and regular bipartite graphs MS Madanlal, G Venkatesan, CP Rangan Information Processing Letters 59 (2), 97-102, 1996 | 84 | 1996 |
| Efficient and provably secure certificateless multi-receiver signcryption SSD Selvi, SS Vivek, D Shukla, P Rangan Chandrasekaran Provable Security: Second International Conference, ProvSec 2008, Shanghai …, 2008 | 81 | 2008 |
| Restrictions of minimum spanner problems G Venkatesan, U Rotics, MS Madanlal, JA Makowsky, CP Rangan Information and computation 136 (2), 143-164, 1997 | 74 | 1997 |
| Clique transversal and clique independence on comparability graphs V Balachandran, P Nagavamsi, CP Rangan Information processing letters 58 (4), 181-184, 1996 | 74 | 1996 |
| Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing SSD Selvi, SS Vivek, CP Rangan Information Security and Cryptology: 5th International Conference, Inscrypt …, 2010 | 73 | 2010 |
| Optimal path cover problem on block graphs and bipartite permutation graphs R Srikant, R Sundaram, KS Singh, CP Rangan Theoretical Computer Science 115 (2), 351-357, 1993 | 71 | 1993 |
| Identity based aggregate signcryption schemes SSD Selvi, SS Vivek, J Shriram, S Kalaivani, CP Rangan Progress in Cryptology-INDOCRYPT 2009: 10th International Conference on …, 2009 | 70 | 2009 |
| The round complexity of verifiable secret sharing revisited A Patra, A Choudhary, T Rabin, CP Rangan Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009 | 67 | 2009 |
| Treewidth of circular-arc graphs R Sundaram, KS Singh, CP Rangan SIAM Journal on Discrete Mathematics 7 (4), 647-655, 1994 | 67 | 1994 |
S.Sree VivekICU MedicalE-mail confirmado em icumed.com