Encyclopedia of Algorithms
Buch in deiner Nähe kaufen
Beschreibung
The Encyclopedia of Algorithms provides a comprehensive set of solutions to important algorithmic problems for students and researchers, including high-impact solutions from the most recent decade.
A must-have for computer scientists, this encyclopedic reference has been edited by Ming Yang Kao, Editor-in-Chief of the top journal in the field, Algorithmica.
All of the entries have been written and peer-reviewed by experts in the field. Nearly 400 entries are organized alphabetically by problem, with subentries for distinct solutions.
Extensive cross-references support efficient, user-friendly searches for immediate access to useful information.
This defining reference is published both in print and online. The print publication includes an index of subjects and authors as well as a chronology for locating recent solutions. The online edition supplements this index with hyperlinks as well as including internal hyperlinks to related entries in the text, CrossRef citations, and links to additional significant research.
Open problems, links to downloadable code, experimental results, data sets, and illustrations are included.
One of Springer’s renowned Major Reference Works, this defining reference provides a comprehensive set of solutions to important algorithmic problems for students and researchers. No comparable reference work on this subject is available, making this a genuine must-have for computer scientists.
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.
No comparable reference work on Algorithms is currently available
A-Z organization allows easy, intuitive access to professionals and researchers interested in a particular aspect of Algorithms
Targeted literature references provide additional value for researchers looking to study a topic in more detail
Useful for scholars, researchers, and professionals who work in other fields — such as mathematics, statistics, biology, economics, financial software, medical informatics, and data mining
Editor-in-Chief is leader in field, with name recognition as EiC of top journal (Algorithmica)
Top-quality editorial board, both scientifically and geographically diverse – ensures balanced coverage
One of Springer’s renowned Major Reference Works, it 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. The print publication includes an index of subjects and authors as well as a chronology for locating recent solutions. The online edition supplements this index with hyperlinks as well as including hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.
Autor*in
Ming-Yang Kao
Themen in »Encyclopedia of Algorithms«
Algorithmica Algorithms All-pairs shortest paths Approximating Arithmetic Coding for Data Compression Bin Packing Communication Algorithms Decoding Dynamic Tree Problems Factoring Fully Dynamic Connectivity Local Alignment MRWMay2006 Maximum Minimum
Stimmen zu »Encyclopedia of Algorithms«
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)()