Encyclopedia of Algorithms (Springer Reference) by Ming-Yang Kao (Editor)

Encyclopedia of Algorithms (Springer Reference) by  Ming-Yang Kao (Editor)
Item# 11011340082
Retail price: US$399.00
Sale price: US$12.00

all items in this store are to be sent to your email within 24 hours after cleared payment. PDF eBooks are sent to you as email attachments. as for mp3 audiobook, a download link from ONEDRIVE will be sent to your email for you to download.

Please Read Before Your Purchase!!!

1. This item is an E-Book in PDF format.

2. Shipping & Delivery: Send to you by E-mail within 24 Hours after cleared payment. Immediately Arrival!!!

3. Shipping ( by email) + Handling Fee = US$0.00 ( Promotional Period)

4. Time-Limited Offer, Order Fast.


Encyclopedia of Algorithms (Springer Reference)

by Ming-Yang Kao (Editor)

Publisher: Springer; 1 edition (August 6, 2008)

Computer Science > Theoretical Computer Science


From the reviews:

"This book was designed to provide a comprehensive overview of developments in solving important algorithmic problems. ¡­ This encyclopedia provides an efficient reference for the definitions and key results of algorithmic problems. ¡­ The entries are in alphabetical order. There are over 300 entries and over 4,000 additional references. ¡­ In conclusion, the book is a valuable resource for theoretical computer scientists and people working in operations research and optimization." (Haris Aziz, ACM Computing Reviews, April, 2009)

¡°This is an encyclopedia of algorithms that sets out the solutions to important algorithmic problems. It aims to be a comprehensive collection and is designed to provide quick and easy access for both students and researchers.¡± (Kybernetes, Vol. 38 (1/2), 2009)

Product Description

The Encyclopedia of Algorithms will provide a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference will focus on high-impact solutions from the most recent decade; later editions will widen the scope of the work.

Nearly 500 entries will be organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry will include:

a description of the basic algorithmic problem

the input and output specifications

the key results

examples of applications

citations to the key literature

Open problems, links to downloadable code, experimental results, data sets, and illustrations may be provided. All entries will be written by experts; links to Internet sites that outline their research work will also be provided. The entries will be peer-reviewed.

This defining reference will be published in print and on line. The print publication will include an index of subjects and authors as well as a chronology for locating recent solutions. The online edition will supplement this index with hyperlinks as well as include hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.