{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T19:31:43Z","timestamp":1781983903010,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229343","type":"print"},{"value":"9783642229350","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_36","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T09:20:39Z","timestamp":1313140839000},"page":"424-435","source":"Crossref","is-referenced-by-count":9,"title":["The Computational Complexity of Estimating MCMC Convergence Time"],"prefix":"10.1007","author":[{"given":"Nayantara","family":"Bhatnagar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrej","family":"Bogdanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elchanan","family":"Mossel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs. Draft, http:\/\/www.stat.Berkeley.edu\/users\/aldous"},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/137926.137932","volume":"2","author":"S. Asmussen","year":"1992","unstructured":"Asmussen, S., Glynn, P.W., Thorisson, H.: Stationarity detection in the initial transient problem. ACM Transactions on Modeling and Computer Simulation\u00a02(2), 130\u2013157 (1992)","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"key":"36_CR3","unstructured":"Bhatnagar, N., Bogdanov, A., Mossel, E.: The complexity of estimating MCMC convergence time (2010), http:\/\/arxiv.org\/abs\/1007.0089"},{"key":"36_CR4","unstructured":"BOA, Bayesian Output Analysis, http:\/\/www.public-health.uiowa.edu\/BOA"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1008820505350","volume":"8","author":"S. Brooks","year":"1998","unstructured":"Brooks, S., Roberts, G.: Assessing convergence of Markov Chain Monte Carlo algorithms. Statistics and Computing\u00a08, 319\u2013335 (1998)","journal-title":"Statistics and Computing"},{"key":"36_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/9781420057669","volume-title":"Bayes and Empirical Bayes methods for data analysis","author":"B. Carlin","year":"2000","unstructured":"Carlin, B., Louis, T.: Bayes and Empirical Bayes methods for data analysis. Chapman and Hall, Boca Raton (2000)"},{"issue":"434","key":"36_CR7","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1080\/01621459.1996.10476956","volume":"91","author":"M. Cowles","year":"1996","unstructured":"Cowles, M., Carlin, B.: Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review. J. Am. Stat. Assoc.\u00a091(434), 883\u2013904 (1996)","journal-title":"J. Am. Stat. Assoc."},{"key":"36_CR8","unstructured":"Gilks, W., Richardson, S., Spiegelhalter, D. (eds.): Monte Carlo Statistical Methods. Chapman and Hall, Boca Raton (1995)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Derrida, B., Weisbuch, G.: Dynamical phase transitions in 3-dimensional spin glasses. Europhys. Lett.\u00a04(6), 657\u2013662 (1987)","DOI":"10.1209\/0295-5075\/4\/6\/004"},{"key":"36_CR10","unstructured":"Goldwasser, S., Sipser, M.: Private Coins versus Public Coins in Interactive Proof Systems. In: Micali, S. (ed.) Advances in Computing Research: a Research Annual, Randomness and Computation, vol.\u00a05, pp. 73\u201390 (1989)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/11535218_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"T. Holenstein","year":"2005","unstructured":"Holenstein, T., Renner, R.S.: One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 478\u2013493. Springer, Heidelberg (2005)"},{"key":"36_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9780470434567","volume-title":"Bayesian Modeling Using WinBUGS","author":"I. Ntzoufras","year":"2009","unstructured":"Ntzoufras, I.: Bayesian Modeling Using WinBUGS. Wiley, Chichester (2009)"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Counting, Sampling and Integrating: Algorithms and Complexity, Birkh\u00e4user, Basel (2003)","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/0222066","volume":"22","author":"M. Jerrum","year":"1993","unstructured":"Jerrum, M., Sinclair, A.: Polynomial-time Approximation Algorithms for the Ising Model. SIAM Journal on Computing\u00a022, 1087\u20131116 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"36_CR15","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 Non-negative Entries. Journal of the ACM\u00a051(4), 671\u2013697 (2004)","journal-title":"Journal of the ACM"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Levin, D., Peres, Y., Wilmer, E.: Markov Chains and Mixing Times (2008)","DOI":"10.1090\/mbk\/058"},{"key":"36_CR17","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulated Annealing in Convex Bodies and an O*(n 4) Volume Algorithm. In: Proc. of the 44th IEEE Symposium on Foundations of Computer Science (2003)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Vempala, S.: Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. In: Proc. of the 47th IEEE Symposium on Foundations of Computer Science (2006)","DOI":"10.1109\/FOCS.2006.28"},{"key":"36_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte Carlo Statistical Methods","author":"C. Roberts","year":"2004","unstructured":"Roberts, C., Casella, G.: Monte Carlo Statistical Methods. Springer, Heidelberg (2004)"},{"key":"36_CR20","unstructured":"Plummer, M., Best, N., Cowles, K., Vines, K.: CODA: Convergence Diagnosis and Output Analysis for MCMC. R News 6(1), 7-11 (2006), http:\/\/CRAN.R-project.org\/doc\/Rnews\/"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting. Birkhauser, Basel (1993)","DOI":"10.1007\/978-1-4612-0323-0"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Sahai, A., Vadhan, S.: A complete promise problem for statistical zero-knowledge. In: Proceedings of the 38th Annual Symposium on the Foundations of Computer Science, pp. 448\u2013457 (1997)","DOI":"10.1109\/SFCS.1997.646133"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Saks, M.: Randomization and Derandomization in Space-bounded Computation. In: Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pp. 128\u2013149 (1996)","DOI":"10.1109\/CCC.1996.507676"},{"issue":"2","key":"36_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships Between Nondeterministic and Deterministic Space Complexities. J. Comp. and Syst. Sci.\u00a04(2), 177\u2013192 (1970)","journal-title":"J. Comp. and Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22935-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T15:18:28Z","timestamp":1741447108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}