Wilf, Herbert S. 19312012
Overview
Works:  99 works in 505 publications in 8 languages and 8,946 library holdings 

Genres:  Conference papers and proceedings Biography Documentary films Biographical films Nonfiction films Film adaptations 
Roles:  Author, Editor, Other, Honoree, Director, Author of introduction 
Classifications:  QA164, 511.60285425 
Publication Timeline
.
Most widely held works about
Herbert S Wilf
 Advances in combinatorics : Waterloo Workshop in Computer Algebra 2011, (WWCA 2011, W80), May 2629, 2011 : in memory of Herbert S. Wilf by Ilias Kotsireas( )
 Mathematical writing (CS 209) : by Donald Ervin Knuth( )
Most widely held works by
Herbert S Wilf
Algorithms and complexity by
Herbert S Wilf(
Book
)
40 editions published between 1986 and 2002 in 3 languages and held by 1,322 WorldCat member libraries worldwide
Tekoči in diskretni algoritmi v okviru numerične analize kot osnova za načrtovanje in pisanje računalniških programov
40 editions published between 1986 and 2002 in 3 languages and held by 1,322 WorldCat member libraries worldwide
Tekoči in diskretni algoritmi v okviru numerične analize kot osnova za načrtovanje in pisanje računalniških programov
Generatingfunctionology by
Herbert S Wilf(
Book
)
52 editions published between 1990 and 2014 in 4 languages and held by 1,215 WorldCat member libraries worldwide
This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics. This new edition includes several new areas of application, including the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences. An appendix on using the computer algebra programs MAPLE(r) and Mathematica(r) to generate functions is also included. The book provides a clear, unified introduction to the basic enumerative applications of generating functions, and includes exercises and solutions, many new, at the end of each chapter
52 editions published between 1990 and 2014 in 4 languages and held by 1,215 WorldCat member libraries worldwide
This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics. This new edition includes several new areas of application, including the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences. An appendix on using the computer algebra programs MAPLE(r) and Mathematica(r) to generate functions is also included. The book provides a clear, unified introduction to the basic enumerative applications of generating functions, and includes exercises and solutions, many new, at the end of each chapter
Mathematical methods for digital computers by
Anthony Ralston(
Book
)
39 editions published between 1960 and 1977 in English and Italian and held by 962 WorldCat member libraries worldwide
39 editions published between 1960 and 1977 in English and Italian and held by 962 WorldCat member libraries worldwide
Mathematics for the physical sciences by
Herbert S Wilf(
Book
)
42 editions published between 1962 and 2013 in 3 languages and held by 702 WorldCat member libraries worldwide
This book offers advanced undergraduates and graduate students in physics, engineering, and other natural sciences a solid foundation in several fields of mathematics. Clear and wellwritten, it assumes a previous knowledge of the theory of functions of real and complex variables, and is ideal for classroom use, selfstudy, or as a supplementary text. Starting with vector spaces and matrices, the text proceeds to orthogonal functions; the roots of polynomial equations; asymptotic expansions; ordinary differential equations; conformal mapping; and extremum problems. Each chapter goes straight to the heart of the matter, developing subjects just far enough so that students can easily make the appropriate applications. Exercises at the end of each chapter, along with solutions at the back of the book, afford further opportunities for reinforcement. Discussions of numerical methods are oriented toward computer use, and they bridge the gap between the "there exists" perspective of pure mathematicians and the "find it to three decimal places" mentality of engineers. Each chapter features a separate bibliography
42 editions published between 1962 and 2013 in 3 languages and held by 702 WorldCat member libraries worldwide
This book offers advanced undergraduates and graduate students in physics, engineering, and other natural sciences a solid foundation in several fields of mathematics. Clear and wellwritten, it assumes a previous knowledge of the theory of functions of real and complex variables, and is ideal for classroom use, selfstudy, or as a supplementary text. Starting with vector spaces and matrices, the text proceeds to orthogonal functions; the roots of polynomial equations; asymptotic expansions; ordinary differential equations; conformal mapping; and extremum problems. Each chapter goes straight to the heart of the matter, developing subjects just far enough so that students can easily make the appropriate applications. Exercises at the end of each chapter, along with solutions at the back of the book, afford further opportunities for reinforcement. Discussions of numerical methods are oriented toward computer use, and they bridge the gap between the "there exists" perspective of pure mathematicians and the "find it to three decimal places" mentality of engineers. Each chapter features a separate bibliography
Combinatorial algorithms for computers and calculators by
Albert Nijenhuis(
Book
)
17 editions published between 1978 and 2015 in English and held by 672 WorldCat member libraries worldwide
Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and ksubset of an nset and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed. Comprised of 30 chapters, this volume begins with an introduction to combinatorial algorithms by considering the generation of all of the 2
17 editions published between 1978 and 2015 in English and held by 672 WorldCat member libraries worldwide
Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and ksubset of an nset and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed. Comprised of 30 chapters, this volume begins with an introduction to combinatorial algorithms by considering the generation of all of the 2
Finite sections of some classical inequalities by
Herbert S Wilf(
Book
)
19 editions published in 1970 in 4 languages and held by 541 WorldCat member libraries worldwide
Hardy, Littlewood and P6lya's famous monograph on inequalities [17J has served as an introduction to hard analysis for many mathema ticians. Some of its most interesting results center around Hilbert's inequality and generalizations. This family of inequalities determines the best bound of a family of operators on /p. When such inequalities are restricted only to finitely many variables, we can then ask for the rate at which the bounds of the restrictions approach the uniform bound. In the context of Toeplitz forms, such research was initiated over fifty years ago by Szego [37J, and the chain of ideas continues to grow strongly today, with fundamental contributions having been made by Kac, Widom, de Bruijn, and many others. In this monograph I attempt to draw together these lines of research from the point of view of sharpenings of the classical inequalities of [17]. This viewpoint leads to the exclusion of some material which might belong to a broaderbased discussion, such as the elegant work of Baxter, Hirschman and others on the strong Szego limit theorem, and the inclusion of other work, such as that of de Bruijn and his students, which is basically nonlinear, and is therefore in some sense disjoint from the earlier investigations. I am grateful to Professor Halmos for inviting me to prepare this volume, and to Professors John and Olga Todd for several helpful comments. Philadelphia, Pa. H.S.W
19 editions published in 1970 in 4 languages and held by 541 WorldCat member libraries worldwide
Hardy, Littlewood and P6lya's famous monograph on inequalities [17J has served as an introduction to hard analysis for many mathema ticians. Some of its most interesting results center around Hilbert's inequality and generalizations. This family of inequalities determines the best bound of a family of operators on /p. When such inequalities are restricted only to finitely many variables, we can then ask for the rate at which the bounds of the restrictions approach the uniform bound. In the context of Toeplitz forms, such research was initiated over fifty years ago by Szego [37J, and the chain of ideas continues to grow strongly today, with fundamental contributions having been made by Kac, Widom, de Bruijn, and many others. In this monograph I attempt to draw together these lines of research from the point of view of sharpenings of the classical inequalities of [17]. This viewpoint leads to the exclusion of some material which might belong to a broaderbased discussion, such as the elegant work of Baxter, Hirschman and others on the strong Szego limit theorem, and the inclusion of other work, such as that of de Bruijn and his students, which is basically nonlinear, and is therefore in some sense disjoint from the earlier investigations. I am grateful to Professor Halmos for inviting me to prepare this volume, and to Professors John and Olga Todd for several helpful comments. Philadelphia, Pa. H.S.W
A=B by
Marko Petkovšek(
Book
)
19 editions published between 1995 and 2009 in English and Undetermined and held by 509 WorldCat member libraries worldwide
In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks
19 editions published between 1995 and 2009 in English and Undetermined and held by 509 WorldCat member libraries worldwide
In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks
Combinatorial algorithms by
Albert Nijenhuis(
Book
)
19 editions published between 1975 and 1978 in English and held by 442 WorldCat member libraries worldwide
19 editions published between 1975 and 1978 in English and held by 442 WorldCat member libraries worldwide
Combinatorial algorithms : an update by
Herbert S Wilf(
Book
)
15 editions published in 1989 in English and Italian and held by 427 WorldCat member libraries worldwide
A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees
15 editions published in 1989 in English and Italian and held by 427 WorldCat member libraries worldwide
A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees
Mathematical aspects of electrical network analysis by Symposium in Applied Mathematics of the American Mathematical Society and the Society for Industrial and Applied Mathematics(
Book
)
13 editions published in 1971 in English and Undetermined and held by 347 WorldCat member libraries worldwide
The volume constitutes the final scientific report for a symposium on Mathematical Aspects of Electrical Network Theory. It contains thirteen papers presented during the April 1969 meeting of the American Mathematical Society. Topics covered include numerical techniques for nonlinear circuit analysis, network models, perturbation theory for nonlinear network synthesis, and graph theoretic applications to electrical network theory. (Author)
13 editions published in 1971 in English and Undetermined and held by 347 WorldCat member libraries worldwide
The volume constitutes the final scientific report for a symposium on Mathematical Aspects of Electrical Network Theory. It contains thirteen papers presented during the April 1969 meeting of the American Mathematical Society. Topics covered include numerical techniques for nonlinear circuit analysis, network models, perturbation theory for nonlinear network synthesis, and graph theoretic applications to electrical network theory. (Author)
Calculus and linear algebra by
Herbert S Wilf(
Book
)
7 editions published between 1966 and 1967 in English and held by 280 WorldCat member libraries worldwide
7 editions published between 1966 and 1967 in English and held by 280 WorldCat member libraries worldwide
N is a number : a portrait of Paul Erdős by
George Paul Csicsery(
Visual
)
1 edition published in 2004 in English and held by 196 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdos's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
1 edition published in 2004 in English and held by 196 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdos's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
Mathematische Methoden für Digitalrechner : mit 33 Tabellen by
Anthony Ralston(
Book
)
26 editions published between 1967 and 1983 in German and Undetermined and held by 160 WorldCat member libraries worldwide
26 editions published between 1967 and 1983 in German and Undetermined and held by 160 WorldCat member libraries worldwide
Programming for a digital computer in the FORTRAN language by
Herbert S Wilf(
Book
)
14 editions published between 1969 and 1970 in English and held by 111 WorldCat member libraries worldwide
14 editions published between 1969 and 1970 in English and held by 111 WorldCat member libraries worldwide
Algorithmes et complexité by
Herbert S Wilf(
Book
)
4 editions published in 1989 in French and Undetermined and held by 96 WorldCat member libraries worldwide
4 editions published in 1989 in French and Undetermined and held by 96 WorldCat member libraries worldwide
Méthodes mathématiques pour calculateurs arithmétiques by
Anthony Ralston(
Book
)
10 editions published in 1965 in French and English and held by 82 WorldCat member libraries worldwide
10 editions published in 1965 in French and English and held by 82 WorldCat member libraries worldwide
Statistical methods for digital computers by
Kurt Enslein(
Book
)
8 editions published in 1977 in English and Spanish and held by 77 WorldCat member libraries worldwide
8 editions published in 1977 in English and Spanish and held by 77 WorldCat member libraries worldwide
Advances in combinatorics : Waterloo Workshop in Computer Algebra 2011, (WWCA 2011, W80), May 2629, 2011 : in memory of Herbert
S. Wilf by
Ilias Kotsireas(
)
3 editions published in 2013 in English and held by 72 WorldCat member libraries worldwide
This book is a tribute to the life and work of the prominent combinatorialist, Herb Wilf. It consists of papers presented at the Third Waterloo Workshop on Computer Algebra (WWCA 2011, W80), and features recent research results in combinatorics, computer algebra, and number theory
3 editions published in 2013 in English and held by 72 WorldCat member libraries worldwide
This book is a tribute to the life and work of the prominent combinatorialist, Herb Wilf. It consists of papers presented at the Third Waterloo Workshop on Computer Algebra (WWCA 2011, W80), and features recent research results in combinatorics, computer algebra, and number theory
Mathematical methods for digital computers by
Anthony Ralston(
Book
)
13 editions published in 1967 in 3 languages and held by 58 WorldCat member libraries worldwide
13 editions published in 1967 in 3 languages and held by 58 WorldCat member libraries worldwide
Mathematical methods for digital computers(
Book
)
11 editions published in 1977 in English and held by 40 WorldCat member libraries worldwide
11 editions published in 1977 in English and held by 40 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Ralston, Anthony Other Author of introduction Author Editor
 Nijenhuis, Albert Other Author
 Enslein, Kurt Author Editor
 Goldstine, Herman H. (Herman Heine) 19132004
 Zeilberger, Doron
 Petkovšek, Marko Author Creator
 Knuth, Donald Ervin 1938 Author
 Kotsireas, Ilias Author Editor
 Zima, E. V. (Evgeniĭ Viktorovich) Editor
 American Mathematical Society Publisher
Useful Links
Associated Subjects
AlgebraData processing Algebras, Linear Algorithms Calculus Combinatorial analysis Combinatorial analysisComputer programs Combinatorial identitiesData processing Computational complexity Computer algorithms Computer programming Computers Computer scienceMathematics Differential equations Electrical engineeringMathematics Electric networks Electronic digital computers Erdős, Paul, FORTRAN (Computer program language) Generating functions Halmos, Paul R.(Paul Richard), Hoffman, Paul, Hungary Inequalities (Mathematics) Inertia (Mechanics) Lamport, Leslie Mathematical physics Mathematicians Mathematics MathematicsAuthorship MathematicsData processing MathematicsPhilosophy Nilsson, Nils J., Number theory Numerical analysis Numerical calculations Problem solvingData processing Programming (Mathematics) Stanford University.Computer Science Department Ullman, Jeffrey D., Van Leunen, MaryClaire Wilf, Herbert S.,
Covers
Alternative Names
Herbert Wilf Amerikaanse wiskundige
Herbert Wilf amerikansk matematikar
Herbert Wilf amerikansk matematiker
Herbert Wilf matemàtic estatunidenc
Herbert Wilf matemático estadounidense
Herbert Wilf matematico statunitense
Herbert Wilf matemáticu estauxunidense (1931–2012)
Herbert Wilf matematikan amerikan
Herbert Wilf mathématicien américain
Herbert Wilf USamerikanischer Mathematiker
Uilf, G. S.
Wei'erfu 19312012
Wilf, H.S.
Wilf, Herbert 1931
Wilf, Herbert 19312012
Wilf, Herbert S.
Wilf, Herbert S., 1931
Wilf, Herbert Saul 19312012
Wirufu, Hābāto S. 19312012
Герберт Вилф американский математик
هربرت ويلف رياضياتي أمريكي
ウイルフ, ハーバート・S
Languages