Doron Zeilberger
Affiliations:- Rutgers University, Department of Mathematics, Piscataway, NJ, USA
According to our database1,
Doron Zeilberger
authored at least 102 papers
between 1980 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2025
2024
2023
ACM Commun. Comput. Algebra, March, 2023
Maple Trans., 2023
Using Generating Functions to Prove Additivity of Gene-Neighborhood Based Phylogenetics - Extended Abstract.
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023
2022
2021
J. Symb. Comput., 2021
There are EXACTLY 1493804444499093354916284290188948031229880469556 Ways to Derange a Standard Deck of Cards (ignoring suits) [and many other such useful facts].
CoRR, 2021
2019
2018
Integers, 2018
A Simple Re-Derivation of Onsager's Solution of the 2D Ising Model using Experimental Mathematics.
CoRR, 2018
2017
Am. Math. Mon., 2017
2016
2014
2013
Using Noonan-Zeilberger Functional Equations to enumerate (in polynomial time!) generalized Wilf classes.
Adv. Appl. Math., 2013
Proceedings of the Surveys in Combinatorics 2013, 2013
2012
Farewell to "W" (Herbert Saul Wilf), a true VISIONARY for whom EVERYTHING was INTERTWINED.
ACM Commun. Comput. Algebra, 2012
Formulæ for the number of partitions of <i>n</i> into at most <i>m</i> parts (using the quasi-polynomial ansatz).
Adv. Appl. Math., 2012
Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124].
Adv. Appl. Math., 2012
2011
A New Algorithm for Proving Global Asymptotic Stability of Rational Difference Equations
CoRR, 2011
Adv. Appl. Math., 2011
Adv. Appl. Math., 2011
2010
The 1958 Pekeris-Accad-WEIZAC Ground-Breaking Collaboration that computed Ground States of Two-Electron Atoms (and its 2010 Redux)
CoRR, 2010
A symbolic computation approach to a problem involving multivariate Poisson distributions.
Adv. Appl. Math., 2010
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010
2009
Electron. J. Comb., 2009
2008
Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (abstract only).
ACM Commun. Comput. Algebra, 2008
Adv. Appl. Math., 2008
2007
Discret. Math. Theor. Comput. Sci., 2007
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.
Electron. J. Comb., 2007
2006
Discret. Math., 2006
Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory.
Adv. Appl. Math., 2006
2005
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms.
J. Symb. Comput., 2005
2004
2003
2002
2001
How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic.
Electron. J. Comb., 2001
Electron. J. Comb., 2001
Adv. Appl. Math., 2001
Babson-Steingrı'msson Statistics are Indeed Mahonian (and Sometimes Even Euler-Mahonian).
Adv. Appl. Math., 2001
2000
1999
1998
A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less!
Electron. J. Comb., 1998
Electron. J. Comb., 1998
1997
J. Comb. Theory A, 1997
Electron. J. Comb., 1997
1996
Electron. J. Comb., 1996
1995
J. Symb. Comput., 1995
1994
J. Symb. Comput., 1994
Proof of a q-Analog of a Constant Term Identity Conjectured by Forrester.
J. Comb. Theory A, 1994
A Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-Mills-Robbins-Rumsey Numbers 1, 2, 7, 42, 429, ...
J. Comb. Theory A, 1994
Talmudic Lattice Path Counting.
J. Comb. Theory A, 1994
Combinatorial Proofs of Capelli's and Turnbull's identities from Classical Invariant Theory.
Electron. J. Comb., 1994
1993
1992
Special Issue: Symbolic Computation in Combinatorics - Foreword of the Guest Editors.
J. Symb. Comput., 1992
A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!).
Discret. Math., 1992
1991
A maple program that finds, and proves, recurrences and differential equations satisfied by hyperexponential definite integrals.
SIGSAM Bull., 1991
1990
A bijection from ordered trees to binary trees that sends the pruning order to the strahler number.
Discret. Math., 1990
A Stembridge-Stanton style elementary proof of the Habsieger-Kadell q-Morris identity.
Discret. Math., 1990
1988
SIAM J. Discret. Math., 1988
1987
1986
1985
1984
Discret. Math., 1984
Discret. Math., 1984
1983
Discret. Math., 1983
1982
1981
1980
Partial difference equations in m<sub>1</sub>>=m<sub>2</sub>>= ... >=m<sub>n</sub>>=0 and their applications to combinatorics.
Discret. Math., 1980