The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Herbert S. Wilf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Herbert S. Wilf
    Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:3, pp:119-121 [Journal]
  2. Herbert S. Wilf
    Tables for Automatic Computation. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1958, v:1, n:1, pp:8-11 [Journal]
  3. Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf
    A Discontinuity in the Distribution of Fixed Point Sums. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  4. Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
    Longest Increasing Subsequences in Pattern-Restricted Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  5. Ira M. Gessel, Jonathan Weinstein, Herbert S. Wilf
    Lattice Walks in Zd and Permutations with No Long Ascending Subsequences. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  6. Marko Petkovsek, Herbert S. Wilf
    A high-tech proof of the Mills-Robbins-Rumsey determinant formula. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:2, pp:- [Journal]
  7. Marko Petkovsek, Herbert S. Wilf
    When can the sum of (1/p)th of the binomial coefficients have closed form? [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  8. Aaron Robertson, Herbert S. Wilf, Doron Zeilberger
    Permutation Patterns and Continued Fractions. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  9. Stan Wagon, Herbert S. Wilf
    When are subset sums equidistributed modulo m? [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1994, v:1, n:, pp:- [Journal]
  10. Herbert S. Wilf
    The Problem of the Kings. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  11. Herbert S. Wilf
    The patterns of permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:575-583 [Journal]
  12. Herbert S. Wilf
    Accelerated series for universal constants, by the WZ method. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:4, pp:189-192 [Journal]
  13. Herbert S. Wilf
    A Stability Criterion for Numerical Integration. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1959, v:6, n:3, pp:363-365 [Journal]
  14. Herbert S. Wilf
    A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:415-420 [Journal]
  15. Edward A. Bender, Herbert S. Wilf
    A Theoretical Analysis of Backtracking in the Graph Coloring Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:2, pp:275-282 [Journal]
  16. John D. Dixon, Herbert S. Wilf
    The Random Selection of Unlabeled Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:3, pp:205-213 [Journal]
  17. Herbert S. Wilf
    The Uniform Selection of Free Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:2, pp:204-207 [Journal]
  18. Herbert S. Wilf
    Two Algorithms for the Sieve Method. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:179-182 [Journal]
  19. Eugenio Calabi, Herbert S. Wilf
    On the Sequential and Random Selection of Subspaces over a Finite Field. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:1, pp:107-109 [Journal]
  20. Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf
    Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:171-190 [Journal]
  21. Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger
    A Pentagonal Number Sieve. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:82, n:2, pp:186-192 [Journal]
  22. Richard Garfield, Donald E. Knuth, Herbert S. Wilf
    A bijection for ordered factorizations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:54, n:2, pp:317-318 [Journal]
  23. Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen
    Counting Pairs of Lattice Paths by Intersections. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:2, pp:173-187 [Journal]
  24. Curtis Greene, Albert Nijenhuis, Herbert S. Wilf
    Another Probabilistic Method in the Theory of Young Tableaux. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:2, pp:127-135 [Journal]
  25. Joan P. Hutchinson, Herbert S. Wilf
    On Eulerian Circuits and Words with Prescribed Adjacency Patterns. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:18, n:1, pp:80-87 [Journal]
  26. Brendan D. McKay, Jennifer Morse, Herbert S. Wilf
    The Distributions of the Entries of Young Tableaux. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:97, n:1, pp:117-128 [Journal]
  27. Albert Nijenhuis, Anita E. Solow, Herbert S. Wilf
    Bijective Methods in the Theory of Finite Vector Spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:1, pp:80-84 [Journal]
  28. Albert Nijenhuis, Herbert S. Wilf
    A Method and Two Algorithms on the Theory of Partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:18, n:2, pp:219-222 [Journal]
  29. Albert Nijenhuis, Herbert S. Wilf
    The Enumeration of Connected Graphs and Linked Diagrams. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:356-359 [Journal]
  30. Andrew M. Odlyzko, Herbert S. Wilf
    Bandwidths and profiles of trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:348-370 [Journal]
  31. Herbert S. Wilf
    Averages by the Sieve Method. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:24, n:3, pp:256-260 [Journal]
  32. Herbert S. Wilf
    Three Problems in Combinatorial Asymptotics. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:35, n:2, pp:199-207 [Journal]
  33. Herbert S. Wilf
    Sieve Equivalence in Generalized Partition Theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:1, pp:80-89 [Journal]
  34. Herbert S. Wilf
    Spectral bounds for the clique and independence numbers of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:1, pp:113-117 [Journal]
  35. Herbert S. Wilf
    Ascending Subsequences of Permutations and the Shapes of Tableaux. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:60, n:1, pp:155-157 [Journal]
  36. Herbert S. Wilf
    The Asymptotic Behavior of the Stirling Numbers of the First Kind. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:64, n:2, pp:344-349 [Journal]
  37. Herbert S. Wilf
    A note on P(-lambda; G). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:3, pp:296- [Journal]
  38. Volker Strehl, Herbert S. Wilf
    Five Surprisingly Simple Complexities. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:5/6, pp:725-729 [Journal]
  39. Herbert S. Wilf
    The Computer-Aided Discovery of a Theorem about Young Tableaux. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:5/6, pp:731-735 [Journal]
  40. Sylvie Corteel, Boris Pittel, Carla D. Savage, Herbert S. Wilf
    On the multiplicity of parts in a random partition. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:2, pp:185-197 [Journal]
  41. Neil J. Calkin, Herbert S. Wilf
    The Number of Independent Sets in a Grid Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:54-60 [Journal]
  42. Amy N. Myers, Herbert S. Wilf
    Some New Aspects of the Coupon Collector's Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:1, pp:1-17 [Journal]
  43. Herbert S. Wilf
    Récents développements et problèmes dans le domaine de la génération aléatoire. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:159, n:1, pp:5-13 [Journal]
  44. Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf
    Basis partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:179, n:1-3, pp:277-283 [Journal]

  45. BG-Ranks and 2-Cores. [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002