| Êíèãà | Ñòðàíèöû äëÿ ïîèñêà |
| Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 1221 |
| Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 96 |
| Ãóäðè÷ Ì.Ò., Òàìàññèÿ Ð. — Ñòðóêòóðû äàííûõ è àëãîðèòìû â Java | 253 |
| Ñòèâåíc Ð. — Delphi. Ãîòîâûå àëãîðèòìû | 127 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 1034 |
| Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 628 |
| Jurafsky D., Martin J.H. — Speech and Language Processing | 344 |
| Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 72 |
| Fulton W. — Young tableaux: with applications to representation theory and geometry | 70 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1034 |
| Deitel H.M. — Visual C# How to Program | 2nd 3rd |
| Terry P.D. — Compliers and Compiler Generators: An Introduction With C++ | 82, 214, 244 |
| Grimmett G. — Percolation | 254 |
| Hilyard J., Teilhet S. — C# Cookbook | 2nd |
| Deitel H.M. — C++ How to Program | 2nd 3rd 4th |
| Diestel R. — Graph theory | 203, 238 |
| Kohonen T. — Self-organizing maps | 45 |
| Sketches — A supplement for Category theory for computing science | 18, 30 |
| Comtet L. — Advanced Combinatorics. The Art of Finite and Infinate Expansions | 54 |
| Kowalski R. — Logic for problem solving | 108, 132 |
| Finch S.R. — Mathematical constants | 25, 147, 294, 298 |
| Hein J.L. — Discrete Mathematics | 52—54, 123—124, 163—166, 547 |
| Rowe N.C. — Artifical intelligence through Prolog | see Tree |
| Solomon C. — Computer environments for children | see “Tree structures” |
| Kingston J.H. (ed.) — An Introduction to Computer Programming with Java | 262 |
| Purdom R.W., Brown C.A. — The analysis of algorithms | 279—280, 315, 354—355 |
| Marchette D.J. — Random Graphs for Statistical Pattern Recognition | 19 |
| Braunstein S.L. — Quantum computing | 117, 131, 132 |
| Samet H. — The design and analysis of spatial data structures | see “Binary search tree” |
| Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 247 |
| Sugiyama K. — Graph Drawing and Applications for Software and Knowledge Engineers | 21 |
| von zur Gathen J., Gerhard J. — Modern computer algebra | 280, 287, 289—291, 293 |
| Watt D.A. — Java collections: an introduction to abstract data types, data structures, and algorithms | 120, 236—269 (see also “AVL-tree”, “Binary search tree”, “Heap”, “Red-black tree”) |
| Alagić S., Arbib M.A. — The Design of Well-Structured and Correct Programs | 217 |
| Brookshear J.G. — Computer Science: An Overview | 368, 381 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 51—52, 120—122, 159—162, 541—542 |
| Ruskey F. — Combinatorial generation | 74, 112 |
| Knuth D.E. — The art of computer programming (vol. 3 Sorting and Searching) | see also “Complete binary tree”, “Extended binary tree” |
| Grimmett G., Stirzaker D. — Probability and Random Processes | 210 |
| Hubbard J.R. — Theory and Problems of Fundamentals of Computing with C++ | 277, 283 |
| Harris M.D. — Introduction to Natural Language Processing | 120—129, 167 |
| Ward S.A. — Computation Structures | 242-243 |
| Antia H.M. — Numerical Methods for Scientists and Engineers | 36, 102 |
| Feldt R., Johnson L., Neumann M. — Ruby Developer's Guide | 461 |
| Hein J.L. — Theory of Computation: An Introduction | 22, 59, 68—70 |
| Seul M., O'Gorman L., Sammon M.J. — Practical algorithms for image analysis. Description, examples, and code | 291 |
| Ballard D.H., Brown C.M. — Computer vision | 244 |
| Marques de Sa J.P. — Pattern recognition: concepts, methods, and applications | 27 |
| Nijenhuis A., Wilf H.S. — Combinatorial Algorithms: For Computers and Calculators | 180 |
| Kaye R. — Models of Peano Arithmetic | (see Tree) |
| Kernighan B.W., Ritchie D.M. — The C programming language | 139 |
| Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 276 |
| van Lint J.H., Wilson R.M. — Course in Combinatorics | 119 |
| Rucker R. — Mind Tools. The Five Levels of Mathematical Reality | 162, 164, 262, 264, 265, 278, See also "Precision golf" |
| Jovanovic-Dolecek G. — Multirate Systems: Design and Applications | 194 |
| Gibbons A. — Algorithmic graph theory | 7 |
| Gibbons A. — Algorithmic graph theory | 7 |
| Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 436, 473 |
| Brookshear J. — Computer Science | 368, 381 |
| Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 436,473 |
| Gries D. — A Logical Approach to Discrete Math | 233 |
| Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 147, 171 |
| Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 276 |
| Du D.-Z., Ko K.-I. — Theory of computational complexity | 150 |
| Suppes P.(ed.) — Handbook of Proof Theory.Studies in logic the foundations of mathematics.Volume 137. | 371 |
| Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 40, 279 |
| Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 488, 595, 600 |
| Di Battista G. — Graph Drawing: Algorithms for the Visualization of Graphs | 30, 42 |
| Drmota M., Flajolet P., Gardy D. — Mathematics and computer science 3. Algorithms, trees, combinatorics and probabilities | 241 |
| Gossett E. — Discrete Math with Proof | 670 |
| Szabo M. E. — Algebra of proofs | 18 |
| Akenine-Möller T. — Real-Time Rendering | see "Tree" |
| Deitel H., Deitel P.J. — C. How to Program | 468, 489 |
| Addison P.S. — Fractals and chaos | 4 |
| Koffman E. — Problem Solving and Structured Programming in PASCAL | 417 |
| Brainerd W.S., Goldberg C.H., Gross J.L. — Pascal Programming : A Spiral Approach | 492—498, 505—506 |
| Gill A. — Applied Algebra for the Computer Sciences | 376 |
| Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 290 |
| Ward S., Halstead R. — Computation Structures (MIT Electrical Engineering and Computer Science) | 242—243 |
| Gries D. — The science of programming | 229 |
| Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 488, 595, 600 |
| Plischke M., Bergersen B. — Equilibrium statistical physics | 362 |
| Nijenhuis A., Wilf H.S. — Combinatorial algorithms for computers and calculators | 180 |
| Truss J.K. — Foundations of Mathematical Analysis | 234 |
| Truss J. — Foundations of mathematical analysis | 234 |
| J. K. Truss — Foundations of mathematical analysis MCet | 234 |
|
|
Î ïðîåêòå