Real-world algorithms : a beginner's guide / Panos Louridas.

Incluye bibliografía e índice.

Preface -- 1 Stock spans -- 1.1 Algorithms -- 1.2 Running times and complexity -- 1.3 Stock span using stack, notes, exercises -- 2 Exploring the labyrinth -- 2.1 Graphs -- 2.2 Graph representation -- 2.3 Depth-first grapg traversal -- 2.4 Breadth-first search, notes, exercises -- 3 Compressing -- 3.1 Compression -- 3.2 Trees and Priority Queues -- 3.3 Huffman coding -- 3.4 Lempel-Ziv-Welch compression, Notes y exercises -- 4 Secrets -- 4.1 A decryption challenge -- 4.2 One-time pad -- 4.3 The AES cipher -- 4.4 Diffie-Hellman key exchange -- 4.5 Fast and modular exponentiation, notes, exercises -- 5. Split secrets -- 5.1 Public key cryptography -- 5.2 The RSA cryptosystem -- 5.3 Message hashing -- 5.4 Internet traffic anonymization, notes, exercises -- 6. Tasks in order -- 6.1 Topological sort -- 6.2 Wighted graphs -- 6.3 Critical paths, notes, exercises -- 7. Lines, paragraphs, paths -- 7.1 Shortest paths -- 7.2 Dijkstras algorithm, notes, exercises -- 8. Routing, arbitrage -- 8.1 Internet routing -- 8.2 The bellman-ford (-Moore) Algorithm -- 8.3 Negative wights and cycles -- 8.4 Arbitrage, notes -- 9. Whatsmost importan -- 9.1 the pagerank idea -- 9.2 The hyperlink matrix -- 9.3 The power method -- 9.4 The google matrix, notes -- 10. Voting strengths -- 10.1 Voting systems -- 10.2 The shulze method -- 10.3 The floyd-warshall algorithm, notes -- 11. Brute forces, secretaries, and dichotomies -- 11.1 Sequential search -- 11.2 Matching, comparing, records, keys -- 11.3 The matthew effect and power laws -- 11.4 Self-organizing search -- 11.5 The secretary problem -- 11.6 Binary search -- 11.7 Representing integers in computers -- 11.8 Binary search revisited -- 11.9 Comparison trees -- 12. A menagerie of sorts -- 12.1 Selection sort -- 12.2 Insertion sort -- 12.3 Heapsort -- 12.4 Merge sort -- 12.5 Quicksort -- 12.6 Spoilt fot choice, notes , exercises -- 13. The cloakroom, the pigeon, and the bucket -- 13.1 Mapping keys to values -- 13.2 Hashing --

13.3 Hashing functions -- 13.4 Floating point representation and hashing -- 13.5 Collisions -- 13.6 Digital fingerprints -- 13.7 Bloom filters, notes, exercises -- 14. Bits and trees -- 14.1 Divinations as a communications problem -- 14.2 Information and entropy -- 14.3 Classification -- 14.4 Decision trees -- 14.5 Attribute selection -- 14.6 The ID3 algorimth -- 14.7 The underlying machinery -- 14.8 Occams razor -- 14.9 Cost, problems,improvements, notes, exercises -- 15. Stringing along -- 15.1 Brute force string matching -- 15.2 The knuth-morris-pratt algorithm -- 15.3 The boyer-moore-horspool algorithm -- 16. Leave to chance -- 16.1 Random numbers -- 16.2 Random sampling -- 16.3 Power games -- 16.4 Searching for primes, notes, exercises.