{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T18:28:07Z","timestamp":1760984887199},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_1","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T08:52:25Z","timestamp":1391590345000},"page":"1-13","source":"Crossref","is-referenced-by-count":14,"title":["A Brief History of Strahler Numbers"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[]},{"given":"Michael","family":"Luttenberger","sequence":"additional","affiliation":[]},{"given":"Maximilian","family":"Schlund","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a forest. Journal of Combinatorial Theory, Series B\u00a052(2), 274\u2013283 (1991), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/009589569190068U","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"S. Bozapalidis","year":"1999","unstructured":"Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Syst.\u00a032(1), 1\u201333 (1999)","journal-title":"Theory Comput. Syst."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ic.2011.10.005","volume":"210","author":"T. Br\u00e1zdil","year":"2012","unstructured":"Br\u00e1zdil, T., Esparza, J., Kiefer, S., Luttenberger, M.: Space-efficient scheduling of stochastically generated tasks. Inf. Comput.\u00a0210, 87\u2013110 (2012)","journal-title":"Inf. Comput."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-52282-4_33","volume-title":"STACS 90","author":"M. Chytil","year":"1990","unstructured":"Chytil, M., Monien, B.: Caterpillars and context-free languages. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol.\u00a0415, pp. 70\u201381. Springer, Heidelberg (1990)"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(95)00114-R","volume":"56","author":"L. Devroye","year":"1995","unstructured":"Devroye, L., Kruszewski, P.: A note on the Horton-Strahler number for random trees. Inf. Process. Lett.\u00a056(2), 95\u201399 (1995)","journal-title":"Inf. Process. Lett."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1137\/0210004","volume":"10","author":"A. Ehrenfeucht","year":"1981","unstructured":"Ehrenfeucht, A., Rozenberg, G., Vermeir, D.: On et0l systems with finite tree-rank. SIAM J. Comput.\u00a010(1), 40\u201358 (1981)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"1_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/368892.368907","volume":"1","author":"A.P. Ershov","year":"1958","unstructured":"Ershov, A.P.: On programming of arithmetic operations. Comm. ACM\u00a01(8), 3\u20139 (1958)","journal-title":"Comm. ACM"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-70918-3_26","volume-title":"STACS 2007","author":"J. Esparza","year":"2007","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: On fixed point equations over commutative semirings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 296\u2013307. Springer, Heidelberg (2007)"},{"issue":"6","key":"1_CR10","doi-asserted-by":"publisher","first-page":"2282","DOI":"10.1137\/090749591","volume":"39","author":"J. Esparza","year":"2010","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Computing the least fixed point of positive polynomial systems. SIAM J. Comput.\u00a039(6), 2282\u20132335 (2010)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1857914.1857917","volume":"57","author":"J. Esparza","year":"2010","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Newtonian program analysis. J. ACM\u00a057(6), 33 (2010)","journal-title":"J. ACM"},{"issue":"12","key":"1_CR12","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ipl.2011.03.019","volume":"111","author":"J. Esparza","year":"2011","unstructured":"Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikhs theorem: A simple and direct automaton construction. Inf. Process. Lett.\u00a0111(12), 614\u2013619 (2011)","journal-title":"Inf. Process. Lett."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: Parameterized verification of asynchronous shared-memory systems. In: Sharygina, Veith (eds.) [24], pp. 124\u2013140","DOI":"10.1007\/978-3-642-39799-8_8"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-22944-2_2","volume-title":"Algebra and Coalgebra in Computer Science","author":"J. Esparza","year":"2011","unstructured":"Esparza, J., Luttenberger, M.: Solving fixed-point equations by derivation tree analysis. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 19\u201335. Springer, Heidelberg (2011)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM\u00a056(1) (2009)","DOI":"10.1145\/1462153.1462154"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(79)90009-4","volume":"9","author":"P. Flajolet","year":"1979","unstructured":"Flajolet, P., Raoult, J.-C., Vuillemin, J.: The number of registers required for evaluating arithmetic expressions. Theor. Comput. Sci.\u00a09, 99\u2013125 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/0215046","volume":"15","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P., Prodinger, H.: Register allocation for unary-binary trees. SIAM J. Comput.\u00a015(3), 629\u2013640 (1986)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10703-011-0136-y","volume":"40","author":"P. Ganty","year":"2012","unstructured":"Ganty, P., Majumdar, R., Monmege, B.: Bounded underapproximations. Formal Methods in System Design\u00a040(2), 206\u2013231 (2012)","journal-title":"Formal Methods in System Design"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0022-0000(68)80009-1","volume":"2","author":"S. Ginsburg","year":"1968","unstructured":"Ginsburg, S., Spanier, E.: Derivation-bounded languages. Journal of Computer and System Sciences\u00a02, 228\u2013250 (1968)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1130\/0016-7606(1945)56[275:EDOSAT]2.0.CO;2","volume":"56","author":"R.E. Horton","year":"1945","unstructured":"Horton, R.E.: Erosional development of streams and their drainage basins: hydro-physical approach to quantitative morphology. Geol. Soc. Am. Bull.\u00a056(3), 275\u2013370 (1945)","journal-title":"Geol. Soc. Am. Bull."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF00289094","volume":"11","author":"R. Kemp","year":"1979","unstructured":"Kemp, R.: The average number of registers needed to evaluate a binary tree optimally. Acta Informatica\u00a011, 363\u2013372 (1979)","journal-title":"Acta Informatica"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph (preliminary version). In: FOCS, pp. 376\u2013385. IEEE Computer Society (1981)","DOI":"10.1109\/SFCS.1981.46"},{"issue":"8","key":"1_CR23","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1016\/j.jcta.2012.05.007","volume":"119","author":"C. Pivoteau","year":"2012","unstructured":"Pivoteau, C., Salvy, B., Soria, M.: Algorithms for combinatorial structures: Well-founded systems and newton iterations. J. Comb. Theory, Ser. A\u00a0119(8), 1711\u20131773 (2012)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","year":"2013","unstructured":"Sharygina, N., Veith, H. (eds.): CAV 2013. LNCS, vol.\u00a08044. Springer, Heidelberg (2013)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Stewart, A., Etessami, K., Yannakakis, M.: Upper Bounds for Newton\u2019s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. In: Sharygina, Veith (eds.) [24], pp. 495\u2013510","DOI":"10.1007\/978-3-642-39799-8_33"},{"issue":"11","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1130\/0016-7606(1952)63[1117:HAAOET]2.0.CO;2","volume":"63","author":"A.N. Strahler","year":"1952","unstructured":"Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topology. Geol. Soc. Am. Bull.\u00a063(11), 1117\u20131142 (1952)","journal-title":"Geol. Soc. Am. Bull."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","volume":"10","author":"M.K. Yntema","year":"1967","unstructured":"Yntema, M.K.: Inclusion relations among families of context-free languages. Information and Control\u00a010, 572\u2013597 (1967)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T01:58:49Z","timestamp":1558835929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}