Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
C. Pandu Rangan
Chandrasekaran Pandu Rangan
2010 – today
- 2012
[j63]Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan: On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. J. ACM 59(5): 22 (2012)- [c122]K. Preetha Mathew, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan: An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model. ACISP 2012: 166-179
- [c121]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Deterministic Identity Based Signature Scheme and Its Application for Aggregate Signatures. ACISP 2012: 280-293
- [c120]Amitash Ramesh, Soumya Ramesh, Sudarshan Iyengar, Vinod Sekhar, C. Pandu Rangan: Obstacles Incentivize Human Learning: A Network Theoretic Study. ASONAM 2012: 1295-1300
- [c119]M. Vijesh, Sudarshan Iyengar, S. M. Vijay Mahantesh, Amitash Ramesh, C. Pandu Rangan, Veni Madhavan: A Navigation Algorithm Inspired by Human Navigation. ASONAM 2012: 1309-1314
- [c118]K. Preetha Mathew, Sachin Vasant, Sridhar Venkatesan, C. Pandu Rangan: A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions. ISPEC 2012: 144-157
- [c117]S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan: Compact Stateful Encryption Schemes with Ciphertext Verifiability. IWSEC 2012: 87-104
- [c116]Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram: Cache Me If You Can: Capacitated Selfish Replication Games. LATIN 2012: 420-432
- [c115]S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan: ID Based Signcryption Scheme in Standard Model. ProvSec 2012: 35-52
- [c114]Chaya Ganesh, C. Pandu Rangan: Optimal Parameters for Efficient Two-Party Computation Protocols. WISTP 2012: 128-143
- [i61]S. Sharmila Deva Selvi, Subhashini Venugopalan, C. Pandu Rangan: On the Security of Attribute Based Signature Schemes. IACR Cryptology ePrint Archive 2012: 62 (2012)
- [i60]S. Sree Vivek, S. Sharmila Deva Selvi, Guhan Balasubramanian, C. Pandu Rangan: Strongly Unforgeable Proxy Re-Signature Schemes in the Standard model. IACR Cryptology ePrint Archive 2012: 80 (2012)
- [i59]S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan: Stronger Public Key Encryption Schemes Withstanding RAM Scraper Like Attacks. IACR Cryptology ePrint Archive 2012: 118 (2012)
- [i58]S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan: ID Based Signcryption Scheme in Standard Model. IACR Cryptology ePrint Archive 2012: 392 (2012)
- [i57]Preetha Mathew K, Sachin Vasant, C. Pandu Rangan: ON PROVABLY SECURE CODE-BASED SIGNATURE AND SIGNCRYPTION SCHEME. IACR Cryptology ePrint Archive 2012: 585 (2012)
- 2011
- [j62]T. V. Thirumala Reddy, C. Pandu Rangan: Variants of Spreading Messages. J. Graph Algorithms Appl. 15(5): 683-699 (2011)
- [j61]Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan: Secure message transmission in asynchronous networks. J. Parallel Distrib. Comput. 71(8): 1067-1074 (2011)
- [c113]Arpita Patra, C. Pandu Rangan: Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience. ICITS 2011: 206-226
- [c112]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Identity Based Online/Offline Encryption and Signcryption Schemes Revisited. InfoSecHiComNet 2011: 111-127
- [c111]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Identity-Based Deterministic Signature Scheme without Forking-Lemma. IWSEC 2011: 79-95
- [c110]S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan: CCA Secure Certificateless Encryption Schemes based on RSA. SECRYPT 2011: 208-217
- [c109]R. Shyam Sundar, C. Pandu Rangan: Bit-depth scalable video coding using error residual correction. VCIP 2011: 1-4
- [c108]Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan: A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. WALCOM 2011: 191-201
- [i56]B. Vignesh, Siddharth S, Sridhar Ramachandran, Sudarshan Iyengar, C. Pandu Rangan: A Lookahead algorithm to compute Betweenness Centrality. CoRR abs/1108.3286 (2011)
- [i55]Esha Ghosh, Subhas Kumar Ghosh, C. Pandu Rangan: On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs. CoRR abs/1109.1706 (2011)
- [i54]William K. Moses Jr., C. Pandu Rangan: Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security. CoRR abs/1112.4033 (2011)
- [i53]William K. Moses Jr., C. Pandu Rangan: Rational Secret Sharing with Honest Players over an Asynchronous Channel. IACR Cryptology ePrint Archive 2011: 68 (2011)
- [i52]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Identity Based Deterministic Signature Scheme Without Forking-Lemma. IACR Cryptology ePrint Archive 2011: 217 (2011)
- [i51]S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan: Compact CCA-Secure Encryption with Ciphertext Verifiability. IACR Cryptology ePrint Archive 2011: 361 (2011)
- [i50]S. Sharmila Deva Selvi, S. Sree Vivek, Dhinakaran Vinayagamurthy, C. Pandu Rangan: On the Security of ID Based Signcryption Schemes. IACR Cryptology ePrint Archive 2011: 664 (2011)
- [i49]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Deterministic Identity Based Signature Scheme and its Application for Aggregate Signatures. IACR Cryptology ePrint Archive 2011: 695 (2011)
- 2010
- [j60]Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan: Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. IJACT 2(2): 159-197 (2010)
- [j59]Balasubramanian Sivan, S. Harini, C. Pandu Rangan: On Conditional Covering Problem. Mathematics in Computer Science 3(1): 97-107 (2010)
- [c107]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. AFRICACRYPT 2010: 184-202
- [c106]Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan: The Round Complexity of Verifiable Secret Sharing: The Statistical Case. ASIACRYPT 2010: 431-447
- [c105]Swarun Kumar, Shivank Agrawal, Subha Balaraman, C. Pandu Rangan: Attribute Based Signatures for Bounded Multi-level Threshold Circuits. EuroPKI 2010: 141-154
- [c104]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: On Communication Complexity of Secure Message Transmission in Directed Networks. ICDCN 2010: 42-53
- [c103]Anuj Gupta, Sandeep Hans, Kannan Srinathan, C. Pandu Rangan: On Composability of Reliable Unicast and Broadcast. ICDCN 2010: 54-66
- [c102]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Certificateless KEM and Hybrid Signcryption Schemes Revisited. ISPEC 2010: 294-307
- [c101]Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan: Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles. ISPEC 2010: 359-376
- [c100]Arpita Patra, C. Pandu Rangan: Communication Optimal Multi-valued Asynchronous Broadcast Protocol. LATINCRYPT 2010: 162-177
- [c99]S. Sharmila Deva Selvi, S. Sree Vivek, Chandrasekaran Pandu Rangan, S. Priti: On the Security of Identity Based Threshold Unsigncryption Schemes. NSS 2010: 554-559
- [c98]S. Sharmila Deva Selvi, S. Sree Vivek, S. Gopi Nath, C. Pandu Rangan: Identity Based Self Delegated Signature - Self Proxy Signatures. NSS 2010: 568-573
- [c97]R. Shyam Sundar, C. Pandu Rangan: Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding. PCM (2) 2010: 121-135
- [c96]Arpita Patra, C. Pandu Rangan: Brief announcement: communication efficient asynchronous byzantine agreement. PODC 2010: 243-244
- [c95]Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. PODC 2010: 245-246
- [c94]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Identity Based Public Verifiable Signcryption Scheme. ProvSec 2010: 244-260
- [c93]S. Sharmila Deva Selvi, S. Sree Vivek, Sakhi S. Anand, C. Pandu Rangan: An Identity based Ring Signcryption Scheme with Public Verifiability. SECRYPT 2010: 362-371
- [c92]Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan: Forcing Out a Confession - Threshold Discernible Ring Signatures. SECRYPT 2010: 379-388
- [c91]T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan: Variants of Spreading Messages. WALCOM 2010: 240-251
- [c90]D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan: Pathwidth and Searching in Parameterized Threshold Graphs. WALCOM 2010: 293-304
- [i48]Arpita Patra, C. Pandu Rangan: Communication and Round Efficient Information Checking Protocol. CoRR abs/1004.3504 (2010)
- [i47]Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram: Capacitated Caching Games. CoRR abs/1007.2694 (2010)
- [i46]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. IACR Cryptology ePrint Archive 2010: 7 (2010)
- [i45]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Security Weaknesses in Two Certificateless Signcryption Schemes. IACR Cryptology ePrint Archive 2010: 92 (2010)
- [i44]Shivank Agrawal, Swarun Kumar, Amjed Shareef, C. Pandu Rangan: Sanitizable signatures with strong transparency in the standard model. IACR Cryptology ePrint Archive 2010: 175 (2010)
- [i43]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Identity Based Online/Offline Encryption Scheme. IACR Cryptology ePrint Archive 2010: 178 (2010)
- [i42]Amjed Shareef, Akshay Agrawal, C. Pandu Rangan: Collusion Free Protocol for Correlated Element Selection Problem. IACR Cryptology ePrint Archive 2010: 238 (2010)
- [i41]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Identity Based Public Verifiable Signcryption Scheme. IACR Cryptology ePrint Archive 2010: 343 (2010)
- [i40]S. Sharmila Deva Selvi, S. Sree Vivek, S. Gopi Nath, C. Pandu Rangan: Identity Based Self Delegated Signature - Self Proxy Signatures. IACR Cryptology ePrint Archive 2010: 359 (2010)
- [i39]S. Sharmila Deva Selvi, S. Sree Vivek, S. Priti, C. Pandu Rangan: On the Security of Identity Based Threshold Unsigncryption Schemes. IACR Cryptology ePrint Archive 2010: 360 (2010)
- [i38]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Identity Based Online/Offline Signcryption Scheme. IACR Cryptology ePrint Archive 2010: 376 (2010)
- [i37]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: CCA2 Secure Certificateless Encryption Schemes Based on RSA. IACR Cryptology ePrint Archive 2010: 459 (2010)
- [i36]S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, C. Pandu Rangan: Identity Based Partial Aggregate Signature Scheme Without Pairing. IACR Cryptology ePrint Archive 2010: 461 (2010)
- [i35]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: A Suite of Identity Based Aggregate Signatures and a Multi-Signature Scheme from RSA. IACR Cryptology ePrint Archive 2010: 493 (2010)
2000 – 2009
- 2009
- [j58]Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra: Perfectly reliable and secure message transmission tolerating mobile adversary. IJACT 1(3): 200-224 (2009)
- [c89]G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. CANS 2009: 21-40
- [c88]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. ASIACCS 2009: 171-182
- [c87]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing. Inscrypt 2009: 75-92
- [c86]Shivank Agrawal, Swarun Kumar, Amjed Shareef, C. Pandu Rangan: Sanitizable Signatures with Strong Transparency in the Standard Model. Inscrypt 2009: 93-107
- [c85]S. Sharmila Deva Selvi, S. Sree Vivek, Shilpi Nayak, C. Pandu Rangan: Breaking and Building of Threshold Signcryption Schemes. Inscrypt 2009: 108-123
- [c84]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. Inscrypt 2009: 179-197
- [c83]Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan: The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009: 487-504
- [c82]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan: On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009: 148-162
- [c81]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. ICITS 2009: 74-92
- [c80]S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan: Identity Based Aggregate Signcryption Schemes. INDOCRYPT 2009: 378-397
- [c79]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. INDOCRYPT 2009: 398-417
- [c78]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: On the Security of Identity Based Ring Signcryption Schemes. ISC 2009: 310-325
- [c77]T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan: The Guarding Problem - Complexity and Approximation. IWOCA 2009: 460-470
- [c76]S. Sharmila Deva Selvi, S. Sree Vivek, Rahul Srinivasan, Chandrasekaran Pandu Rangan: An Efficient Identity-Based Signcryption Scheme for Multiple Receivers. IWSEC 2009: 71-88
- [c75]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Simple and efficient asynchronous byzantine agreement with optimal resilience. PODC 2009: 92-101
- [c74]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Brief announcement: perfectly secure message transmission in directed networks re-visited. PODC 2009: 278-279
- [c73]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Breaking and Fixing of an Identity Based Multi-Signcryption Scheme. ProvSec 2009: 61-75
- [c72]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Information Theoretically Secure Multi Party Set Intersection Re-visited. Selected Areas in Cryptography 2009: 71-91
- [c71]S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan: On the Security of Two Ring Signcryption Schemes. SECRYPT 2009: 219-224
- [c70]S. Sree Vivek, S. Sharmila Deva Selvi, S. Gopi Nath, C. Pandu Rangan: Breaking and Building of Group Inside Signature. SecureComm 2009: 330-339
- [c69]Balasubramanian Sivan, S. Harini, C. Pandu Rangan: Core and Conditional Core Path of Specified Length in Special Classes of Graphs. WALCOM 2009: 262-273
- [i34]S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan: ON THE SECURITY OF TWO RING SIGNCRYPTION SCHEMES. IACR Cryptology ePrint Archive 2009: 52 (2009)
- [i33]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate. IACR Cryptology ePrint Archive 2009: 87 (2009)
- [i32]S. Sree Vivek, S. Sharmila Deva Selvi, Deepanshu Shukla, C. Pandu Rangan: Scalable Compilers for Group Key Establishment : Two/Three Party to Group. IACR Cryptology ePrint Archive 2009: 115 (2009)
- [i31]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Information Theoretically Secure Multi Party Set Intersection Re-Visited. IACR Cryptology ePrint Archive 2009: 116 (2009)
- [i30]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: On the security of Identity Based Ring Signcryption Schemes. IACR Cryptology ePrint Archive 2009: 144 (2009)
- [i29]S. Sree Vivek, S. Sharmila Deva Selvi, S. Gopi Nath, C. Pandu Rangan: Breaking and Building of Group Inside Signature. IACR Cryptology ePrint Archive 2009: 188 (2009)
- [i28]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Breaking and Fixing of an Identity Based Multi-Signcryption Scheme. IACR Cryptology ePrint Archive 2009: 235 (2009)
- [i27]S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan: Security Analysis of Aggregate signature and Batch verification signature schemes. IACR Cryptology ePrint Archive 2009: 290 (2009)
- [i26]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction Without Pairing. IACR Cryptology ePrint Archive 2009: 298 (2009)
- [i25]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: A note on the Certificateless Multi-receiver Signcryption Scheme. IACR Cryptology ePrint Archive 2009: 308 (2009)
- [i24]G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security. IACR Cryptology ePrint Archive 2009: 311 (2009)
- [i23]Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan: Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles. IACR Cryptology ePrint Archive 2009: 350 (2009)
- [i22]Arpita Patra, C. Pandu Rangan: Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience. IACR Cryptology ePrint Archive 2009: 433 (2009)
- [i21]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan: Certificateless KEM and Hybrid Signcryption Schemes Revisited. IACR Cryptology ePrint Archive 2009: 462 (2009)
- [i20]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. IACR Cryptology ePrint Archive 2009: 470 (2009)
- [i19]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2009: 492 (2009)
- 2008
- [c68]Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan: Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. ACISP 2008: 170-186
- [c67]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable Message Transmission in Directed Hypergraphs. CANS 2008: 285-303
- [c66]Varad Kirtane, C. Pandu Rangan: RSA-TBOS signcryption with proxy re-encryption. Digital Rights Management Workshop 2008: 59-66
- [c65]S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan, Neha Jain: Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme. EUC (2) 2008: 127-132
- [c64]Amjed Shareef, C. Pandu Rangan: On Optimal Probabilistic Asynchronous Byzantine Agreement. ICDCN 2008: 86-98
- [c63]Bhavani Shankar, Kannan Srinathan, C. Pandu Rangan: Alternative Protocols for Generalized Oblivious Transfer. ICDCN 2008: 304-309
- [c62]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan: Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. ICITS 2008: 137-155
- [c61]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Round Efficient Unconditionally Secure Multiparty Computation Protocol. INDOCRYPT 2008: 185-199
- [c60]Shaik Maleka, Amjed Shareef, C. Pandu Rangan: The deterministic protocol for rational secret sharing. IPDPS 2008: 1-7
- [c59]Shaik Maleka, Amjed Shareef, C. Pandu Rangan: Rational Secret Sharing with Repeated Games. ISPEC 2008: 334-346
- [c58]B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan: On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. PODC 2008: 115-124
- [c57]Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan: Efficient single phase unconditionally secure message transmission with optimum communication complexity. PODC 2008: 457
- [c56]S. Sharmila Deva Selvi, S. Sree Vivek, Deepanshu Shukla, C. Pandu Rangan: Efficient and Provably Secure Certificateless Multi-receiver Signcryption. ProvSec 2008: 52-67
- [c55]S. Sharmila Deva Selvi, S. Sree Vivek, Naga Naresh Karuturi, Ragavendran Gopalakrishnan, C. Pandu Rangan: Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks. PST 2008: 109-120
- [c54]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008: 309-326
- [c53]Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan: Unconditionally reliable message transmission in directed networks. SODA 2008: 1048-1055
- [c52]S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan: Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme. WISA 2008: 115-129
- [i18]Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan: Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. IACR Cryptology ePrint Archive 2008: 86 (2008)
- [i17]Arpita Patra, Ashish Choudhary, B. V. Ashwinkumar, C. Pandu Rangan: Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary. IACR Cryptology ePrint Archive 2008: 101 (2008)
- [i16]Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan: Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. IACR Cryptology ePrint Archive 2008: 141 (2008)
- [i15]Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan: The Round Complexity of Verifiable Secret Sharing Revisited. IACR Cryptology ePrint Archive 2008: 172 (2008)
- [i14]S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan: Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme. IACR Cryptology ePrint Archive 2008: 225 (2008)
- [i13]Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan: Perfectly Secure Message Transmission Tolerating Mixed Adversary. IACR Cryptology ePrint Archive 2008: 232 (2008)
- [i12]S. Sharmila Deva Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan: On the Provable Security of Multi-Receiver Signcryption Schemes. IACR Cryptology ePrint Archive 2008: 238 (2008)
- [i11]Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Statistically Reliable and Secure Message Transmission in Directed Networks. IACR Cryptology ePrint Archive 2008: 262 (2008)
- [i10]Chandrasekar S., Ambika K., C. Pandu Rangan: Signcryption with Proxy Re-encryption. IACR Cryptology ePrint Archive 2008: 276 (2008)
- [i9]Varad Kirtane, C. Pandu Rangan: RSA-TBOS Signcryption with Proxy Re-encryption. IACR Cryptology ePrint Archive 2008: 324 (2008)
- [i8]Varad Kirtane, C. Pandu Rangan: Side Channel Attack Resistant Implementation of Multi-Power RSA using Hensel Lifting. IACR Cryptology ePrint Archive 2008: 368 (2008)
- [i7]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable Message Transmission in Directed Hypergraphs. IACR Cryptology ePrint Archive 2008: 371 (2008)
- [i6]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Round Efficient Unconditionally Secure Multiparty Computation Protocol. IACR Cryptology ePrint Archive 2008: 399 (2008)
- [i5]Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Efficient Asynchronous Byzantine Agreement with Optimal Resilience. IACR Cryptology ePrint Archive 2008: 424 (2008)
- [i4]Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Efficient Asynchronous Multiparty Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2008: 425 (2008)
- [i3]Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan: On Communication Complexity of Perfectly Reliable and Secure Communication in Directed Networks. IACR Cryptology ePrint Archive 2008: 461 (2008)
- [i2]Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Secure Multiparty Set Intersection Re-Visited. IACR Cryptology ePrint Archive 2008: 462 (2008)
- [i1]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary. IACR Cryptology ePrint Archive 2008: 506 (2008)
- 2007
- [c51]Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan: On Proactive Perfectly Secure Message Transmission. ACISP 2007: 461-473
- [c50]K. Anil Kumar, C. Pandu Rangan: Privacy Preserving DBSCAN Algorithm for Clustering. ADMA 2007: 57-68
- [c49]P. Krishna Prasad, C. Pandu Rangan: Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases. ADMA 2007: 146-157
- [c48]Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan: Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. CANS 2007: 80-101
- [c47]P. Krishna Prasad, C. Pandu Rangan: Privacy Preserving CACTUS Algorithm for Clustering over Vertically Partitioned Databases. DMIN 2007: 308-314
- [c46]Avinash V. Varadarajan, Ramarathnam Venkatesan, C. Pandu Rangan: Data structures for limited oblivious execution of programs while preserving locality of reference. Digital Rights Management Workshop 2007: 63-69
- [c45]Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. INDOCRYPT 2007: 101-122
- [c44]
- [c43]Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan: Constant phase efficient protocols for secure message transmission in directed networks. PODC 2007: 322-323
- [c42]Kannan Srinathan, N. R. Prasad, C. Pandu Rangan: On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication. IEEE Symposium on Security and Privacy 2007: 311-320
- [c41]Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan: Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. DISC 2007: 496-498
- [e4]K. Srinathan, C. Pandu Rangan, Moti Yung (Eds.): Progress in Cryptology - INDOCRYPT 2007, 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings. Lecture Notes in Computer Science 4859, Springer 2007, ISBN 978-3-540-77025-1
- 2006
- [j57]Arvind Narayanan, K. Srinathan, C. Pandu Rangan: Perfectly Reliable Message Transmission. Inf. Process. Lett. 100(1): 23-28 (2006)
- [c40]R. C. Chakinala, Abishek Kumarasubramanian, R. Manokaran, Guevara Noubir, C. Pandu Rangan, Ravi Sundaram: Steganographic Communication in Ordered Channels. Information Hiding 2006: 42-57
- [c39]Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan: Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. INDOCRYPT 2006: 221-235
- [c38]Kannan Srinathan, C. Pandu Rangan: Possibility and complexity of probabilistic reliable communication in directed networks. PODC 2006: 265-274
- [c37]P. Krishna Prasad, C. Pandu Rangan: Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases. Secure Data Management 2006: 84-99
- [c36]R. C. Chakinala, Abishek Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman: Playing push vs pull: models and algorithms for disseminating dynamic data in networks. SPAA 2006: 244-253
- [c35]Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan: Round-Optimal and Efficient Verifiable Secret Sharing. TCC 2006: 329-342
- 2004
- [c34]K. Srinathan, Arvind Narayanan, C. Pandu Rangan: Optimal Perfectly Secure Message Transmission. CRYPTO 2004: 545-561
- [c33]D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan: Brief announcement: on the round complexity of distributed consensus over synchronous networks. PODC 2004: 397
- [c32]D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan: On Byzantine Agreement over (2, 3)-Uniform Hypergraphs. DISC 2004: 450-464
- 2003
- [c31]
- [c30]V. Vinod, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, Kwangjo Kim: On the Power of Computational Secret Sharing. INDOCRYPT 2003: 162-176
- [c29]S. Amitanand, I. Sanketh, K. Srinathan, V. Vinod, C. Pandu Rangan: Distributed consensus in the presence of sectional faults. PODC 2003: 202-210
- [c28]K. Srinathan, V. Vinod, C. Pandu Rangan: Brief announcement: efficient perfectly secure communication over synchronous networks. PODC 2003: 252
- 2002
- [c27]M. V. N. Ashwin Kumar, K. Srinathan, C. Pandu Rangan: Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries. ACISP 2002: 497-512
- [c26]K. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan: Asynchronous Secure Communication Tolerating Mixed Adversaries. ASIACRYPT 2002: 224-242
- [c25]K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan: Theory of Equal-Flows in Networks. COCOON 2002: 514-524
- [c24]B. Prabhu, K. Srinathan, C. Pandu Rangan: Asynchronous Unconditionally Secure Computation: An Efficiency Improvement. INDOCRYPT 2002: 93-107
- [c23]K. Srinathan, N. Tharani Rajan, C. Pandu Rangan: Non-perfect Secret Sharing over General Access Structures. INDOCRYPT 2002: 409-421
- [c22]M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan: On perfectly secure cmmunication over arbitrary networks. PODC 2002: 193-202
- [c21]B. Prabhu, K. Srinathan, C. Pandu Rangan: Trading Players for Efficiency in Unconditional Multiparty Computation. SCN 2002: 342-353
- 2001
- [j56]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Kr-Packing Problem. Computing 66(1): 79-89 (2001)
- [c20]K. Srinathan, C. Pandu Rangan, V. Kamakoti: Toward Optimal Player Weights in Secure Distributed Protocols. INDOCRYPT 2001: 232-241
- [e3]C. Pandu Rangan, Cunsheng Ding (Eds.): Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings. Lecture Notes in Computer Science 2247, Springer 2001, ISBN 3-540-43010-5
- 2000
- [j55]Venkatesan Guruswami, C. Pandu Rangan: Algorithmic aspects of clique-transversal and clique-independent sets. Discrete Applied Mathematics 100(3): 183-202 (2000)
- [j54]D. Arun Kumar, C. Pandu Rangan: Approximation algorithms for the Traveling Salesman Problem with range condition. ITA 34(3): 173-182 (2000)
- [j53]Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan, C. Pandu Rangan: On the Generative Power of Simple H Systems. Journal of Automata, Languages and Combinatorics 5(4): 457- (2000)
- [j52]Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner: On the Complexity of Partial Order Properties. Order 17(2): 179-193 (2000)
- [c19]K. Srinathan, C. Pandu Rangan: Efficient Asynchronous Secure Multiparty Distributed Computation. INDOCRYPT 2000: 117-129
- [c18]K. Srinathan, C. Pandu Rangan: Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. INDOCRYPT 2000: 130-142
1990 – 1999
- 1999
- [j51]A. Arvind, C. Pandu Rangan: Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue. Inf. Process. Lett. 69(4): 197-199 (1999)
- [e2]C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam (Eds.): Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings. Lecture Notes in Computer Science 1738, Springer 1999, ISBN 3-540-66836-5
- [e1]Alok Aggarwal, C. Pandu Rangan (Eds.): Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings. Lecture Notes in Computer Science 1741, Springer 1999, ISBN 3-540-66916-7
- 1998
- [j50]C. Pandu Rangan, K. R. Parthasarathy, V. Prakash: On The g-centroidal Problem in Special Classes of Perfect Graphs. Ars Comb. 50 (1998)
- [j49]David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan: Partial and Perfect Path Covers of Cographs. Discrete Applied Mathematics 89(1-3): 143-153 (1998)
- [j48]Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan: Weighted Irredundance of Interval Graphs. Inf. Process. Lett. 66(2): 65-70 (1998)
- [j47]Venkatesan Guruswami, C. Pandu Rangan: A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds. Inf. Process. Lett. 68(5): 241-248 (1998)
- [c17]Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan: The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. COCOON 1998: 35-44
- [c16]Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan: Probabilistic Data Structures for Priority Queues (Extended Abstract). SWAT 1998: 143-154
- [c15]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Vertex-Disjoint Triangles Problem. WG 1998: 26-37
- 1997
- [j46]G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan: Restrictions of Minimum Spanner Problems. Inf. Comput. 136(2): 143-164 (1997)
- 1996
- [j45]K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri: Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph. Algorithmica 15(3): 242-255 (1996)
- [j44]Satyan R. Coorg, C. Pandu Rangan: The Parity Path Problem on Some Subclasses of Perfect Graphs. Discrete Applied Mathematics 68(3): 293-302 (1996)
- [j43]V. Balachandhran, C. Pandu Rangan: All-pairs-shortest-length on Strongly Chordal Graphs. Discrete Applied Mathematics 69(1-2): 169-182 (1996)
- [j42]V. Balachandran, P. Nagavamsi, C. Pandu Rangan: Clique Transversal and Clique Independence on Comparability Graphs. Inf. Process. Lett. 58(4): 181-184 (1996)
- [j41]M. S. Madanlal, G. Venkatesan, C. Pandu Rangan: Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs. Inf. Process. Lett. 59(2): 97-102 (1996)
- [j40]Rohan F. M. Aranha, C. Pandu Rangan: An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 59(3): 145-150 (1996)
- [j39]G. Venkatesan, C. Pandu Rangan: Approximate Triclique Coloring for Register Allocation. Inf. Process. Lett. 60(5): 249-253 (1996)
- 1995
- [j38]Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg: Weighted Independent Perfect Domination on Cocomparability Graphs. Discrete Applied Mathematics 63(3): 215-222 (1995)
- [j37]C. P. Gopalakrishnan, C. Pandu Rangan: Edge-disjoint paths in permutation graphs. Discussiones Mathematicae Graph Theory 15(1): 59-72 (1995)
- [j36]C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg: Efficient algorithms for minimal disjoint path problems on chordal graphs. Discussiones Mathematicae Graph Theory 15(2): 119-145 (1995)
- [j35]C. P. Gopalakrishnan, C. Pandu Rangan: A linear algorithms for the two paths problem on permutation graphs. Discussiones Mathematicae Graph Theory 15(2): 147-166 (1995)
- [j34]Saptarshi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan: Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems. IEICE Transactions 78-D(1): 3-12 (1995)
- [j33]Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang: Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs. Inf. Process. Lett. 56(3): 165-171 (1995)
- [j32]
- [j31]K. Arvind, V. Kamakoti, C. Pandu Rangan: Efficient Parallel Algorithms for Permutation Graphs. J. Parallel Distrib. Comput. 26(1): 116-124 (1995)
- [j30]Rohan F. M. Aranha, C. Pandu Rangan: An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph. J. UCS 1(9): 633-650 (1995)
- [j29]Satyan R. Coorg, C. Pandu Rangan: Feedback vertex set on cocomparability graphs. Networks 26(2): 101-111 (1995)
- [j28]V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan: An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets. Nord. J. Comput. 2(1): 28-40 (1995)
- [j27]Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan: Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs. Parallel Processing Letters 5: 343-355 (1995)
- [j26]K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar: Systematic Design of an Algorithm for Biconnected Components. Sci. Comput. Program. 25(1): 63-77 (1995)
- [j25]G. Srikrishna, C. Pandu Rangan: Optimal Parallel Algorithms for Path Problems on Planar Graphs. Theor. Comput. Sci. 145(1&2): 27-43 (1995)
- [c14]V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan: Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees. COCOON 1995: 71-80
- 1994
- [j24]K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston: A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 51(3): 121-124 (1994)
- [j23]Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram: Efficient Parallel Shuffle Recognition. Parallel Processing Letters 4: 455-463 (1994)
- [j22]Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan: Treewidth of Circular-Arc Graphs. SIAM J. Discrete Math. 7(4): 647-655 (1994)
- [c13]P. Jagan Mohan, V. Kamakoti, C. Pandu Rangan: Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension. IFIP Congress (1) 1994: 547-552
- [c12]C. P. Gopalakrishnan, C. Pandu Rangan: Edge-Disjoint Paths in Permutation Graphs. ISAAC 1994: 208-216
- [c11]
- 1993
- [j21]P. B. Ramprasad, C. Pandu Rangan: A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs. Algorithmica 9(3): 199-216 (1993)
- [j20]Arjun Raman, C. Pandu Rangan: A Unified Approach to Parallel Algorithms for the Domatic Partition Problem on Special Classes of Perfect Graphs. Parallel Processing Letters 3: 233-241 (1993)
- [j19]R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan: Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs. Theor. Comput. Sci. 115(2): 351-357 (1993)
- [c10]Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg: Weighted Independent Perfect Domination on Cocomparability Graphs. ISAAC 1993: 506-514
- [c9]Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan: Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs. WADS 1993: 131-141
- 1992
- [j18]C. Pandu Rangan, Ramesh Govindan: An O(n log n) algorithm for a maxmin location problem. Discrete Applied Mathematics 36(2): 203-205 (1992)
- [j17]Madhav V. Marathe, R. Ravi, C. Pandu Rangan: Generalized Vertex Covering in Interval Graphs. Discrete Applied Mathematics 39(1): 87-93 (1992)
- [j16]V. Kamakoti, C. Pandu Rangan: An Optimal Algorithm for Reconstructing a Binary Tree. Inf. Process. Lett. 42(2): 113-115 (1992)
- [j15]R. Ravi, Madhav V. Marathe, C. Pandu Rangan: An optimal algorithm to solve the all-pair shortest path problem on interval graphs. Networks 22(1): 21-35 (1992)
- [c8]Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar: A Parallel Algorithm for Recognizing the Shuffle of Two Strings. IPPS 1992: 112-115
- 1991
- [j14]Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher: Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31(2): 182-193 (1991)
- [j13]Srinivasa Rao Arikati, C. Pandu Rangan: An efficient algorithm for finding a two-pair, and its applications. Discrete Applied Mathematics 31(1): 71-74 (1991)
- [j12]R. Mahesh, C. Pandu Rangan, Aravind Srinivasan: On Finding the Minimum Bandwidth of Interval Graphs. Inf. Comput. 95(2): 218-224 (1991)
- [j11]Aravind Srinivasan, C. Pandu Rangan: Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs. Theor. Comput. Sci. 91(1): 1-21 (1991)
- [c7]Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan: Treewidth of Circular-Arc Graphs (Abstract). WADS 1991: 41
- 1990
- [j10]S. Sudarshan, C. Pandu Rangan: A Fast Algorithm for Computing Sparse Visibility Graphs. Algorithmica 5(2): 210-214 (1990)
- [j9]G. Ramalingam, C. Pandu Rangan: New Sequential and Parallel Algorithms for Interval Graph Recognition. Inf. Process. Lett. 34(4): 215-219 (1990)
- [j8]Srinivasa Rao Arikati, C. Pandu Rangan: Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. Inf. Process. Lett. 35(3): 149-153 (1990)
- [c6]
1980 – 1989
- 1989
- [j7]A. Srinivasa Rao, C. Pandu Rangan: Linear Algorithm for Domatic Number Problem on Interval Graphs. Inf. Process. Lett. 33(1): 29-33 (1989)
- [j6]A. Srinivasa Rao, C. Pandu Rangan: Optimal Parallel Algorithms on Circular-Arc Graphs. Inf. Process. Lett. 33(3): 147-156 (1989)
- [j5]Suresh Venkatasubramanian, Kamala Krithivasan, C. Pandu Rangan: Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton. ITA 23(3): 251-279 (1989)
- [c5]A. Srinivasa Rao, C. Pandu Rangan: Optimal Parallel Algorithms on Circular-Arc Graphs. FSTTCS 1989: 44-55
- [c4]A. Srinivasa Rao, C. Pandu Rangan: Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph. WADS 1989: 267-290
- 1988
- [j4]G. Ramalingam, C. Pandu Rangan: Total Domination in Interval Graphs Revisited. Inf. Process. Lett. 27(1): 17-21 (1988)
- [j3]G. Ramalingam, C. Pandu Rangan: A Unified Approach to Domination Problems on Interval Graphs. Inf. Process. Lett. 27(5): 271-274 (1988)
- [c3]S. V. Krishnan, C. Pandu Rangan, S. Seshadri: A New Linear Algorithm for the Two Path Problem on Chordal Graphs. FSTTCS 1988: 49-66
- 1987
- [j2]S. Kiran Kumar, C. Pandu Rangan: A Linear Space Algorithm for the LCS Problem. Acta Inf. 24(3): 353-362 (1987)
- [c2]
- 1986
- [c1]Ramesh Dewangan, C. Pandu Rangan: A Simple Implementation of Warshall's Algorithm on a VLSI Chip. WG 1986: 131-145
- 1983
- [j1]C. Pandu Rangan: On the Minimum Number of Additions Required to Compute a Quadratic Form. J. Algorithms 4(3): 282-285 (1983)
Coauthor Index
[j63] [j61] [c113] [j60] [c107] [c106] [c104] [c100] [c96] [c95] [i48] [i46] [j58] [c89] [c88] [c84] [c83] [c82] [c81] [c79] [c75] [c74] [c72] [i33] [i31] [i24] [i22] [i20] [i19] [c68] [c67] [c62] [c61] [c58] [c57] [c54] [i18] [i17] [i16] [i15] [i13] [i11] [i7] [i6] [i5] [i4] [i3] [i2] [i1] [c48] [c45] [c43] [c41] [c39]
[c121] [c117] [c115] [i61] [i60] [i59] [i58] [c112] [c111] [c110] [i52] [i51] [i50] [i49] [c102] [c99] [c98] [c94] [c93] [i45] [i43] [i41] [i40] [i39] [i38] [i37] [i36] [i35] [c87] [c85] [c80] [c78] [c76] [c73] [c71] [c70] [i34] [i32] [i30] [i29] [i28] [i27] [i26] [i25] [i21] [c65] [c56] [c55] [c52] [i14] [i12]
[c121] [c117] [c115] [i60] [i59] [i58] [c112] [c111] [c110] [i52] [i51] [i50] [i49] [c102] [c99] [c98] [c94] [c93] [i45] [i43] [i41] [i40] [i39] [i38] [i37] [i36] [i35] [c87] [c85] [c80] [c78] [c76] [c73] [c71] [c70] [i34] [i32] [i30] [i29] [i28] [i27] [i26] [i25] [i21] [c65] [c56] [c55] [c52] [i14] [i12]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-09 20:57 CET by the dblp team