{"id":"https://openalex.org/W2120741727","doi":"https://doi.org/10.1109/isit.2005.1523285","title":"A T-decomposition algorithm with O(n log n) time and space complexity","display_name":"A T-decomposition algorithm with O(n log n) time and space complexity","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2120741727","doi":"https://doi.org/10.1109/isit.2005.1523285","mag":"2120741727"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523285","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-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/A5101672408","display_name":"Yang Jia","orcid":"https://orcid.org/0000-0001-8964-6702"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Jia Yang","raw_affiliation_strings":["Department of Computer Science, University of Auckland, Auckland, New Zealand","Dept. of Comput. Sci., Auckland Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Auckland Univ","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072582772","display_name":"Ulrich Speidel","orcid":"https://orcid.org/0000-0001-9107-4918"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"U. Speidel","raw_affiliation_strings":["Department of Computer Science, University of Auckland, Auckland, New Zealand","Dept. of Comput. Sci., Auckland Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Auckland Univ","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1349,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.94009326,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"143","issue":null,"first_page":"23","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9919000267982483,"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/decomposition","display_name":"Decomposition","score":0.6529334783554077},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6216037273406982},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5242807269096375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5235214233398438},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.521607518196106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5059086680412292},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4946541488170624},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4851187467575073},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45670461654663086},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.45494604110717773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4417480230331421},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4191143214702606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41593271493911743},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38468775153160095},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12293955683708191},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0982547402381897}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6529334783554077},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6216037273406982},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5242807269096375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5235214233398438},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.521607518196106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5059086680412292},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4946541488170624},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4851187467575073},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45670461654663086},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45494604110717773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4417480230331421},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4191143214702606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41593271493911743},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38468775153160095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12293955683708191},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0982547402381897},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2005.1523285","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:researchspace.auckland.ac.nz:2292/3766","is_oa":false,"landing_page_url":"http://hdl.handle.net/2292/3766","pdf_url":null,"source":{"id":"https://openalex.org/S7407055463","display_name":"ResearchSpace (University of Auckland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I154130895","host_organization_name":"University of Auckland","host_organization_lineage":["https://openalex.org/I154130895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial","raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W183954829","https://openalex.org/W1558090637","https://openalex.org/W1836205513","https://openalex.org/W1983619746","https://openalex.org/W2020327934","https://openalex.org/W2050082536","https://openalex.org/W2077770566","https://openalex.org/W2120741727","https://openalex.org/W2133976730","https://openalex.org/W2623131489","https://openalex.org/W2887424908","https://openalex.org/W4285719527","https://openalex.org/W4292003032","https://openalex.org/W6678142254","https://openalex.org/W6679858102","https://openalex.org/W6738674355","https://openalex.org/W6753953059"],"related_works":["https://openalex.org/W2395056458","https://openalex.org/W4377371889","https://openalex.org/W2113623403","https://openalex.org/W1862126075","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1589381382","https://openalex.org/W2109630252","https://openalex.org/W2113270940"],"abstract_inverted_index":{"T-decomposition":[0,33,66],"maps":[1],"a":[2,6,11,65],"finite":[3],"string":[4,13],"into":[5],"series":[7],"of":[8,21,41,48],"parameters":[9],"for":[10,18],"recursive":[12],"construction":[14],"algorithm.":[15],"Initially":[16],"developed":[17],"the":[19,39,46],"communication":[20],"coding":[22],"trees":[23],"(M.":[24],"R.":[25],"Titchener,":[26],"June":[27],"1996),":[28],"(U.":[29],"Guenther,":[30],"Feb.":[31],"2001),":[32],"has":[34],"since":[35],"been":[36],"studied":[37],"within":[38],"context":[40],"information":[42],"measures.":[43],"This":[44,62],"involves":[45],"parsing":[47],"potentially":[49],"very":[50],"large":[51],"strings,":[52],"which":[53],"in":[54],"turn":[55],"requires":[56],"algorithms":[57],"with":[58,68],"good":[59],"time":[60,72],"complexity.":[61],"paper":[63],"presents":[64],"algorithm":[67],"O(n":[69],"log":[70],"n)":[71],"and":[73],"space":[74],"complexity":[75]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}