{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:34:35Z","timestamp":1648611275552},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10852-008-9089-6","type":"journal-article","created":{"date-parts":[[2008,9,11]],"date-time":"2008-09-11T10:32:37Z","timestamp":1221129157000},"page":"255-276","source":"Crossref","is-referenced-by-count":0,"title":["Fault Tolerant Sorting\u2014Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Tauras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Owen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"9089_CR1","unstructured":"Brodal, G.S., Fagerberg, R., Moruz, G.: On the adaptiveness of quicksort. In: ALENEX\/ANALCO, pp. 130\u2013140, Vancouver, 22 January 2005"},{"key":"9089_CR2","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Gennari, R., Rossi, F.: Constraint propagation for soft constraints: generalization and termination conditions. In: International Conference on the Principles and Practice of Constraint Programming, pp. 83\u201397, Singapore, 18\u201321 September 2000","DOI":"10.1007\/3-540-45349-0_8"},{"issue":"11","key":"9089_CR3","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J.L. Bentley","year":"1993","unstructured":"Bentley, J.L., Douglas McIlroy, M.: Engineering a sort function. Softw. Pract. Exp. 23(11), 1249\u20131265 (1993)","journal-title":"Softw. Pract. Exp."},{"key":"9089_CR4","first-page":"163","volume-title":"Proceedings of the 11th International Conference on Computer Hardware Description Languages and their Applications (CHDL\u201993), IFIP Transactions A: Computer Science and Technology, Amsterdam, The Netherlands, vol. 32","author":"E.M. Clarke","year":"1993","unstructured":"Clarke, E.M.: Automatic verification of sequential circuit designs. In: Agnew, D., Claesen, L., Camposano, R. (eds.) Proceedings of the 11th International Conference on Computer Hardware Description Languages and their Applications (CHDL\u201993), IFIP Transactions A: Computer Science and Technology, Amsterdam, The Netherlands, vol. 32, pp. 163\u2013166. North-Holland, Amsterdam (1993)"},{"key":"9089_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT, Cambridge (2001)"},{"issue":"6","key":"9089_CR6","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C. Demtrescu","year":"2004","unstructured":"Demtrescu, C.: A new approach to dynamic all pairs shortest paths. J. ACM 51(6), 968\u2013992 (2004)","journal-title":"J. ACM"},{"issue":"4","key":"9089_CR7","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Comput. Surv. 24(4), 441\u2013476 (1992)","journal-title":"ACM Comput. Surv."},{"key":"9089_CR8","doi-asserted-by":"crossref","unstructured":"Gonzalez, O., Shrikumar, H., Ramamritham, K., Stankovic, J.: Adaptive fault tolerance and graceful degradation under dynamic hard real-time scheduling. In: Real-Time Systems Symposium, San Francisco, 2\u20135 December 1997","DOI":"10.1109\/REAL.1997.641271"},{"key":"9089_CR9","volume-title":"Algorithm Design: Foundations, Analysis and Internet Examples","author":"M.T. Goodrich","year":"2002","unstructured":"Goodrich, M.T., Tamassia, R.: Algorithm Design: Foundations, Analysis and Internet Examples. Wiley, New York (2002)"},{"key":"9089_CR10","first-page":"14","volume-title":"Modelling and Evaluation of ATM Networks","author":"C. Herrmann","year":"1994","unstructured":"Herrmann, C.: Vbr video in atm without frame buffering: influence of a periodic correlation function on qos parameters. In: Modelling and Evaluation of ATM Networks, pp. 14\u201331. Chapman & Hall, London (1994)"},{"issue":"7","key":"9089_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Quicksort. Commun. ACM 4(7), 321 (1961)","journal-title":"Commun. ACM"},{"key":"9089_CR12","unstructured":"Karger, D.R.: Randomized Algorithms for Graph Optimization Problem. Ph.D. thesis, Stanford University (1994)"},{"key":"9089_CR13","unstructured":"Kiwiel, K.C.: Partitioning schemes for quicksort and quickselect. Technical report, Systems Research Institute (2003)"},{"key":"9089_CR14","volume-title":"The Art of Computer Programming Vol. 3: Sorting and Searching","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming Vol. 3: Sorting and Searching. Addison-Wesley Longman, Boston (1997)"},{"key":"9089_CR15","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, P.: Fault-tolerant real-time scheduling. ALGRTHMICA: Algorithmica 28, (2000)","DOI":"10.1007\/s004530010034"},{"key":"9089_CR16","unstructured":"Martinez, C.: Partial quicksort. In: Proceedings of the First ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), New Orleans, 10 January 2004"},{"issue":"4","key":"9089_CR17","doi-asserted-by":"crossref","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":"McIlroy, M.D.: A killer adversary for quicksort. Softw. Pract. Exp. 29(4), 341\u2013344 (1999)","journal-title":"Softw. Pract. Exp."},{"key":"9089_CR18","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/MC.2007.37","volume":"40","author":"T. Menzies","year":"2007","unstructured":"Menzies, T., Owen, D., Richardson, J.: The strangest thing about software. IEEE Comput. 40, 54\u201360 (2007)","journal-title":"IEEE Comput."},{"key":"9089_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"3","key":"9089_CR20","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/S0097539700382108","volume":"31","author":"C. Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Roura, S.: Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput. 31(3), 683\u2013705 (2001)","journal-title":"SIAM J. Comput."},{"key":"9089_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing, 1st edn. Cambridge University Press, Cambridge (2005)","edition":"1"},{"key":"9089_CR22","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"key":"9089_CR23","unstructured":"Owen, D., Menzies, T.: Lurch: a lightweight alternative to model checking. In: SEKE, pp. 158\u2013165, San Francisco, 1\u20133 July 2003"},{"key":"9089_CR24","volume-title":"Fault-Tolerant Computing: Theory and Techniques","author":"D.K. Pradhan","year":"1986","unstructured":"Pradhan, D.K.: Fault-Tolerant Computing: Theory and Techniques. Prentice Hall, Englewood Cliffs (1986)"},{"issue":"2","key":"9089_CR25","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996)","journal-title":"J. Algorithms"},{"issue":"2","key":"9089_CR26","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/0206018","volume":"6","author":"R. Sedgewick","year":"1977","unstructured":"Sedgewick, R.: Quicksort with equal keys. SIAM J. Comput. 6(2), 240\u2013268 (1977)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"9089_CR27","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"Sedgewick, R.: Implementing quicksort programs. Commun. ACM 21(10), 847\u2013857 (1978)","journal-title":"Commun. ACM"},{"key":"9089_CR28","doi-asserted-by":"crossref","unstructured":"Stankovic, J.: Misconceptions about real-time computing. IEEE Comput. 21(10), (1988)","DOI":"10.1109\/2.7053"},{"key":"9089_CR29","first-page":"14","volume-title":"Tutorial: Hard Real Time Systems","author":"J.A. Stankovic","year":"1988","unstructured":"Stankovic, J.A.: Real-time computing systems: the next generation. In: Stankovic, J.A., Ramamritham, K. (eds.) Tutorial: Hard Real Time Systems, pp. 14\u201338. IEEE, Piscataway (1988)"},{"key":"9089_CR30","first-page":"12","volume-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 20\u201322 October 1997","author":"M. Thorup","year":"1997","unstructured":"Thorup, M.: Undirected single source shortest path in linear time. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 20\u201322 October 1997, pp. 12\u201321. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"11","key":"9089_CR31","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1145\/362790.362803","volume":"13","author":"M.H. Emden van","year":"1970","unstructured":"van Emden, M.H.: Algorithms 402: increasing the efficiency of quicksort. Commun. ACM 13(11), 693\u2013694 (1970)","journal-title":"Commun. ACM"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9089-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9089-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9089-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:30Z","timestamp":1559269590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9089-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9089"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9089-6","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9]]}}}