{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:35:57Z","timestamp":1725795357173},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_1","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Selecting Data for Experiments: Past, Present and Future"],"prefix":"10.1007","author":[{"given":"Jon","family":"Bentley","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J.L. Bentley","year":"1992","unstructured":"Bentley, J.L.: Fast algorithms for geometric traveling salesman problems. ORSA J. Computing\u00a04, 387\u2013411 (1992)","journal-title":"ORSA J. Computing"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J.L. Bentley","year":"1993","unstructured":"Bentley, J.L., McIlroy, M.D.: Engineering a sort function. Software Pract. Exper.\u00a023, 1249\u20131265 (1993)","journal-title":"Software Pract. Exper."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0255(01)00097-4","volume":"135","author":"J.L. Bentley","year":"2001","unstructured":"Bentley, J.L., McIlroy, M.D.: Data compression with long repeated strings. Inform. Sci.\u00a0135, 1\u201311 (2001)","journal-title":"Inform. Sci."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bentley, J.L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems, Technical report CMU-CS-79-111. Carnegie-Mellon University Computer Science Department (1979)","DOI":"10.21236\/ADA066740"},{"key":"1_CR5","first-page":"4","volume":"6","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems. ACM Trans. Math. Software\u00a06, 4 (1980)","journal-title":"ACM Trans. Math. Software"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F. Chang","year":"2008","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E., Bigtable: A distributed storage system for structured data. ACM Trans. Computer Systems\u00a026, 2 (2008)","journal-title":"ACM Trans. Computer Systems"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Computer J.\u00a05, 10\u201315 (1962)","journal-title":"Computer J."},{"key":"1_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511843747","volume-title":"A Guide to Experimental Algorithmics","author":"C.C. McGeoch","year":"2012","unstructured":"McGeoch, C.C.: A Guide to Experimental Algorithmics. Cambridge University Press, Cambridge (2012)"},{"key":"1_CR9","unstructured":"Wikipedia: BigTable (April 2014)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T04:57:15Z","timestamp":1689310635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}