default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. B. Lakshmanan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j18]Petros Hadjicostas, K. B. Lakshmanan:
Measures of disorder and straight insertion sort with erroneous comparisons. Ars Comb. 98: 259-288 (2011)- [j17]Petros Hadjicostas, K. B. Lakshmanan:
Recursive merge sort with erroneous comparisons. Discret. Appl. Math. 159(14): 1398-1417 (2011)
2000 – 2009
- 2005
- [j16]Petros Hadjicostas, K. B. Lakshmanan:
Bubble sort with erroneous comparisons. Australas. J Comb. 31: 85-106 (2005) - 2000
- [j15]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)
1990 – 1999
- 1994
- [j14]Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc:
Searching with Local Constraints on Error Patterns. Eur. J. Comb. 15(3): 217-222 (1994) - 1993
- [j13]Anindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal:
Distributed Fault diagnosis of a Ring of Processors. Parallel Process. Lett. 3: 195-204 (1993) - [j12]Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan:
Multiprocessor Fault Diagnosis Under Local Constraints. IEEE Trans. Computers 42(8): 984-988 (1993) - 1991
- [j11]Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc:
Searching with a Forbidden Lie Pattern in Responses. Inf. Process. Lett. 37(3): 127-132 (1991) - [j10]K. B. Lakshmanan, Bala Ravikumar, K. Ganesan:
Coping with Erroneous Information while Sorting. IEEE Trans. Computers 40(9): 1081-1084 (1991) - [j9]K. B. Lakshmanan, S. Jayaprakash, P. K. Sinha:
Properties of Control-Flow Complexity Measures. IEEE Trans. Software Eng. 17(12): 1289-1295 (1991)
1980 – 1989
- 1989
- [j8]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) - [c4]Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan:
t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm. WG 1989: 34-45 - 1987
- [j7]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) - [c3]Bala Ravikumar, K. Ganesan, K. B. Lakshmanan:
On Selecting the Largest Element in Spite of Erroneous Information. STACS 1987: 88-99 - [c2]K. B. Lakshmanan, Krishnaiyan Thulasiraman:
On the Use of Synchronizers for Asynchronous Communication Networks. WDAG 1987: 257-277 - 1984
- [j6]Bala Ravikumar, K. B. Lakshmanan:
Coping with Known Patterns of Lies in a Search Game. Theor. Comput. Sci. 33: 85-94 (1984) - 1982
- [c1]Ravi Janardan, K. B. Lakshmanan:
A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. CRYPTO 1982: 21-37 - 1981
- [j5]K. B. Lakshmanan:
On Universal Codeword Sets. IEEE Trans. Inf. Theory 27(5): 659-662 (1981)
1970 – 1979
- 1979
- [j4]K. B. Lakshmanan, B. Chandrasekaran:
Compound Hypothesis Testing with Finite Memory. Inf. Control. 40(2): 223-233 (1979) - 1978
- [j3]K. B. Lakshmanan:
Decision making with finite memory devices (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 24(1): 134 (1978) - [j2]K. B. Lakshmanan, B. Chandrasekaran:
On finite memory solutions to the two-armed bandit problem (Corresp.). IEEE Trans. Inf. Theory 24(2): 244-248 (1978) - [j1]B. Chandrasekaran, K. B. Lakshmanan:
Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problems. IEEE Trans. Inf. Theory 24(6): 755-759 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
