{"entities":{"Q1253100":{"pageid":1263850,"ns":120,"title":"Item:Q1253100","lastrevid":70001664,"modified":"2026-04-13T11:46:26Z","type":"item","id":"Q1253100","labels":{"en":{"language":"en","value":"The average number of registers needed to evaluate a binary tree optimally"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3614191"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$609C5463-E94F-49F6-9F7C-83F17FF42359","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"584bc15291f8c5ccfd87853a9d3430b4063bfe04","datavalue":{"value":{"text":"The average number of registers needed to evaluate a binary tree optimally","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1253100$145B308A-81D2-4902-915E-B988BFC972B7","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9d6b6791907f606d04e834991621b8169e4911fe","datavalue":{"value":"0395.68059","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$0522C298-4E81-454D-9F57-2570F2AA87EC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"25810ae01ae2a528c913e218bd5689ddf015b5ee","datavalue":{"value":"10.1007/BF00289094","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$CBEF4839-1F77-43AF-9FF0-2B9EF6832859","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e47d94cb50e8bff7e07db91cf2e29b89383adf9","datavalue":{"value":{"entity-type":"item","numeric-id":1223001,"id":"Q1223001"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$7D912F27-3458-470C-9619-8D073FA899C4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7d0f02e85530cd06ceb2c58a40dc9c2e0258e194","datavalue":{"value":{"entity-type":"item","numeric-id":161641,"id":"Q161641"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$B74FC2EC-EC39-4BD5-8290-07ADE1AB29AD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0b87f78dda5694898cc127305eecf88680ce6c83","datavalue":{"value":{"time":"+1979-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1253100$8043D7EA-1A8D-4204-BFE6-B15A23A717A4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$70F58279-E8BC-4C00-8938-B985D2C72970","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9ed1e3c6cced595a05b8ae19055521b22405b78a","datavalue":{"value":"68W99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$B416D117-9355-473A-9104-FF28BD9DC336","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c23dec48a3293f0be30fba7ca1732a18d4263499","datavalue":{"value":"26-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$2CF50951-CCE1-4289-BA56-3C91FCD98F9D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2021df42829abb823598ecf47b8edd0842b59bf2","datavalue":{"value":"33-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$962915EE-5676-4066-B943-91432B97D639","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7bc0bf7e3904706610a183a8b4575e701cd787b5","datavalue":{"value":"3614191","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$46226EE8-8C32-450B-B393-532FCA6A013A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"00d5fb5b60863e60db7b9a501c4823d3962e50db","datavalue":{"value":"Binary Tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q1253100$21082BE6-7F79-47A0-8D7C-99FF27003B25","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f40703271f7dd05098c771c147b15f84af6e1fb7","datavalue":{"value":"Registers","type":"string"},"datatype":"string"},"type":"statement","id":"Q1253100$A14BF28C-E582-4E1C-8919-A511844F4A57","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f867d3c4541765a00f9c5da4f4254d4ff14e22d4","datavalue":{"value":"Asymptotic Expansion","type":"string"},"datatype":"string"},"type":"statement","id":"Q1253100$F78577BF-9240-422A-ACEB-B41F5088EAEE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d25e954d3d19ad6d22fe55f53bf231601527d766","datavalue":{"value":"Enumeration","type":"string"},"datatype":"string"},"type":"statement","id":"Q1253100$57E1773D-8DFB-48A9-8B8F-9D56FD4D73D0","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$A0EA0680-CA7C-4FEB-9E9D-2FF3970B075A","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"8bf37d0bc0726c56972518dd0703ba682968f690","datavalue":{"value":{"entity-type":"item","numeric-id":5621389,"id":"Q5621389"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$F98420E6-8638-4C61-8CB1-752D7C34D6F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"78086d932c8459e7de00cebcf9a48175432b3809","datavalue":{"value":{"entity-type":"item","numeric-id":5659554,"id":"Q5659554"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$A7415D1F-C288-474F-8B82-788CD6CAC442","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7e298edab0e9c4d45d4ffbcee1cb823ba7b509a8","datavalue":{"value":{"entity-type":"item","numeric-id":5786798,"id":"Q5786798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$CD7A6657-9F41-4725-A7D3-66F35A82B96D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f956075fe984de14193c1e1c45a8f348b956db2f","datavalue":{"value":{"entity-type":"item","numeric-id":1253100,"id":"Q1253100"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$4BFDD468-41AB-48C7-B72B-016304C6C755","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d090a5d0237244ffd39e2f4deabce45005f10036","datavalue":{"value":{"entity-type":"item","numeric-id":5535424,"id":"Q5535424"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$5DFA23B0-783D-4BD8-9F8B-326255B41BB4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7f581cbd7f0c20cb87078b5515ccb752ff826b47","datavalue":{"value":{"entity-type":"item","numeric-id":5613555,"id":"Q5613555"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1253100$5761B7C4-220F-458E-8FF8-EC840180D6DD","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3e06d3778634a01f82eec7f4336f349878a7b8ed","datavalue":{"value":"https://doi.org/10.1007/bf00289094","type":"string"},"datatype":"url"},"type":"statement","id":"Q1253100$CB442689-52FF-49D5-92D5-FB1070BBD2CF","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"616de4ea0a7d13b33c481b01c0147235dd1add69","datavalue":{"value":"W1998448131","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1253100$D92DCAB3-17FA-41D4-93E3-D3E81CB88573","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The average number of registers needed to evaluate a binary tree optimally","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_average_number_of_registers_needed_to_evaluate_a_binary_tree_optimally"}}}}}