Kadathur B. Lakshmanan
List of publications from the DBLP Bibliography Server - FAQ
| 2000 | ||
|---|---|---|
| 16 | K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi: Alarm placement in systems with fault propagation. Theor. Comput. Sci. 243(1-2): 269-288 (2000) | |
| 1994 | ||
| 15 | Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc: Searching with Local Constraints on Error Patterns. Eur. J. Comb. 15(3): 217-222 (1994) | |
| 1993 | ||
| 14 | Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan: Multiprocessor Fault Diagnosis Under Local Constraints. IEEE Trans. Computers 42(8): 984-988 (1993) | |
| 13 | Anindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal: Distributed Fault diagnosis of a Ring of Processors. Parallel Processing Letters 3: 195-204 (1993) | |
| 1991 | ||
| 12 | K. B. Lakshmanan, Bala Ravikumar, K. Ganesan: Coping with Erroneous Information while Sorting. IEEE Trans. Computers 40(9): 1081-1084 (1991) | |
| 11 | K. B. Lakshmanan, S. Jayaprakash, P. K. Sinha: Properties of Control-Flow Complexity Measures. IEEE Trans. Software Eng. 17(12): 1289-1295 (1991) | |
| 10 | Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc: Searching with a Forbidden Lie Pattern in Responses. Inf. Process. Lett. 37(3): 127-132 (1991) | |
| 1989 | ||
| 9 | Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan: t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm. WG 1989: 34-45 | |
| 8 | K. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau: An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights. IEEE Trans. Software Eng. 15(5): 639-644 (1989) | |
| 1987 | ||
| 7 | Bala Ravikumar, K. Ganesan, K. B. Lakshmanan: On Selecting the Largest Element in Spite of Erroneous Information. STACS 1987: 88-99 | |
| 6 | K. B. Lakshmanan, Krishnaiyan Thulasiraman: On the Use of Synchronizers for Asynchronous Communication Networks. WDAG 1987: 257-277 | |
| 5 | K. B. Lakshmanan, N. Meenakshi, Krishnaiyan Thulasiraman: A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search. Inf. Process. Lett. 25(2): 103-109 (1987) | |
| 1984 | ||
| 4 | Bala Ravikumar, K. B. Lakshmanan: Coping with Known Patterns of Lies in a Search Game. Theor. Comput. Sci. 33: 85-94 (1984) | |
| 1982 | ||
| 3 | Ravi Janardan, K. B. Lakshmanan: A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. CRYPTO 1982: 21-37 | |
| 1981 | ||
| 2 | K. B. Lakshmanan: On Universal Codeword Sets. IEEE Transactions on Information Theory 27(5): 659- (1981) | |
| 1979 | ||
| 1 | K. B. Lakshmanan, B. Chandrasekaran: Compound Hypothesis Testing with Finite Memory Information and Control 40(2): 223-233 (1979) | |
| 1 | Vinod K. Agarwal | [9] [13] [14] |
| 2 | B. Chandrasekaran (Balakrishnan Chandrasekaran) | [1] |
| 3 | M. A. Comeau | [8] |
| 4 | Jurek Czyzowicz | [10] [15] |
| 5 | Anindya Das | [9] [13] [14] |
| 6 | K. Ganesan | [7] [12] |
| 7 | Ravi Janardan | [3] |
| 8 | S. Jayaprakash | [11] |
| 9 | N. Meenakshi | [5] |
| 10 | Andrzej Pelc | [10] [15] |
| 11 | S. S. Ravi | [16] |
| 12 | Bala Ravikumar | [4] [7] [12] |
| 13 | Daniel J. Rosenkrantz | [16] |
| 14 | P. K. Sinha | [11] |
| 15 | Krishnaiyan Thulasiraman | [5] [6] [8] [9] [13] [14] |