{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:59Z","timestamp":1725796619997},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_3","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"25-36","source":"Crossref","is-referenced-by-count":1,"title":["L \u2009\u221e\u2009-Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains"],"prefix":"10.1007","author":[{"given":"Takeharu","family":"Shiraga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukiko","family":"Yamauchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuji","family":"Kijima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Akbari, H., Berenbrink, P.: Parallel rotor walks on finite graphs and applications in discrete load balancing. In: Proc. SPAA 2013, pp. 186\u2013195 (2013)","DOI":"10.1145\/2486159.2486178"},{"key":"3_CR2","unstructured":"Angel, O., Holroyd, A.E., Martin, J., Propp, J.: Discrete low discrepancy sequences, arXiv:0910.1077"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0012-365X(98)00333-1","volume":"201","author":"R. Bubley","year":"1999","unstructured":"Bubley, R., Dyer, M.: Faster random generation of linear extensions. Discrete Mathematics\u00a0201, 81\u201388 (1999)","journal-title":"Discrete Mathematics"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/rsa.20314","volume":"37","author":"J. Cooper","year":"2010","unstructured":"Cooper, J., Doerr, B., Friedrich, T., Spencer, J.: Deterministic random walks on regular trees. Random Structures & Algorithms\u00a037, 353\u2013366 (2010)","journal-title":"Random Structures & Algorithms"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"2072","DOI":"10.1016\/j.ejc.2007.04.018","volume":"28","author":"J. Cooper","year":"2007","unstructured":"Cooper, J., Doerr, B., Spencer, J., Tardos, G.: Deterministic random walks on the integers. European Journal of Combinatorics\u00a028, 2072\u20132090 (2007)","journal-title":"European Journal of Combinatorics"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1017\/S0963548306007565","volume":"15","author":"J. Cooper","year":"2006","unstructured":"Cooper, J., Spencer, J.: Simulating a random walk with constant error. Combinatorics, Probability and Computing\u00a015, 815\u2013822 (2006)","journal-title":"Combinatorics, Probability and Computing"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/S0963548308009589","volume":"18","author":"B. Doerr","year":"2009","unstructured":"Doerr, B., Friedrich, T.: Deterministic random walks on the two-dimensional grid. Combinatorics, Probability and Computing\u00a018, 123\u2013144 (2009)","journal-title":"Combinatorics, Probability and Computing"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1137\/100799216","volume":"41","author":"T. Friedrich","year":"2012","unstructured":"Friedrich, T., Gairing, M., Sauerwald, T.: Quasirandom load balancing. SIAM Journal on Computing\u00a041, 747\u2013771 (2012)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Gopalan, P., Klivans, A., Meka, R., Stefankovic, D., Vempala, S., Vigoda, E.: An FPTAS for #knapsack and related counting problems. In: Proc. FOCS 2011, pp. 817\u2013826 (2011)","DOI":"10.1109\/FOCS.2011.32"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Holroyd, A.E., Propp, J.: Rotor walks and Markov chains. In: Lladser, M., Maier, R.S., Mishna, M., Rechnitzer, A. (eds.) Algorithmic Probability and Combinatorics, pp. 105\u2013126. The American Mathematical Society (2010)","DOI":"10.1090\/conm\/520\/10256"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"2332","DOI":"10.1246\/bcsj.44.2332","volume":"44","author":"H. Hosoya","year":"1971","unstructured":"Hosoya, H.: Topological index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bulletin of the Chemical Society of Japan\u00a044, 2332\u20132339 (1971)","journal-title":"Bulletin of the Chemical Society of Japan"},{"key":"3_CR12","unstructured":"Jerrum, M., Sinclair, A.: Approximation algorithms for NP-hard problems. In: Hochbaum, D.S. (ed.) The Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration. PWS Publishing (1996)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM\u00a051, 671\u2013697 (2004)","journal-title":"Journal of the ACM"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00385809","volume":"8","author":"A. Karzanov","year":"1991","unstructured":"Karzanov, A., Khachiyan, L.: On the conductance of order Markov chains. Order\u00a08, 7\u201315 (1991)","journal-title":"Order"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Kijima, S., Koga, K., Makino, K.: Deterministic random walks on finite graphs. In: Proc. ANALCO 2012, pp. 16\u201325 (2012)","DOI":"10.1137\/1.9781611973020.3"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Levine, D.A., Peres, Y., Wilmer, E.L.: Markov Chain and Mixing Times. American Mathematical Society (2008)","DOI":"10.1090\/mbk\/058"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0097539702411915","volume":"34","author":"B. Morris","year":"2004","unstructured":"Morris, B., Sinclair, A.: Random walks on truncated cubes and sampling 0-1 knapsack solutions. SIAM Journal on Computing\u00a034, 195\u2013226 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR18","unstructured":"Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of Markov chains and analysis of iterative load balancing schemes. In: Proc. FOCS 1998, pp. 694\u2013705 (1998)"},{"key":"3_CR19","unstructured":"Shiraga, T., Yamauchi, Y., Kijima, S., Yamashita, M.: Deterministic random walks for rapidly mixing chains, arXiv:1311.3749"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Sinclair, A.: Algorithms for Random Generation & Counting, A Markov chain approach. Birkh\u00e4user (1993)","DOI":"10.1007\/978-1-4612-0323-0"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0012-365X(80)90269-1","volume":"32","author":"R. Tijdeman","year":"1980","unstructured":"Tijdeman, R.: The chairman assignment problem. Discrete Math.\u00a032, 323\u2013330 (1980)","journal-title":"Discrete Math."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08, 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T07:10:58Z","timestamp":1558941058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}