{"id":"https://openalex.org/keywords/dynamic-optimality","display_name":"dynamic optimality","description":"A proposed efficiency property for algorithms that dynamically access ordered data structures, requiring performance close to the best possible sequence-specific strategy.","display_name_alternatives":["dynamic optimality of binary search trees","BST dynamic optimality"],"ids":{"openalex":"https://openalex.org/keywords/dynamic-optimality","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.5768,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.5768,"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/T12288","display_name":"Optimization and Search Problems","score":0.1013,"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"}}],"works_count":139,"cited_by_count":2165,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/dynamic-optimality","updated_date":"2026-11-21T04:06:33","created_date":"2026-09-30T00:00:00"}
