{"id":"https://openalex.org/W1691713230","doi":"https://doi.org/10.37236/1253","title":"Descendants in heap ordered trees or a triumph of computer algebra","display_name":"Descendants in heap ordered trees or a triumph of computer algebra","publication_year":1996,"publication_date":"1996-09-16","ids":{"openalex":"https://openalex.org/W1691713230","doi":"https://doi.org/10.37236/1253","mag":"1691713230"},"language":"en","primary_location":{"id":"doi:10.37236/1253","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1253","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v3i1r29/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v3i1r29/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014728682","display_name":"Helmut Prodinger","orcid":"https://orcid.org/0000-0002-0009-8015"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Helmut Prodinger","raw_affiliation_strings":["Institut fr Algebra und Diskrete Mathematik Technical University of Vienna Wiedner Hauptstrasse 8-10 A-1040 Vienna, Austria","Institut f\u00fcr Algebra und Diskrete Mathematik Technical University of Vienna Wiedner Hauptstrasse 8-10 A-1040 Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institut fr Algebra und Diskrete Mathematik Technical University of Vienna Wiedner Hauptstrasse 8-10 A-1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Institut f\u00fcr Algebra und Diskrete Mathematik Technical University of Vienna Wiedner Hauptstrasse 8-10 A-1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014728682"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.5288,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.65157541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"3","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9739000201225281,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9739000201225281,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9465000033378601,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9413999915122986,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.9056879281997681},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.875481367111206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.819951057434082},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7533564567565918},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42589670419692993},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40136122703552246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11218792200088501}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.9056879281997681},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.875481367111206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.819951057434082},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7533564567565918},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42589670419692993},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40136122703552246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11218792200088501}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1253","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1253","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v3i1r29/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.8638","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.8638","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://elib.uni-osnabrueck.de/EMIS/journals/EJC/Volume_3/PostScriptfiles/v3i1r29.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.2699","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wits.ac.za/helmut/postscriptfiles/hot_desc.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1253","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1253","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v3i1r29/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1691713230.pdf","grobid_xml":"https://content.openalex.org/works/W1691713230.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1538293310","https://openalex.org/W1540048281","https://openalex.org/W2026693728","https://openalex.org/W2029948740","https://openalex.org/W2058114850","https://openalex.org/W2092844902","https://openalex.org/W2112241657","https://openalex.org/W3148461011"],"related_works":["https://openalex.org/W2952259524","https://openalex.org/W2279732055","https://openalex.org/W2995857455","https://openalex.org/W4288805235","https://openalex.org/W2027277382","https://openalex.org/W4287020903","https://openalex.org/W1508013399","https://openalex.org/W2998840281","https://openalex.org/W2160566290","https://openalex.org/W2063982045"],"abstract_inverted_index":{"A":[0],"heap":[1,50],"ordered":[2,51],"tree":[3,13,52],"with":[4,15],"$n$":[5],"nodes":[6,20],"(\"size":[7],"$n$\")":[8],"is":[9,26],"a":[10,16,48],"planted":[11],"plane":[12],"together":[14],"bijection":[17],"from":[18,31],"the":[19,22,32,35,39,44,62],"to":[21,34],"set":[23],"$\\{1,\\dots,n\\}$":[24],"which":[25],"monotonically":[27],"increasing":[28],"when":[29],"going":[30],"root":[33],"leaves.":[36],"We":[37],"consider":[38],"number":[40],"of":[41,43,53],"descendants":[42],"node":[45],"$j$":[46],"in":[47],"(random)":[49],"size":[54],"$n\\ge":[55],"j$.":[56],"Precise":[57],"expressions":[58],"are":[59],"derived":[60],"for":[61],"probability":[63],"distribution":[64],"and":[65],"all":[66],"(factorial)":[67],"moments.":[68]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}