Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh

Open source

DOI: 10.1007/978-3-030-50026-9_11
Published: 2020
Container: Lecture Notes in Computer Science
Publisher: Springer International Publishing
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/978-3-030-50026-9_11,
  title = {Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics},
  author = {Olivier Bodini and Antoine Genitrini and Mehdi Naima and Alexandros Singh},
  year = {2020},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/978-3-030-50026-9_11},
  url = {https://doi.org/10.1007/978-3-030-50026-9_11}
}

RIS

TY  - JOUR
TI  - Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics
AU  - Olivier Bodini
AU  - Antoine Genitrini
AU  - Mehdi Naima
AU  - Alexandros Singh
PY  - 2020
JO  - Lecture Notes in Computer Science
DO  - 10.1007/978-3-030-50026-9_11
UR  - https://doi.org/10.1007/978-3-030-50026-9_11
ER  -

APA

Bodini, O., Genitrini, A., Naima, M., & Singh, A. (2020). Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-50026-9_11

Source records

crossref · retrieved 2026-09-25T15:12:42.182Z