- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j14 |      | Antonio Blanca, Anant P. Godbole: On Universal Cycles for new Classes of Combinatorial Structures. SIAM J. Discrete Math. 25(4): 1832-1842 (2011) |
| 2010 | ||
| j13 | | Arielle Leitner, Anant P. Godbole: Universal cycles of classes of restricted words. Discrete Mathematics 310(23): 3303-3309 (2010) |
| i1 | | Michael S. Donders, Anant P. Godbole: $t$-Covering Arrays Generated by a Tiling Probability Model. CoRR abs/1011.0351 (2010) |
| 2009 | ||
| j12 | | Anant P. Godbole, Nathaniel G. Watson, Carl R. Yerger: Threshold and complexity results for the cover pebbling game. Discrete Mathematics 309(11): 3609-3624 (2009) |
| 2008 | ||
| j11 | | Melody Chan, Anant P. Godbole: Improved pebbling bounds. Discrete Mathematics 308(11): 2301-2306 (2008) |
| 2005 | ||
| j10 | | 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 | ||
| j9 | | 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) |
| j8 | | 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 | ||
| j7 | | Ben Wieland, Anant P. Godbole: On the Domination Number of a Random Graph. Electr. J. Comb. 8(1) (2001) |
| 1998 | ||
| j6 | | Anant P. Godbole, Laura K. Potter, Erik Jonathan Sandquist: Sign-balanced covering matrices. Discrete Mathematics 190(1-3): 79-93 (1998) |
| 1997 | ||
| j5 | | Anant P. Godbole, Ben Lamorte, Erik Jonathan Sandquist: Threshold Functions for the Bipartite Tura'n property. Electr. J. Comb. 4(1) (1997) |
| j4 | | Andrew D. Barbour, Anant P. Godbole, Jinghua Qian: Imperfections in Random Tournaments. Combinatorics, Probability & Computing 6(1): 1-15 (1997) |
| 1996 | ||
| j3 |  | Anant P. Godbole, Sandra E. Thompson, Eric Vigoda: General upper bounds for covering numbers. Ars Comb. 42 (1996) |
| j2 | | Anant P. Godbole, Daphne E. Skipper, Rachel A. Sunley: t-Covering Arrays: Upper Bounds and Poisson Approximations. Combinatorics, Probability & Computing 5: 105-117 (1996) |
| j1 | | Anant P. Godbole, Svante Janson: Random Covering Designs. J. Comb. Theory, Ser. A 75(1): 85-98 (1996) |
Colors in the list of coauthors
Last update Wed May 22 20:01:20 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page