K. B. Lakshmanan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2011

Recursive merge sort with erroneous comparisonsPetros Hadjicostas, K. B. Lakshmanan. DAM, 159(14):1398-1417, 2011. [doi]

Measures of disorder and straight insertion sort with erroneous comparisonsPetros Hadjicostas, K. B. Lakshmanan. arscom, 98:259-288, 2011.

2005

Bubble sort with erroneous comparisonsPetros Hadjicostas, K. B. Lakshmanan. ajc, 31:85-106, 2005. [doi]

2000

Alarm placement in systems with fault propagationK. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi. TCS, 243(1-2):269-288, 2000. [doi]

1994

Searching with Local Constraints on Error PatternsJurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc. ejc, 15(3):217-222, 1994. [doi]

1993

Multiprocessor Fault Diagnosis Under Local ConstraintsAnindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan. TC, 42(8):984-988, 1993.

Distributed Fault diagnosis of a Ring of ProcessorsAnindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal. ppl, 3:195-204, 1993.

1991

Searching with a Forbidden Lie Pattern in ResponsesJurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc. ipl, 37(3):127-132, 1991.

Properties of Control-Flow Complexity MeasuresK. B. Lakshmanan, S. Jayaprakash, P. K. Sinha. TSE, 17(12):1289-1295, 1991. [doi]

Coping with Erroneous Information while SortingK. B. Lakshmanan, Bala Ravikumar, K. Ganesan. TC, 40(9):1081-1084, 1991.

1989

t/s-Diagnosable Systems: A Characterization and Diagnosis AlgorithmAnindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan. criwg 1990: 34-45

An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative WeightsK. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau. TSE, 15(5):639-644, 1989. [doi]

1987

On the Use of Synchronizers for Asynchronous Communication NetworksK. B. Lakshmanan, Krishnaiyan Thulasiraman. wdag 1988: 257-277

A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-SearchK. B. Lakshmanan, N. Meenakshi, Krishnaiyan Thulasiraman. ipl, 25(2):103-109, 1987.

On Selecting the Largest Element in Spite of Erroneous InformationBala Ravikumar, K. Ganesan, K. B. Lakshmanan. STACS 1987: 88-99

1984

Coping with Known Patterns of Lies in a Search GameBala Ravikumar, K. B. Lakshmanan. TCS, 33:85-94, 1984.

1982

A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete ProblemRavi Janardan, K. B. Lakshmanan. crypto 1982: 21-37

1981

On Universal Codeword SetsK. B. Lakshmanan. TIT, 27(5):659, 1981.

1979

Compound Hypothesis Testing with Finite MemoryK. B. Lakshmanan, B. Chandrasekaran. iandc, 40(2):223-233, February 1979.

1978

Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problemsB. Chandrasekaran, K. B. Lakshmanan. TIT, 24(6):755-759, 1978. [doi]

Decision making with finite memory devices (Ph.D. Thesis abstr.)K. B. Lakshmanan. TIT, 24(1):134, 1978. [doi]

On finite memory solutions to the two-armed bandit problem (Corresp.)K. B. Lakshmanan, B. Chandrasekaran. TIT, 24(2):244-248, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL