{"id":"https://openalex.org/W2149243190","doi":"https://doi.org/10.1109/sfcs.1989.63533","title":"Space-efficient static trees and graphs","display_name":"Space-efficient static trees and graphs","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W2149243190","doi":"https://doi.org/10.1109/sfcs.1989.63533","mag":"2149243190"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1989.63533","doi":"https://doi.org/10.1109/sfcs.1989.63533","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1989.63533","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"30th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5111891932","display_name":"G. Jacobson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. Jacobson","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111891932"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":634,"citation_normalized_percentile":{"value":0.25017921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"549","last_page":"554"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9707000255584717,"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.9707000255584717,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.020800000056624413,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0035000001080334187,"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/succinct-data-structures","display_name":"succinct data structures","score":0.9279999732971191},{"id":"https://openalex.org/keywords/planar-graphs","display_name":"planar graphs","score":0.8569999933242798},{"id":"https://openalex.org/keywords/graph-representation","display_name":"graph representation","score":0.656000018119812},{"id":"https://openalex.org/keywords/space-efficient-data-structures","display_name":"space-efficient data structures","score":0.5830000042915344},{"id":"https://openalex.org/keywords/page-numbers","display_name":"page numbering","score":0.5889999866485596},{"id":"https://openalex.org/keywords/vector-spaces","display_name":"vector spaces","score":0.5920000076293945}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7168824076652527},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6513713002204895},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6175229549407959},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5848323106765747},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5203335285186768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5151928067207336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49118635058403015},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4848848283290863},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4831332862377167},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46766912937164307},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4315233826637268},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.42930975556373596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4037468433380127},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.359209805727005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32811933755874634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2662414014339447},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11741858720779419},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.1989.63533","doi":"https://doi.org/10.1109/sfcs.1989.63533","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1989.63533","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"30th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W47591876","https://openalex.org/W1655990431","https://openalex.org/W1975373301","https://openalex.org/W1982538209","https://openalex.org/W1998294201","https://openalex.org/W2051049045","https://openalex.org/W2057223122","https://openalex.org/W2060963839","https://openalex.org/W2093636046"],"related_works":["https://openalex.org/W121845590","https://openalex.org/W1501906007","https://openalex.org/W2156771668","https://openalex.org/W2084590597","https://openalex.org/W2130264685","https://openalex.org/W2142761843","https://openalex.org/W4243828764","https://openalex.org/W4229844547","https://openalex.org/W2391392917","https://openalex.org/W3110101717"],"abstract_inverted_index":{"Data":[0],"structures":[1,13,41],"that":[2,51],"represent":[3],"static":[4],"unlabeled":[5],"trees":[6,54],"and":[7],"planar":[8,66],"graphs":[9,67,71],"are":[10,14,29,43],"developed.":[11],"The":[12],"more":[15],"space":[16],"efficient":[17,33],"than":[18],"conventional":[19],"pointer-based":[20],"representations,":[21],"but":[22],"(to":[23],"within":[24,85],"a":[25,86],"constant":[26,87],"factor)":[27],"they":[28],"just":[30],"as":[31,60],"time":[32],"for":[34,69],"traversal":[35],"operations.":[36],"For":[37,65],"trees,":[38],"the":[39,76,90],"data":[40,77],"described":[42,79],"asymptotically":[44],"optimal:":[45],"there":[46],"is":[47,84],"no":[48],"other":[49],"structure":[50,78],"encodes":[52],"n-node":[53],"with":[55],"fewer":[56],"bits":[57],"per":[58],"node,":[59],"N":[61],"grows":[62],"without":[63],"bound.":[64],"(and":[68],"all":[70],"of":[72,89],"bounded":[73],"page":[74],"number),":[75],"uses":[80],"linear":[81],"space:":[82],"it":[83],"factor":[88],"most":[91],"succinct":[92],"representation.>":[93]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":24},{"year":2021,"cited_by_count":22},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":24},{"year":2018,"cited_by_count":31},{"year":2017,"cited_by_count":21},{"year":2016,"cited_by_count":41},{"year":2015,"cited_by_count":44},{"year":2014,"cited_by_count":51},{"year":2013,"cited_by_count":38},{"year":2012,"cited_by_count":42}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}