C.Pandu Rangan
C.Pandu Rangan
Professor, Department of Computer Science and Engg, IIT-Madras, India.
Email verificata su cse.iitm.ac.in - Home page
Titolo
Citata da
Citata da
Anno
Description logics
F Baader, I Horrocks, U Sattler
Handbook on ontologies, 3-28, 2004
4172004
List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition
V Guruswami
Springer Science & Business Media, 2004
3122004
Embedded systems design: the ARTIST roadmap for research and development
B Bouyssounouse
Springer Science & Business Media, 2005
1712005
A unified approach to domination problems on interval graphs
G Ramalingam, CP Rangan
Information Processing Letters 27 (5), 271-274, 1988
1441988
Linear algorithm for optimal path cover problem on interval graphs
SR Arikati, CP Rangan
Information Processing Letters 35 (3), 149-153, 1990
1331990
An experimental study on distance-based graph drawing
U Brandes, C Pich
International Symposium on Graph Drawing, 218-229, 2008
1182008
Coevolutionary fuzzy modeling
CA Peña Reyes
EPFL, 2002
1132002
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
1022002
Algorithmic aspects of clique-transversal and clique-independent sets
V Guruswami, CP Rangan
Discrete Applied Mathematics 100 (3), 183-202, 2000
1012000
Optimal perfectly secure message transmission
K Srinathan, A Narayanan, CP Rangan
Annual International Cryptology Conference, 545-561, 2004
972004
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
91*2008
Rational secret sharing with repeated games
S Maleka, A Shareef, CP Rangan
International Conference on Information Security Practice and Experience …, 2008
892008
Round-optimal and efficient verifiable secret sharing
M Fitzi, J Garay, S Gollakota, CP Rangan, K Srinathan
Theory of Cryptography Conference, 329-342, 2006
862006
Tree 3-spanners on interval, permutation and regular bipartite graphs
MS Madanlal, G Venkatesan, CP Rangan
Information Processing Letters 59 (2), 97-102, 1996
721996
Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing
SSD Selvi, SS Vivek, CP Rangan
International conference on information security and cryptology, 75-92, 2009
702009
Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing
SSD Selvi, SS Vivek, CP Rangan
International conference on information security and cryptology, 75-92, 2009
702009
Clique transversal and clique independence on comparability graphs
V Balachandran, P Nagavamsi, CP Rangan
Information processing letters 58 (4), 181-184, 1996
681996
Restrictions of minimum spanner problems
G Venkatesan, U Rotics, MS Madanlal, JA Makowsky, CP Rangan
Information and computation 136 (2), 143-164, 1997
631997
Treewidth of circular-arc graphs
R Sundaram, KS Singh, CP Rangan
SIAM Journal on Discrete Mathematics 7 (4), 647-655, 1994
621994
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
621993
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20