{"id":"https://openalex.org/W2038050724","doi":"https://doi.org/10.1137/s0097539790189733","title":"Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences","display_name":"Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W2038050724","doi":"https://doi.org/10.1137/s0097539790189733","mag":"2038050724"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539790189733","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790189733","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5069418281","display_name":"R. Sundar","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajamani Sundar","raw_affiliation_strings":["Princeton University#TAB#"],"affiliations":[{"raw_affiliation_string":"Princeton University#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069418281"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.14398709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"1","first_page":"24","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"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/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"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/ternary-search-tree","display_name":"Ternary search tree","score":0.7180379033088684},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.579778254032135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5416581630706787},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5386132597923279},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5379552841186523},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5220203995704651},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4830820858478546},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.47242772579193115},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4698345363140106},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.43323197960853577},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43119657039642334},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3630821108818054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3544636368751526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34566372632980347},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.33922135829925537},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.31850460171699524},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.18071317672729492},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.173586905002594}],"concepts":[{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.7180379033088684},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.579778254032135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5416581630706787},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5386132597923279},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5379552841186523},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5220203995704651},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4830820858478546},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.47242772579193115},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4698345363140106},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.43323197960853577},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43119657039642334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3630821108818054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3544636368751526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34566372632980347},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.33922135829925537},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.31850460171699524},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.18071317672729492},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.173586905002594}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539790189733","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790189733","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1985623009","https://openalex.org/W1992636056","https://openalex.org/W2016857845","https://openalex.org/W2046569047","https://openalex.org/W2052207834","https://openalex.org/W2095120546","https://openalex.org/W2123225606","https://openalex.org/W2130055503","https://openalex.org/W2172042336","https://openalex.org/W4213048098"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2026697457","https://openalex.org/W2371680642","https://openalex.org/W2072157347","https://openalex.org/W3022865202","https://openalex.org/W2951678044","https://openalex.org/W1992432548","https://openalex.org/W4300450359","https://openalex.org/W2006964051","https://openalex.org/W2111619805"],"abstract_inverted_index":{"This":[0],"paper":[1,44],"studies":[2],"the":[3,33,49,59,74,80,102,139,196,199,207],"problem":[4,34],"of":[5,51,79,96,104,107,118,142,152,154,170,198,210],"representing":[6],"sets":[7,119],"over":[8],"an":[9,70,149],"ordered":[10],"universe":[11],"by":[12],"unique":[13],"binary":[14],"search":[15],"trees,":[16],"so":[17],"that":[18,47,100,201],"dictionary":[19,52,60],"operations":[20,53,156],"can":[21],"be":[22],"performed":[23],"efficiently":[24],"on":[25,148,157],"any":[26],"set.":[27],"Although":[28],"efficient":[29,88,150],"randomized":[30,77],"solutions":[31],"to":[32,86],"are":[35,84],"known,":[36],"its":[37],"deterministic":[38,56,75],"complexity":[39],"has":[40],"been":[41],"open.":[42],"The":[43,67,109,161],"exhibits":[45],"representations":[46,83],"permit":[48],"execution":[50],"in":[54,120,127,172,178],"optimal":[55],"time":[57,122,131,174,186],"when":[58],"is":[61,146,202],"sufficiently":[62,65],"sparse":[63],"or":[64],"dense.":[66],"results":[68],"demonstrate":[69],"exponential":[71],"separation":[72],"between":[73],"and":[76,123,132,175,187,204],"complexities":[78],"problem.":[81],"Unique":[82],"applied":[85],"obtain":[87],"data":[89,110,162],"structures":[90],"for":[91,112,164],"maintaining":[92],"a":[93,105],"dynamic":[94],"collection":[95],"sets/sequences":[97],"under":[98],"queries":[99],"test":[101],"equality":[103,114,117,166,169],"pair":[106],"objects.":[108],"structure":[111,163],"set":[113,125],"testing":[115,167],"tests":[116,168],"constant":[121,173],"processes":[124,176],"updates":[126,143,177,211],"$O(\\log":[128,133],"m)$":[129,134,184],"amortized":[130,185,191],"space,":[135],"where":[136,193],"m":[137,205],"denotes":[138,195,206],"total":[140,208],"number":[141,209],"performed.":[144,212],"It":[145],"based":[147],"implementation":[151],"cascades":[153],"CONS":[155],"uniquely":[158],"stored":[159],"S-expressions.":[160],"sequence":[165,200],"sequences":[171],"$O(\\sqrt":[179,188],"{n\\log":[180],"m}":[181],"=":[182],"\\log":[183],"n":[189,194],")$":[190],"space":[192],"length":[197],"updated":[203]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}