{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:39:38Z","timestamp":1725485978427},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003465"},{"type":"electronic","value":"9783540363835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36383-1_9","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:26:41Z","timestamp":1180902401000},"page":"181-196","source":"Crossref","is-referenced-by-count":5,"title":["Presenting Data from Experiments in Algorithmics"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders.","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1019293017474","volume":"99","author":"P. Alefragis","year":"2000","unstructured":"P. Alefragis, P. Sanders, T. Takkula, and D. Wedelin. Parallel integer optimization for crew scheduling. Annals of Operations Research, 99(1):141\u2013166, 2000.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"2000","unstructured":"Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM Journal on Computing, 29(1):180\u2013200, February 2000.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"P. Berenbrink, A. Czumaj, A. Steger, and B. V\u00f6cking. Balanced allocations: the heavily loaded case. In 32th Annual ACM Symposium on Theory of Computing (STOC\u201900), pages 745\u2013754, 2000.","DOI":"10.1145\/335305.335411"},{"key":"9_CR4","volume-title":"Graphical Methods for Data Analysis","author":"J. M. Chambers","year":"1983","unstructured":"J. M. Chambers, W. S. Cleveland, B. Kleiner, and P. A. Tukey. Graphical Methods for Data Analysis. Duxbury Press, Boston, 1983."},{"key":"9_CR5","volume-title":"Elements of Graphing Data","author":"W. S._Cleveland","year":"1994","unstructured":"W. S._Cleveland. Elements of Graphing Data. Wadsworth, Monterey, Ca, 2nd edition, 1994.","edition":"2nd edition"},{"key":"9_CR6","unstructured":"D. S. Johnson. A theoretician\u2019s guide to the experimental analysis of algorithms. In M. Goldwasser, D. S. Johnson, and C. C. McGeoch, editors, Proceedings of the 5th and 6th DIMACS Implementation Challenges. American Mathematical Society, 2002."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACMTMCS: ACM Transactions on Modeling and Computer Simulation, 8:3\u201330, 1998. http:\/\/www.math.keio.ac.jp\/~matumoto\/emt.html .","journal-title":"ACMTMCS: ACM Transactions on Modeling and Computer Simulation"},{"key":"9_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BFb0052828","volume-title":"Advances in Intelligent Data Analysis","author":"C. C. McGeoch","year":"1997","unstructured":"C. C. McGeoch, D. Precup, and P. R. Cohen. How to find big-oh in your data set (and how not to). In Advances in Intelligent Data Analysis. Springer Lecture Notes in Computer Science 1280, pages 41\u201352, 1997."},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/337885.337899","volume":"30","author":"C. C. McGeoch","year":"1999","unstructured":"C. C. McGeoch and B. M. E. Moret. How to present a paper on experimental work with algorithms. SIGACT News, 30(4):85\u201390, 1999.","journal-title":"SIGACT News"},{"key":"9_CR10","unstructured":"B. M. E. Moret. Towards a discipline of experimental algorithmics. In 5th DIMACS Challenge, DIMACS Monograph Series, 2000. To appear."},{"key":"9_CR11","unstructured":"W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992."},{"key":"9_CR12","unstructured":"P. Sanders. Lastverteilungsalgorithmen f\u00fcr parallele Tiefensuche. Number 463 in Fortschrittsberichte, Reihe 10. VDI Verlag, 1997."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"P. Sanders. Asynchronous scheduling of redundant disk arrays. In 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201900), pages 89\u201398, 2000.","DOI":"10.1145\/341800.341812"},{"key":"9_CR14","series-title":"Lect Notes Comput Sci","first-page":"135","volume-title":"A case study for randomized algorithms","author":"P. Sanders","year":"2000","unstructured":"P. Sanders and R. Fleischer. Asymptotic complexity from experiments? A case study for randomized algorithms. In Proceedings of the 4th Workshop on Algorithm Engineering (WAE\u201900). Springer Lecture Notes in Computer Science 1982, pages 135\u2013146, 2000."},{"key":"9_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1007\/3-540-44520-X_128","volume-title":"A bandwidth latency tradeoff for broadcast and reduction","author":"P. Sanders","year":"2000","unstructured":"P. Sanders and J. Sibeyn. A bandwidth latency tradeoff for broadcast and reduction. In Proceedings of the 6th International Euro-Par Conference. Springer Lecture Notes in Computer Science 1900, pages 918\u2013926, 2000."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"P. Sanders. Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics, 5, 2000.","DOI":"10.1145\/351827.384249"},{"key":"9_CR17","volume-title":"The Visual Display of Quantitative Information","author":"E. R. Tufte","year":"1983","unstructured":"E. R. Tufte. The Visual Display of Quantitative Information. Graphics Press, Cheshire, Connecticut, U.S.A., 1983."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36383-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:55:43Z","timestamp":1556470543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36383-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003465","9783540363835"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36383-1_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}