{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T12:05:30Z","timestamp":1779451530072,"version":"3.53.1"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T00:00:00Z","timestamp":1778112000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116011","type":"journal-article","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T12:38:59Z","timestamp":1778243939000},"page":"116011","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A computer algebra package for bivariate asymptotics with effective error bounds"],"prefix":"10.1016","volume":"1078","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2998-9599","authenticated-orcid":false,"given":"Benjamin","family":"Hackl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116011_bib0001","series-title":"35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)","first-page":"19:1","article-title":"Binomial sums and mellin asymptotics with explicit error bounds: a case study","volume":"Vol. 302","author":"Hackl","year":"2024"},{"key":"10.1016\/j.tcs.2026.116011_bib0002","first-page":"128","article-title":"Question 294","volume":"3","author":"Ramanujan","year":"1911","journal-title":"J. Indian Math. Soc."},{"issue":"1","key":"10.1016\/j.tcs.2026.116011_bib0003","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0377-0427(93)E0258-N","article-title":"On Ramanujan\u2019s Q-function","volume":"58","author":"Flajolet","year":"1995","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.tcs.2026.116011_bib0004","series-title":"The Art of Computer Programming. Vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/j.tcs.2026.116011_bib0005","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1112\/plms\/s2-29.1.293","article-title":"Theorems stated by Ramanujan. V: approximations connected with ex","volume":"29","author":"Watson","year":"1929","journal-title":"Proc. Lond. Math. Soc. (2)"},{"issue":"3","key":"10.1016\/j.tcs.2026.116011_bib0006","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1112\/S0024610704005253","article-title":"On Ramanujan\u2019s inequalities for exp\u2009(k)","volume":"69","author":"Alzer","year":"2004","journal-title":"J. Lond. Math. Soc., II. Ser."},{"issue":"4","key":"10.1016\/j.tcs.2026.116011_bib0007","doi-asserted-by":"crossref","DOI":"10.37236\/9506","article-title":"Pattern avoiding permutations with a unique longest increasing subsequence","volume":"27","author":"B\u00f3na","year":"2020","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2026.116011_bib0008","first-page":"397","article-title":"Unique longest increasing subsequences in 132-avoiding permutations","volume":"89","author":"van Nimwegen","year":"2024","journal-title":"Australas. J. Comb."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.116011_bib0009","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","article-title":"Mellin transforms and asymptotics: Harmonic sums","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116011_bib0010","unstructured":"B. Hackl, C. Heuberger, D. Krenn, Asymptotic Expansions in SageMath, 2015, http:\/\/trac.sagemath.org\/17601. module in SageMath 6.10."},{"key":"10.1016\/j.tcs.2026.116011_bib0011","unstructured":"The SageMath Developers, SageMath, 2023, https:\/\/github.com\/sagemath\/sage. 10.5281\/zenodo.593563."},{"key":"10.1016\/j.tcs.2026.116011_bib0012","unstructured":"NIST Digital Library of Mathematical Functions, https:\/\/dlmf.nist.gov\/, Release 1.1.12 of 2023-12-15. F.W.J. Olver, A.B. Olde Daalhuis, D.W. Lozier, B.I. Schneider, R.F. Boisvert, C.W. Clark, B.R. Miller, B.V. Saunders, H.S. Cohl, M.A. McClain, Eds., https:\/\/dlmf.nist.gov\/. 2023."},{"key":"10.1016\/j.tcs.2026.116011_bib0013","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.jnt.2023.09.003","article-title":"An improved explicit estimate for \u03b6(1\/2+it)","volume":"256","author":"Hiary","year":"2024","journal-title":"J. Number Theory"},{"issue":"2","key":"10.1016\/j.tcs.2026.116011_bib0014","first-page":"125","article-title":"Culminating paths","volume":"10","author":"Bousquet-M\u00e9lou","year":"2008","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.116011_bib0015","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/s00026-016-0330-0","article-title":"Analysis of bidirectional ballot sequences and random walks ending in their maximum","volume":"20","author":"Hackl","year":"2016","journal-title":"Ann. Comb."},{"key":"10.1016\/j.tcs.2026.116011_bib0016","first-page":"187","article-title":"Grandes valeurs de la fonction somme des diviseurs et hypoth\u00e8se de Riemann","volume":"63","author":"Robin","year":"1984","journal-title":"J. Math. Pures Appl. (9)"},{"key":"10.1016\/j.tcs.2026.116011_bib0017","series-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002616?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002616?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:13:28Z","timestamp":1779448408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":17,"alternative-id":["S0304397526002616"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116011","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A computer algebra package for bivariate asymptotics with effective error bounds","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116011"}}