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.

"About this title" may belong to another edition of this title.

Store Description

Labyrinth is an acclaimed independent bookstore serving the students and faculty of Princeton University as well as the town of Princeton and beyond. As the official bookstore for Princeton University, our independent store specializes in academic books for scholars, and we can always be relied upon to provide those books that form the backbone of current debates both inside and outside of the universities. We also carry books of broad and general interest: contemporary and classic literature, poetry, current events, history, philosophy, theology, cookbooks, comics, and books for children. We offer a large selection of constantly-changing inventory, daily sales and deep discounts on most books, used and antiquarian titles.

Visit Seller's Storefront

Seller's business information

Great Jones Books, Inc.
27 Route 31 South, Pennington, NJ, 08534, U.S.A.

Terms of Sale:

Purchase will be shipped upon receipt of payment including any additional shipping costs. NJ residents add appropriate sales tax. If you are dissatisfied (Incorrect Item/Not as Described/Damaged) or if the order has not arrived by the latest estimated delivery date, you maybe be eligible for a refund within 30 days of the estimated delivery date. Please contact us for any other return inquiries, and we will respond within 2 business days.

Shipping Terms:

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 lbs or less, or 1 kg. Heavy or oversized books may require additional shipping charges.

Domestic shipping: Under 2.2 lbs
Media Mail $4.00 per book + $1.00 for each additional book
Priority Mail $7.00 per book + $3.00 for each additional book

Standard Shipping orders will be delivered via UPS Ground and USPS Media Mail, typically 2-5 business days for in-stock items. In-stock items will generally ship by the next business day.

Please note: While the overwhelming majority of packages shipped via USPS Media Mail arrive within the time specified above, in rare cases shipments can take up to 3 to 5 weeks to arrive. Media Mail shipments to Alaska, Hawaii, Guam, Puerto Rico and APO/FPO addresses can take up 3 to 8 weeks to arrive.

Payment Methods
accepted by seller

Add to Wants

Items related to Data Structures and Algorithms I: Sorting and Searching...

Data Structures and Algorithms I: Sorting and Searching (Monographs in Theoretical Computer Science. An EATCS Series)

K. Mehlhorn

Used - Hardcover

Seller's business information