- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| i2 |      | Emilie Hogan, Doron Zeilberger: A New Algorithm for Proving Global Asymptotic Stability of Rational Difference Equations. CoRR abs/1106.0932 (2011) |
| 2010 | ||
| c1 | | |
| i1 | | Christoph Koutschan, Doron Zeilberger: The 1958 Pekeris-Accad-WEIZAC Ground-Breaking Collaboration that computed Ground States of Two-Electron Atoms (and its 2010 Redux). CoRR abs/1006.0200 (2010) |
| 2009 | ||
| j50 | | William Y. C. Chen, Jing Qin, Christian M. Reidys, Doron Zeilberger: Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams. Electr. J. Comb. 16(1) (2009) |
| j49 | | Yuri Bahturin, Amitai Regev, Doron Zeilberger: Commutation relations and Vandermonde determinants. Eur. J. Comb. 30(5): 1271-1276 (2009) |
| 2008 | ||
| j48 | | Manuel Kauers, Doron Zeilberger: Experiments with a Positivity-Preserving Operator. Experimental Mathematics 17(3): 341-345 (2008) |
| 2007 | ||
| j47 | | Arvind Ayyer, Doron Zeilberger: 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. Electr. J. Comb. 14(1) (2007) |
| j46 | | Tewodros Amdeberhan, Doron Zeilberger: "Trivializing" Generalizations of some Izergin-Korepin-type Determinants. Discrete Mathematics & Theoretical Computer Science 9(1) (2007) |
| 2006 | ||
| j45 | | Doron Zeilberger, David M. Bressoud: A proof of Andrews' q-Dyson conjecture. Discrete Mathematics 306(10-11): 1039-1059 (2006) |
| j44 | | Doron Zeilberger: A fast algorithm for proving terminating hypergeometric identities. Discrete Mathematics 306(10-11): 1072-1075 (2006) |
| j43 | | Andrew V. Sills, Doron Zeilberger: Disturbing the Dyson Conjecture (in a GOOD Way). Experimental Mathematics 15(2): 187-191 (2006) |
| 2005 | ||
| j42 | | Mohamud Mohammed, Doron Zeilberger: Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms. J. Symb. Comput. 39(2): 201-207 (2005) |
| 2004 | ||
| j41 | | |
| 2001 | ||
| j40 | | Doron Zeilberger: The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks. Electr. J. Comb. 8(1) (2001) |
| j39 | | Doron Zeilberger: How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic. Electr. J. Comb. 8(2) (2001) |
| 2000 | ||
| j38 | | Doron Zeilberger: The Umbral Transfer-Matrix Method. I. Foundations. J. Comb. Theory, Ser. A 91(1-2): 451-463 (2000) |
| 1999 | ||
| j37 | | Aaron Robertson, Herbert S. Wilf, Doron Zeilberger: Permutation Patterns and Continued Fractions. Electr. J. Comb. 6 (1999) |
| 1998 | ||
| j36 | | Scott Ahlgren, Shalosh B. Ekhad, Ken Ono, Doron Zeilberger: A Binomial Coefficient Identity Associated to a Conjecture of Beukers. Electr. J. Comb. 5 (1998) |
| j35 | | Aaron Robertson, Doron Zeilberger: A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less! Electr. J. Comb. 5 (1998) |
| j34 | | Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger: A Pentagonal Number Sieve. J. Comb. Theory, Ser. A 82(2): 186-192 (1998) |
| 1997 | ||
| j33 | | Tewodros Amdeberhan, Doron Zeilberger: Hypergeometric series acceleration via the WZ method. Electr. J. Comb. 4(2) (1997) |
| j32 | | Doron Zeilberger: Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and WOMEN. Electr. J. Comb. 4(2) (1997) |
| j31 | | Dominique Foata, Doron Zeilberger: A Classic Proof of a Recurrence for a Very Classical Sequence. J. Comb. Theory, Ser. A 80(2): 380-384 (1997) |
| 1996 | ||
| j30 | | Shalosh B. Ekhad, Doron Zeilberger: The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q). Electr. J. Comb. 3(1) (1996) |
| j29 | | |
| 1995 | ||
| j28 | | Doron Zeilberger: Three Recitations on Holonomic Systems and Hypergeometric Series. J. Symb. Comput. 20(5/6): 699-724 (1995) |
| 1994 | ||
| j27 | | Dominique Foata, Doron Zeilberger: Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory. Electr. J. Comb. 1 (1994) |
| j26 |  | Doron Zeilberger: A Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-Mills-Robbins-Rumsey Numbers 1, 2, 7, 42, 429, ... J. Comb. Theory, Ser. A 66(1): 17-27 (1994) |
| j25 | | Doron Zeilberger: Proof of a q-Analog of a Constant Term Identity Conjectured by Forrester. J. Comb. Theory, Ser. A 66(2): 311-312 (1994) |
| j24 | | Jane Friedman, Ira M. Gessel, Doron Zeilberger: Talmudic Lattice Path Counting. J. Comb. Theory, Ser. A 68(1): 215-217 (1994) |
| j23 | | Craig R. Orr, Doron Zeilberger: A Computer Algebra Approach to the Discrete Dirichlet Problem. J. Symb. Comput. 18(1): 87-90 (1994) |
| 1993 | ||
| j22 | | |
| 1992 | ||
| j21 | | 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)!). Discrete Mathematics 102(1): 85-93 (1992) |
| j20 | | Peter Paule, Doron Zeilberger: Special Issue: Symbolic Computation in Combinatorics - Foreword of the Guest Editors. J. Symb. Comput. 14(2/3): 123-126 (1992) |
| 1991 | ||
| j19 | | |
| 1990 | ||
| j18 | | Doron Zeilberger: A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q-Morris identity. Discrete Mathematics 79(3): 313-322 (1990) |
| j17 | | Doron Zeilberger: A fast algorithm for proving terminating hypergeometric identities. Discrete Mathematics 80(2): 207-211 (1990) |
| j16 | | Doron Zeilberger: A bijection from ordered trees to binary trees that sends the pruning order to the strahler number. Discrete Mathematics 82(1): 89-92 (1990) |
| j15 | | Gert Almkvist, Doron Zeilberger: The Method of Differentiating under the Integral Sign. J. Symb. Comput. 10(6): 571-592 (1990) |
| 1988 | ||
| j14 | | Dominique Foata, Doron Zeilberger: Laguerre Polynomials, Weighted Derangements, and Positivity. SIAM J. Discrete Math. 1(4): 425-433 (1988) |
| 1987 | ||
| j13 | | |
| 1986 | ||
| j12 | | M. Werman, Doron Zeilberger: A bijective proof of Cassini's Fibonacci identity. Discrete Mathematics 58(1): 109 (1986) |
| 1985 | ||
| j11 | | Doron Zeilberger, David M. Bressoud: A proof of Andrews' q-Dyson conjecture. Discrete Mathematics 54(2): 201-224 (1985) |
| j10 | | Doron Zeilberger: A combinatorial approach to matrix algebra. Discrete Mathematics 56(1): 61-72 (1985) |
| 1984 | ||
| j9 | | Doron Zeilberger: A combinatorial proof of Newton's identities. Discrete Mathematics 49(3): 319 (1984) |
| j8 | | Doron Zeilberger: A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof. Discrete Mathematics 51(1): 101-108 (1984) |
| j7 | | Doron Zeilberger: Garsia and Milne's bijective proof of the inclusion-exclusion principle. Discrete Mathematics 51(1): 109-110 (1984) |
| 1983 | ||
| j6 | | Doron Zeilberger: Andre's reflection proof generalized to the many-candidate ballot problem. Discrete Mathematics 44(3): 325-326 (1983) |
| 1982 | ||
| j5 | | David M. Bressoud, Doron Zeilberger: A short Rogers-Ramanujan bijection. Discrete Mathematics 38(2-3): 313-315 (1982) |
| j4 | | Doron Zeilberger: A combinatorial proof of Dyson's conjecture. Discrete Mathematics 41(3): 317-321 (1982) |
| j3 | | Deborah S. Franzblau, Doron Zeilberger: A Bijective Proof of the Hook-Length Formula. J. Algorithms 3(4): 317-343 (1982) |
| 1981 | ||
| j2 | | Doron Zeilberger: Enumeration of words by their number of mistakes. Discrete Mathematics 34(1): 89-91 (1981) |
| 1980 | ||
| j1 | | Doron Zeilberger: Partial difference equations in m1>=m2>= ... >=mn>=0 and their applications to combinatorics. Discrete Mathematics 31(1): 65-77 (1980) |
Colors in the list of coauthors
Last update Tue May 21 20:27:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page