{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:42Z","timestamp":1759637862100},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90085-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"351-373","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Parking functions, valet functions and priority queues"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Julian D.","family":"Gilbey","sequence":"first","affiliation":[]},{"given":"Louis H.","family":"Kalikow","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90085-7_BIB1","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1137\/S0097539792240893","article-title":"Priority queues and permutations","volume":"23","author":"Atkinson","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.37236\/1218","article-title":"Priority queues and multisets","volume":"2","author":"Atkinson","year":"1995","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB3","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\/S0012-365X(99)90085-7_BIB4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(93)90180-H","article-title":"Enumerating k-way trees","volume":"48","author":"Atkinson","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB5","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/BF01834776","article-title":"Mappings of acyclic and parking functions","volume":"10","author":"Foata","year":"1974","journal-title":"Aequationes Math."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0097-3165(75)90063-1","article-title":"Acyclic and parking functions","volume":"18","author":"Fran\u00e7on","year":"1975","journal-title":"J. Combin. Theory (A)"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB7","series-title":"The Foata Festschrift","first-page":"36","article-title":"The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions","volume":"3","author":"Gessel","year":"1996"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB8","unstructured":"I.M. Gessel, K.-Y. Wang, A bijective approach to the permutational power of a priority queue. unpublished."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB9","series-title":"Graph-Theoretic Concepts in Computer Science","first-page":"282","article-title":"Labelled trees and pairs of input-output permutations in priority queues","volume":"vol. 903","author":"Golin","year":"1995"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1022450120589","article-title":"Conjectures on the quotient ring by diagonal invariants","volume":"3","author":"Haiman","year":"1994","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB11","article-title":"Sorting and Searching","volume":"vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB12","doi-asserted-by":"crossref","first-page":"1266","DOI":"10.1137\/0114101","article-title":"An occupancy discipline and applications","volume":"14","author":"Konheim","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02107572","article-title":"Une famille de polyn\u00f4mes ayant plusieurs propri\u00e9t\u00e9s \u00e9numeratives","volume":"11","author":"Kreweras","year":"1980","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB14","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1090\/S0002-9904-1968-11888-9","article-title":"The inversion enumerator for labeled trees","volume":"74","author":"Mallows","year":"1968","journal-title":"Bull. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/S0012-365X(99)90085-7_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01848152","article-title":"Arbres et suites majeures","volume":"20","author":"Moszkowski","year":"1989","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1147\/rd.12.0130","article-title":"Addressing for random access storage","volume":"1","author":"Peterson","year":"1957","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0012-365X(99)90085-7_BIB17","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/S0021-9800(69)80039-6","article-title":"Ballots and trees","volume":"6","author":"Riordan","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB18","series-title":"The Elements of Mathematical Logic","author":"Rosenbloom","year":"1950"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0021-9800(68)80003-1","article-title":"On an enumeration problem","volume":"4","author":"Sch\u00fctzenberger","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB20","first-page":"2620","article-title":"Hyperplane arrangements, intervals orders, and trees","volume":"93","author":"Stanley","year":"1996"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB21","series-title":"The Wilf Festschrift","first-page":"14","article-title":"Parking functions and noncrossing partitions","volume":"4","author":"Stanley","year":"1997"},{"key":"10.1016\/S0012-365X(99)90085-7_BIB22","series-title":"Mathematical Essays in Honor of Gian-Carlo Rota","first-page":"259","article-title":"Hyperplane arrangements, parking functions, and tree inversions","author":"Stanley","year":"1998"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900857?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900857?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T15:00:34Z","timestamp":1622991634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":22,"alternative-id":["S0012365X99900857"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90085-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}