{"entities":{"Q1897255":{"pageid":1907997,"ns":120,"title":"Item:Q1897255","lastrevid":71102088,"modified":"2026-04-13T19:29:54Z","type":"item","id":"Q1897255","labels":{"en":{"language":"en","value":"Discrete probability and algorithms. Proceedings of the workshops ``Probability and algorithms'' and ``The finite Markov chain renaissance'' held at IMA, University of Minnesota, Minneapolis, MN, USA, 1993"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 790130"}},"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":"Q1897255$0BE198B8-F0AD-424E-81C0-28A6A5593130","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fef94c594ae3a7434e41f84c6215a7b07bfcdbe1","datavalue":{"value":{"text":"Discrete probability and algorithms. Proceedings of the workshops ``Probability and algorithms'' and ``The finite Markov chain renaissance'' held at IMA, University of Minnesota, Minneapolis, MN, USA, 1993","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1897255$0787BA56-F681-44DF-8AE9-526F4AA10D8D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2dd593f1e1a7b22607a34a5e377e435d7ec9c41c","datavalue":{"value":"0822.00011","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1897255$5D908332-FBB4-4BF8-A5C3-AD7AE50A444E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7d5fecc3d8dc3fe134c0a72db54d7d7062b9197c","datavalue":{"value":{"entity-type":"item","numeric-id":175937,"id":"Q175937"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1897255$4A0D53BF-1E22-43F8-87E7-129BB9728C07","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"130e39adf7d31aeb394dfacb8a12a0f0ed2af467","datavalue":{"value":{"time":"+1995-08-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":"Q1897255$9EE0DB84-B2A2-45AB-BAD5-C29B17E3F360","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"47bda4825a82abf4fe88ea7e12a8a6d9bdd95c65","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Aldous, David}, On simulating a Markov chain stationary distribution when transition probabilities are unknown, 1-9 [Zbl 0877.60050]  \\textit{Alon, Noga}, A note on network reliability, 11-14 [Zbl 0830.60086]  \\textit{Diaconis, Persi; Gangolli, Anil}, Rectangular arrays with fixed margins, 15-41 [Zbl 0839.05005]  \\textit{Diaconis, Persi; Holmes, Susan}, Three examples of Monte-Carlo Markov chains: At the interface between statistical computing, computer science, and statistical mechanics, 43-56 [Zbl 0827.60059]  \\textit{Dobrow, Robert P.; Fill, James Allen}, The move-to-front rule for self-organizing lists with Markov dependent requests, 57-80 [Zbl 0827.60054]  \\textit{Godbole, Anant P.; Skipper, Daphne E.; Sunley, Rachel A.}, The asymptotic lower bound on the diagonal Ramsey numbers: A closer look, 81-94 [Zbl 0834.05049]  \\textit{Karlin, Anna R.; Raghavan, Prabhakar}, Random walks and undirected graph connectivity: A survey, 95-101 [Zbl 0830.60062]  \\textit{Spencer, Joel; Tetali, Prasad}, Sidon sets with small gaps, 103-109 [Zbl 0833.60011]  \\textit{Steele, J. Michael}, Variations on the monotone subsequence theme of Erd\u00f6s and Szekeres, 111-131 [Zbl 0832.60012]  \\textit{Welsh, Dominic}, Randomised approximation schemes for Tutte-Gr\u00f6thendieck invariants, 133-148 [Zbl 0831.05018]  \\textit{Yukich, J. E.}, Quasi-additive Euclidean functionals, 149-158 [Zbl 0828.60060]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1897255$3E12334C-CC8C-40AA-9828-EBB300EF6144","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1897255$2BE21DDE-C0B8-4C62-997D-7C23F5CC0942","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"226655afee1bf0bb32eee240ec2948137df408df","datavalue":{"value":"60-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1897255$0E21846D-0598-4195-B956-64F1EEA6345B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c2375fd4b32d2eb23df347253ca68f523c20922c","datavalue":{"value":"05-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1897255$2EE30792-2E0C-433E-B982-689B36C58F4F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1897255$657048FB-FB91-49A1-8B87-88D06F24D9F3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7d4b61c839eaf6ce289667b0defc66a1d3d893fd","datavalue":{"value":"790130","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1897255$86A4A243-2910-4E7A-9F1D-A35426F0F0BA","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e18e27b98a1ca5a842c85138422ac65add46866a","datavalue":{"value":"Discrete probability","type":"string"},"datatype":"string"},"type":"statement","id":"Q1897255$967BE806-4304-4F68-8F65-4D4072933909","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8baf804bc4c1172cd32c9cc96b06a8c070f11c0c","datavalue":{"value":"Algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1897255$0FBE38DD-AF3B-4C08-A213-5706684BA45C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1897255$EB35E6F0-307F-4DF8-94ED-5F7229C55BFF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q1897255$67C66301-05A1-42C3-9117-38184379BE78","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cc4f9721877be3149abd910b1d3342acf788f42b","datavalue":{"value":"Probability","type":"string"},"datatype":"string"},"type":"statement","id":"Q1897255$06C01703-5E75-464B-BB10-DEE18A15C18F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4a12681ec70e8e35ba76682985143871f11d250a","datavalue":{"value":"Finite Markov chain","type":"string"},"datatype":"string"},"type":"statement","id":"Q1897255$F46B6D91-6FEF-4CEF-9F27-07F237A8F89A","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":"Q1897255$94E9649B-B5A0-4A3C-BDEC-9CC825EA535F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Discrete probability and algorithms. Proceedings of the workshops ``Probability and algorithms'' and ``The finite Markov chain renaissance'' held at IMA, University of Minnesota, Minneapolis, MN, USA, 1993","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Discrete_probability_and_algorithms._Proceedings_of_the_workshops_%60%60Probability_and_algorithms%27%27_and_%60%60The_finite_Markov_chain_renaissance%27%27_held_at_IMA,_University_of_Minnesota,_Minneapolis,_MN,_USA,_1993"}}}}}