Posted by **Grev27** at March 30, 2018

English | 17 Sept. 1997 | ISBN: 0201314525 | 720 Pages | PDF | 14.9 MB

Posted by **Grev27** at March 27, 2018

English | ISBN: 0201316633 | 2001 | PDF | 512 pages | 15 MB

Posted by **Grev27** at March 26, 2018

English | 28 Apr. 2011 | ISBN: 032157351X | 992 Pages | EPUB/MOBI | 71.71 MB

Posted by **AlexGolova** at March 20, 2018

English | 16 Aug. 2001 | ISBN: 0201316633 | 500 Pages | MOBI | 5.77 MB

Posted by **First1** at Nov. 17, 2017

English | 2008 | ISBN: 0201361205, 9780201361209 | 764 Pages | True PDF | 17.28 MB

By blending theory and practice, this book appeals equally to both the academic and professional markets. For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java.

Posted by **roxul** at April 19, 2018

English | 2016 | ISBN-10: 3319242091 | 558 pages | EPUB | 8 MB

Posted by **AvaxGenius** at April 19, 2018

English | PDF,EPUB | 2018 | 356 Pages | ISBN : 9811090033 | 20.57 MB

The main theme of this book is recent progress in structure-preserving algorithms for solving initial value problems of oscillatory differential equations arising in a variety of research areas, such as astronomy, theoretical physics, electronics, quantum mechanics and engineering. It systematically describes the latest advances in the development of structure-preserving integrators for oscillatory differential equations, such as structure-preserving exponential integrators, functionally fitted energy-preserving integrators, exponential Fourier collocation methods, trigonometric collocation methods, and symmetric and arbitrarily high-order time-stepping methods.

Posted by **DZ123** at April 18, 2018

English | 2013 | ISBN: 144715018X | PDF | pages: 101 | 4.1 mb

Posted by **AvaxGenius** at April 18, 2018

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before.

Posted by **igor_lv** at April 17, 2018

English | 1987 | ISBN: 1107669375 | PDF | 142 pages | 13 Mb