{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T00:17:39Z","timestamp":1720484259901},"reference-count":12,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.403.10","type":"journal-article","created":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T15:47:33Z","timestamp":1718812053000},"page":"29-34","source":"Crossref","is-referenced-by-count":0,"title":["Progressive and Rushed Dyck Paths"],"prefix":"10.4204","volume":"403","author":[{"given":"Axel","family":"Bacher","sequence":"first","affiliation":[{"name":"Universite Sorbonne Paris Nord"}]}],"member":"2720","published-online":{"date-parts":[[2024,6,24]]},"reference":[{"key":"banderier","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(02)00007-5","article-title":"Basic analytic combinatorics of directed lattice paths","volume":"281","author":"Banderier","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"mbm","article-title":"Discrete excursions","volume":"57","author":"Bousquet-M\u00e9lou","year":"2006\/08","journal-title":"S\u00e9minaire Lotharingien de Combinatoire"},{"issue":"2","key":"mbm-ponty","doi-asserted-by":"publisher","first-page":"125","DOI":"10.46298\/dmtcs.438","article-title":"Culminating paths","volume":"10","author":"Bousquet-M\u00e9lou","year":"2008","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"rechnitzer","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0012-365X(02)00352-7","article-title":"Lattice animals and heaps of dimers","volume":"258","author":"Bousquet-M\u00e9lou","year":"2002","journal-title":"Discrete Mathematics"},{"key":"chang","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.AofA.2022.5","article-title":"Enumeration of d-Combining Tree-Child Networks","volume-title":"33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)","volume":"225","author":"Chang","year":"2022"},{"key":"bruijn","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/B978-1-4832-3187-7.50007-6","article-title":"The Average Height of Planted Plane Trees","volume-title":"Graph Theory and Computing","author":"de Bruijn","year":"1972"},{"key":"durhuus","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00440-023-01188-7","article-title":"Trees with exponential height dependent weight","volume":"186","author":"Durhuus","year":"2023","journal-title":"Probability Theory and Related Fields"},{"key":"durhuus2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s44007-023-00080-z","article-title":"Local Limits of One-Sided Trees","volume":"3","author":"Durhuus","year":"2024","journal-title":"La Matematica"},{"key":"price","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105306","article-title":"Compacted binary trees admit a stretched exponential","volume":"177","author":"Elvey Price","year":"2021","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"4","key":"guttmann","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/48\/4\/045209","article-title":"Analysis of series expansions for non-algebraic singularities","volume":"48","author":"Guttmann","year":"2015","journal-title":"Journal of Physics A: Mathematical and Theoretical"},{"key":"viennot","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BFb0072524","article-title":"Heaps of pieces. I. Basic definitions and combinatorial lemmas","volume-title":"Combinatoire \u00e9num\u00e9rative (Montreal, Que., 1985\/Quebec, Que., 1985)","volume":"1234","author":"Viennot","year":"1986"},{"key":"wilf","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0001-8708(77)90059-7","article-title":"A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects","volume":"24","author":"Wilf","year":"1977","journal-title":"Advances in Mathematics"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T08:24:06Z","timestamp":1720427046000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2403.08120v3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,24]]},"references-count":12,"URL":"https:\/\/doi.org\/10.4204\/eptcs.403.10","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,24]]}}}