2008 |
11 | EE | Melody Chan,
Anant P. Godbole:
Improved pebbling bounds.
Discrete Mathematics 308(11): 2301-2306 (2008) |
2005 |
10 | EE | Anant P. Godbole,
Nathaniel G. Watson,
Carl R. Yerger:
Cover Pebbling Thresholds for the Complete Graph.
Electronic Notes in Discrete Mathematics 22: 301-304 (2005) |
2004 |
9 | EE | Adam Wierman,
Julia Salzman,
Michael Jablonski,
Anant P. Godbole:
An improved upper bound for the pebbling threshold of the n-path.
Discrete Mathematics 275(1-3): 367-373 (2004) |
8 | EE | Anant P. Godbole,
Joseph A. Johnson:
Even 2 × 2 Submatrices of a Random Zero-One Matrix.
Graphs and Combinatorics 20(4): 457-466 (2004) |
2001 |
7 | EE | Ben Wieland,
Anant P. Godbole:
On the Domination Number of a Random Graph.
Electr. J. Comb. 8(1): (2001) |
1998 |
6 | EE | Anant P. Godbole,
Laura K. Potter,
Erik Jonathan Sandquist:
Sign-balanced covering matrices.
Discrete Mathematics 190(1-3): 79-93 (1998) |
1997 |
5 | | Andrew D. Barbour,
Anant P. Godbole,
Jinghua Qian:
Imperfections in Random Tournaments.
Combinatorics, Probability & Computing 6(1): 1-15 (1997) |
4 | EE | Anant P. Godbole,
Ben Lamorte,
Erik Jonathan Sandquist:
Threshold Functions for the Bipartite Tura'n property.
Electr. J. Comb. 4(1): (1997) |
1996 |
3 | | Anant P. Godbole,
Sandra E. Thompson,
Eric Vigoda:
General upper bounds for covering numbers.
Ars Comb. 42: (1996) |
2 | | Anant P. Godbole,
Daphne E. Skipper,
Rachel A. Sunley:
t-Covering Arrays: Upper Bounds and Poisson Approximations.
Combinatorics, Probability & Computing 5: 105-117 (1996) |
1 | EE | Anant P. Godbole,
Svante Janson:
Random Covering Designs.
J. Comb. Theory, Ser. A 75(1): 85-98 (1996) |