A non-increasing tree growth process for recursive trees and applications.
Saved in:
| Title: | A non-increasing tree growth process for recursive trees and applications. |
|---|---|
| Authors: | Eslava, Laura1 (AUTHOR) laura@sigma.iimas.unam.mx |
| Source: | Combinatorics, Probability & Computing. Jan2021, Vol. 30 Issue 1, p79-104. 26p. |
| Database: | Mathematics Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 153538466 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A non-increasing tree growth process for recursive trees and applications. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Eslava%2C+Laura%22">Eslava, Laura</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> laura@sigma.iimas.unam.mx</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Combinatorics%2C+Probability+%26+Computing%22">Combinatorics, Probability & Computing</searchLink>. Jan2021, Vol. 30 Issue 1, p79-104. 26p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=153538466 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1017/S0963548320000073 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 26 StartPage: 79 Titles: – TitleFull: A non-increasing tree growth process for recursive trees and applications. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Eslava, Laura IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: Jan2021 Type: published Y: 2021 Identifiers: – Type: issn-print Value: 09635483 Numbering: – Type: volume Value: 30 – Type: issue Value: 1 Titles: – TitleFull: Combinatorics, Probability & Computing Type: main |
| ResultId | 1 |