K. B. Lakshmanan

Publication Activity (10 Years)

Years Active: 1978-2011
Publications (10 Years): 0

Publications

Petros Hadjicostas, K. B. Lakshmanan
Recursive merge sort with erroneous comparisons. Discret. Appl. Math. 159 (14) (2011)
Petros Hadjicostas, K. B. Lakshmanan
Measures of disorder and straight insertion sort with erroneous comparisons. Ars Comb. 98 (2011)
Petros Hadjicostas, K. B. Lakshmanan
Bubble sort with erroneous comparisons. Australas. J Comb. 31 (2005)
K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi
Alarm placement in systems with fault propagation. Theor. Comput. Sci. 243 (1-2) (2000)
Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
Searching with Local Constraints on Error Patterns. Eur. J. Comb. 15 (3) (1994)
Anindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal
Distributed Fault diagnosis of a Ring of Processors. Parallel Process. Lett. 3 (1993)
Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan
Multiprocessor Fault Diagnosis Under Local Constraints. IEEE Trans. Computers 42 (8) (1993)
Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc
Searching with a Forbidden Lie Pattern in Responses. Inf. Process. Lett. 37 (3) (1991)
K. B. Lakshmanan, Bala Ravikumar, K. Ganesan
Coping with Erroneous Information while Sorting. IEEE Trans. Computers 40 (9) (1991)
K. B. Lakshmanan, S. Jayaprakash, P. K. Sinha
Properties of Control-Flow Complexity Measures. IEEE Trans. Software Eng. 17 (12) (1991)
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) (1989)
Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan
t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm. WG (1989)
K. B. Lakshmanan, Krishnaiyan Thulasiraman
On the Use of Synchronizers for Asynchronous Communication Networks. WDAG (1987)
K. B. Lakshmanan, N. Meenakshi, Krishnaiyan Thulasiraman
A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search. Inf. Process. Lett. 25 (2) (1987)
Bala Ravikumar, K. Ganesan, K. B. Lakshmanan
On Selecting the Largest Element in Spite of Erroneous Information. STACS (1987)
Bala Ravikumar, K. B. Lakshmanan
Coping with Known Patterns of Lies in a Search Game. Theor. Comput. Sci. 33 (1984)
Ravi Janardan, K. B. Lakshmanan
A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. CRYPTO (1982)
K. B. Lakshmanan
On Universal Codeword Sets. IEEE Trans. Inf. Theory 27 (5) (1981)
K. B. Lakshmanan, B. Chandrasekaran
Compound Hypothesis Testing with Finite Memory Inf. Control. 40 (2) (1979)
K. B. Lakshmanan, B. Chandrasekaran
On finite memory solutions to the two-armed bandit problem (Corresp.). IEEE Trans. Inf. Theory 24 (2) (1978)
B. Chandrasekaran, K. B. Lakshmanan
Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problems. IEEE Trans. Inf. Theory 24 (6) (1978)
K. B. Lakshmanan
Decision making with finite memory devices (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 24 (1) (1978)