K. B. Lakshmanan

According to our database, K. B. Lakshmanan authored at least 22 papers between 1978 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Recursive merge sort with erroneous comparisons.

Petros Hadjicostas, K. B. Lakshmanan

Discret. Appl. Math., 2011

Measures of disorder and straight insertion sort with erroneous comparisons.

Petros Hadjicostas, K. B. Lakshmanan

Ars Comb., 2011

2005

Bubble sort with erroneous comparisons.

Petros Hadjicostas, K. B. Lakshmanan

Australas. J Comb., 2005

2000

Alarm placement in systems with fault propagation.

K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi

Theor. Comput. Sci., 2000

1994

Searching with Local Constraints on Error Patterns.

Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc

Eur. J. Comb., 1994

1993

Multiprocessor Fault Diagnosis Under Local Constraints.

Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan

IEEE Trans. Computers, 1993

Distributed Fault diagnosis of a Ring of Processors.

Anindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal

Parallel Process. Lett., 1993

1991

Properties of Control-Flow Complexity Measures.

K. B. Lakshmanan, S. Jayaprakash, P. K. Sinha

IEEE Trans. Software Eng., 1991

Coping with Erroneous Information while Sorting.

K. B. Lakshmanan, Bala Ravikumar, K. Ganesan

IEEE Trans. Computers, 1991

Searching with a Forbidden Lie Pattern in Responses.

Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc

Inf. Process. Lett., 1991

1989

An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights.

K. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau

IEEE Trans. Software Eng., 1989

t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm.

Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1987

A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search.

K. B. Lakshmanan, N. Meenakshi, Krishnaiyan Thulasiraman

Inf. Process. Lett., 1987

On the Use of Synchronizers for Asynchronous Communication Networks.

K. B. Lakshmanan, Krishnaiyan Thulasiraman

Proceedings of the Distributed Algorithms, 1987

On Selecting the Largest Element in Spite of Erroneous Information.

Bala Ravikumar, K. Ganesan, K. B. Lakshmanan

Proceedings of the STACS 87, 1987

1984

Coping with Known Patterns of Lies in a Search Game.

Bala Ravikumar, K. B. Lakshmanan

Theor. Comput. Sci., 1984

1982

A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem.

Ravi Janardan, K. B. Lakshmanan

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981

On Universal Codeword Sets.

K. B. Lakshmanan

IEEE Trans. Inf. Theory, 1981

1979

Compound Hypothesis Testing with Finite Memory

K. B. Lakshmanan, B. Chandrasekaran

Inf. Control., February, 1979

1978

On finite memory solutions to the two-armed bandit problem (Corresp.).

K. B. Lakshmanan, B. Chandrasekaran

IEEE Trans. Inf. Theory, 1978

Decision making with finite memory devices (Ph.D. Thesis abstr.).

K. B. Lakshmanan

IEEE Trans. Inf. Theory, 1978

Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problems.

B. Chandrasekaran, K. B. Lakshmanan

IEEE Trans. Inf. Theory, 1978