Книга | Страницы для поиска |
Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 1221 |
Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 95 |
Sobell M.G. — A Practical Guide to Red Hat Linux | |
Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 614 |
Diestel R. — Graph Theory | 12, 27 |
Lee J.M. — Differential and Physical Geometry | 334 |
Sobell M.G., Seebach P. — A Practical Guide to UNIX® for Mac OS® X Users | |
Allen R., Lowe-Norris A.G. — Active Directory | |
Aho A.V., Sethi R., Ullman J.D. — Compilers: principles, techniques and tools | 29 |
Maeder R.E. — Computer science with mathematica | 133 |
Barnsley M. — Fractals Everywhere | 53, 98, 102—103, 105, 156, 379 |
Brin M., Stuck G. — Introdution to dynamical system | 139 |
Lee K.-K. — Building Resilient IP Networks | |
Mahmoud H.M. — Evolution of random search trees | 6 |
Diestel R. — Graph theory | 13, 15, 31, 204 |
Bryant R.L., Chern S.S., Gardner R.B. — Exterior differential systems | 29 |
Moerdijk I., Mrcun J. — Introduction to Foliations and Lie Groupoids | 5 |
Michor P.W. — Topics in Differential Geometry | 31 |
Kolar I., Michor P.W., Slovak J. — Natural Operations in Differential Geometry | 25 |
Forsyth R., Naylor Ch. — The Hitch-Hicker's Guide to Artificial Intelligence | 129 |
Williamson S. — Combinatorics for computer science | 228 |
Zoladek H. — Monodromy Group | 334 |
Hein J.L. — Discrete Mathematics | 50 |
Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 181—182 |
Ross Sh.M. — Topics in Finite and Discrete Mathematics | 127 |
Brickell F., Clark R.S. — Differentiable Manifolds | 202 |
Marchette D.J. — Random Graphs for Statistical Pattern Recognition | 4 |
Бауэр Ф.Л., Гооз Г. — Информатика | 438 |
Semple Ch., Steel M. — Phylogenetics | 7 |
Sugiyama K. — Graph Drawing and Applications for Software and Knowledge Engineers | 23 |
Spivak M. — A Comprehensive Introduction to Differential Geometry (Vol.1) | 194 |
Hein J.L. — Discrete Structures, Logic, and Computability | 48 |
Barthelemy J.-P., Guenoche A. — Trees and proximity representations | 4 |
Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 41 |
Ebbinghaus H.-D., Flum J. — Finite Model Theory | 3 |
Troelstra A.S. — Basic proof theory | 8 |
Tamura I. — Topology of lie groups, I and II | 82 |
D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | 214, 6, 231, 393 |
Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 210 |
Hubbard J.R. — Theory and Problems of Fundamentals of Computing with C++ | 277, 293, 312 |
Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 194 |
Hein J.L. — Theory of Computation: An Introduction | 22 |
Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search | 245 |
König S., Zimmermann A. — Derived Equivalences For Group Rings | 69 |
Shafer G. — The Art of Causal Conjecture | 385 |
Ore O. — Theory of Graphs | 82, 149 |
Perrin D., Pin J.-E. — Infinite Words: Automata, Semigroups, Logic abd Games | 415 |
Lee J.M. — Differential and physical geometry | 334 |
Brickell F., Clark R.S. — Differentiable manifolds | 202 |
Hermann R. — Differential geometry and the calculus of variations | 69, 70 |
Diestel R. — Graph Theory | 12, 27 |
Gibbons A. — Algorithmic graph theory | 7 |
Gibbons A. — Algorithmic graph theory | 7 |
Iverson K.E. — A Programming Language | 46 |
Gries D. — A Logical Approach to Discrete Math | 233 |
Candel A., Conlon L. — Foliations I | 5, 279 |
Tuynman G.M. — Supermanifolds and Supergroups: Basic Theory | 244, 246, 294 |
Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | 39 |
Partee B.H., Meulen A.T., Wall R.E. — Mathematical Methods in Linguistics | 441, 444, 447, 449, 556, 557 |
Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 39 |
Pier J.-P. — Mathematical Analysis during the 20th Century | 298 |
Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 588, 591, 593, 596, 597, 600, 601, 611, 612 |
Di Battista G. — Graph Drawing: Algorithms for the Visualization of Graphs | 42 |
Gossett E. — Discrete Math with Proof | 670 |
Koffman E. — Problem Solving and Structured Programming in PASCAL | 417 |
Andrews P.B. — An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof | 118 |
Scheinerman E.A. — Mathematics: A Discrete Introduction | 416, 548 |
Brainerd W.S., Goldberg C.H., Gross J.L. — Pascal Programming : A Spiral Approach | 493 |
Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 588, 591, 593, 596, 597, 600, 601, 611, 612 |
D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | 214-216, 231, 393 |
Markl M., Shnider S., Stasheff J. — Operads in Algebra, Topology and Physics | 50 |
Truss J.K. — Foundations of Mathematical Analysis | 294 |
Truss J. — Foundations of mathematical analysis | 294 |
J. K. Truss — Foundations of mathematical analysis MCet | 294 |