{"id":"https://openalex.org/W2080974025","doi":"https://doi.org/10.1080/00207160410001715311","title":"A Markov chain model for dynamic binary search tree behaviour","display_name":"A Markov chain model for dynamic binary search tree behaviour","publication_year":2004,"publication_date":"2004-06-29","ids":{"openalex":"https://openalex.org/W2080974025","doi":"https://doi.org/10.1080/00207160410001715311","mag":"2080974025"},"language":"en","primary_location":{"id":"doi:10.1080/00207160410001715311","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160410001715311","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5089042084","display_name":"William E. Wright","orcid":"https://orcid.org/0000-0002-1701-9811"},"institutions":[{"id":"https://openalex.org/I4210153001","display_name":"North-West State Technical University","ror":"https://ror.org/04dm8yx03","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210153001"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"William E. Wright","raw_affiliation_strings":["Correspondencewright@cs.siu.edu"],"affiliations":[{"raw_affiliation_string":"Correspondencewright@cs.siu.edu","institution_ids":["https://openalex.org/I4210153001"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089042084"],"corresponding_institution_ids":["https://openalex.org/I4210153001"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1110144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"81","issue":"7","first_page":"803","last_page":"812"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.996399998664856,"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.996399998664856,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9837999939918518,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7255192995071411},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6848676204681396},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.6609818935394287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5983662605285645},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.5932084321975708},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5506092309951782},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5430994629859924},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5387445688247681},{"id":"https://openalex.org/keywords/lineage","display_name":"Lineage (genetic)","score":0.5251091122627258},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.47712182998657227},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.45262712240219116},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4412135183811188},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4062448740005493},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3752399981021881},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3481515049934387},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3396158218383789},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3145284056663513},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17493146657943726},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.07229506969451904}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7255192995071411},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6848676204681396},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.6609818935394287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5983662605285645},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.5932084321975708},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5506092309951782},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5430994629859924},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5387445688247681},{"id":"https://openalex.org/C2776817793","wikidata":"https://www.wikidata.org/wiki/Q6553369","display_name":"Lineage (genetic)","level":3,"score":0.5251091122627258},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.47712182998657227},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.45262712240219116},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4412135183811188},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4062448740005493},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3752399981021881},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3481515049934387},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3396158218383789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3145284056663513},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17493146657943726},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.07229506969451904},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160410001715311","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160410001715311","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1996509888","https://openalex.org/W2752061190"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W3169685561","https://openalex.org/W2501849745","https://openalex.org/W2364382882","https://openalex.org/W2026697457","https://openalex.org/W2061004850","https://openalex.org/W1979520615","https://openalex.org/W2004985727","https://openalex.org/W4244673516","https://openalex.org/W2072157347"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,30,34,39,100,120],"Markov":[3,79],"chain":[4],"model":[5,26,52,96,104,110],"for":[6,106,114,130],"the":[7,10,18,53,71,78,86,123,126],"analysis":[8],"of":[9,12,21,42,55,88,122,125],"behaviour":[11],"binary":[13],"search":[14],"trees":[15],"(BSTs)":[16],"under":[17],"dynamic":[19],"conditions":[20],"insertions":[22,56],"and":[23,57,59,65],"deletions.":[24],"The":[25,95,108],"is":[27,97,111],"based":[28,84,98],"on":[29,85,99],"data":[31,132],"structure":[32],"called":[33],"lineage":[35,72,102,127],"tree,":[36],"which":[37],"provides":[38],"compact":[40],"representation":[41],"different":[43],"BST":[44,89,109],"structures":[45,90,133],"while":[46],"still":[47],"retaining":[48],"enough":[49],"information":[50],"to":[51,60,75,92],"effect":[54],"deletions":[58],"compute":[61],"average":[62],"path":[63],"length":[64],"tree":[66,73,103,128],"height.":[67],"Different":[68],"lineages":[69],"in":[70,77],"correspond":[74],"states":[76],"chain.":[80],"Transition":[81],"probabilities":[82],"are":[83],"number":[87],"corresponding":[91],"each":[93],"lineage.":[94],"similar":[101],"developed":[105],"B-trees.":[107],"not":[112],"intended":[113],"practical":[115],"computations,":[116],"but":[117],"rather":[118],"as":[119,135],"demonstration":[121],"generalizability":[124],"approach":[129],"modeling":[131],"such":[134],"B-trees,":[136],"B*-trees,":[137],"B+-trees,":[138],"BSTs,":[139],"etc.":[140]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}