{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:27:09Z","timestamp":1787340429706,"version":"build-2736575974"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1981,8]]},"abstract":"<jats:p>We consider techniques for self-organizing linear search, examining the behavior of methods under arbitrary and specific probability distributions.<\/jats:p>\n                  <jats:p>The notion of moving an element forward after it has been accessed k times in a row is introduced. One implementation performs the transformation after any k identical requests. A second essentially groups requests into batches of k, and performs the action only if all requests of a batch are the same. Adopting as the transformation, the move to front heuristic, the second approach is shown in general to be superior. We show that the batched approach, with $k = 2$, leads to an average search time no greater than 1.21... times that of the optimal ordering. For the more direct approach, a ratio of 1.36... is shown under the same constraints.<\/jats:p>\n                  <jats:p>The simple move to front heuristic (i.e., $k = 1$) is also examined. It is shown that for a particular distribution this scheme can lead to an average number of probes $\\pi\/2$ times that of the optimal order. Within an interesting class of distributions, this is shown to be the worst average behavior.<\/jats:p>","DOI":"10.1137\/0210046","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:24:20Z","timestamp":1109226260000},"page":"613-637","source":"Crossref","is-referenced-by-count":54,"title":["Exegesis of Self-Organizing Linear Search"],"prefix":"10.1137","volume":"10","author":[{"given":"Gaston H.","family":"Gonnet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hendra","family":"Suwanda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"Handbook of mathematical functions with formulas, graphs, and mathematical tables","author":"Abramowitz Milton","year":"1964"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322094"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0208007"},{"key":"R4","volume-title":"Asymptotic Methods in Analysis","author":"de Bruijn N. G.","year":"1970"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90059-5"},{"key":"R6","unstructured":"G. H. Gonnet,  A Handbook of Algorithms and Data Structures, Report, CS-80-23, University of Waterloo,  1981, May"},{"key":"R7","volume-title":"Table of integrals, series, and products","author":"Gradshteyn I. S.","year":"1965"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0205050"},{"key":"R9","volume-title":"The art of computer programming. Volume 3","author":"Knuth Donald E.","year":"1973"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.4.609"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/359997.360000"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1145\/359588.359616"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0210046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:34:48Z","timestamp":1787337288000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0210046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,8]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,8]]}},"alternative-id":["10.1137\/0210046"],"URL":"https:\/\/doi.org\/10.1137\/0210046","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,8]]}}}