{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T09:18:05Z","timestamp":1718443085812},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf01932127","type":"journal-article","created":{"date-parts":[[2005,7,24]],"date-time":"2005-07-24T15:12:10Z","timestamp":1122217930000},"page":"17-26","source":"Crossref","is-referenced-by-count":6,"title":["Generating alternating permutations lexicographically"],"prefix":"10.1007","volume":"30","author":[{"given":"Bruce","family":"Bauslaugh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Ruskey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01932127_CR1","doi-asserted-by":"crossref","unstructured":"L. Comtet:Advanced Combinatorics. D. Reidel, 1974.","DOI":"10.1007\/978-94-010-2196-8"},{"key":"BF01932127_CR2","first-page":"241","volume":"14","author":"R. C. Entringer","year":"1966","unstructured":"R. C. Entringer:A combinatorial interpretation of the Euler and Bernoulli numbers. Nieuw Archief voor Wiskunde 14:241\u2013246, 1966.","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"BF01932127_CR3","first-page":"79","volume":"4","author":"T. Hough","year":"1988","unstructured":"T. Hough and F. Ruskey:An efficient implementation of the Eades, Hickey, Read adjacent interchange combination generation algorithm. J. Combinat. Math. and Combinat. Computing, 4:79\u201386, 1988.","journal-title":"J. Combinat. Math. and Combinat. Computing"},{"key":"BF01932127_CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0196-6774(83)90042-1","volume":"4","author":"A. D. Kalvin","year":"1983","unstructured":"A. D. Kalvin and Y. L. Varol:On the generation of all topological sortings. J. Algorithms, 4:150\u2013162, 1983.","journal-title":"J. Algorithms"},{"key":"BF01932127_CR5","doi-asserted-by":"crossref","unstructured":"R. Kemp:Fundamentals of the Average Case Analysis of Particular Algorithms. Wiley-Teubner, 1984.","DOI":"10.1007\/978-3-663-12191-6"},{"key":"BF01932127_CR6","unstructured":"D. E. Knuth:Sorting and Searching. Addison-Wesley, 1973."},{"key":"BF01932127_CR7","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1090\/S0025-5718-1967-0221735-9","volume":"21","author":"D. E. Knuth","year":"1967","unstructured":"D. E. Knuth and T. J. Buckholtz:Computing of Tangent, Euler, and Bernoulli numbers. Math. Computation, 21:663\u2013688, 1967.","journal-title":"Math. Computation"},{"key":"BF01932127_CR8","unstructured":"A. Nijenhuis and H. S. Wilf:Combinatorial Algorithms, 2nd Ed. Academic Press, 1978."},{"key":"BF01932127_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/362896.362913","volume":"2","author":"R. J. Ord-Smith","year":"1968","unstructured":"R. J. Ord-Smith:Generation of permutations in lexicographic order (algorithm 323). Comm. ACM, 2:117, 1968.","journal-title":"Comm. ACM"},{"key":"BF01932127_CR10","unstructured":"G. Pruesse and F. Ruskey:Transposition Generation of the Linear Extensions of Certain Posets. Technical Report DCS-91-IR, U. Victoria, 1988."},{"key":"BF01932127_CR11","unstructured":"E. M. Reingold, J. Nievergelt, and N. Deo:Combinatorial Algorithms: Theory and Practice. Prentice-Hall, 1977."},{"key":"BF01932127_CR12","unstructured":"F. Ruskey:Transposition Generation of Alternating Permutations. Technical Report DCS-90-IR. U. Victoria, 1988."},{"key":"BF01932127_CR13","doi-asserted-by":"crossref","unstructured":"F. Ruskey and A. Proskurowski:Generating binary trees by transpositions. J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(90)90030-I"},{"key":"BF01932127_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/356689.356692","volume":"9","author":"R. Sedgewick","year":"1977","unstructured":"R. Sedgewick:Permutation generation methods. Computing Surveys, 9:137\u2013164, 1977.","journal-title":"Computing Surveys"},{"key":"BF01932127_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0001-8708(77)80046-7","volume":"24","author":"H. S. Wilf","year":"1977","unstructured":"H. S. Wilf:A unified setting for sequencing, ranking and selection algorithms for combinatorial objects. Advances in Math., 24:281\u2013291, 1977.","journal-title":"Advances in Math."},{"key":"BF01932127_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S. Zaks","year":"1980","unstructured":"S. Zaks:Lexicographic generation of ordered trees. Theoretical Computer Science, 10:63\u201382, 1980.","journal-title":"Theoretical Computer Science"},{"key":"BF01932127_CR17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S. Zaks","year":"1979","unstructured":"S. Zaks and D. Richards:Generating trees and other combinatorial objects lexicographically. SIAM J. Computing, 8:73\u201381, 1979.","journal-title":"SIAM J. Computing"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01932127\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:59:34Z","timestamp":1557435574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01932127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF01932127"],"URL":"https:\/\/doi.org\/10.1007\/bf01932127","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}