{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T13:59:30Z","timestamp":1775483970734,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/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":1627,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advances in Applied Mathematics"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1016\/j.aam.2008.06.005","type":"journal-article","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T14:13:36Z","timestamp":1220796816000},"page":"157-175","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Geometry and complexity of O'Hara's algorithm"],"prefix":"10.1016","volume":"42","author":[{"given":"Matja\u017e","family":"Konvalinka","sequence":"first","affiliation":[]},{"given":"Igor","family":"Pak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.aam.2008.06.005_bib001","series-title":"The Theory of Partitions","author":"Andrews","year":"1998"},{"key":"10.1016\/j.aam.2008.06.005_bib002","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1016\/j.jcta.2005.09.007","article-title":"A combinatorial proof of the Rogers\u2013Ramanujan identities","volume":"113","author":"Boulet","year":"2006","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"10.1016\/j.aam.2008.06.005_bib003","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1073\/pnas.78.4.2026","article-title":"Method for constructing bijections for classical partition identities","volume":"78","author":"Garsia","year":"1981","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.aam.2008.06.005_bib004","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0097-3165(81)90062-5","article-title":"A Rogers\u2013Ramanujan bijection","volume":"31","author":"Garsia","year":"1981","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.aam.2008.06.005_bib005","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(83)90043-2","article-title":"Sieve-equivalence and explicit bijections","volume":"34","author":"Gordon","year":"1983","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.aam.2008.06.005_bib006","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.disc.2004.01.017","article-title":"Finding direct partition bijections by two-directional rewriting techniques","volume":"285","author":"Kanovich","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.aam.2008.06.005_bib007","doi-asserted-by":"crossref","first-page":"1909","DOI":"10.1016\/j.disc.2006.10.005","article-title":"The two-way rewriting in action: Removing the mystery of Euler\u2013Glaisher's map","volume":"307","author":"Kanovich","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.aam.2008.06.005_bib008","unstructured":"K.M. O'Hara, Structure and complexity of the involution principle for partitions, PhD thesis, UC Berkeley, CA, 1984, 135 pp"},{"key":"10.1016\/j.aam.2008.06.005_bib009","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0097-3165(88)90026-X","article-title":"Bijections for partition identities","volume":"49","author":"O'Hara","year":"1988","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.aam.2008.06.005_bib010","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1090\/S0002-9939-04-07031-5","article-title":"Partition identities and geometric bijections","volume":"132","author":"Pak","year":"2004","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/j.aam.2008.06.005_bib011","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.aam.2003.08.007","article-title":"The nature of partition bijections I. Involutions","volume":"33","author":"Pak","year":"2004","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/j.aam.2008.06.005_bib012","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11139-006-9576-1","article-title":"Partition bijections, a survey","volume":"12","author":"Pak","year":"2006","journal-title":"Ramanujan J."},{"key":"10.1016\/j.aam.2008.06.005_bib013","author":"Pak"},{"key":"10.1016\/j.aam.2008.06.005_bib014","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1016\/j.ejc.2004.06.008","article-title":"Combinatorics and geometry of Littlewood\u2013Richardson cones","volume":"26","author":"Pak","year":"2005","journal-title":"European J. Combin."},{"key":"10.1016\/j.aam.2008.06.005_bib015","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0097-3165(82)90040-1","article-title":"Bijective proofs of some classical partition identities","volume":"33","author":"Remmel","year":"1982","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.aam.2008.06.005_bib016","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"issue":"1","key":"10.1016\/j.aam.2008.06.005_bib017","doi-asserted-by":"crossref","DOI":"10.37236\/1796","article-title":"Bijections and congruences for generalizations of partition identities of Euler and Guy","volume":"11","author":"Sellers","year":"2004","journal-title":"Electron. J. Combin."}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0196885808000766?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0196885808000766?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:48:44Z","timestamp":1759301324000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0196885808000766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["S0196885808000766"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.aam.2008.06.005","relation":{},"ISSN":["0196-8858"],"issn-type":[{"value":"0196-8858","type":"print"}],"subject":[],"published":{"date-parts":[[2009,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Geometry and complexity of O'Hara's algorithm","name":"articletitle","label":"Article Title"},{"value":"Advances in Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.aam.2008.06.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2008 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}