{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T05:22:31Z","timestamp":1737264151833,"version":"3.33.0"},"reference-count":12,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5923,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1991,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>There have been several researches on how to generate quasi\u2010random sequences from semirandom sources (SRS). Recently, SRSs have been studied and generalized such that they output an element over an arbitrary finite set. However, the existing generator outputs one element from \u03c9 ((log<jats:italic>n<\/jats:italic>)<jats:sup>2<\/jats:sup>) inputs and uses \u03c9 ((log<jats:italic>n<\/jats:italic>)<jats:sup>2<\/jats:sup>) SRSs. This paper presents more efficient methods to generate quasi\u2010random sequences. This method uses \u03c9 (log<jats:italic>n<\/jats:italic>) inputs to make one output.<\/jats:p>","DOI":"10.1002\/scj.4690220204","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T20:30:16Z","timestamp":1183840216000},"page":"25-33","source":"Crossref","is-referenced-by-count":0,"title":["Note on the efficiency of methods to generate quasi\u2010random sequences"],"prefix":"10.1002","volume":"22","author":[{"given":"Hiroaki","family":"Yamamoto","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"M.Blum.Independent Unbiased Coin Flips from a Correlated Biased Source: A Finite State Markov Chain. IEEE Sympos. Found. Comput. Sci. pp.425\u2013433(1984).","DOI":"10.1109\/SFCS.1984.715944"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0215025"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"B.ChorandO.Goldreich.Unbiased bits from sources of weak randomness and probabilistic communication complexity. IEEE Sympos. Found. Comput. Sci. pp.429\u2013442(1985).","DOI":"10.1109\/SFCS.1985.62"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"O.Goldreich S.Goldwasser andS.Micali.How to construct random functions. IEEE Sympos. Found. Comput. Sci. pp.464\u2013479(1984).","DOI":"10.1109\/SFCS.1984.715949"},{"volume-title":"The Art of Computer Programming","year":"1981","author":"Kuth D.","key":"e_1_2_1_7_2"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"M.SanthaandU. V.Vazirani.Generating quasi\u2010random sequences from slightly random sources. IEEE Sympos. Found. Comput. Sci. pp.434\u2013440(1984).","DOI":"10.1109\/SFCS.1984.715945"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90044-9"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"U. V.Vazirani.Toward a strong communication complexity theory or generating quasi\u2010random sequences from two communicating slightly random sources. ACM Sympos. Theory of Comput. pp.366\u2013378(1985).","DOI":"10.1145\/22145.22186"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"U. V.VaziraniandV. V.Vazirani.Random polynomial time is equal to slightly random polynomial time. IEEE Sympos. Found. Comput. Sci. pp.417\u2013428(1985).","DOI":"10.1109\/SFCS.1985.45"},{"issue":"11","key":"e_1_2_1_12_2","first-page":"2242","article-title":"Extraction of randomness from semi\u2010random sources","volume":"71","author":"Yamamoto H.","year":"1988","journal-title":"Trans. I.E.I.C.E.(D)"},{"volume-title":"Linear Programming","year":"1978","author":"Sekine Y.","key":"e_1_2_1_13_2"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690220204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690220204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T17:25:18Z","timestamp":1737221118000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690220204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1002\/scj.4690220204"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690220204","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"type":"print","value":"0882-1666"},{"type":"electronic","value":"1520-684X"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}