Sledovat
C.Pandu Rangan
C.Pandu Rangan
Professor, Department of Computer Science and Engg, IIT-Madras, India.
E-mailová adresa ověřena na: cse.iitm.ac.in - Domovská stránka
Název
Citace
Citace
Rok
A unified approach to domination problems on interval graphs
G Ramalingam, CP Rangan
Information Processing Letters 27 (5), 271-274, 1988
1561988
Linear algorithm for optimal path cover problem on interval graphs
SR Arikati, CP Rangan
Information Processing Letters 35 (3), 149-153, 1990
1351990
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, J Kamps, M Lalmas, A Trotman
Springer, 2008
108*2008
Optimal perfectly secure message transmission
K Srinathan, A Narayanan, CP Rangan
Annual International Cryptology Conference, 545-561, 2004
1032004
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
1012002
Algorithmic aspects of clique-transversal and clique-independent sets
V Guruswami, CP Rangan
Discrete Applied Mathematics 100 (3), 183-202, 2000
1012000
Round-optimal and efficient verifiable secret sharing
M Fitzi, J Garay, S Gollakota, CP Rangan, K Srinathan
Theory of Cryptography Conference, 329-342, 2006
912006
Rational secret sharing with repeated games
S Maleka, A Shareef, CP Rangan
International Conference on Information Security Practice and Experience …, 2008
882008
Tree 3-spanners on interval, permutation and regular bipartite graphs
MS Madanlal, G Venkatesan, CP Rangan
Information Processing Letters 59 (2), 97-102, 1996
761996
Restrictions of minimum spanner problems
G Venkatesan, U Rotics, MS Madanlal, JA Makowsky, CP Rangan
Information and computation 136 (2), 143-164, 1997
711997
Clique transversal and clique independence on comparability graphs
V Balachandran, P Nagavamsi, CP Rangan
Information processing letters 58 (4), 181-184, 1996
681996
Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing
S Selvi, SS Vivek, CP Rangan
International conference on information security and cryptology, 75-92, 2009
672009
Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing
S Selvi, SS Vivek, CP Rangan
International conference on information security and cryptology, 75-92, 2009
672009
Efficient and provably secure certificateless multi-receiver signcryption
S Selvi, SS Vivek, D Shukla, P Rangan Chandrasekaran
International Conference on Provable Security, 52-67, 2008
672008
Treewidth of circular-arc graphs
R Sundaram, KS Singh, CP Rangan
SIAM Journal on Discrete Mathematics 7 (4), 647-655, 1994
661994
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
631993
The round complexity of verifiable secret sharing revisited
A Patra, A Choudhary, T Rabin, CP Rangan
Annual International Cryptology Conference, 487-504, 2009
602009
Identity based aggregate signcryption schemes
S Selvi, SS Vivek, J Shriram, S Kalaivani, CP Rangan
International Conference on Cryptology in India, 378-397, 2009
562009
A linear space algorithm for the LCS problem
SK Kumar, CP Rangan
Acta Informatica 24 (3), 353-362, 1987
561987
Weighted independent perfect domination on cocomparability graphs
GJ Chang, CP Rangan, SR Coorg
Discrete Applied Mathematics 63 (3), 215-222, 1995
551995
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20