Existence of Submatrices with All Possible Columns. - J. Michael Steele (J. Comb. Theory A, 1978)

Long unimodal subsequences: a problem of F.R.K. Chung. - J. Michael Steele (Discret. Math., 1981)

Complete Convergence of Short Paths and Karp's Algorithm for the TSP. - J. Michael Steele (Math. Oper. Res., 1981)

Fast Sorting of Weyl Sequences Using Comparisons. - Martin H. Ellis; J. Michael Steele (SIAM J. Comput., 1981)

Lower Bounds for Algebraic Decision Trees. - J. Michael Steele; Andrew Chi-Chih Yao (J. Algorithms, 1982)

Algorithms and complexity for least median of squares regression. - J. Michael Steele; William L. Steiger (Discret. Appl. Math., 1986)

Probabilistic Algorithm for the Directed Traveling Salesman Problem. - J. Michael Steele (Math. Oper. Res., 1986)

On Frieze's χ(3) limit for lengths of minimal spanning trees. - J. Michael Steele (Discret. Appl. Math., 1987)

A Randomized Data Structure for Ordered Sets. - Jon Louis Bentley; Frank Thomson Leighton; Margaret Lepley; Donald F. Stanat; J. Michael Steele (Adv. Comput. Res., 1989)

Certifying smoothness of discrete functions and measuring legitimacy of images. - J. Michael Steele (J. Complex., 1989)

Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization. - J. Michael Steele; Timothy Law Snyder (SIAM J. Comput., 1989)

Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space. - J. Michael Steele (Math. Oper. Res., 1990)

Worst-case greedy matchings in the unit d-cube. - Timothy Law Snyder; J. Michael Steele (Networks, 1990)

A Priori Inequalities for the Euclidean Traveling Salesman. - Timothy Law Snyder; J. Michael Steele (SCG, 1992)

Euclidean semi-matchings of random samples. - J. Michael Steele (Math. Program., 1992)

Equidistribution of Point Sets for the Traveling Salesman and Related Problems. - Timothy Law Snyder; J. Michael Steele (SODA, 1993)

Worst-Case TSP Point Sets in All Dimensions are Asymptotically Equidistributed. - Timothy Law Snyder; J. Michael Steele (CCCG, 1994)

General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem. - Jun Gao; J. Michael Steele (J. Complex., 1994)

Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman Problem. - Jun Gao; J. Michael Steele (SIAM J. Discret. Math., 1994)

A Priori Bounds on the Euclidean Traveling Salesman. - Timothy Law Snyder; J. Michael Steele (SIAM J. Comput., 1995)

Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem. - Timothy Law Snyder; J. Michael Steele (SIAM J. Discret. Math., 1995)

Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence. - Alessandro Arlotto; J. Michael Steele (Comb. Probab. Comput., 2011)

Markov Decision Problems Where Means Bound Variances. - Alessandro Arlotto; Noah Gans; J. Michael Steele (Oper. Res., 2014)

Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars. - Petar Jevtic; J. Michael Steele (Math. Oper. Res., 2015)

Explaining a Mysterious Maximal Inequality - and a Path to the Law of Large Numbers. - J. Michael Steele (Am. Math. Mon., 2015)

A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming. - Alessandro Arlotto; J. Michael Steele (Math. Oper. Res., 2016)

Quickest online selection of an increasing subsequence of specified size. - Alessandro Arlotto; Elchanan Mossel; J. Michael Steele (Random Struct. Algorithms, 2016)