The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Doron Zeilberger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Scott Ahlgren, Shalosh B. Ekhad, Ken Ono, Doron Zeilberger
    A Binomial Coefficient Identity Associated to a Conjecture of Beukers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  2. Tewodros Amdeberhan, Doron Zeilberger
    Hypergeometric series acceleration via the WZ method. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  3. Shalosh B. Ekhad, Doron Zeilberger
    The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q). [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  4. Dominique Foata, Doron Zeilberger
    Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1994, v:1, n:, pp:- [Journal]
  5. Mohamud Mohammed, Doron Zeilberger
    The Markov-WZ Method. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  6. 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]
  7. Aaron Robertson, Doron Zeilberger
    A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less! [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  8. Doron Zeilberger
    The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  9. Doron Zeilberger
    How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  10. Doron Zeilberger
    Proof of the alternating sign matrix conjecture. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:2, pp:- [Journal]
  11. Doron Zeilberger
    Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and WOMEN. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  12. Doron Zeilberger
    A fast algorithm for proving terminating hypergeometric identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1072-1075 [Journal]
  13. Doron Zeilberger, David M. Bressoud
    A proof of Andrews' q-Dyson conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1039-1059 [Journal]
  14. Deborah S. Franzblau, Doron Zeilberger
    A Bijective Proof of the Hook-Length Formula. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:4, pp:317-343 [Journal]
  15. 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]
  16. Dominique Foata, Doron Zeilberger
    A Classic Proof of a Recurrence for a Very Classical Sequence. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:380-384 [Journal]
  17. Jane Friedman, Ira M. Gessel, Doron Zeilberger
    Talmudic Lattice Path Counting. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:68, n:1, pp:215-217 [Journal]
  18. Doron Zeilberger
    The Umbral Transfer-Matrix Method. I. Foundations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:451-463 [Journal]
  19. Doron Zeilberger
    A Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-Mills-Robbins-Rumsey Numbers 1, 2, 7, 42, 429, ... [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:66, n:1, pp:17-27 [Journal]
  20. Doron Zeilberger
    Proof of a q-Analog of a Constant Term Identity Conjectured by Forrester. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:66, n:2, pp:311-312 [Journal]
  21. Gert Almkvist, Doron Zeilberger
    The Method of Differentiating under the Integral Sign. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:6, pp:571-592 [Journal]
  22. Mohamud Mohammed, Doron Zeilberger
    Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2005, v:39, n:2, pp:201-207 [Journal]
  23. Craig R. Orr, Doron Zeilberger
    A Computer Algebra Approach to the Discrete Dirichlet Problem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:18, n:1, pp:87-90 [Journal]
  24. Peter Paule, Doron Zeilberger
    Special Issue: Symbolic Computation in Combinatorics - Foreword of the Guest Editors. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1992, v:14, n:2/3, pp:123-126 [Journal]
  25. Doron Zeilberger
    The Method of Creative Telescoping. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:11, n:3, pp:195-204 [Journal]
  26. Doron Zeilberger
    Three Recitations on Holonomic Systems and Hypergeometric Series. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:5/6, pp:699-724 [Journal]
  27. Dominique Foata, Doron Zeilberger
    Laguerre Polynomials, Weighted Derangements, and Positivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:4, pp:425-433 [Journal]
  28. Doron Zeilberger
    Identities in Search of Identity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:117, n:1&2, pp:23-38 [Journal]
  29. Doron Zeilberger
    Partial difference equations in m1>=m2>= ... >=mn>=0 and their applications to combinatorics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:1, pp:65-77 [Journal]
  30. Doron Zeilberger
    Enumeration of words by their number of mistakes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:1, pp:89-91 [Journal]
  31. David M. Bressoud, Doron Zeilberger
    A short Rogers-Ramanujan bijection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:313-315 [Journal]
  32. Doron Zeilberger
    A combinatorial proof of Dyson's conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:3, pp:317-321 [Journal]
  33. Doron Zeilberger
    Andre's reflection proof generalized to the many-candidate ballot problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:325-326 [Journal]
  34. Doron Zeilberger
    Garsia and Milne's bijective proof of the inclusion-exclusion principle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:109-110 [Journal]
  35. Doron Zeilberger
    A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:101-108 [Journal]
  36. Doron Zeilberger, David M. Bressoud
    A proof of Andrews' q-Dyson conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:201-224 [Journal]
  37. Doron Zeilberger
    A combinatorial approach to matrix algebra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:1, pp:61-72 [Journal]
  38. M. Werman, Doron Zeilberger
    A bijective proof of Cassini's Fibonacci identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:109- [Journal]
  39. Doron Zeilberger
    Enumerating totally clean words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:313-315 [Journal]
  40. Doron Zeilberger
    A combinatorial proof of Newton's identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:3, pp:319- [Journal]
  41. Doron Zeilberger
    A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q-Morris identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:3, pp:313-322 [Journal]
  42. Doron Zeilberger
    A fast algorithm for proving terminating hypergeometric identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:2, pp:207-211 [Journal]
  43. Doron Zeilberger
    A bijection from ordered trees to binary trees that sends the pruning order to the strahler number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:1, pp:89-92 [Journal]
  44. Doron Zeilberger
    A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:1, pp:85-93 [Journal]

  45. Against Rigor. [Citation Graph (, )][DBLP]


  46. The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by More Than w Points. [Citation Graph (, )][DBLP]


  47. The 1958 Pekeris-Accad-WEIZAC Ground-Breaking Collaboration that computed Ground States of Two-Electron Atoms (and its 2010 Redux) [Citation Graph (, )][DBLP]


  48. "Trivializing" Generalizations of some Izergin-Korepin-type Determinants. [Citation Graph (, )][DBLP]


  49. Commutation relations and Vandermonde determinants. [Citation Graph (, )][DBLP]


Search in 0.129secs, Finished in 0.132secs
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