Herbert S. Wilf

Herbert S. Wilf

Herbert Wilf (1931-2012) was the University of Pennsylvania Thomas A. Scott Emeritus Professor of Mathematics. He was the author of six books and more than 160 research articles. From the 1950's, he was a pioneer in the mathematical programming of early computers, beginning with his work at Nuclear Development Associates, which led to his book Mathematical Methods for Digital Computers, written with A. Ralston. His early work focused on numerical analysis and complex analysis, and led to numerous research papers as well as a textbook, Mathematics for the Physical Sciences.

Back to all authors

Books Authored by Herbert S. Wilf

Combinatorial Algorithms for Computers and Calculators, Second Edition

Post date: 06 May 2007
An easy-to-read introduction to Combinatorial Algorithms for any graduate student of mathematics or computer science. Provides a kit of building blocks with which the reader can construct more elaborate structures of his or her own.
Publisher: Academic Press
Publication date: 01 Jun 1978
 
Combinatorial Algorithms for Computers and Calculators, Second Edition

Combinatorial Algorithms for Computers and Calculators, Second Edition

Post date: 06 May 2007
An easy-to-read introduction to Combinatorial Algorithms for any graduate student of mathematics or computer science. Provides a kit of building blocks with which the reader can construct more elaborate structures of his or her own.
Publisher: Academic Press
Publication date: 01 Jun 1978


generatingfunctionology

Post date: 08 Jan 2007
Covers generating functions as a bridge between discrete mathematics, on the one hand, and continuous analysis (particularly complex variable theory) on the other.
Publisher: A K Peters, Ltd.
Publication date: 20 Dec 2005
 
generatingfunctionology

generatingfunctionology

Post date: 08 Jan 2007
Covers generating functions as a bridge between discrete mathematics, on the one hand, and continuous analysis (particularly complex variable theory) on the other.
Publisher: A K Peters, Ltd.
Publication date: 20 Dec 2005


A=B

Post date: 02 Jul 2005
Shows how several recently developed computer algorithms can simplify complex summations, presenting the underlying mathematical theory of these methods, the principle theorems and proofs, and the implementation using Maple packages.
Publisher: A K Peters, Ltd.
Publication date: 01 Jan 1996
Document Type: Textbook
 
A=B

A=B

Post date: 02 Jul 2005
Shows how several recently developed computer algorithms can simplify complex summations, presenting the underlying mathematical theory of these methods, the principle theorems and proofs, and the implementation using Maple packages.
Publisher: A K Peters, Ltd.
Publication date: 01 Jan 1996
Document Type: Textbook


Algorithm and Complexity

Post date: 30 Oct 2004
Methods for solving problems on computers and the costs (usually the running time) of using those methods.
Publisher: A K Peters, Ltd.
Publication date: 09 Dec 2002
 
Algorithm and Complexity

Algorithm and Complexity

Post date: 30 Oct 2004
Methods for solving problems on computers and the costs (usually the running time) of using those methods.
Publisher: A K Peters, Ltd.
Publication date: 09 Dec 2002


Book Categories
Sponsors
Icons8, a free icon pack