|
|
 |
| Результат поиска |
Поиск книг, содержащих: Knuth, Donald E.
| Книга | Страницы для поиска | | Львовский С.М. — Набор и верстка в системе LaTeX | 13, 340 | | Отикер Т. — Не очень краткое введение в LaTeX2ε или LaTeX2ε за 106 минут | 1 | | Отикер Т. — Не очень краткое введение в LaTeX2ε или LaTeX2ε за 94 минуты | 1 | | Gardner M. — Wheels, life, and other mathematical amusements | 16, 119 | | Higham N. — Accuracy and stability of numerical algorithms | xxiv, 54, 57, 58, 67q, 87q, 93, 94, 114, 461, 491q, 520q, 526, 534 | | Rockmore D. — Stalking the Riemann Hypothesis: The Quest to Find the Hidden Law of Prime Numbers | 257 | | Borwein J., Bailey D., Girgensohn R. — Experimentation in Mathematics: Computational Paths to Discovery | 15, 110 | | Purdom R.W., Brown C.A. — The analysis of algorithms | xv, 6, 10, 12—14, 16, 18, 20, 23, 34, 37, 40, 44, 46, 54, 63, 65, 66, 67, 69, 75, 78, 80, 83, 92, 95, 98, 101, 109, 116, 121, 126, 130, 132, 136 157 160, 182, 185, 188, 190, 195, 198, 204, 213, 221, 223, 226, 227, 235, 238, 239, 245, 246, 249, 263, 271, 273, 278, 279, 282, 283, 293, 298, 301, 306, 308, 313, 317, 319, 328, 342, 344, 347, 353, 355, 369, 374, 379, 388, 395, 408, 412, 414, 459, 468, 481, 495, 496, 501, 502 | | Higham N.J. — Accuracy and Stability of Numerical Algorithms | xxiii, xxviii, 49, 53, 54, 61, 79, 84, 85, 104, 447, 471, 489, 518, 523, 532 | | Rockmore D. — Stalking the Riemann Hypothesis | 257 | | Scott M.L. — Programming Language Pragmatics | 102, 202 | | Bechtolsheim S.V. — TEX in Practice, Vol. 3 | I-xxv, I—13, II-xxv, xxxi, IV-xxi | | Bechtolsheim S.V. — TEX in Practice, Vol. 2 | I-xxv, I-13, xxv, III-xxxi, IV-xxi | | Hubbard J.R. — Theory and Problems of Programming with C++ | 240 | | Gardner M. — Knotted Doughnuts and Other Mathematical Entertainments | 71, 79, 84, 100, 102, 103, 106, 123—126, 127, 129, 131 | | Bechtolsheim S.V. — TEX in Practice, Vol. 1 | xxv, 13, II-xxv, xxxi, IV-xxi | | Bergin T.J., Gibson R.G. — History of Programming Languages (Vol. 2) | 393 | | Smyth B. — Computing patterns in strings | 18, 20, 36, 42, 77, 97, 98, 108, 176, 181—187, 194, 235, 330 | | Bjorner D. — Software Engineering 3 | 647, 648 | | Higham N. — Handbook of writing for the mathematical sciences | 3, 10, 23, 41, 45 n, 84, 86, 91 n, 94, 108, 185 q, 186, 206, 222 | | Higham N.J. — Handbook of writing for the mathematical sciences | 3, 10, 23, 41, 45 n, 84, 86, 91 n, 94, 108, 185 q, 186, 206, 222 | | Wilf H.S., Zeilbercer D., Petkovšek M. — A=B | ii, ix, 106, 165, 194 | | Gries D. — A Logical Approach to Discrete Math | 289, 318, 474 | | Dershowitz N. — Calendrical Calculations | xxiv, 41, 47, 121, 361 | | Berlekamp E., Wolfe D. — Mathematical Go: Chilling Gets the Last Point | 49 | | Oetiker T., Partl H., Hyna I., Schlegl E. — The not so short introduction to LaTeX2e | 1 | | Wilson R. — Mathematical conversations: selections from The mathematical intelligencer | 99 | | Kopka H., Daly P.W. — A Guide to LaTeX | 2, 3, 55, 71, 117, 149, 398, 436, 442, 445, 447, 561 | | Kupferschmid M. — Classical FORTRAN: Programming for Engineering and Scientific Applications | 488, 678, 683, 685 | | Gardner M. — Knotted Doughnuts and Other Mathematical Entertainments | 71, 79, 84, 100, 102, 103, 106, 123—126, 127, 129, 131 |
|
|
|
|
О проекте