Encyclopedia of Algorithms (eBook)

Ming-Yang Kao (Herausgeber)

eBook Download: EPUB

2016 | 2. Auflage
2500 Seiten
Springer New York (Verlag)
978-1-4939-2864-4 (ISBN)

Infos

The 2^nd ed. of this comprehensive work provides a set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference focused on high-impact solutions from the most recent decade; this edition widens the scope of the work.

Nearly 500 entries are organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry includes: 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 are provided. All entries are written by experts with links to Internet sites that outline their research work. The entries are peer-reviewed.

This defining reference is published 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 and also includes hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.

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.

Kao heads the EECS Computing, Algorithms & Applications Division and is the editor-in-chief of Algorithmica.

---

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

Produkt-Details

• Erscheint lt. Verlag: 22.4.2016
• Sprache: englisch
• Themenwelt: Schulbuch / Wörterbuch ► Lexikon / Chroniken
• Themenwelt: Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Analysis
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Technik ► Elektrotechnik / Energietechnik
• ISBN-10: 1-4939-2864-3 / 1493928643
• ISBN-13: 978-1-4939-2864-4 / 9781493928644