Quantitative analysis of problems in computer algebra: Grobner bases and the Nullstellensatz. - Thomas Dubé (1989)

The Structure of Polynomial Ideals and Gröbner Bases. - Thomas Dubé (SIAM J. Comput., 1990)

Dominance Range-Query: The One-Reporting Case. - Thomas Dubé (SCG, 1993)

The Geometry in Constraint Logic Programs. - Thomas Dubé; Chee-Keng Yap (PPCP, 1993)

A Combinatorial Proof of the Effective Nullstellensatz. - Thomas Dubé (J. Symb. Comput., 1993)

Firmware modification attacks on programmable logic controllers. - Zachry Basnight; Jonathan Butts; Juan Lopez Jr.; Thomas Dubé (Int. J. Crit. Infrastructure Prot., 2013)