| Книга | Страницы для поиска |
| Ахо А.В., Хопкрофт Д.Э., Ульман Д.Д. — Структуры данных и алгоритмы | 54, 122 |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 260 |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 194 |
| Страуструп Б. — Дизайн и эволюция C++ | 72 |
| Джосьютис Н. — C++ Стандартная библиотека | 430 |
| Шилдт Г. — C++. Руководство для начинающих | 382 |
| Стивенc Р. — Delphi. Готовые алгоритмы | 65 |
| Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 96.E |
| Шилдт Г. — Самоучитель C++ | 419 |
| Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 626 |
| Mishra B. — Algorithmic algebra | 14 |
| Lueneburg H. — Tools and fundamental constructions of combinatorial mathematics | 231 |
| Aho A.V., Sethi R., Ullman J.D. — Compilers: principles, techniques and tools | 507—508 |
| Deitel H.M. — Visual C# How to Program | 2nd 3rd |
| Cowart R., Knittel B. — Special Edition Using Microsoft Windows XP Professional | |
| Drayton P., Albahari B., Neward T. — C# in a Nutshell | |
| Cogswell J., Diggins C., Stephens R. — C++ Cookbook | |
| Deitel H.M. — C++ How to Program | |
| Lippman S.B., Lajoie J., Moo B.E. — C++ Primer | |
| Shapiro J.R., Policht M. — Building high availability Windows Server™ 2003 solutions | |
| Breuer L., Baum D. — Introduction to Queueing Theory and Matrix-Analytic Methods | 4 |
| Hein J.L. — Discrete Mathematics | 545 |
| Rowe N.C. — Artifical intelligence through Prolog | 233, 390, 391 |
| Kingston J.H. (ed.) — An Introduction to Computer Programming with Java | 99 |
| Sedgewick R. — Algorithms | 109, 395 |
| Li M., Vitanyi P. — An introduction to Kolmogorov complexity and its applications | 439 |
| Ito K. — Encyclopedic Dictionary of Mathematics | 96.E |
| Бауэр Ф.Л., Гооз Г. — Информатика | 365 |
| Архангельский А.Я. — C++ Builder 6. Книга 1 | 5.4.5 |
| Watt D.A. — Java collections: an introduction to abstract data types, data structures, and algorithms | 120, 149—165 (see also “ArrayQueue”, “LinkedQueue”) |
| Knuth D.E. — The art of computer programming (Vol. 1. Fundamental algorithms) | 235—239, 240—241, 248—249, 261—263, 271, 458 |
| Brookshear J.G. — Computer Science: An Overview | 136, 367, 379 |
| Bingham N.H., Goldie C.M., Teugels J.L. — Regular variation | 385—388, 421, 430 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 539 |
| Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 196 |
| Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 27 |
| Мейерс С. — Эффективное использование STL | 16 |
| Kozen D.C. — The Design And Analysis Of Algorithms | 19 |
| Hubbard J.R. — Theory and Problems of Fundamentals of Computing with C++ | 156, 163, 232 |
| Attiya H., Welch J. — Distributed computing | 203, 322, 338 |
| Feldt R., Johnson L., Neumann M. — Ruby Developer's Guide | 539 |
| Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 30 |
| Hein J.L. — Theory of Computation: An Introduction | 109 |
| Holz M., Podewski K.-P., Steffens K. — Injective Choice Functions | 127 |
| Shore S.N. — The Tapestry of Modern Astrophysics | 346—347 |
| Bona M. — Combinatorics of permutations | 300 |
| Milner R. — Communicating and mobile systems: the symbol for pi-calculus | 25, 72 |
| Knuth D.E. — The art of computer programming (vol. 1 Fundаmental algorithms) | 239—243, 264—266, 459, 577, 607 |
| Peterson J.L. — Petri net theory and the modeling of systems | 214 |
| Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 190 |
| Milner R. — Communicating and Mobile Systems: the Pi-Calculus | 25, 72 |
| Chase R.B., Jacobs E.R. — Operations management for competitive advantage | 289 |
| Dolev S. — Self-Stabilization | 6, 8, 49, 51, 59, 65, 75, 77, 82, 111, 114, 115, 118 |
| Baeten J.C.M., Middelburg С.A. — Process Algebra with timing | 129 |
| Grimmett G., Welsh D. — Probability: An Introduction | 185 |
| Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 227 |
| Brookshear J. — Computer Science | 136, 367, 379 |
| Conen W., Neumann G. — Coordination Technology for Collaborative Applications: Organizations, Processes, and Agents | 256, 258, 260 |
| Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 227 |
| Kept R. — Fundamentals of the Average Case Analysis of Particular Algorithms | 87, 128 |
| Luenberger D.G. — Introduction to dynamic systems | 50 |
| Нейгел К., Ивьен Б., Глинн Д. — C# 2005 и платформа .NET3.0 | 300 |
| Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 190 |
| Boissonnat J.D., Yvinec M. — Algorithmic Geometry | 15 |
| Hamacher C., Vranesic, Zaky S. — Computer Organization 5th Edition | 71, see also "Instructions" |
| Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 41, 321 |
| Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 598, 599 |
| Gossett E. — Discrete Math with Proof | 686, 689 |
| Rice J.A. — Mathematical statistics and data analysis | 31 |
| Hazel P. — Exim. The Mail Transfer Agent | 31 |
| Deitel H., Deitel P.J. — C. How to Program | 260, 396, 468, 484, 667 |
| Brainerd W.S., Goldberg C.H., Gross J.L. — Pascal Programming : A Spiral Approach | 523-525 |
| Shen A. — Algorithms and Programming | 85 |
| Gries D. — The science of programming | 313 |
| Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 598, 599 |
| Nievergelt J., Farrar J.C., Reingold E.M. — Computer approaches to mathematical problems | 162 |
| Bona M. — Combinatorics of Permutations | 300 |
|
|
О проекте