{"entities":{"Q7361412":{"pageid":31519775,"ns":120,"title":"Item:Q7361412","lastrevid":105365726,"modified":"2026-10-07T13:36:17Z","type":"item","id":"Q7361412","labels":{"en":{"language":"en","value":"Randomised Binary Search Trees"}},"descriptions":{"en":{"language":"en","value":"AFP entry Randomised_BSTs"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"4357e65fbda71124b4a5a247f2fe2e5e6ae6092d","datavalue":{"value":"https://isa-afp.org/entries/Randomised_BSTs.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361412$B8FFFEB8-7CFA-4061-A892-A18C9B0FD733","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5851604a72cdd40de4e79399957d1d12419d2f19","datavalue":{"value":{"time":"+2018-10-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361412$EECED17E-3182-42BE-B69A-5107784F3FEF","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"85859c7ab42dcb8b36208f2902b7ce0d86423a6f","datavalue":{"value":"Manuel Eberl","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361412$3151194A-8FBD-4A40-AA54-95D15E06F91F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0c37573664d4a70225f6c323de5a3adfd897659e","datavalue":{"value":{"text":"Randomised Binary Search Trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361412$4EE1DF43-2445-470D-A308-5373663E7F42","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"b792d23dad4aaa65d8a98dbda08bd58b3f47cf42","datavalue":{"value":"This work is a formalisation of the Randomised Binary Search Trees introduced by Mart\u00ednez and Roura, including definitions and correctness proofs. Like randomised treaps, they are a probabilistic data structure that behaves exactly as if elements were inserted into a non-balancing BST in random order. However, unlike treaps, they only use discrete probability distributions, but their use of randomness is more complicated.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361412$267CB519-AD01-4910-92FA-8536E9D87809","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"9cb9ee576d1e7865e04b83330f1ef40da2932360","datavalue":{"value":{"entity-type":"item","numeric-id":3841653,"id":"Q3841653"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361412$3D453FC1-6D4F-42CA-BE91-60932E728786","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":"Q7361412$14DBD736-5778-4962-ABC2-E6BC8AFC4CF4","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"ceeec1476c044e883da5dc800851f022e7ceae8f","datavalue":{"value":{"entity-type":"item","numeric-id":7361442,"id":"Q7361442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361412$46AADAF8-D3AD-483B-994F-7C7F94595E32","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"2c009aab4f697160b25e89a5eefaab809089489d","datavalue":{"value":{"entity-type":"item","numeric-id":7361825,"id":"Q7361825"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361412$BF2BF0B9-38F7-4558-AE80-58E8B65ED883","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"ef7bddd24a035fe32f48fd95ea6033928a9b8e67","datavalue":{"value":{"entity-type":"item","numeric-id":7360788,"id":"Q7360788"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361412$07E9443E-25C4-4E24-A9A5-F7BE93C2F3F6","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":"Q7361412$251CB3F9-F5C0-4BD9-90AF-3B0985D5A291","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Randomised Binary Search Trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Randomised_Binary_Search_Trees"}}}}}