default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Michael Steele
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j24]Alessandro Arlotto, J. Michael Steele:
A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming. Math. Oper. Res. 41(4): 1448-1468 (2016)- [j23]Alessandro Arlotto, Elchanan Mossel, J. Michael Steele:
Quickest online selection of an increasing subsequence of specified size. Random Struct. Algorithms 49(2): 235-252 (2016) - 2015
- [j22]Petar Jevtic, J. Michael Steele:
Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars. Math. Oper. Res. 40(4): 992-1004 (2015) - [j21]J. Michael Steele:
Explaining a Mysterious Maximal Inequality - and a Path to the Law of Large Numbers. Am. Math. Mon. 122(5): 490-494 (2015) - 2014
- [j20]Alessandro Arlotto, Noah Gans, J. Michael Steele:
Markov Decision Problems Where Means Bound Variances. Oper. Res. 62(4): 864-875 (2014) - 2011
- [j19]Alessandro Arlotto, J. Michael Steele:
Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence. Comb. Probab. Comput. 20(6): 799-814 (2011)
1990 – 1999
- 1995
- [j18]Timothy Law Snyder, J. Michael Steele:
A Priori Bounds on the Euclidean Traveling Salesman. SIAM J. Comput. 24(3): 665-671 (1995) - [j17]Timothy Law Snyder, J. Michael Steele:
Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem. SIAM J. Discret. Math. 8(4): 678-683 (1995) - 1994
- [j16]Jun Gao, J. Michael Steele:
General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem. J. Complex. 10(2): 230-245 (1994) - [j15]Jun Gao, J. Michael Steele:
Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman Problem. SIAM J. Discret. Math. 7(2): 314-324 (1994) - [c3]Timothy Law Snyder, J. Michael Steele:
Worst-Case TSP Point Sets in All Dimensions are Asymptotically Equidistributed. CCCG 1994: 147-152 - 1993
- [c2]Timothy Law Snyder, J. Michael Steele:
Equidistribution of Point Sets for the Traveling Salesman and Related Problems. SODA 1993: 462-466 - 1992
- [j14]J. Michael Steele:
Euclidean semi-matchings of random samples. Math. Program. 53: 127-146 (1992) - [c1]Timothy Law Snyder, J. Michael Steele:
A Priori Inequalities for the Euclidean Traveling Salesman. SCG 1992: 344-349 - 1990
- [j13]J. Michael Steele:
Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space. Math. Oper. Res. 15(4): 749-770 (1990) - [j12]Timothy Law Snyder, J. Michael Steele:
Worst-case greedy matchings in the unit d-cube. Networks 20(6): 779-800 (1990)
1980 – 1989
- 1989
- [j11]Jon Louis Bentley, Frank Thomson Leighton, Margaret Lepley, Donald F. Stanat, J. Michael Steele:
A Randomized Data Structure for Ordered Sets. Adv. Comput. Res. 5: 413-428 (1989) - [j10]J. Michael Steele:
Certifying smoothness of discrete functions and measuring legitimacy of images. J. Complex. 5(3): 261-270 (1989) - [j9]J. Michael Steele, Timothy Law Snyder:
Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization. SIAM J. Comput. 18(2): 278-287 (1989) - 1987
- [j8]J. Michael Steele:
On Frieze's χ(3) limit for lengths of minimal spanning trees. Discret. Appl. Math. 18(1): 99-103 (1987) - 1986
- [j7]J. Michael Steele, William L. Steiger:
Algorithms and complexity for least median of squares regression. Discret. Appl. Math. 14(1): 93-100 (1986) - [j6]J. Michael Steele:
Probabilistic Algorithm for the Directed Traveling Salesman Problem. Math. Oper. Res. 11(2): 343-350 (1986) - 1982
- [j5]J. Michael Steele, Andrew Chi-Chih Yao:
Lower Bounds for Algebraic Decision Trees. J. Algorithms 3(1): 1-8 (1982) - 1981
- [j4]J. Michael Steele:
Long unimodal subsequences: a problem of F.R.K. Chung. Discret. Math. 33(2): 223-225 (1981) - [j3]J. Michael Steele:
Complete Convergence of Short Paths and Karp's Algorithm for the TSP. Math. Oper. Res. 6(3): 374-378 (1981) - [j2]Martin H. Ellis, J. Michael Steele:
Fast Sorting of Weyl Sequences Using Comparisons. SIAM J. Comput. 10(1): 88-95 (1981)
1970 – 1979
- 1978
- [j1]J. Michael Steele:
Existence of Submatrices with All Possible Columns. J. Comb. Theory A 24(1): 84-88 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
