{"id":"https://openalex.org/W4289655242","doi":"https://doi.org/10.1109/isit50566.2022.9834477","title":"Speeding Up AIFV-m Dynamic Programs by m\u20131 Orders of Magnitude","display_name":"Speeding Up AIFV-m Dynamic Programs by m\u20131 Orders of Magnitude","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655242","doi":"https://doi.org/10.1109/isit50566.2022.9834477"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834477","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5051953152","display_name":"Mordecai J. Golin","orcid":"https://orcid.org/0000-0002-1260-6574"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Mordecai J. Golin","raw_affiliation_strings":["CSE, HKUST,Hong Kong"],"affiliations":[{"raw_affiliation_string":"CSE, HKUST,Hong Kong","institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025518472","display_name":"Albert John Lalim Patupat","orcid":null},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Albert John L. Patupat","raw_affiliation_strings":["CSE, HKUST,Hong Kong"],"affiliations":[{"raw_affiliation_string":"CSE, HKUST,Hong Kong","institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051953152"],"corresponding_institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":0.6293,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.6753233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"246","last_page":"251"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9894000291824341,"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.9864000082015991,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6521884202957153},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.5922553539276123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5912432074546814},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4968138039112091},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4616568982601166},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.43569421768188477},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.43053171038627625},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.42710989713668823},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.41898152232170105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41043663024902344},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3277275562286377},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3249439597129822},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.27957046031951904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2713668942451477},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.240334153175354},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.11797481775283813},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08437606692314148},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07584750652313232}],"concepts":[{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6521884202957153},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.5922553539276123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5912432074546814},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4968138039112091},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4616568982601166},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.43569421768188477},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.43053171038627625},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.42710989713668823},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.41898152232170105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41043663024902344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3277275562286377},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3249439597129822},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27957046031951904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2713668942451477},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.240334153175354},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.11797481775283813},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08437606692314148},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07584750652313232},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit50566.2022.9834477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834477","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-119383","is_oa":false,"landing_page_url":"http://www.scopus.com/record/display.url?eid=2-s2.0-85136250127&origin=inward","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2060108852","https://openalex.org/W2148949320","https://openalex.org/W2159266843","https://openalex.org/W2583343534","https://openalex.org/W2752885492","https://openalex.org/W2785487930","https://openalex.org/W2886231064","https://openalex.org/W2945747618","https://openalex.org/W2963079252","https://openalex.org/W2963275264","https://openalex.org/W2975920387","https://openalex.org/W3081123211","https://openalex.org/W3130619598","https://openalex.org/W6733229216"],"related_works":["https://openalex.org/W2383319832","https://openalex.org/W2521117258","https://openalex.org/W4254689347","https://openalex.org/W4366145473","https://openalex.org/W2375901233","https://openalex.org/W2024187501","https://openalex.org/W2115012797","https://openalex.org/W2352632909","https://openalex.org/W2952044666","https://openalex.org/W4226352648"],"abstract_inverted_index":{"AIFV-m":[0,47],"coding":[1],"is":[2,52],"a":[3,58,114,121],"method":[4],"for":[5,9,44,87],"constructing":[6,45],"lossless":[7],"codes":[8],"memoryless":[10],"sources":[11],"that":[12,119],"provide":[13],"better":[14],"worst-case":[15],"redundancy":[16],"than":[17],"Huffman":[18],"codes.":[19],"It":[20],"achieves":[21],"this":[22],"by":[23,33,75],"using":[24,67],"m":[25,88,108],"code":[26],"trees":[27],"instead":[28],"of":[29],"one":[30],"and":[31],"also":[32],"allowing":[34],"some":[35],"bounded":[36],"delay":[37],"in":[38],"the":[39,101],"decoding":[40],"process.":[41],"The":[42,84],"process":[43],"optimal":[46],"on":[48,54],"n":[49],"source":[50],"symbols":[51],"based":[53],"multiple":[55],"calls":[56],"to":[57,94,107],"local":[59],"optimization":[60,63],"subroutine.":[61],"Local":[62],"was":[64,72,91,104],"originally":[65],"performed":[66],"Integer":[68],"Linear":[69],"Programming,":[70],"which":[71],"later":[73],"replaced":[74],"an":[76],"O(mn":[77,123],"<sup":[78,96,124],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[79,97,125],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2m+1</sup>":[80],")-time":[81,127],"Dynamic":[82],"Program.":[83],"running":[85],"time":[86],"=":[89],"2":[90],"further":[92],"improved":[93],"O(n":[95],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[98],"),":[99],"but":[100],"speedup":[102],"technique":[103],"not":[105],"applicable":[106],">":[109],"2.":[110],"This":[111],"paper":[112],"introduces":[113],"new":[115],"dynamic":[116],"programming":[117],"approach":[118],"yields":[120],"general":[122],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m+2</sup>":[126],"algorithm.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}