dblp.uni-trier.dewww.uni-trier.de

Doron Zeilberger Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
46EETewodros Amdeberhan, Doron Zeilberger: "Trivializing" Generalizations of some Izergin-Korepin-type Determinants. Discrete Mathematics & Theoretical Computer Science 9(1): (2007)
45EEArvind 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)
2006
44EEDoron Zeilberger, David M. Bressoud: A proof of Andrews' q-Dyson conjecture. Discrete Mathematics 306(10-11): 1039-1059 (2006)
43EEDoron Zeilberger: A fast algorithm for proving terminating hypergeometric identities. Discrete Mathematics 306(10-11): 1072-1075 (2006)
2005
42EEMohamud 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
41EEMohamud Mohammed, Doron Zeilberger: The Markov-WZ Method. Electr. J. Comb. 11(1): (2004)
2001
40EEDoron Zeilberger: The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks. Electr. J. Comb. 8(1): (2001)
39EEDoron Zeilberger: How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic. Electr. J. Comb. 8(2): (2001)
2000
38EEDoron Zeilberger: The Umbral Transfer-Matrix Method. I. Foundations. J. Comb. Theory, Ser. A 91(1-2): 451-463 (2000)
1999
37EEAaron Robertson, Herbert S. Wilf, Doron Zeilberger: Permutation Patterns and Continued Fractions. Electr. J. Comb. 6: (1999)
1998
36EEAaron 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)
35EEScott Ahlgren, Shalosh B. Ekhad, Ken Ono, Doron Zeilberger: A Binomial Coefficient Identity Associated to a Conjecture of Beukers. Electr. J. Comb. 5: (1998)
34EESylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger: A Pentagonal Number Sieve. J. Comb. Theory, Ser. A 82(2): 186-192 (1998)
1997
33EEDoron Zeilberger: Dodgson's Determinant-Evaluation Rule Proved by TWO-TIMING MEN and WOMEN. Electr. J. Comb. 4(2): (1997)
32EETewodros Amdeberhan, Doron Zeilberger: Hypergeometric series acceleration via the WZ method. Electr. J. Comb. 4(2): (1997)
31EEDominique 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
30EEShalosh B. Ekhad, Doron Zeilberger: The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q). Electr. J. Comb. 3(1): (1996)
29EEDoron Zeilberger: Proof of the alternating sign matrix conjecture. Electr. J. Comb. 3(2): (1996)
1995
28 Doron Zeilberger: Three Recitations on Holonomic Systems and Hypergeometric Series. J. Symb. Comput. 20(5/6): 699-724 (1995)
1994
27EEDominique Foata, Doron Zeilberger: Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory. Electr. J. Comb. 1: (1994)
26 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)
25 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)
24 Jane Friedman, Ira M. Gessel, Doron Zeilberger: Talmudic Lattice Path Counting. J. Comb. Theory, Ser. A 68(1): 215-217 (1994)
23 Craig R. Orr, Doron Zeilberger: A Computer Algebra Approach to the Discrete Dirichlet Problem. J. Symb. Comput. 18(1): 87-90 (1994)
1993
22 Doron Zeilberger: Identities in Search of Identity. Theor. Comput. Sci. 117(1&2): 23-38 (1993)
1992
21EEDoron 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)
20 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
19 Doron Zeilberger: The Method of Creative Telescoping. J. Symb. Comput. 11(3): 195-204 (1991)
1990
18EEDoron Zeilberger: A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q-Morris identity. Discrete Mathematics 79(3): 313-322 (1990)
17EEDoron Zeilberger: A fast algorithm for proving terminating hypergeometric identities. Discrete Mathematics 80(2): 207-211 (1990)
16EEDoron 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)
15 Gert Almkvist, Doron Zeilberger: The Method of Differentiating under the Integral Sign. J. Symb. Comput. 10(6): 571-592 (1990)
1988
14 Dominique Foata, Doron Zeilberger: Laguerre Polynomials, Weighted Derangements, and Positivity. SIAM J. Discrete Math. 1(4): 425-433 (1988)
1987
13EEDoron Zeilberger: Enumerating totally clean words. Discrete Mathematics 64(2-3): 313-315 (1987)
1986
12EEM. Werman, Doron Zeilberger: A bijective proof of Cassini's Fibonacci identity. Discrete Mathematics 58(1): 109 (1986)
1985
11EEDoron Zeilberger, David M. Bressoud: A proof of Andrews' q-Dyson conjecture. Discrete Mathematics 54(2): 201-224 (1985)
10EEDoron Zeilberger: A combinatorial approach to matrix algebra. Discrete Mathematics 56(1): 61-72 (1985)
1984
9EEDoron Zeilberger: A combinatorial proof of Newton's identities. Discrete Mathematics 49(3): 319 (1984)
8EEDoron Zeilberger: A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof. Discrete Mathematics 51(1): 101-108 (1984)
7EEDoron Zeilberger: Garsia and Milne's bijective proof of the inclusion-exclusion principle. Discrete Mathematics 51(1): 109-110 (1984)
1983
6EEDoron Zeilberger: Andre's reflection proof generalized to the many-candidate ballot problem. Discrete Mathematics 44(3): 325-326 (1983)
1982
5EEDavid M. Bressoud, Doron Zeilberger: A short Rogers-Ramanujan bijection. Discrete Mathematics 38(2-3): 313-315 (1982)
4EEDoron Zeilberger: A combinatorial proof of Dyson's conjecture. Discrete Mathematics 41(3): 317-321 (1982)
3 Deborah S. Franzblau, Doron Zeilberger: A Bijective Proof of the Hook-Length Formula. J. Algorithms 3(4): 317-343 (1982)
1981
2EEDoron Zeilberger: Enumeration of words by their number of mistakes. Discrete Mathematics 34(1): 89-91 (1981)
1980
1EEDoron Zeilberger: Partial difference equations in m1>=m2>= ... >=mn>=0 and their applications to combinatorics. Discrete Mathematics 31(1): 65-77 (1980)

Coauthor Index

1Scott Ahlgren [35]
2Gert Almkvist [15]
3Tewodros Amdeberhan [32] [46]
4Arvind Ayyer [45]
5David M. Bressoud [5] [11] [44]
6Sylvie Corteel [34]
7Shalosh B. Ekhad [30] [35]
8Dominique Foata [14] [27] [31]
9Deborah S. Franzblau [3]
10Jane Friedman [24]
11Ira M. Gessel [24]
12Mohamud Mohammed [41] [42]
13Ken Ono [35]
14Craig R. Orr [23]
15Peter Paule [20]
16Aaron Robertson [36] [37]
17Carla D. Savage [34]
18M. Werman [12]
19Herbert S. Wilf [34] [37]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)