To see accurate pricing, please choose your delivery country.
 
 
United States
£ GBP
All Shops

British Wildlife

8 issues per year 84 pages per issue Subscription only

British Wildlife is the leading natural history magazine in the UK, providing essential reading for both enthusiast and professional naturalists and wildlife conservationists. Published eight times a year, British Wildlife bridges the gap between popular writing and scientific literature through a combination of long-form articles, regular columns and reports, book reviews and letters.

Subscriptions from £33 per year

Conservation Land Management

4 issues per year 44 pages per issue Subscription only

Conservation Land Management (CLM) is a quarterly magazine that is widely regarded as essential reading for all who are involved in land management for nature conservation, across the British Isles. CLM includes long-form articles, events listings, publication reviews, new product information and updates, reports of conferences and letters.

Subscriptions from £26 per year
Academic & Professional Books  Reference  Data Analysis & Modelling  Data Analysis & Statistics

Fundamentals of Algorithmics

Textbook Out of Print
By: G Brassard
400 pages
Fundamentals of Algorithmics
Click to have a closer look
  • Fundamentals of Algorithmics ISBN: 9780133350685 Paperback Dec 1995 Out of Print #89572
About this book Contents Related titles

About this book

This is an introductory-level algorithm text which includes worked examples and detailed proofs, presenting algorithms by type rather than proof. The book begins with a compact, but complete introduction to some necessary maths, and also includes a long introduction to proofs by contradiction and mathematical induction to fill the gaps that many undergraduates have in their knowledge. It then goes on to provide a thorough introduction to the analysis of algorithms, and uses coherent notation and solving recurrences. It also includes a chapter on probabilistic algorithms, and an introduction to parallel algorithms. This work is intended for use on undergraduate courses in Algorithms or Design and Analysis of Algorithms.

Contents

1. Preliminaries. 2. Elementary Algorithmicss. 3. Asymptotic Notation. 4. Analysis of Algorithms. 5. Some Data Structures. 6. Greedy Algorithms. 7. Divide-And-Conquer. 8. Dynamic Programming. 9. Exploring Graphs. 10. Probabilistic Algorithms. 11. Parallel Algorithms. 12. Computational Complexity. 13. Heuristic and Approximate Algorithms. References. Index.

Customer Reviews

Textbook Out of Print
By: G Brassard
400 pages
Current promotions
New and Forthcoming BooksNHBS Moth TrapBritish Wildlife MagazineBuyers Guides