dblp.uni-trier.dewww.uni-trier.de

C. Pandu Rangan

Chanrasekharan Pandu Rangan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
125EEKannan 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
124EEAshish 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
123EEBalasubramanian Sivan, S. Harini, C. Pandu Rangan: Core and Conditional Core Path of Specified Length in Special Classes of Graphs. WALCOM 2009: 262-273
2008
122EEArpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan: Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. ACISP 2008: 170-186
121EEKannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable Message Transmission in Directed Hypergraphs. CANS 2008: 285-303
120EEVarad Kirtane, C. Pandu Rangan: RSA-TBOS signcryption with proxy re-encryption. Digital Rights Management Workshop 2008: 59-66
119EEBhavani Shankar, Kannan Srinathan, C. Pandu Rangan: Alternative Protocols for Generalized Oblivious Transfer. ICDCN 2008: 304-309
118EEAmjed Shareef, C. Pandu Rangan: On Optimal Probabilistic Asynchronous Byzantine Agreement. ICDCN 2008: 86-98
117EEAshish 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
116EEArpita Patra, Ashish Choudhary, C. Pandu Rangan: Round Efficient Unconditionally Secure Multiparty Computation Protocol. INDOCRYPT 2008: 185-199
115EEShaik Maleka, Amjed Shareef, C. Pandu Rangan: The deterministic protocol for rational secret sharing. IPDPS 2008: 1-7
114EEShaik Maleka, Amjed Shareef, C. Pandu Rangan: Rational Secret Sharing with Repeated Games. ISPEC 2008: 334-346
113EEB. 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
112EEKannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan: Efficient single phase unconditionally secure message transmission with optimum communication complexity. PODC 2008: 457
111EES. 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
110EES. Sharmila Deva Selvi, S. Sree Vivek, Deepanshu Shukla, C. Pandu Rangan: Efficient and Provably Secure Certificateless Multi-receiver Signcryption. ProvSec 2008: 52-67
109EEArpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008: 309-326
108EEBhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan: Unconditionally reliable message transmission in directed networks. SODA 2008: 1048-1055
107EES. 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
2007
106 K. Srinathan, C. Pandu Rangan, Moti Yung: Progress in Cryptology - INDOCRYPT 2007, 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings Springer 2007
105EEKannan Srinathan, Prasad Raghavendra, C. Pandu Rangan: On Proactive Perfectly Secure Message Transmission. ACISP 2007: 461-473
104EEP. Krishna Prasad, C. Pandu Rangan: Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases. ADMA 2007: 146-157
103EEK. Anil Kumar, C. Pandu Rangan: Privacy Preserving DBSCAN Algorithm for Clustering. ADMA 2007: 57-68
102EEArpita 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
101EEArpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan: Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. DISC 2007: 496-498
100 P. Krishna Prasad, C. Pandu Rangan: Privacy Preserving CACTUS Algorithm for Clustering over Vertically Partitioned Databases. DMIN 2007: 308-314
99EEAvinash 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
98EEKannan 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
97EEKannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. INDOCRYPT 2007: 101-122
96 Amjed Shareef, C. Pandu Rangan: Efficient Protocol For Approximate Agreement. PDPTA 2007: 193-199
95EEArpita Patra, Ashish Choudhary, Chanrasekharan Pandu Rangan: Constant phase efficient protocols for secure message transmission in directed networks. PODC 2007: 322-323
2006
94EEArpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan: Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. INDOCRYPT 2006: 221-235
93EER. C. Chakinala, Abishek Kumarasubramanian, R. Manokaran, Guevara Noubir, C. Pandu Rangan, Ravi Sundaram: Steganographic Communication in Ordered Channels. Information Hiding 2006: 42-57
92EEKannan Srinathan, C. Pandu Rangan: Possibility and complexity of probabilistic reliable communication in directed networks. PODC 2006: 265-274
91EER. 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
90EEP. Krishna Prasad, C. Pandu Rangan: Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases. Secure Data Management 2006: 84-99
89EEMatthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan: Round-Optimal and Efficient Verifiable Secret Sharing. TCC 2006: 329-342
88EEArvind Narayanan, K. Srinathan, C. Pandu Rangan: Perfectly Reliable Message Transmission. Inf. Process. Lett. 100(1): 23-28 (2006)
2004
87EEK. Srinathan, Arvind Narayanan, C. Pandu Rangan: Optimal Perfectly Secure Message Transmission. CRYPTO 2004: 545-561
86EED. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan: On Byzantine Agreement over (2, 3)-Uniform Hypergraphs. DISC 2004: 450-464
85EED. 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
2003
84EEArvind Narayanan, C. Pandu Rangan, Kwangjo Kim: Practical Pay TV Schemes. ACISP 2003: 192-203
83EEV. Vinod, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, Kwangjo Kim: On the Power of Computational Secret Sharing. INDOCRYPT 2003: 162-176
82EES. Amitanand, I. Sanketh, K. Srinathan, V. Vinod, C. Pandu Rangan: Distributed consensus in the presence of sectional faults. PODC 2003: 202-210
81EEK. Srinathan, V. Vinod, C. Pandu Rangan: Brief announcement: efficient perfectly secure communication over synchronous networks. PODC 2003: 252
2002
80EEM. V. N. Ashwin Kumar, K. Srinathan, C. Pandu Rangan: Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries. ACISP 2002: 497-512
79EEK. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan: Asynchronous Secure Communication Tolerating Mixed Adversaries. ASIACRYPT 2002: 224-242
78EEK. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan: Theory of Equal-Flows in Networks. COCOON 2002: 514-524
77EEK. Srinathan, N. Tharani Rajan, C. Pandu Rangan: Non-perfect Secret Sharing over General Access Structures. INDOCRYPT 2002: 409-421
76EEB. Prabhu, K. Srinathan, C. Pandu Rangan: Asynchronous Unconditionally Secure Computation: An Efficiency Improvement. INDOCRYPT 2002: 93-107
75EEM. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan: On perfectly secure cmmunication over arbitrary networks. PODC 2002: 193-202
74EEB. Prabhu, K. Srinathan, C. Pandu Rangan: Trading Players for Efficiency in Unconditional Multiparty Computation. SCN 2002: 342-353
2001
73 C. Pandu Rangan, Cunsheng Ding: Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings Springer 2001
72EEK. Srinathan, C. Pandu Rangan, V. Kamakoti: Toward Optimal Player Weights in Secure Distributed Protocols. INDOCRYPT 2001: 232-241
71EEVenkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Kr-Packing Problem. Computing 66(1): 79-89 (2001)
2000
70EEK. Srinathan, C. Pandu Rangan: Efficient Asynchronous Secure Multiparty Distributed Computation. INDOCRYPT 2000: 117-129
69EEK. Srinathan, C. Pandu Rangan: Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. INDOCRYPT 2000: 130-142
68 Venkatesan Guruswami, C. Pandu Rangan: Algorithmic aspects of clique-transversal and clique-independent sets. Discrete Applied Mathematics 100(3): 183-202 (2000)
67 D. Arun Kumar, C. Pandu Rangan: Approximation algorithms for the Traveling Salesman Problem with range condition. ITA 34(3): 173-182 (2000)
66 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)
65EEStefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner: On the Complexity of Partial Order Properties. Order 17(2): 179-193 (2000)
1999
64 C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings Springer 1999
63 Alok Aggarwal, C. Pandu Rangan: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings Springer 1999
62EEA. 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)
1998
61EEThomas 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
60EESridhar Ramachandran, K. Rajasekar, C. Pandu Rangan: Probabilistic Data Structures for Priority Queues (Extended Abstract). SWAT 1998: 143-154
59 Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Vertex-Disjoint Triangles Problem. WG 1998: 26-37
58 C. Pandu Rangan, K. R. Parthasarathy, V. Prakash: On The g-centroidal Problem in Special Classes of Perfect Graphs. Ars Comb. 50: (1998)
57EEDavid 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)
56EEMaw-Shang Chang, P. Nagavamsi, C. Pandu Rangan: Weighted Irredundance of Interval Graphs. Inf. Process. Lett. 66(2): 65-70 (1998)
55EEVenkatesan Guruswami, C. Pandu Rangan: A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds. Inf. Process. Lett. 68(5): 241-248 (1998)
1997
54 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
53 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)
52EESatyan R. Coorg, C. Pandu Rangan: The Parity Path Problem on Some Subclasses of Perfect Graphs. Discrete Applied Mathematics 68(3): 293-302 (1996)
51EEV. Balachandhran, C. Pandu Rangan: All-pairs-shortest-length on Strongly Chordal Graphs. Discrete Applied Mathematics 69(1-2): 169-182 (1996)
50EEV. Balachandran, P. Nagavamsi, C. Pandu Rangan: Clique Transversal and Clique Independence on Comparability Graphs. Inf. Process. Lett. 58(4): 181-184 (1996)
49EEM. 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)
48EERohan 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)
47EEG. Venkatesan, C. Pandu Rangan: Approximate Triclique Coloring for Register Allocation. Inf. Process. Lett. 60(5): 249-253 (1996)
1995
46 V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan: Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees. COCOON 1995: 71-80
45EEGerard J. Chang, C. Pandu Rangan, Satyan R. Coorg: Weighted Independent Perfect Domination on Cocomparability Graphs. Discrete Applied Mathematics 63(3): 215-222 (1995)
44 V. B. Balayogan, C. Pandu Rangan: Parallel Algorithms on Interval Graphs. ITA 29(6): 451-470 (1995)
43EEAnand 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)
42 K. Arvind, V. Kamakoti, C. Pandu Rangan: Efficient Parallel Algorithms for Permutation Graphs. J. Parallel Distrib. Comput. 26(1): 116-124 (1995)
41EERohan 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)
40 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)
39 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)
38 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)
37EEG. Srikrishna, C. Pandu Rangan: Optimal Parallel Algorithms for Path Problems on Planar Graphs. Theor. Comput. Sci. 145(1&2): 27-43 (1995)
1994
36 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
35 C. P. Gopalakrishnan, C. Pandu Rangan: Edge-Disjoint Paths in Permutation Graphs. ISAAC 1994: 208-216
34 C. Pandu Rangan, Maw-Shang Chang: Weighted Irredundance of Interval Graphs. ISAAC 1994: 567-574
33 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)
32 Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram: Efficient Parallel Shuffle Recognition. Parallel Processing Letters 4: 455-463 (1994)
31EERavi Sundaram, Karan Sher Singh, C. Pandu Rangan: Treewidth of Circular-Arc Graphs. SIAM J. Discrete Math. 7(4): 647-655 (1994)
1993
30 Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg: Weighted Independent Perfect Domination on Cocomparability Graphs. ISAAC 1993: 506-514
29 Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan: Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs. WADS 1993: 131-141
28 P. B. Ramprasad, C. Pandu Rangan: A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs. Algorithmica 9(3): 199-216 (1993)
27 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)
26 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)
1992
25 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
24EEC. Pandu Rangan, Ramesh Govindan: An O(n log n) algorithm for a maxmin location problem. Discrete Applied Mathematics 36(2): 203-205 (1992)
23EEMadhav V. Marathe, R. Ravi, C. Pandu Rangan: Generalized Vertex Covering in Interval Graphs. Discrete Applied Mathematics 39(1): 87-93 (1992)
22 V. Kamakoti, C. Pandu Rangan: An Optimal Algorithm for Reconstructing a Binary Tree. Inf. Process. Lett. 42(2): 113-115 (1992)
1991
21 Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan: Treewidth of Circular-Arc Graphs (Abstract). WADS 1991: 41
20 Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher: Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31(2): 182-193 (1991)
19EESrinivasa Rao Arikati, C. Pandu Rangan: An efficient algorithm for finding a two-pair, and its applications. Discrete Applied Mathematics 31(1): 71-74 (1991)
18 R. Mahesh, C. Pandu Rangan, Aravind Srinivasan: On Finding the Minimum Bandwidth of Interval Graphs Inf. Comput. 95(2): 218-224 (1991)
17 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)
1990
16 G. D. S. Ramkumar, C. Pandu Rangan: Parallel Algorithms on Interval Graphs. ICPP (3) 1990: 72-74
15 S. Sudarshan, C. Pandu Rangan: A Fast Algorithm for Computing Sparse Visibility Graphs. Algorithmica 5(2): 210-214 (1990)
14 G. Ramalingam, C. Pandu Rangan: New Sequential and Parallel Algorithms for Interval Graph Recognition. Inf. Process. Lett. 34(4): 215-219 (1990)
13 Srinivasa Rao Arikati, C. Pandu Rangan: Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. Inf. Process. Lett. 35(3): 149-153 (1990)
1989
12 A. Srinivasa Rao, C. Pandu Rangan: Optimal Parallel Algorithms on Circular-Arc Graphs. FSTTCS 1989: 44-55
11 A. Srinivasa Rao, C. Pandu Rangan: Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph. WADS 1989: 267-290
10 Suresh Venkatasubramanian, Kamala Krithivasan, C. Pandu Rangan: Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton. ITA 23(3): 251-279 (1989)
9 A. Srinivasa Rao, C. Pandu Rangan: Linear Algorithm for Domatic Number Problem on Interval Graphs. Inf. Process. Lett. 33(1): 29-33 (1989)
8 A. Srinivasa Rao, C. Pandu Rangan: Optimal Parallel Algorithms on Circular-Arc Graphs. Inf. Process. Lett. 33(3): 147-156 (1989)
1988
7 S. V. Krishnan, C. Pandu Rangan, S. Seshadri: A New Linear Algorithm for the Two Path Problem on Chordal Graphs. FSTTCS 1988: 49-66
6 G. Ramalingam, C. Pandu Rangan: Total Domination in Interval Graphs Revisited. Inf. Process. Lett. 27(1): 17-21 (1988)
5EEG. Ramalingam, C. Pandu Rangan: A Unified Approach to Domination Problems on Interval Graphs. Inf. Process. Lett. 27(5): 271-274 (1988)
1987
4 Ramesh Govindan, C. Pandu Rangan: Competitive Location in the L1 and LINF Metrics. WG 1987: 70-83
3 S. Kiran Kumar, C. Pandu Rangan: A Linear Space Algorithm for the LCS Problem. Acta Inf. 24(3): 353-362 (1987)
1986
2 Ramesh Dewangan, C. Pandu Rangan: A Simple Implementation of Warshall's Algorithm on a VLSI Chip. WG 1986: 131-145
1983
1 C. Pandu Rangan: On the Minimum Number of Additions Required to Compute a Quadratic Form. J. Algorithms 4(3): 282-285 (1983)

