Doron Zeilberger's National Science Foundation Grants
Added 2016: After being continually funded since 1984, I decided to no longer apply
for NSF funding, since I was tired of lying. My true research plan is to prove the
Riemann Hypothesis, but instead I had to make up some more tractable research
problems, that the "peers" would approve of, and then I would be obligated to
work on these boring problems. So while my chance of proving the Riemann Hypothesis
is rather small, the expected gain of trying to prove RH far surpasses the
expected gain of getting a funded NSF proposal.

Rigorous Experimental Combinatorics (NSF Grant DMS 0901226)
(Here is the proposal itself:
.ps,
.pdf).
(Here are the
reviews).

Automating Combinatorics (NSF Grant DMS 0401124)
(Here is the proposal itself:
.ps,
.pdf).
(Here are the
reviews).

Symbolic Computation and Combinatorics(NSF Grant DMS 0100403)
(Here is the proposal itself:
.ps,
.pdf)
(Here are the
reviews [scanned pdf]).

Classical Combinatorics: An International
Conference (NSF Grant DMS 9985949),
(With Aaron Robertson).

Targeted Proof Machines in Combinatorics (NSF Grant DMS 9732602)
(Here is the proposal itself:
.ps,
.pdf)

Combinatorics, Special Functions, and Computer
Algebra (NSF Grant DMS 9500646)
(Here is the proposal itself:
.ps,
.pdf).
(Here are the
reviews [scanned pdf]).

ComputerGenerated and ComputerAssisted
Research in Combinatorics and Special Functions (NSF Grant DMS 9123836).
(Here are the
reviews [scanned pdf]).

Asymptotic Methods in Combinatorics (NSF Grant DMS 8901610)
(With Jet Wimp).

Constant Term Identities and Combinatorial
Enumeration(NSF Grant DMS 8800663)
(Here are the
reviews [scanned pdf]).

Toward a General Theory of Combinatorial Bijections
(NSF Grant DMS 8600243)
(Here are the
reviews [scanned pdf]).

Proving Identities by Combinatorial Methods
(NSF Grant DMS 8400204)
(Here are the
reviews [scanned pdf]).
Home Page of Doron Zeilberger.