{"entities":{"Q7361810":{"pageid":31520969,"ns":120,"title":"Item:Q7361810","lastrevid":105369671,"modified":"2026-10-07T13:38:37Z","type":"item","id":"Q7361810","labels":{"en":{"language":"en","value":"Optimal Binary Search Trees"}},"descriptions":{"en":{"language":"en","value":"AFP entry Optimal_BST"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"12fb3cca4fe66e63b6d685f6ee90aa76a5043f24","datavalue":{"value":"https://isa-afp.org/entries/Optimal_BST.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361810$A0CC6486-3D88-4EC2-8571-E47CF20BECC6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"cffd27ff90d37d346ec740513f58c13bc329ab92","datavalue":{"value":{"time":"+2018-05-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361810$6B553C5F-2414-4995-A905-917FD8DBDBC9","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"78083bbf5b06a4f292e9e00ee445948e4fa51db5","datavalue":{"value":"Tobias Nipkow","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361810$E9565200-7BAB-4B79-A878-7C7894D901EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"06bb81bf8da45f9018ad40952189a16cae695e8b","datavalue":{"value":"D\u00e1niel Somogyi","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361810$924C902F-A52E-4A96-A9D5-800147658846","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0f2af723e42400d4d936555d6932104001334d91","datavalue":{"value":{"text":"Optimal Binary Search Trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361810$7DEAACCA-FCE9-4CDE-919B-7E96716E6D41","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"b790dc1f5a483e9122b4014f5d1e085dd5c4eec8","datavalue":{"value":"This article formalizes recursive algorithms for the construction of optimal binary search trees given fixed access frequencies. We follow Knuth (1971), Yao (1980) and Mehlhorn (1984). The algorithms are memoized with the help of the AFP article Monadification, Memoization and Dynamic Programming , thus yielding dynamic programming algorithms.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361810$378790D2-9BEF-49DF-82AC-8469018B3459","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"c4fd2399a3704cf83726a1162abe2d51c058ed2e","datavalue":{"value":{"entity-type":"item","numeric-id":2551314,"id":"Q2551314"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361810$30C70D4F-AE22-4F48-85D1-040EDAD936A9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9387bbd38b0874a230355988a020913f3259fce1","datavalue":{"value":{"entity-type":"item","numeric-id":3219751,"id":"Q3219751"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361810$14FB0A6C-BECF-4E99-AE67-DB30B74C3E61","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"4f6dbc9d14aa31bda7ad388a4db3885ef278ef66","datavalue":{"value":{"entity-type":"item","numeric-id":1791205,"id":"Q1791205"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361810$F857DDBE-2811-4AE0-A6DA-ACB31BAAA6D3","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361810$5C1EE797-F609-4F33-99FF-B1AD84339A85","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"edee312282aa69f74c00c81cc4b11201ce3a44fd","datavalue":{"value":{"entity-type":"item","numeric-id":7361005,"id":"Q7361005"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361810$CCE45FBB-7F78-41DD-99D5-495FA0C37A9D","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"1157f6239d5752bb0ad1cee836272bd46c6bf40f","datavalue":{"value":{"entity-type":"item","numeric-id":7360772,"id":"Q7360772"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361810$07B40424-E4D5-4785-84B2-D012F10956EB","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361810$A89332E3-B8BE-4158-8495-F3EBFBD671AA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal Binary Search Trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_Binary_Search_Trees"}}}}}