{"id":"https://openalex.org/W2009319645","doi":"https://doi.org/10.1145/800141.804691","title":"Efficient dynamic programming using quadrangle inequalities","display_name":"Efficient dynamic programming using quadrangle inequalities","publication_year":1980,"publication_date":"1980-01-01","ids":{"openalex":"https://openalex.org/W2009319645","doi":"https://doi.org/10.1145/800141.804691","mag":"2009319645"},"language":"en","primary_location":{"id":"doi:10.1145/800141.804691","doi":"https://doi.org/10.1145/800141.804691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800141.804691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804691","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804691","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112495398","display_name":"F. Frances Yao","orcid":"https://orcid.org/0009-0008-2882-8623","observed_orcids":["https://orcid.org/0009-0008-2882-8623"]},"institutions":[{"id":"https://openalex.org/I173498003","display_name":"Palo Alto Research Center","ror":"https://ror.org/0529fxt39","country_code":"US","type":"facility","lineage":["https://openalex.org/I173498003","https://openalex.org/I4210132870"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. Frances Yao","raw_affiliation_strings":["","Xerox Palo Alto Research Center Palo Alto, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Xerox Palo Alto Research Center Palo Alto, California","institution_ids":["https://openalex.org/I173498003"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112495398"],"corresponding_institution_ids":["https://openalex.org/I173498003"],"apc_list":null,"apc_paid":null,"fwci":0.8844,"has_fulltext":true,"cited_by_count":144,"citation_normalized_percentile":{"value":0.66857143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"429","last_page":"435"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7221999764442444,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7221999764442444,"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/T11269","display_name":"Algorithms and Data Compression","score":0.259799987077713,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.007600000128149986,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.8619999885559082},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.7459999918937683},{"id":"https://openalex.org/keywords/optimal-binary-search-trees","display_name":"optimal binary search trees","score":0.8820000290870667},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6190000176429749},{"id":"https://openalex.org/keywords/algorithm-optimization","display_name":"algorithm optimization","score":0.3569999933242798}],"concepts":[{"id":"https://openalex.org/C27258493","wikidata":"https://www.wikidata.org/wiki/Q7268308","display_name":"Quadrangle","level":2,"score":0.9079687595367432},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.8289970755577087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6613901853561401},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.5514845848083496},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49937915802001953},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4898500144481659},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.472125381231308},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35733163356781006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3491312861442566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2825658917427063},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21242755651474},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11473137140274048},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/800141.804691","doi":"https://doi.org/10.1145/800141.804691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800141.804691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804691","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/800141.804691","doi":"https://doi.org/10.1145/800141.804691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800141.804691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804691","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2009319645.pdf","grobid_xml":"https://content.openalex.org/works/W2009319645.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1552202544","https://openalex.org/W1655990431","https://openalex.org/W1970961429","https://openalex.org/W2007572995","https://openalex.org/W2022366735","https://openalex.org/W2068373264","https://openalex.org/W2369142236","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W4231962054","https://openalex.org/W6633749307"],"related_works":["https://openalex.org/W2008594195","https://openalex.org/W2060710868","https://openalex.org/W2622763161","https://openalex.org/W2104037408","https://openalex.org/W32573221","https://openalex.org/W1953003771","https://openalex.org/W2388819496","https://openalex.org/W7124896281","https://openalex.org/W3139655621","https://openalex.org/W2087817903"],"abstract_inverted_index":{"Dynamic":[0],"programming":[1],"is":[2,73],"one":[3,20],"of":[4,29,32,42,97],"several":[5,81],"widely":[6],"used":[7],"problem-solving":[8],"techniques":[9],"in":[10,38],"computer":[11],"science":[12],"and":[13,76,122],"operation":[14],"research.":[15],"In":[16,59],"applying":[17],"this":[18,60],"technique,":[19],"always":[21],"seeks":[22],"to":[23,51,80,109],"find":[24],"speed-up":[25],"by":[26,117],"taking":[27],"advantage":[28],"special":[30],"properties":[31],"the":[33,39,95],"problem":[34],"at":[35],"hand.":[36],"However,":[37],"current":[40],"state":[41],"art,":[43],"ad":[44],"hoc":[45],"approaches":[46],"for":[47,68],"speeding":[48],"up":[49,105],"seem":[50],"be":[52,78,103],"characteristic;":[53],"few":[54],"general":[55,92],"criteria":[56],"are":[57],"known.":[58],"paper":[61],"we":[62],"give":[63],"a":[64,111,120],"quadrangle":[65],"inequality":[66],"condition":[67,72,93],"rendering":[69],"speed-up.":[70],"This":[71],"easily":[74],"checked,":[75],"can":[77],"applied":[79],"apparently":[82],"different":[83,121],"problems.":[84],"For":[85],"example,":[86],"it":[87],"follows":[88],"immediately":[89],"from":[90,106],"our":[91],"that":[94,113],"construction":[96],"optimal":[98],"binary":[99],"search":[100],"trees":[101],"may":[102],"speeded":[104],"O(n3)":[107],"steps":[108],"O(n2),":[110],"result":[112],"was":[114],"first":[115],"obtained":[116],"Knuth":[118],"using":[119],"rather":[123],"complicated":[124],"argument.":[125]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":36},{"year":2024,"cited_by_count":9},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}