Entry Pelc:1989:SKE from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Pelc:1989:SKE,
author = "Andrzej Pelc",
title = "Searching with known error probability",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "185--202",
month = feb,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ du Quebec a Hull",
affiliationaddress = "Hull, Que, Can",
classification = "723; 922; C1260 (Information theory)",
corpsource = "Dept. d'Inf., Quebec Univ., Hull, Que., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; comparison queries; Computer Programming;
Continuous Search; discrete bounded; Discrete Bounded
Search; Discrete Unbounded Search; Error Probability;
information theory; Interactive Searching; interactive
searching; probability; Probability; Reliability;
Search Algorithms; searching algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bounded,
35(2)191,
35(2)295,
36(2)239,
40(1)3,
40(1)13,
40(2)163,
40(2)237,
51(3)255,
51(3)325,
52(3)251,
52(3)341,
54(2)331,
56(1)37,
57(1)87,
59(3)259,
59(3)309,
62(1)67,
64(1)1,
65(2)221,
67(1)99,
67(2)283,
68(2)155
- C1260,
35(2)295,
36(1)99,
37(1)77,
41(2)215,
48(2)283,
51(1)215,
54(2)165,
56(3)339,
57(1)97,
57(1)131,
57(2)283,
58(1)103,
63(2)157,
65(2)143,
65(2)171,
65(2)249,
65(2)z,
68(2)175
- comparison,
43(2)345,
54(2)249,
58(1)3,
61(1)67,
66(1)105,
66(2)137
- continuous,
35(2)345,
38(1)17,
43(1)59,
43(2)251,
43(2)293,
48(2)229,
51(3)309,
68(3)277,
68(3)303
- discrete,
40(2)275,
47(3)329,
51(3)331,
52(3)269,
54(2)215,
57(2)317,
66(1)105
- error,
46(1)13,
47(1)61,
54(1)129,
57(1)87,
66(1)105
- information,
35(2)295,
36(1)99,
37(1)77,
41(2)215,
43(2)149,
44(1)69,
48(2)283,
49(2)171,
49(2)185,
51(1)215,
54(2)165,
56(3)339,
57(1)97,
57(1)131,
57(2)283,
58(1)103,
62(1)3,
62(1)39,
62(3)251,
63(1)91,
63(2)157,
65(1)85,
65(2)143,
65(2)171,
65(2)249,
65(2)z,
68(2)175,
68(3)239
- probability,
41(2)325,
49(2)267,
53(1)67,
53(1)99,
57(1)87,
62(3)251,
64(2)203,
65(0)123,
65(2)149,
65(2)171,
65(2)z,
67(1)5,
68(1)1
- query,
40(2)237,
46(1)67,
47(1)61,
47(3)237,
52(3)281,
62(0)3,
62(1)67,
62(1)187,
62(3)251,
63(3)253,
66(1)105,
69(1)1
- reliability,
37(2)151
- search,
39(2)89,
41(2)325,
47(1)61,
47(2)205,
47(3)277,
58(1)57,
58(1)143,
58(1)209,
59(1)133,
59(3)297,
66(0)117,
66(1)105,
66(2)181,
68(3)343,
69(1)1
- searching,
45(1)63,
47(2)205,
58(1)57,
58(1)143,
63(1)91,
66(1)105,
67(1)115
- unbounded,
38(1)99,
40(2)211,
52(1)91,
59(3)211,
68(3)277