pickabook books with huge discounts for everyone
pickabook books with huge discounts for everyone
Visit our new collection website www.collectionsforschool.co.uk
     
Email: Subscribe to news & offers:
Need assistance? Log In/Register


Item Details
Title: DATA STRUCTURES AND ALGORITHMS
SORTING AND SEARCHING
Volume: 1
By: Kurt Mehlhorn
Format: Paperback

List price: £72.00


We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10: 3642696740
ISBN 13: 9783642696749
Publisher: SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG
Pub. date: 8 December, 2011
Edition: Softcover reprint of the original 1st ed. 1984
Series: Monographs in Theoretical Computer Science : An Eatcs Series 1
Pages: 350
Synopsis: The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen- dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith- mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa- tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I.Most of the algorithms presented are very recent inven- tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.
Illustrations: biography
Publication: Germany
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Returns: Returnable
Some other items by this author:
ALGORITHMEN UND DATENSTRUKTUREN
ALGORITHMS - ESA 2008 (PB)
ALGORITHMS AND DATA STRUCTURES (HB)
ALGORITHMS AND DATA STRUCTURES (PB)
AUTOMATA, LANGUAGES, AND PROGRAMMING (PB)
AUTOMATA, LANGUAGES, AND PROGRAMMING (PB)
CONSTRUCTIVE HOPF'S THEOREM
CONSTRUCTIVE HOPF'S THEOREM (HB)
DATA STRUCTURES AND ALGORITHMS (PB)
DATA STRUCTURES AND ALGORITHMS (PB)
DATA STRUCTURES AND ALGORITHMS 2 (HB)
DATENSTRUKTUREN UND EFFIZIENTE ALGORITHMEN (PB)
GRANULARITY OF PARALLEL MEMORIES
GRANULARITY OF PARALLEL MEMORIES (HB)
GRUNDLAGEN DER PROGRAMMIERSPRACHEN
INFORMATIK 2000 (PB)
LEDA (HB)
LEDA 2 PART PAPERBACK SET
PARALLEL ALGORITHMS AND ARCHITECTURES (PB)
SEQUENTIAL AND PARALLEL ALGORITHMS AND DATA STRUCTURES
SEQUENTIAL AND PARALLEL ALGORITHMS AND DATA STRUCTURES (HB)
STACS 84 (PB)
STACS 85 (PB)
VLSI ALGORITHMS AND ARCHITECTURES (PB)



Information provided by www.pickabook.co.uk
SHOPPING BASKET
  
Your basket is empty
  Total Items: 0
 






Early Learning
Little Worried Caterpillar (PB) Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
add to basket

Early Learning
add to basket

Picture Book
All the Things We Carry PB What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
add to basket