J. Michael Steele - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2016

A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic ProgrammingAlessandro Arlotto, J. Michael Steele. mor, 41(4):1448-1468, 2016. [doi]

Quickest online selection of an increasing subsequence of specified sizeAlessandro Arlotto, Elchanan Mossel, J. Michael Steele. rsa, 49(2):235-252, 2016. [doi]

2015

Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning CaterpillarsPetar Jevtic, J. Michael Steele. mor, 40(4):992-1004, 2015. [doi]

Explaining a Mysterious Maximal Inequality - and a Path to the Law of Large NumbersJ. Michael Steele. tamm, 122(5):490-494, 2015. [doi]

2014

Markov Decision Problems Where Means Bound VariancesAlessandro Arlotto, Noah Gans, J. Michael Steele. ior, 62(4):864-875, 2014. [doi]

2011

Optimal Sequential Selection of a Unimodal Subsequence of a Random SequenceAlessandro Arlotto, J. Michael Steele. cpc, 20(6):799-814, 2011. [doi]

1995

Equidistribution in All Dimensions of Worst-Case Point Sets forthe Traveling Salesman ProblemTimothy Law Snyder, J. Michael Steele. siamdm, 8(4):678-683, 1995. [doi]

1994

Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman ProblemJun Gao, J. Michael Steele. siamdm, 7(2):314-324, 1994. [doi]

General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman ProblemJun Gao, J. Michael Steele. jc, 10(2):230-245, 1994. [doi]

Worst-Case TSP Point Sets in All Dimensions are Asymptotically EquidistributedTimothy Law Snyder, J. Michael Steele. cccg 1994: 147-152

1992

::::A Priori:::: Inequalities for the Euclidean Traveling SalesmanTimothy Law Snyder, J. Michael Steele. compgeom 1992: 344-349 [doi]

Euclidean semi-matchings of random samplesJ. Michael Steele. mp, 53:127-146, 1992.

1990

d-cubeTimothy Law Snyder, J. Michael Steele. networks, 20(6):779-800, 1990. [doi]

Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean SpaceJ. Michael Steele. mor, 15(4):749-770, 1990. [doi]

1989

A Randomized Data Structure for Ordered SetsJon Louis Bentley, Frank Thomson Leighton, Margaret Lepley, Donald F. Stanat, J. Michael Steele. acr, 5:413-428, 1989.

Certifying smoothness of discrete functions and measuring legitimacy of imagesJ. Michael Steele. jc, 5(3):261-270, 1989. [doi]

Worst-Case Growth Rates of Some Classical Problems of Combinatorial OptimizationJ. Michael Steele, Timothy Law Snyder. SICOMP, 18(2):278-287, 1989.

1987

On Frieze's χ(3) limit for lengths of minimal spanning treesJ. Michael Steele. DAM, 18(1):99-103, 1987. [doi]

1986

Probabilistic Algorithm for the Directed Traveling Salesman ProblemJ. Michael Steele. mor, 11(2):343-350, 1986. [doi]

Algorithms and complexity for least median of squares regressionJ. Michael Steele, William L. Steiger. DAM, 14(1):93-100, 1986. [doi]

1982

Lower Bounds for Algebraic Decision TreesJ. Michael Steele, Andrew Chi-Chih Yao. jal, 3(1):1-8, 1982.

1981

Fast Sorting of Weyl Sequences Using ComparisonsMartin H. Ellis, J. Michael Steele. SICOMP, 10(1):88-95, 1981.

Long unimodal subsequences: a problem of F.R.K. ChungJ. Michael Steele. DM, 33(2):223-225, 1981. [doi]

Complete Convergence of Short Paths and Karp's Algorithm for the TSPJ. Michael Steele. mor, 6(3):374-378, 1981. [doi]

1978

Existence of Submatrices with All Possible ColumnsJ. Michael Steele. JCT, 24(1):84-88, 1978.

Sign in or sign up to see more results.

runs on WebDSL