{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:05:07Z","timestamp":1725563107648},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_53","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"710-723","source":"Crossref","is-referenced-by-count":2,"title":["Delaying Satisfiability for Random 2SAT"],"prefix":"10.1007","author":[{"given":"Alistair","family":"Sinclair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Vilenchik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Apswall","year":"1979","unstructured":"Apswall, B., Plass, M., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Proc. Letters\u00a08, 121\u2013123 (1979)","journal-title":"Inf. Proc. Letters"},{"issue":"1","key":"53_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal on Computing\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"53_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/rsa.1019","volume":"19","author":"T. Bohman","year":"2001","unstructured":"Bohman, T., Frieze, A.: Avoiding a giant component. Random Structures & Algorithms\u00a019(1), 75\u201385 (2001)","journal-title":"Random Structures & Algorithms"},{"issue":"4","key":"53_CR4","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1002\/rsa.20038","volume":"25","author":"T. Bohman","year":"2004","unstructured":"Bohman, T., Frieze, A., Wormald, N.: Avoidance of a giant component in half the edge set of a random graph. Random Structures & Algorithms\u00a025(4), 432\u2013449 (2004)","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"53_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/rsa.20085","volume":"28","author":"T. Bohman","year":"2006","unstructured":"Bohman, T., Kim, J.H.: A phase transition for avoiding a giant component. Random Structures & Algorithms\u00a028(2), 195\u2013214 (2006)","journal-title":"Random Structures & Algorithms"},{"issue":"4","key":"53_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1017\/S0963548306007486","volume":"15","author":"T. Bohman","year":"2006","unstructured":"Bohman, T., Kravitz, D.: Creating a giant component. Combinatorics, Probability and Computing\u00a015(4), 489\u2013511 (2006)","journal-title":"Combinatorics, Probability and Computing"},{"key":"53_CR7","unstructured":"Broder, A., Frieze, A., Upfal, E.: On the satisfiability and maximum satisfiability of random 3CNF formulas. In: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 322\u2013330 (1993)"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Reed, B.: Mick gets some (the odds are on his side). In: Proc. 33rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 620\u2013627 (1992)","DOI":"10.1109\/SFCS.1992.267789"},{"key":"53_CR9","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci.\u00a05, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"issue":"3","key":"53_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.20070","volume":"27","author":"A. Flaxman","year":"2005","unstructured":"Flaxman, A., Gamarnik, D., Sorkin, G.: Embracing the giant component. Random Structures & Algorithms\u00a027(3), 277\u2013289 (2005)","journal-title":"Random Structures & Algorithms"},{"issue":"4","key":"53_CR11","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E. Friedgut","year":"1998","unstructured":"Friedgut, E.: Sharp thresholds of graph properties and the k-SAT problem. Journal of the American Mathematical Society\u00a012(4), 1017\u20131054 (1998)","journal-title":"Journal of the American Mathematical Society"},{"issue":"3","key":"53_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00493-005-0017-3","volume":"25","author":"A. Frieze","year":"2005","unstructured":"Frieze, A., Wormald, N.: Random k-Sat: A tight threshold for moderately growing k. Combinatorica\u00a025(3), 297\u2013305 (2005)","journal-title":"Combinatorica"},{"issue":"3","key":"53_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1006\/jcss.1996.0081","volume":"53","author":"A. Goerdt","year":"1996","unstructured":"Goerdt, A.: A threshold for unsatisfiability. Journal of Computer and System Sciences\u00a053(3), 469\u2013486 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"S. Kirkpatrick","year":"1994","unstructured":"Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random Boolean expressions. Science\u00a0264, 1297\u20131301 (1994)","journal-title":"Science"},{"issue":"2","key":"53_CR15","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/060662216","volume":"21","author":"D. Kravitz","year":"2007","unstructured":"Kravitz, D.: Random 2SAT does not depend on a giant. SIAM Journal on Discrete Mathematics\u00a021(2), 408\u2013422 (2007)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"53_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/rsa.20254","volume":"34","author":"M. Krivelevich","year":"2009","unstructured":"Krivelevich, M., Loh, P., Sudakov, B.: Avoiding small subgraphs in Achlioptas processes. Random Structures & Algorithms\u00a034(1), 165\u2013195 (2009)","journal-title":"Random Structures & Algorithms"},{"key":"53_CR17","doi-asserted-by":"crossref","unstructured":"Krivelevich, M., Lubetzky, E., Sudakov, B.: Hamiltonicity thresholds in Achlioptas processes. In: Random Structures & Algorithms (to appear)","DOI":"10.1002\/rsa.20302"},{"issue":"5","key":"53_CR18","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00493-007-2163-2","volume":"27","author":"J. Spencer","year":"2007","unstructured":"Spencer, J., Wormald, N.: Birth control for giants. Combinatorica\u00a027(5), 587\u2013628 (2007)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:35Z","timestamp":1606187135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}