{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:05:01Z","timestamp":1759709101327,"version":"build-2065373602"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00186-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:42:39Z","timestamp":1027629759000},"page":"133-144","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Priority queues with binary priorities"],"prefix":"10.1016","volume":"262","author":[{"given":"K.","family":"Kalorkoti","sequence":"first","affiliation":[]},{"given":"D.H.","family":"Tulley","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00186-9_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01990338","article-title":"The permutational power of a priority queue","volume":"33","author":"Atkinson","year":"1993","journal-title":"BIT"},{"key":"10.1016\/S0304-3975(00)00186-9_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01108706","article-title":"Transforming binary sequences with priority queues","volume":"10","author":"Atkinson","year":"1993","journal-title":"Order"},{"key":"10.1016\/S0304-3975(00)00186-9_BIB3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0304-3975(96)00149-1","article-title":"Bounded capacity priority queues","volume":"205","author":"Atkinson","year":"1997","journal-title":"Theoret. Comput. Sci."},{"year":"1974","series-title":"Advanced Combinatorics","author":"Comtet","key":"10.1016\/S0304-3975(00)00186-9_BIB4"},{"key":"10.1016\/S0304-3975(00)00186-9_BIB5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0012-365X(99)90085-7","article-title":"Parking functions, valet functions and priority queues","volume":"197\/198","author":"Gilbey","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(00)00186-9_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(97)00037-6","article-title":"Labelled trees and input\u2013output permutations in priority queues","volume":"205","author":"Golin","year":"1997","journal-title":"Theoret. Comput. Sci."},{"year":"1983","series-title":"Combinatorial Enumeration","author":"Goulden","key":"10.1016\/S0304-3975(00)00186-9_BIB7"},{"year":"1968","series-title":"Priority Queues","author":"Jaiswal","key":"10.1016\/S0304-3975(00)00186-9_BIB8"},{"year":"1990","series-title":"Computer and Communication Systems Performance Modelling","author":"King","key":"10.1016\/S0304-3975(00)00186-9_BIB9"},{"key":"10.1016\/S0304-3975(00)00186-9_BIB10","unstructured":"D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming vol. 1, 1 ed., Addison-Wesley, Reading, MA, 1968 (see also 2nd ed., 1973)."},{"key":"10.1016\/S0304-3975(00)00186-9_BIB11","unstructured":"H. Leemans, Queue lengths and waiting times in the two-class two-server queue with nonpreemptive heterogeneous priority structures, 14th UK Computer and Telecommunications Performance Engineering Workshop, Department of Computer Science, The University of Edinburgh, 1998, pp.150\u2013165."},{"key":"10.1016\/S0304-3975(00)00186-9_BIB12","doi-asserted-by":"crossref","unstructured":"V.R. Pratt, Computing permutations with double-ended queues, 5th ACM Symp. on Theory of Computing, 1973, pp. 268\u2013277.","DOI":"10.1145\/800125.804058"},{"key":"10.1016\/S0304-3975(00)00186-9_BIB13","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","article-title":"Sorting using networks of queues and stacks","volume":"19","author":"Tarjan","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00186-9_BIB14","unstructured":"D.H. Tulley, The combinatorics of abstract container data types, Ph.D. Thesis, School of Mathematical and Computational Sciences, University of St. Andrews, Scotland, 1996."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001869?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001869?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:53:01Z","timestamp":1759625581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500001869"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00186-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Priority queues with binary priorities","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00186-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}