The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Edward A. Bender: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald
    Optimal Worst Case Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1987, v:24, n:4, pp:475-489 [Journal]
  2. Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald
    The asymptotic number of acyclic diagraphs I. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:1, pp:15-22 [Journal]
  3. Edward A. Bender, L. Bruce Richmond
    Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  4. Edward A. Bender, S. Gill Williamson
    Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  5. Edward A. Bender, William J. Helton, L. Bruce Richmond
    Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  6. Edward A. Bender, L. Bruce Richmond
    Admissible Functions and Asymptotics for Labelled Structures by Number of Components. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  7. Edward A. Bender, L. Bruce Richmond
    A Multivariate Lagrange Inversion Formula for Asymptotic Calculations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  8. Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond
    Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  9. Edward A. Bender, E. Rodney Canfield
    The Fraction of Subspaces of GF(q) n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  10. Edward A. Bender, E. Rodney Canfield
    Intersections of Randomly Embedded Sparse Graphs are Poisson. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  11. 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]
  12. Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald
    The Number of Labeled 2-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  13. Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Richmond
    Submap Density and Asymmetry Results for Two Parameter Map Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:17-25 [Journal]
  14. Edward A. Bender
    Surveyor's Forum: A Recurrent Problem. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1979, v:11, n:1, pp:67-68 [Journal]
  15. Edward A. Bender, Fred Kochman
    The Distribution of Subword Counts is Usually Normal. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:4, pp:265-275 [Journal]
  16. Edward A. Bender
    The Number of Fanout-Free Functions with Various Gates. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:1, pp:181-190 [Journal]
  17. Edward A. Bender, Jon T. Butler
    Enumeration of Structured Flowcharts [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:537-548 [Journal]
  18. Edward A. Bender, E. Rodney Canfield
    An Approximate Probabilistic Model for Structured Gaussian Elimination. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:2, pp:271-290 [Journal]
  19. 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]
  20. Edward A. Bender
    Central and Local Limit Theorems Applied to Asymptotic Enumeration. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1973, v:15, n:1, pp:91-111 [Journal]
  21. Edward A. Bender
    On Buckhiester's Enumeration of n x n Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:17, n:2, pp:273-274 [Journal]
  22. Edward A. Bender
    Some Asymptotic Bijections. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:1, pp:96-98 [Journal]
  23. Edward A. Bender, E. Rodney Canfield
    The Asymptotic Number of Labeled Graphs with Given Degree Sequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:24, n:3, pp:296-307 [Journal]
  24. Edward A. Bender, E. Rodney Canfield
    Enumeration of connected invariant graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:268-278 [Journal]
  25. Edward A. Bender, E. Rodney Canfield
    The asymptotic number of rooted maps on a surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:244-257 [Journal]
  26. Edward A. Bender, E. Rodney Canfield
    Face sizes of 3-polytopes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:1, pp:58-65 [Journal]
  27. Edward A. Bender, E. Rodney Canfield
    The number of rooted maps on an orientable surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:53, n:2, pp:293-299 [Journal]
  28. Edward A. Bender, E. Rodney Canfield
    Log-Concavity and Related Properties of the Cycle Index Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:57-70 [Journal]
  29. Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
    The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:1, pp:124-150 [Journal]
  30. Edward A. Bender, E. Rodney Canfield, Robert W. Robinson
    The asymptotic number of tree-rooted maps on a surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:48, n:2, pp:156-164 [Journal]
  31. Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond
    The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:63, n:2, pp:318-329 [Journal]
  32. Edward A. Bender, Raymond Coley, David P. Robbins, Howard Rumsey Jr.
    Enumeration of Subspaces by Dimension Sequence. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:1-11 [Journal]
  33. Edward A. Bender, Zhicheng Gao, William McCuaig, L. Bruce Richmond
    Submaps of maps. II. Cyclically k-connected planar cubic maps. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:1, pp:118-124 [Journal]
  34. Edward A. Bender, Zhicheng Gao, L. Bruce Richmond
    Submaps of maps. I. General 0-1 laws. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:1, pp:104-117 [Journal]
  35. Edward A. Bender, Donald E. Knuth
    Enumeration of Plane Partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:13, n:1, pp:40-54 [Journal]
  36. Edward A. Bender, Atefeh Mashatan, Daniel Panario, L. Bruce Richmond
    Asymptotics of combinatorial structures with large smallest component. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:107, n:1, pp:117-125 [Journal]
  37. Edward A. Bender, L. Bruce Richmond
    Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:3, pp:255-265 [Journal]
  38. Edward A. Bender, L. Bruce Richmond
    The asymptotic enumeration of rooted convex polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:276-283 [Journal]
  39. Edward A. Bender, L. Bruce Richmond
    A generalisation of Canfield's formula. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:1, pp:50-60 [Journal]
  40. Edward A. Bender, L. Bruce Richmond
    A survey of the asymptotic behaviour of maps. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:3, pp:297-329 [Journal]
  41. Edward A. Bender, Robert W. Robinson
    The asymptotic number of acyclic digraphs, II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:363-369 [Journal]
  42. Edward A. Bender, L. Bruce Richmond
    Submaps of maps. III. k-Connected nonplanar maps. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:55, n:1, pp:125-132 [Journal]
  43. Edward A. Bender, L. Bruce Richmond, S. G. Williamson
    Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:35, n:3, pp:263-278 [Journal]
  44. Edward A. Bender, Nicholas C. Wormald
    The asymptotic number of rooted nonseparable maps on a surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:370-380 [Journal]
  45. Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
    The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:2, pp:127-170 [Journal]
  46. Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
    Asymptotic Properties of Labeled Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:2, pp:183-202 [Journal]
  47. Edward A. Bender, Kevin J. Compton, L. Bruce Richmond
    0-1 laws for maps. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:3, pp:215-237 [Journal]
  48. Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald
    Largest 4-Connected Components of 3-Connected Planar Triangulations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:4, pp:273-286 [Journal]
  49. Edward A. Bender, E. Rodney Canfield
    The Number of Degree-Restricted Rooted Maps on the Sphere. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:9-15 [Journal]
  50. Edward A. Bender, Jon T. Butler
    Asymptotic Aproximations for the Number of Fanout-Free Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1978, v:27, n:12, pp:1180-1183 [Journal]
  51. Edward A. Bender, Jon T. Butler
    On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:1, pp:82-98 [Journal]
  52. Edward A. Bender, Nicholas C. Wormald
    The number of loopless planar maps. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:235-237 [Journal]
  53. Edward A. Bender, John S. Devitt, L. Bruce Richmond
    Partitions of multisets II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:1-8 [Journal]
  54. Edward A. Bender, L. Bruce Richmond
    An asymptotic expansion for the coefficients of some power series II: Lagrange inversion. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:135-141 [Journal]

  55. Locally Restricted Compositions I. Restricted Adjacent Differences. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
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