Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Ravikumar:1984:CKP,
author = "B. Ravikumar and K. B. Lakshmanan",
title = "Coping with known patterns of lies in a search game",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "85--94",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0240E (Game theory); C1140E (Game theory)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of
Technol., Madras, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "average-case analysis; game theory; known patterns;
lies; real number; search game; worst-case size",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}