Overview
- Covers a wealth of problems currently relevant in diverse fields including biology, economics, financial software and computer science, amongst others
- Presents accessible, updated and enhanced, A-Z entries with useful cross-references
- Features examples from growing areas such as bioinformatics and social networks
- Ensures a balanced coverage through a top-quality, scientifically and geographically diverse editorial board
- Offers literature references for those looking to study a topic in more detail
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (633 entries)
-
Front Matter
-
A
Keywords
About this book
This dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics.
This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms.
Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code.
All entries are peer-reviewed, written by leading experts in the field—and each entry contains links to a summary of the author’s research work.
This defining reference is available in both print and online—a dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs.
New and Updated entries include:
Algorithmic Aspects of Distributed Sensor Networks,
Algorithms for Modern Computers
Bioinformatics
Certified Reconstruction and Mesh Generation
Combinatorial Group Testing
Compression of Text and Data Structures
Computational Counting
Computational Economics
Computational Geometry
Differential Privacy
Enumeration Algorithms
Exact Exponential Algorithms
Game Theory
Graph Drawing
Group Testing
Internet Algorithms
Kernels and Compressions
Massive Data Algorithms
Mathematical Optimization
Modern Learning Theory
Social Networks
Stable Marriage Problems, k-SAT Algorithms
Sublinear Algorithms
Tile Self-Assembly
VLSI CAD Algorithms
Reviews
Editors and Affiliations
About the editor
Ming-Yang Kao is Professor of Computer Science at the Northwestern University, Evanston. He got a B.S. in Mathematics, 1978 at the National Taiwan University, Republic of China (Taiwan) and his Ph.D. in Computer Science, 1986, at Yale University, USA.
Prof. Kao studies the design, analysis and implementation of algorithms. His work spans a broad range of applications including bioinformatics, computational finance, electronic commerce, and nanotechnology. Kao's most recent research includes work on DNA self-assembly, variants of the traveling salesman problem, and graph labeling problems.
Bibliographic Information
Book Title: Encyclopedia of Algorithms
Editors: Ming-Yang Kao
DOI: https://doi.org/10.1007/978-1-4939-2864-4
Publisher: Springer New York, NY
eBook Packages: Computer Science, Reference Module Computer Science and Engineering
Copyright Information: Springer Science+Business Media New York 2016
Hardcover ISBN: 978-1-4939-2863-7
eBook ISBN: 978-1-4939-2864-4
Edition Number: 2
Number of Pages: L, 2389
Number of Illustrations: 263 b/w illustrations, 116 illustrations in colour
Topics: Theory of Computation, Electrical Engineering, Applications of Mathematics, Artificial Intelligence, Computational Mathematics and Numerical Analysis