|
|
 |
| Результат поиска |
Поиск книг, содержащих: Pippenger, N.
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 410, 425, 1755 | | Devroye L. — Generation of non-uniform random variates | 104, 431 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 410, 425, 1629, 1755, see Paul, W.J. | | Bach E., Shallit J. — Algorithmic Number Theory (том 1) | 66, 121 | | Mahmoud H.M. — Evolution of random search trees | 247 | | Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding | 214 | | Finch S.R. — Mathematical constants | 314, 316 | | Papadimitriou C.H. — Computational Complexity | 276, 353, 386, 389, 394 | | Samet H. — Applications of Spatial Data Structures: Computer Graphics, Image Processing, and Other Areas | 441 | | Purdom R.W., Brown C.A. — The analysis of algorithms | 249, 502 | | Sedgewick R. — Algorithms | 231, 237 | | Li M., Vitanyi P. — An introduction to Kolmogorov complexity and its applications | 393, 395, 444, 453 | | Mahmoud H.M. — Sorting: a distribution theory | 25 | | Samet H. — The design and analysis of spatial data structures | 107, 112, 117, 139, 141, 427 | | Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry | 74, 115 [247], 746, 759 [41] | | Kozen D.C. — The Design And Analysis Of Algorithms | 152 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 35 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 319 | | Gleason A. — Proceedings of the International Congress of Mathematicians | 1469-II | | Devroye L. — Non-Uniform Random Variate Generation | 104, 431 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 242, 243 | | Yovits M. — Advances in Computers.Volume 26. | 198 |
|
|
|
|
О проекте