Generating functionology HS Wilf Elsevier, 2013 | 2047 | 2013 |

Mathematical methods for digital computers A Ralston, HS Wilf | 1731 | 1960 |

Combinatorial algorithms: for computers and calculators A Nijenhuis, HS Wilf Elsevier, 2014 | 1345 | 2014 |

Uniqueness theorems for periodic functions NJ Fine, HS Wilf Proceedings of the American Mathematical Society 16 (1), 109-114, 1965 | 573 | 1965 |

Handbook of combinatorics RL Graham Elsevier, 1995 | 567 | 1995 |

Algorithms and complexity HS Wilf AK Peters/CRC Press, 2002 | 466* | 2002 |

An algorithmic proof theory for hypergeometric (ordinary and “*q*”) multisum/integral identitiesHS Wilf, D Zeilberger Inventiones mathematicae 108 (1), 575-633, 1992 | 431 | 1992 |

Mathematics for the physical sciences HS Wilf Courier Corporation, 2013 | 318 | 2013 |

An inequality for the chromatic number of a graph G Szekeres, HS Wilf Journal of Combinatorial Theory 4 (1), 1-3, 1968 | 236 | 1968 |

The number of independent sets in a grid graph NJ Calkin, HS Wilf SIAM Journal on Discrete Mathematics 11 (1), 54-60, 1998 | 214 | 1998 |

Combinatorial algorithms: an update HS Wilf Society for industrial and applied mathematics, 1989 | 213 | 1989 |

Recounting the rationals N Calkin, HS Wilf The American Mathematical Monthly 107 (4), 360-363, 2000 | 212 | 2000 |

Rational functions certify combinatorial identities HS Wilf, D Zeilberger Journal of the american mathematical society 3 (1), 147-158, 1990 | 192 | 1990 |

The eigenvalues of a graph and its chromatic number HS Wilf J. London Math. Soc 42 (1967), 330, 1967 | 191 | 1967 |

A= BAK Peters M Petkovšek, HS Wilf, D Zeilberger Wellesley, MA, 1996 | 188 | 1996 |

A probabilistic proof of a formula for the number of Young tableaux of a given shape C Greene, A Nijenhuis, HS Wilf Young Tableaux in Combinatorics, Invariant Theory, and Algebra, 17-22, 1982 | 173 | 1982 |

Subordinating factor sequences for convex maps of the unit circle HS Wilf Proceedings of the American Mathematical Society 12 (5), 689-693, 1961 | 168 | 1961 |

The interchange graph of a finite graph ACM van Rooij, HS Wilf Acta Mathematica Academiae Scientiarum Hungarica 16 (3-4), 263-269, 1965 | 137 | 1965 |

Statistical methods for digital computers K Enslein, A Ralston, HS Wilf J. Wiley, 1977 | 130 | 1977 |

Backtrack: an O (1) expected time algorithm for the graph coloring problem HS Wilf Information Processing Letters 18 (3), 119-121, 1984 | 124 | 1984 |