Encyclopedia of Algorithms
Description
One of Springer's renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.
Reviews / Votes
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)More details
Other editions
New editions
Content
VLSI.- Distributed Computing.- Parallel Processing.- Automated Design.- Robotics.- Graphics.- Data Base Design.- Software Tools.- Sorting.- Searching.- Data Structures.- Computational Geometry.- Linear Programming.