Coauthor Index

1Alok Aggarwal [63]
2S. Amitanand [82]
3Rohan F. M. Aranha [41] [48]
4Srinivasa Rao Arikati [13] [19] [20]
5A. Arvind [62]
6K. Arvind [42]
7B. V. Ashwinkumar [113] [117] [124]
8V. Balachandhran [51]
9V. Balachandran [50]
10Hari Balakrishnan [29]
11V. B. Balayogan [44]
12R. C. Chakinala [91] [93]
13Gerard J. Chang [30] [45] [59] [71]
14Maw-Shang Chang [34] [43] [56] [59] [71]
15Grant A. Cheston [33]
16Ashish Choudhary [94] [95] [97] [101] [102] [109] [112] [113] [116] [117] [121] [122] [124] [125]
17Satyan R. Coorg [30] [45] [52]
18Ramesh Dewangan [2]
19Cunsheng Ding [73]
20K. S. Easwarakumar [33] [53]
21Stefan Felsner [65]
22Matthias Fitzi [89]
23Juan A. Garay [89]
24Shyamnath Gollakota [89]
25Prasant Gopal [108]
26C. P. Gopalakrishnan [35]
27Ragavendran Gopalakrishnan [107] [111]
28Pranava R. Goundan [75] [78]
29Ramesh Govindan [4] [24]
30Thomas Graf [61]
31Venkatesan Guruswami [55] [59] [68] [71]
32S. Harini [123]
33V. Kamakoti [22] [36] [40] [42] [46] [61] [72]
34Ravi Kant [65]
35Naga Naresh Karuturi [107] [111]
36Kwangjo Kim [83] [84]
37David G. Kirkpatrick [57]
38Varad Kirtane [120]
39S. V. Krishnan [7] [53]
40Kamala Krithivasan [10] [40] [46] [66]
41D. Arun Kumar [67]
42D. Pavan Kumar [38]
43K. Anil Kumar [103]
44S. Kiran Kumar [3]
45Abishek Kumarasubramanian [91] [93]
46Ambrose Kofi Laing (Kofi A. Laing) [91]
47N. S. Janaki Latha [61]
48Ashwin Machanavajjhala (M. V. N. Ashwin Kumar) [75] [78] [79] [80]
49M. S. Madanlal [49] [54]
50K. Madhukar [38] [43]
51R. Mahesh [18]
52Sathi Mahesh [39]
53Johann A. Makowsky (Janos Makowsky) [54]
54Shaik Maleka [114] [115]
55Glenn K. Manacher [20]
56R. Manokaran [91] [93]
57Madhav V. Marathe [23]
58P. Jagan Mohan [36]
59C. Siva Ram Murthy [39]
60P. Nagavamsi [43] [50] [56]
61R. Nandakumar [78]
62Arvind Narayanan [83] [84] [87] [88]
63Maurice Nivat [25] [32]
64Guevara Noubir [93]
65K. R. Parthasarathy [58]
66Arpita Patra [94] [95] [97] [101] [102] [109] [112] [113] [116] [117] [121] [122] [124] [125]
67B. Prabhu [74] [76]
68V. Prakash [58]
69N. R. Prasad [98]
70P. Krishna Prasad [90] [100] [104]
71Prasad Raghavendra [105]
72N. Tharani Rajan [77]
73Anand Rajaraman [29]
74Rajmohan Rajaraman [91]
75K. Rajasekar [60]
76Sridhar Ramachandran [60]
77G. Ramalingam (Ganesan Ramalingam) [5] [6] [14]
78Arjun Raman [27]
79Venkatesh Raman [64]
80Ramaswamy Ramanujam [64]
81G. D. S. Ramkumar [16] [25] [32]
82P. B. Ramprasad [28]
83A. Srinivasa Rao [8] [9] [11] [12]
84R. Ravi [23]
85D. V. S. Ravikant [85] [86]
86Madhukar K. Reddy [57]
87Udi Rotics [54]
88I. Sanketh [82]
89Ahmed Saoudi [25] [32]
90S. Sharmila Deva Selvi [107] [110] [111]
91S. Seshadri [7] [53]
92Bhavani Shankar [102] [108] [119]
93Amjed Shareef [96] [114] [115] [118]
94Deepanshu Shukla [110]
95Karan Sher Singh [21] [26] [31]
96Balasubramanian Sivan [123]
97R. Srikant (Rayadurgam Srikant) [26]
98V. Srikanth [85] [86]
99G. Srikrishna [37]
100K. Srinathan (Kannan Srinathan) [69] [70] [72] [74] [75] [76] [77] [78] [79] [80] [81] [82] [83] [85] [86] [87] [88] [89] [92] [94] [97] [98] [101] [102] [105] [106] [108] [112] [113] [117] [119] [121] [124] [125]
101Anand Srinivasan [43] [57]
102Aravind Srinivasan [17] [18]
103Lakshminarayanan Subramanian [66]
104S. Sudarshan [15]
105R. Sundar [38]
106Ravi Sundaram [21] [25] [26] [31] [32] [93]
107Muralidhar Talupur [66]
108Madhu Vaidyanathan [122]
109Vinod Vaikuntanathan (V. Vinod) [81] [82] [83]
110Avinash V. Varadarajan [99]
111Suresh Venkatasubramanian [10]
112G. Venkatesan [47] [49] [54]
113Ramarathnam Venkatesan [99]
114Muthuramakrishnan Venkitasubramaniam [85] [86]
115S. Sree Vivek [107] [110] [111]
116Dorothea Wagner [65]
117Chak-Kuen Wong (C. K. Wong) [59] [71]
118Moti Yung (Mordechai M. Yung) [106]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)