|
|
 |
| Результат поиска |
Поиск книг, содержащих: Tarjan, R.E.
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 14, 117, 119, 120, 139, 329, 2018, 2025, 2027 | | Devroye L. — Generation of non-uniform random variates | 431 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 14, 114, 117, 119, 120, 125, 128, 135, 139, 307, 327, 329, 566, 883, 910, 1458, 1511, 1582, 1754, 2018, 2020, 2025, 2027, see Fredman, M.L., see Gabow, H., see Garey, M.R., see Goldberg, A.V., see Goldberg, M.V., see Hopcroft, J.E., see Paul, W.J. | | Bach E., Shallit J. — Algorithmic Number Theory (том 1) | 38 | | Merris R. — Combinatorics | 501 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 237, 242, 243, 246, 247, 274, 281, 332, 337, 339, 344, 345 | | Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 299, 354, 355 | | Papadimitriou C.H. — Computational Complexity | 17, 487, 488 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 510 | | Motwani R., Raghavan P. — Randomized algorithms | 63, 229, 302, 303, 387, 389 | | Samet H. — Applications of Spatial Data Structures: Computer Graphics, Image Processing, and Other Areas | 186—187, 432, 439, 454, 463, 468, 472 | | Sedgewick R. — Algorithms | 387, 405, 428, 454 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 15, 21—23, 71—72, 80, 92, 95, 114—115, 135, 141—142, 148, 253, 257, 392, 530, 575, 586 | | Samet H. — The design and analysis of spatial data structures | 118, 173, 176, 250, 286—287, 387—389, 418, 425, 440, 449, 454, 458 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 216, 217, 246, 305, 306 | | Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 33, 34, 79, 87, 95, 121, 149, 151, 160, 161, 162, 170, 182, 183, 185, 210 | | Bentley J. — Programming pearls | 137 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 114 | | Gibbons A. — Algorithmic graph theory | 32, 42, 62, 72, 85, 86, 92, 244 | | Gibbons A. — Algorithmic graph theory | 32, 42, 62, 72, 85, 86, 92, 244 | | Devroye L. — Non-Uniform Random Variate Generation | 431 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 111, 243 | | Bentley J. — Programming Pearls | 137 | | Rubinoff M., Yovits M. — Advances in Computers, Volume 14 | 20, 42 |
|
|
|
|
О проекте