{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T01:36:33Z","timestamp":1750469793306},"reference-count":22,"publisher":"Wiley","issue":"3-4","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<213::aid-rsa3>3.0.co;2-y","type":"journal-article","created":{"date-parts":[[2002,9,10]],"date-time":"2002-09-10T18:43:15Z","timestamp":1031683395000},"page":"213-237","source":"Crossref","is-referenced-by-count":8,"title":["Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov\ufffdsz local lemma"],"prefix":"10.1002","volume":"17","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/rsa.3240020403","volume":"2","author":"Alon","year":"1991","journal-title":"Random Struct Alg"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB2","first-page":"274","volume-title":"Proc 21st Annual ACM Symp Theory of Computing Seattle, May 15-17","author":"Alon","year":"1989","unstructured":"and On the complexity of radio communication, Proc 21st Annual ACM Symp Theory of Computing Seattle, May 15-17, 1989, pp. 274-285, ACM Press, New York."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"Alon","year":"1992","journal-title":"Random Struct Alg"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"Alon","year":"1991","journal-title":"Random Struct Alg"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB5","series-title":"Wiley-Intersc","volume-title":"The probabilistic method","author":"Alon","year":"1992","unstructured":"and The probabilistic method. Wiley-Interscience Ser. Discrete Math and Optimization, Wiley, New York, 1992."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","volume":"2","author":"Beck","year":"1991","journal-title":"Random Struct Alg"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB7","first-page":"531","volume-title":"Proc 29th Annual ACM Symp Theory of Computing, El Paso, TX, May 4-6, 1997","author":"Broder","unstructured":"and Static and dynamic path selection on expander graphs: a random walk approach, Proc 29th Annual ACM Symp Theory of Computing, El Paso, TX, May 4-6, 1997, pp. 531-539, ACM Press, New York."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB8","first-page":"609","volume-title":"Infinite and finite sets","volume":"II","author":"Erd?s","year":"1975","unstructured":"and Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and finite sets (to Paul Erd\ufffds on his 60th birthday), Vol II, ( and eds.) North-Holland, Amsterdam, 1975, pp. 609-627, Colloq. Math. Soc. J\ufffdnos Bolyai, Vol. 10: Infinite and Finite Sets, Keszthely, Hungary, 1973."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90040-4","volume":"30","author":"Erd?s","year":"1991","journal-title":"Discrete Appl Math"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1098-2418(199808)13:1<1::AID-RSA1>3.0.CO;2-W","volume":"13","author":"Even","year":"1998","journal-title":"Random Struct Alg"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB11","first-page":"624","volume-title":"Proc 30th Annual ACM Symp Theory of Computing, Dallas, TX, May 23-26, 1998","author":"Feige","unstructured":"and Improved bounds for acyclic job shop scheduling, Proc 30th Annual ACM Symp Theory of Computing, Dallas, TX, May 23-26, 1998, pp. 624-633, ACM Press, New York."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB12","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/BF01195001","volume":"17","author":"Hind","year":"1997","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"Leighton","year":"1994","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"Leighton","year":"1999","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB15","first-page":"643","volume-title":"Proc 10th Annual ACM-SIAM Symp Discrete Algorithms, Baltimore, January 17-19, 1999","author":"Leighton","unstructured":"and New algorithmic aspects of the local lemma with applications to routing and partitioning, Proc 10th Annual ACM-SIAM Symp Discrete Algorithms, Baltimore, January 17-19, 1999, pp. 643-652, SIAM, Philadelphia."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-662-12788-9_1","volume-title":"Probabilistic methods for algorithmic discrete mathematics","author":"Molloy","year":"1998","unstructured":"The probabilistic method, Probabilistic methods for algorithmic discrete mathematics, ( and eds.), Springer-Verlag, Berlin, 1998, pp. 1-35."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB17","first-page":"524","volume-title":"Proc 30th Annual ACM Symp Theory of Computing, Dallas, TX, May 23-26, 1998","author":"Molloy","unstructured":"and Further algorithmic aspects of the local lemma, Proc 30th Annual ACM Symp Theory of Computing, Dallas, TX, May 23-26, 1998, pp. 524-529, ACM Press, New York."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB18","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"Naor","year":"1993","journal-title":"SIAM J Comput"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB19","first-page":"684","volume-title":"Proc 39th IEEE Symp Foundations of Computer Science, Palo Alto, CA, November 8-11, 1998","author":"Radhakrishnan","unstructured":"and Improved bounds and algorithms for hypergraph two-coloring, Proc 39th IEEE Symp Foundations of Computer Science, Palo Alto, CA, November 8-11, 1998, pp. 684-693, IEEE Computer Society Press, Los Alamitos, CA."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K","volume":"27","author":"Reed","year":"1998","journal-title":"J Graph Theory"},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970074","volume-title":"Ten lectures on the probabilistic method","author":"Spencer","year":"1994","unstructured":"Ten lectures on the probabilistic method, 2nd ed., SIAM, Philadelphia, 1994."},{"key":"10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y-BIB22","first-page":"6","volume-title":"Proc 7th Annaul ACM-SIAM Symp Discrete Algorithms, Atlanta, January 28-30, 1996","author":"Srinivasan","unstructured":"An extension of the Lov\ufffdsz local lemma, and its applications to integer programming, Proc 7th Annaul ACM-SIAM Symp Discrete Algorithms, Atlanta, January 28-30, 1996, pp. 6-15, SIAM, Philadelphia."}],"container-title":["Random Structures and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1098-2418(200010%2F12)17:3%2F4%3C213::AID-RSA3%3E3.0.CO;2-Y","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1098-2418(200010\/12)17:3\/4%3C213::AID-RSA3%3E3.0.CO;2-Y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T03:19:09Z","timestamp":1625109549000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1098-2418(200010\/12)17:3\/4<213::AID-RSA3>3.0.CO;2-Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":22,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2000,10]]}},"URL":"https:\/\/doi.org\/10.1002\/1098-2418(200010\/12)17:3\/4<213::aid-rsa3>3.0.co;2-y","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}