{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:54:21Z","timestamp":1648878861378},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s00607-008-0011-x","type":"journal-article","created":{"date-parts":[[2008,9,2]],"date-time":"2008-09-02T02:26:55Z","timestamp":1220322415000},"page":"41-54","source":"Crossref","is-referenced-by-count":0,"title":["Computing inversion pair cardinality through partition-based sorting"],"prefix":"10.1007","volume":"83","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bistarelli S, Gennari R, Rossi F (2000) Constraint propagation for soft constraints: generalization and termination conditions. In: CP, pp 83\u201397","DOI":"10.1007\/3-540-45349-0_8"},{"issue":"11","key":"11_CR2","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"JL Bentley","year":"1993","unstructured":"Bentley JL, McIlroy MD (1993) Engineering a sort function. Softw Practice Exp 23(11): 1249\u20131265","journal-title":"Softw Practice Exp"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"MR Brown","year":"1980","unstructured":"Brown MR, Tarjan RE (1980) Design and analysis of data structures for representing sorted lists. SIAM J Comput 9: 594\u2013614","journal-title":"SIAM J Comput"},{"issue":"3","key":"11_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0019-9958(58)80001-7","volume":"1","author":"WH Burge","year":"1958","unstructured":"Burge WH (1958) Sorting, trees and measures of order. Inf Control 1(3): 181\u2013197","journal-title":"Inf Control"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"CR Cook","year":"1980","unstructured":"Cook CR, Kim DJ (1980) Best sorting algorithms for nearly linearly sorted lists. Commun ACM 23: 620\u2013624","journal-title":"Commun ACM"},{"key":"11_CR6","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"1992","unstructured":"Cormen TH, Leiserson CE, Rivest RL (1992) Introduction to algorithms, 2nd edn. MIT Press and McGraw-Hill Book Company, Boston","edition":"2"},{"key":"11_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, New York"},{"issue":"6","key":"11_CR8","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C Demtrescu","year":"2004","unstructured":"Demtrescu C (2004) A new approach to dynamic all pairs shortest paths. J ACM 51(6): 968\u2013992","journal-title":"J ACM"},{"issue":"4","key":"11_CR9","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 (1992) A survey of adaptive sorting algorithms. ACM Comput Surv 24(4): 441\u2013476","journal-title":"ACM Comput Surv"},{"key":"11_CR10","unstructured":"Guibas LJ, McCreight EM, Plass MF (1977) A new represenation of linear lists. In: Symposium on the theory of computing, pp 49\u201360"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gonzalez O, Shrikumar H, Ramamritham K, Stankovic J (1997) Adaptive fault tolerance and graceful degradation under dynamic hard real-time scheduling. In: Real-time systems symposium, San Francisco","DOI":"10.1109\/REAL.1997.641271"},{"key":"11_CR12","unstructured":"Herrmann C (1994) 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"},{"issue":"7","key":"11_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"CAR Hoare","year":"1961","unstructured":"Hoare CAR (1961) Quicksort. Commun ACM 4(7): 321","journal-title":"Commun ACM"},{"key":"11_CR14","unstructured":"Kiwiel KC (2003) Partitioning schemes for quicksort and quickselect, Warsaw"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, Pruhs (2000) Fault-tolerant real-time scheduling. ALGRTHMICA: Algorithmica, 28","DOI":"10.1007\/s004530010034"},{"issue":"4","key":"11_CR16","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/TC.1985.5009382","volume":"34","author":"H Mannila","year":"1985","unstructured":"Mannila H (1985) Measures of presortedness and optimal sorting algorithms. IEEE Trans Comput 34(4): 318\u2013325","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"11_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":"MD McIlroy","year":"1999","unstructured":"McIlroy MD (1999) A killer adversary for quicksort. Softw Practice Exp 29(4): 341\u2013344","journal-title":"Softw Practice Exp"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Mehlhorn K (1984) Data structures and algorithms, vol I: Sorting and Searching. EATCS monographs on Theoretical Computer Science. Springer, Heidelberg","DOI":"10.1007\/978-3-642-69672-5_2"},{"issue":"3","key":"11_CR19","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 (2001) Optimal sampling strategies in quicksort and quickselect. SIAM J Comput 31(3): 683\u2013705","journal-title":"SIAM J Comput"},{"key":"11_CR20","unstructured":"Petersson O (1990) Adaptive sorting. PhD Thesis, Lund University, Lund, Sweden"},{"key":"11_CR21","volume-title":"Fault-tolerant computing: theory and techniques","author":"DK Pradhan","year":"1986","unstructured":"Pradhan DK (1986) Fault-tolerant computing: theory and techniques. Prentice Hall, Englewood Cliffs, NJ"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Stankovic J (1988) Misconceptions about real-time computing. IEEE Comput 21(10):10\u201319","DOI":"10.1109\/2.7053"},{"key":"11_CR23","unstructured":"Stankovic JA (1988) Real-time computing systems: the next generation. In: Stankovic JA, Ramamritham K (eds) Tutorial: hard real time systems. IEEE 14:38"},{"key":"11_CR24","unstructured":"Takoka T (2008) Minimal mergesort (manuscript)"},{"issue":"11","key":"11_CR25","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1145\/362790.362803","volume":"13","author":"MH van Emden","year":"1970","unstructured":"van Emden MH (1970) Algorithms 402: Increasing the efficiency of quicksort. Commun ACM 13(11): 693\u2013694","journal-title":"Commun ACM"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-008-0011-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-008-0011-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-008-0011-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:30:21Z","timestamp":1559125821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-008-0011-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s00607-008-0011-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5]]}}}