{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:27Z","timestamp":1725493647534},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_2","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"3-4","source":"Crossref","is-referenced-by-count":0,"title":["Experiments for Algorithm Engineering"],"prefix":"10.1007","author":[{"given":"Jon","family":"Bentley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"2","key":"2_CR1","first-page":"85","volume":"10","author":"J. L. Bentley","year":"1992","unstructured":"J. L. Bentley. Software Exploratorium: The Trouble With Qsort, UNIX Review, Vol. 10,2, pp. 85\u201393, February 1992.","journal-title":"UNIX Review"},{"issue":"4","key":"2_CR2","first-page":"65","volume":"15","author":"J. L. Bentley","year":"1997","unstructured":"J. L. Bentley. Software Explorations: Cost Models for Sorting, UNIX Review, Vol. 15,4, pp. 65\u201372, April 1997.","journal-title":"UNIX Review"},{"key":"2_CR3","volume-title":"Programming Pearls","author":"J. L. Bentley","year":"2000","unstructured":"J. L. Bentley. Programming Pearls, Second Edition, Addison-Wesley, Reading, MA, 2000.","edition":"Second Edition"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J. L. Bentley","year":"1993","unstructured":"J. L. Bentley and M. D. McIlroy. Engineering a sort function, Software-Practice and Experience, Vol. 23,1, pp. 1249\u20131265, 1993.","journal-title":"Software-Practice and Experience"},{"key":"2_CR5","unstructured":"J. L. Bentley and R. Sedgewick. Fast Algorithms for Sorting and Searching Strings, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 360\u2013369, January 1997."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. Quicksort, Computer Journal, Vol. 5,1, 1962.","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/(SICI)1097-024X(19990410)29:4<341::AID-SPE237>3.0.CO;2-R","volume":"29","author":"M. D. McIlroy","year":"1999","unstructured":"M. D. McIlroy. A killer adversary for quicksort, Software-Practice and Experience, Vol. 29, pp. 341\u2013344, 1999.","journal-title":"Software-Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T16:02:11Z","timestamp":1551024131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}