Last update: Sun Mar 31 02:13:37 MDT 2019
Top |
Symbols |
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{Smith:2006:BRM,
author = "Marc L. Smith",
title = "Book Review: {Mark Burgin, \booktitle{Super-Recursive
Algorithms}. Series: Monographs in Computer Science.
Springer-Verlag (2005). ISBN 0-387-95569-0.
\$79.95\slash \pounds 61.50. 304 pp. Hardbound}",
journal = j-COMP-J,
volume = "49",
number = "6",
pages = "762--763",
month = nov,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxl050",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:32 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue6/index.dtl;
http://www.math.utah.edu/pub/tex/bib/compj2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/full/49/6/762-a;
http://comjnl.oxfordjournals.org/cgi/reprint/49/6/762-a",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
Related entries
- £,
49(1)130,
49(2)249,
49(2)250,
49(3)375,
49(3)376,
49(4)500,
49(4)500,
49(4)501,
49(4)501,
49(5)629,
49(6)764,
50(1)129,
50(1)129,
50(3)369,
52(4)510,
52(4)510,
52(6)724,
52(6)725
- 0-387-95569-0,
0(0)xii--304
- \$79.95ash,
49(2)250
- algorithm,
0(0)xii--274,
0(0)xii--304,
0(0)xvii--325,
0(0)x--295,
43(1)81,
43(2)152,
43(4)315,
43(6)482,
44(2)101,
44(3)214,
44(4)292,
44(4)303,
45(1)88,
45(2)174,
45(2)237,
45(3)304,
45(4)423,
45(5)525,
45(5)561,
46(4)391,
46(4)401,
46(4)427,
46(5)498,
46(6)645,
46(6)680,
47(5)602,
47(6)694,
47(6)701,
48(2)220,
48(3)300,
48(4)443,
48(6)650,
48(6)737,
48(6)749,
49(1)42,
49(1)108,
49(2)201,
49(2)249,
49(2)252,
49(3)351,
49(3)358,
49(4)418,
49(5)629,
50(3)332,
50(3)348,
50(4)435,
50(4)473,
50(6)728,
51(1)7,
51(1)26,
51(1)60,
51(1)79,
51(1)122,
51(1)137,
51(3)303,
51(4)451,
51(4)470,
51(6)688,
52(1)90,
52(2)268,
52(6)656,
52(6)690,
1008(0)363
- computer,
0(0)viii--378,
0(0)xi--170,
0(0)xi--420,
0(0)xii--574,
0(0)xiii--483,
0(0)xiii--574,
0(0)xv--387,
0(0)xvi--848,
0(0)xvii--325,
0(0)xviii--240,
0(0)xxi--418,
0(0)xxiii--703,
0(0)xxv--469,
0(0)xxv--672,
0(0)xxvi--590,
0(0)xxx--593,
0(0)xxxii--648,
0(0)xxxvi--412,
0(0)0,
0(0)x--295,
0(0)x--438,
7(0)x--153,
35(0)335,
41(7)445,
43(4)274,
44(4)321,
44(4)324,
44(4)326,
46(1)3,
46(5)487,
47(4)399,
47(6)627,
48(6)650,
48(6)662,
49(1)129,
49(1)130,
49(2)136,
49(2)249,
49(3)376,
49(3)378,
49(4)390,
49(4)501,
50(1)4,
50(2)151,
50(3)254,
50(4)375,
51(1)1,
51(6)688,
51(6)731,
51(6)735,
51(6)741,
51(6)743,
58(0)xvi--358,
z(0)xiv--320,
z(0)xxvi--442
- Hardbound,
49(1)127,
49(1)130,
49(2)249,
49(2)251,
49(2)252,
49(3)375,
49(3)376,
49(4)501,
49(5)629,
49(5)629,
49(6)762,
50(3)369,
52(6)724
- ISBN,
49(1)127,
49(1)127,
49(1)128,
49(1)129,
49(1)130,
49(2)249,
49(2)250,
49(2)251,
49(2)252,
49(3)375,
49(3)376,
49(3)376,
49(4)500,
49(4)500,
49(4)501,
49(4)501,
49(5)629,
49(5)629,
49(6)762,
49(6)764,
50(1)129,
50(3)369,
52(6)725
- mark,
47(2)271,
47(4)399,
47(5)623,
49(4)500
- pp,
46(5)487,
49(1)127,
49(1)127,
49(1)128,
49(1)129,
49(1)130,
49(2)249,
49(2)250,
49(2)251,
49(2)252,
49(3)375,
49(3)376,
49(3)376,
49(4)500,
49(4)500,
49(4)501,
49(4)501,
49(5)629,
49(5)629,
49(6)762,
49(6)764,
50(1)129,
50(3)369,
52(4)510,
52(4)510,
52(6)724,
52(6)725,
52(6)725
- science,
0(0)viii--378,
0(0)xi--420,
0(0)xii--574,
0(0)xiii--483,
0(0)xvii--325,
0(0)xxiii--703,
0(0)xxxii--648,
0(0)0,
7(0)x--153,
35(0)335,
47(4)399,
48(1)49,
48(4)460,
49(1)128,
49(1)130,
49(2)249,
49(3)376,
49(4)501,
z(0)xiv--320,
z(0)xxvi--442
- series,
47(4)399,
49(1)130,
49(2)249,
49(2)250,
49(2)252,
49(3)376,
49(4)501,
50(3)371,
50(4)500
- Springer-Verlag,
49(2)252,
49(3)375,
49(3)376,
49(5)629,
49(6)762
- Verlag, Springer-,
49(2)252,
49(3)375,
49(3)376,
49(5)629,
49(6)762