 |
|
 A Guide to Experimental Algorithmics
Computational experiments on algorithms can supplement theoretical analysis by showing what algorithms, implementations, and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of the major experimental questions: What should I measure? What inputs should I test? How do I... |  |  Graph Algorithms
Shimon was a great computer scientist who inspired generations of Israeli
stutents and young researchers, including many future leaders of theoretical
computer science.
He was a master at creating combinatorial algorithms, constructions, and
proofs. He always sought the simplest and most lucid solutions. Because... |  |  Discrete Mathematics and its Applications
Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced... |
|
|
|
|
| Result Page: 13 12 11 10 9 8 7 6 5 4 3 2 1 |