{"id":"https://openalex.org/W2079108315","doi":"https://doi.org/10.1051/ita:2001114","title":"On the Stack-Size of General Tries","display_name":"On the Stack-Size of General Tries","publication_year":2001,"publication_date":"2001-03-01","ids":{"openalex":"https://openalex.org/W2079108315","doi":"https://doi.org/10.1051/ita:2001114","mag":"2079108315"},"language":"en","primary_location":{"id":"doi:10.1051/ita:2001114","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2001114","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037413740","display_name":"J\u00e9r\u00e9mie Bourdon","orcid":"https://orcid.org/0000-0001-6674-8626"},"institutions":[{"id":"https://openalex.org/I98702875","display_name":"Universit\u00e9 de Caen Normandie","ror":"https://ror.org/051kpcy16","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J\u00e9r\u00e9mie Bourdon","raw_affiliation_strings":["GREYC, Universit\u00e9 de Caen, 14032 Caen, France; (Jeremie.Bourdon@info.unicaen.fr)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GREYC, Universit\u00e9 de Caen, 14032 Caen, France; (Jeremie.Bourdon@info.unicaen.fr)","institution_ids":["https://openalex.org/I98702875"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024961278","display_name":"Markus E. Nebel","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Nebel","raw_affiliation_strings":["FB Informatik, Johann Wolfgang Goethe-Universit\u00e4t, 60054 Frankfurt a. M., Germany; (nebel@sads.informatik.uni-frankfurt.de)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB Informatik, Johann Wolfgang Goethe-Universit\u00e4t, 60054 Frankfurt a. M., Germany; (nebel@sads.informatik.uni-frankfurt.de)","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111497028","display_name":"Brigitte Vall\u00e9e","orcid":null},"institutions":[{"id":"https://openalex.org/I98702875","display_name":"Universit\u00e9 de Caen Normandie","ror":"https://ror.org/051kpcy16","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Brigitte Vall\u00e9e","raw_affiliation_strings":["GREYC, Universit\u00e9 de Caen, 14032 C aen, France; (Brigitte.Vallee@info.unicaen.fr)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GREYC, Universit\u00e9 de Caen, 14032 C aen, France; (Brigitte.Vallee@info.unicaen.fr)","institution_ids":["https://openalex.org/I98702875"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0934,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84310812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"35","issue":"2","first_page":"163","last_page":"185"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9980999827384949,"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/T11567","display_name":"semigroups and automata theory","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7863481640815735},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.7478951215744019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6329304575920105},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5655602216720581},{"id":"https://openalex.org/keywords/call-stack","display_name":"Call stack","score":0.5395921468734741},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.5216267704963684},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5088801383972168},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.49898838996887207},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.458763062953949},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4545918107032776},{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.45229825377464294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4412339925765991},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.43740034103393555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35067930817604065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23296132683753967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1518782079219818},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14161470532417297},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12572920322418213}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7863481640815735},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.7478951215744019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6329304575920105},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5655602216720581},{"id":"https://openalex.org/C119024030","wikidata":"https://www.wikidata.org/wiki/Q759899","display_name":"Call stack","level":3,"score":0.5395921468734741},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.5216267704963684},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5088801383972168},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.49898838996887207},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.458763062953949},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4545918107032776},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.45229825377464294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4412339925765991},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.43740034103393555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35067930817604065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23296132683753967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1518782079219818},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14161470532417297},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12572920322418213},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1051/ita:2001114","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2001114","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.7699999809265137,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1551265161","https://openalex.org/W1965516463","https://openalex.org/W1971749553","https://openalex.org/W2005721481","https://openalex.org/W2008188815","https://openalex.org/W2014771275","https://openalex.org/W2045083286","https://openalex.org/W2048490349","https://openalex.org/W2053183761","https://openalex.org/W2085901659","https://openalex.org/W2091108070","https://openalex.org/W2098828803","https://openalex.org/W2128930787","https://openalex.org/W2132464174","https://openalex.org/W2137921216","https://openalex.org/W2155631901","https://openalex.org/W2160299629","https://openalex.org/W2161613033","https://openalex.org/W2337480916","https://openalex.org/W2340110832","https://openalex.org/W2913099459","https://openalex.org/W4205204187","https://openalex.org/W6636070404"],"related_works":["https://openalex.org/W2354609459","https://openalex.org/W2367083125","https://openalex.org/W2552915643","https://openalex.org/W4229950834","https://openalex.org/W2124919561","https://openalex.org/W3176456339","https://openalex.org/W1998902257","https://openalex.org/W2350429749","https://openalex.org/W2383868342","https://openalex.org/W151008969"],"abstract_inverted_index":{"Digital":[0],"trees":[1],"or":[2],"tries":[3],"are":[4,62],"a":[5,39,46,56,65,89],"general":[6,57],"purpose":[7],"flexible":[8],"data":[9,83],"structure":[10],"that":[11,71,78],"implements":[12],"dictionaries":[13],"built":[14],"on":[15,22,108],"words.":[16],"The":[17,36,50],"present":[18],"paper":[19],"is":[20,41,52,131],"focussed":[21],"the":[23,34,42,68,100,103,106,111,117,122,127,132],"average-case":[24,91],"analysis":[25,51,94],"of":[26,30,38,95],"an":[27],"important":[28],"parameter":[29],"this":[31,136],"tree-structure,":[32],"i.e.,":[33],"stack-size.":[35,96],"stack-size":[37,104],"tree":[40],"memory":[43],"needed":[44],"by":[45,64],"storage-optimal":[47],"preorder":[48],"traversal.":[49],"carried":[53],"out":[54],"under":[55],"model":[58],"in":[59,110,135],"which":[60],"words":[61],"produced":[63],"source":[66,118],"(in":[67],"information-theoretic":[69],"sense)":[70],"emits":[72,119],"symbols.":[73],"Under":[74],"some":[75],"natural":[76],"assumptions":[77],"encompass":[79],"all":[80],"commonly":[81],"used":[82],"models":[84],"(and":[85],"more),":[86],"we":[87,98,113],"obtain":[88],"precise":[90],"and":[92,105],"probabilistic":[93],"Furthermore,":[97],"study":[99],"dependency":[101],"between":[102],"ordering":[107,124],"symbols":[109],"alphabet:":[112],"establish":[114],"that,":[115],"when":[116,126],"independent":[120],"symbols,":[121],"optimal":[123],"arises":[125],"most":[128],"probable":[129],"symbol":[130],"last":[133],"one":[134],"order.":[137]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}