{"entities":{"Q1304183":{"pageid":1314933,"ns":120,"title":"Item:Q1304183","lastrevid":68412312,"modified":"2026-04-12T23:32:27Z","type":"item","id":"Q1304183","labels":{"en":{"language":"en","value":"Advances in randomized parallel computing"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1349365"}},"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":"Q1304183$94739930-56EC-488C-8E47-B08E94EC9B89","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b235662fedfdcc2c772ff1e7ad02abbb8683e4c5","datavalue":{"value":{"text":"Advances in randomized parallel computing","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1304183$878DBDC3-7D94-43EB-ADA6-7E44AD508EBD","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"281f73c381503d3189772c429b5c91c3581d8ccc","datavalue":{"value":"0930.00017","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1304183$8DCA098B-2DC8-4A02-81A2-49F8320E56E5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"80816fa5656d66bbc0a0bf5e84b84357eb43f642","datavalue":{"value":{"entity-type":"item","numeric-id":1278048,"id":"Q1278048"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1304183$0351A5FD-4E25-42AB-BD6E-261C8B015EF2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"83fe9e06aa9d40cff90268e1038560222d3bf965","datavalue":{"value":{"time":"+1999-10-10T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1304183$35BA26F2-0125-41A2-B221-2EE7EE5369D9","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"6da7e25cbc60744163c1fdbefcaebe4b83e12357","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Cohen, Aviad; Rabinovich, Yuri; Schuster, Assaf; Shachnai, Hadas}, Optimal bounds on tail probabilities: A study of an approach, 1-24 [Zbl 0944.60032]  \\textit{Krizanc, Danny}, A survey of randomness and parallism in comparison problems, 25-39 [Zbl 0944.68042]  \\textit{Raman, Rajeev}, Random sampling techniques in parallel algorithms, 41-66 [Zbl 0944.68197]  \\textit{Narayanan, Lata}, Randomized algorithms on the mesh, 67-83 [Zbl 0944.68043]  \\textit{Wei, David S. L.}, Efficient randomized algorithms for parallel and distributed machines, 85-111 [Zbl 0944.68198]  \\textit{Dessmark, Anders; Dorgerloh, Carsten; Lingas, Andrzej; Wirtgen, J\u00fcrgen}, Ultrafast randomized parallel construction- and approximation algorithms for spanning forests in dense graphs, 113-132 [Zbl 0944.68143]  \\textit{Ramaswami, Suneeta}, Parallel randomized techniques for some fundamental geometric problems, 133-157 [Zbl 0944.68185]  \\textit{Hsu, David; Latombe, Jean-Claude; Motwani, Rajeev; Kavraki, Lydia E.}, Capturing the connectivity of high-dimensional geometric spaces by parallelizable random sampling techniques, 159-182 [Zbl 0943.68155]  \\textit{Kallahalla, Mahesh; Varman, Peter J.}, Randomized parallel prefetching and buffer management, 183-208 [Zbl 0944.68007]  \\textit{Ravikumar, B.}, Parallel algorithms for finite automata problems, 209-239 [Zbl 0945.68196]  \\textit{Dongarra, Jack; Wa\u015bniewski, Jerzy}, High performance linear algebra package -- LAPACK90, 241-275 [Zbl 0942.68802]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1304183$E555D3BE-0FAE-4FB8-A02E-9AF4501DFF4E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"342a6161f41187e2c595daa41b09cee10ab1ace9","datavalue":{"value":"00B15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1304183$E410BC07-53E7-405F-820B-7F50682702AA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1304183$5EE55E7B-F586-406A-9E99-7A5074CC0C0F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35bbdcbda53152c249a7f99650e19b5ef62999f2","datavalue":{"value":"68Q10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1304183$C681A729-8CC7-4249-858B-C7BAD05F8309","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6d750996be8d7fb7540db8d2b7b58712c0a5987c","datavalue":{"value":"1349365","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1304183$D5E7C70F-2888-4A1C-8D22-B6065B777862","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"55b83eb8662cf8f66a7bd2a9c708d95df7fb3115","datavalue":{"value":"Randomized parallel computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q1304183$F88EA85C-5297-4A58-9C1D-C7938ADC5880","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":"Q1304183$53F8F365-9D8F-4B8B-865B-07BECA64974B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Advances in randomized parallel computing","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Advances_in_randomized_parallel_computing"}}}}}