{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:54:36Z","timestamp":1743130476045,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_81","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"758-767","source":"Crossref","is-referenced-by-count":0,"title":["Finding Most Likely Solutions"],"prefix":"10.1007","author":[{"given":"Osamu","family":"Watanabe","sequence":"first","affiliation":[]},{"given":"Mikael","family":"Onsj\u00f6","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"81_CR1","doi-asserted-by":"crossref","unstructured":"Boppana, R.B.: Eigenvalues and graph bisection: an average-case analysis. In: Proc. Symposium on Foundations of Computer Science, pp. 280-285 (1987)","DOI":"10.1109\/SFCS.1987.22"},{"key":"81_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T. Bui","year":"1987","unstructured":"Bui, T., Chaudhuri, S., Leighton, F., Spiser, M.: Graph bisection algorithms with good average behavior. Combinatorica\u00a07, 171\u2013191 (1987)","journal-title":"Combinatorica"},{"issue":"3","key":"81_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/rsa.20116","volume":"29","author":"A. Coja-Oghlan","year":"2006","unstructured":"Coja-Oghlan, A.: A spectral heuristic for bisecting random graphs. Random Struct. Algorithms\u00a029(3), 351\u2013398 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"81_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/978-3-540-24597-1_15","volume-title":"FST TCS 2003","author":"D. Dubhashi","year":"2003","unstructured":"Dubhashi, D., Laura, L., Panconesi, A.: Analysis and experimental evaluation of a simple algorithm for collaborative filtering in planted partition models. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003. LNCS, vol.\u00a02914, pp. 168\u2013182. Springer, Heidelberg (2003)"},{"issue":"21","key":"81_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"IT-8","author":"R.G. Gallager","year":"1962","unstructured":"Gallager, R.G.: Low density parity check codes. IRE Trans. Inform. Theory\u00a0IT-8(21), 21\u201328 (1962)","journal-title":"IRE Trans. Inform. Theory"},{"key":"81_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, Bell Telephone Laboratories, Incorporated (1979)"},{"issue":"1-3","key":"81_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(97)00133-9","volume":"82","author":"M. Jerrum","year":"1998","unstructured":"Jerrum, M., Sorkin, G.: The Metropolis algorithm for graph bisection. Discrete Appl. Math\u00a082(1-3), 155\u2013175 (1998)","journal-title":"Discrete Appl. Math"},{"issue":"2","key":"81_CR8","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/18.910576","volume":"47","author":"M. Luby","year":"2001","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, M., Spielman, D.: Improved low-density parity-check codes using irregular graphs. IEEE Trans. on Information Theory\u00a047(2), 585\u2013598 (2001)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"2","key":"81_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"IT-45","author":"D. MacKay","year":"1999","unstructured":"MacKay, D.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory\u00a0IT-45(2), 399\u2013431 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"81_CR10","doi-asserted-by":"crossref","unstructured":"McEliece, R., MacKay, D., Cheng, J.: Turbo decoding as an instance of Pearl\u2019s Belief Propagation algorithm. In: EEE J. on Selected Areas in Comm. 16(2) (1998)","DOI":"10.1109\/49.661103"},{"key":"81_CR11","volume-title":"FOCS\u201999","author":"F. McSherry","year":"1999","unstructured":"McSherry, F.: Spectral partition of random graphs. In: FOCS\u201999. Proc. 40th IEEE Sympos. on Foundations of Computer Science, IEEE, NJ, New York (1999)"},{"key":"81_CR12","unstructured":"Onsj\u00f6, M.: Master Thesis (2005)"},{"key":"81_CR13","unstructured":"Onsj\u00f6, M., Watanabe, O.: Simple algorithms for graph partition problems, Research Report C-212, Dept. of Math. and Comput. Sci. Tokyo Inst. of Tech. (2005)"},{"key":"81_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/11940128_51","volume-title":"Proc. 17th Int\u2019l Sympos. on Algorithms and Computation, (ISAAC\u201906)","author":"M. Onsj\u00f6","year":"2006","unstructured":"Onsj\u00f6, M., Watanabe, O.: A simple message passing algorithm for graph partition problem. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 507\u2013516. Springer, Heidelberg (2006)"},{"key":"81_CR15","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, San Francisco (1988)"},{"key":"81_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-540-39816-5_5","volume-title":"Proc. 2nd Intn\u2019l Sympos. on Stochastic Algorithms","author":"O. Watanabe","year":"2003","unstructured":"Watanabe, O., Sawai, T., Takahashi, H.: Analysis of a randomized local search algorithm for LDPCC decoding problem. In: Albrecht, A.A., Steinh\u00f6fel, K. (eds.) SAGA 2003. LNCS, vol.\u00a02827, pp. 50\u201360. Springer, Heidelberg (2003)"},{"key":"81_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/11814948_27","volume-title":"Proc. 9th Int\u2019l Conference on Theory and Application of Satisfiability Testing, (SAT\u201906)","author":"O. Watanabe","year":"2006","unstructured":"Watanabe, O., Yamamoto, M.: Average-case analysis for the MAX-2SAT problem. In: Campilho, A., Kamel, M. (eds.) ICIAR 2006. LNCS, vol.\u00a04142, pp. 277\u2013282. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:30:47Z","timestamp":1558470647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}