Michael A Forbes

If you made any changes in Pure these will be visible here soon.

Research Output

  • 15 Conference contribution
  • 5 Article
Filter
Article
2018

Identity testing and lower bounds for read-k oblivious algebraic branching programs

Anderson, M., Forbes, M. A., Saptharishi, R., Shpilka, A. & Volk, B. L., Jan 2018, In : ACM Transactions on Computation Theory. 10, 1, 3.

Research output: Contribution to journalArticle

Succinct hitting sets and barriers to proving lower bounds for algebraic circuits

Forbes, M. A., Shpilka, A. & Volk, B. L., 2018, In : Theory of Computing. 14, 18.

Research output: Contribution to journalArticle

2014

On the locality of codeword symbols in non-linear codes

Forbes, M. & Yekhanin, S., Jun 6 2014, In : Discrete Mathematics. 324, 1, p. 78-84 7 p.

Research output: Contribution to journalArticle

2011

A survey of binary covering arrays

Lawrence, J., Kacker, R. N., Lei, Y., Richard Kuhn, D. & Forbes, M., 2011, In : Electronic Journal of Combinatorics. 18, 1

Research output: Contribution to journalArticle

Open Access
2008

Refining the in-parameter-order strategy for constructing covering arrays

Forbes, M., Lawrence, J., Lei, Y., Kacker, R. N. & Kuhn, D. R., 2008, In : Journal of Research of the National Institute of Standards and Technology. 113, 5, p. 287-297 11 p.

Research output: Contribution to journalArticle