<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-639WUEPZ</identifier><date>2013</date><creator>Policriti, Alberto</creator><creator>Tomescu, Alexandru I.</creator><relation>documents/casopisje/ars-mathematica-contemporanea/16468569a.pdf</relation><relation>documents/doc/6/URN_NBN_SI_doc-639WUEPZ_001.pdf</relation><relation>documents/doc/6/URN_NBN_SI_doc-639WUEPZ_001.txt</relation><format format_type="issue">1</format><format format_type="volume">6</format><format format_type="type">article</format><format format_type="extent">str. 57-68</format><identifier identifier_type="COBISSID">16468569</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-639WUEPZ</identifier><language>eng</language><publisher>Društvo matematikov, fizikov in astronomov Slovenije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">extensional digraph</subject><subject language_type_id="eng">Markov chain</subject><subject language_type_id="eng">random generation</subject><subject language_type_id="eng">set theory</subject><subject language_type_id="eng">transitive set</subject><title>Markov chain algorithms for generating sets uniformly at random</title></Record>