{"type":"journal_article","page":"213--237","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","date_created":"2018-04-03T06:17:52Z","publication":"Random Struct. Algorithms","issue":"3-4","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"status":"public","date_updated":"2022-01-06T06:55:00Z","year":"2000","_id":"2148","intvolume":"        17","language":[{"iso":"eng"}],"volume":17,"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","citation":{"ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct Algorithms</i>. 2000;17(3-4):213--237.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>Random Struct. Algorithms</i> 17, no. 3–4 (2000): 213--237.","bibtex":"@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct. Algorithms</i>, <i>17</i>(3–4), 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” <i>Random Struct. Algorithms</i>, vol. 17, no. 3–4, pp. 213--237, 2000.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>Random Struct. Algorithms</i>, vol. 17, no. 3–4, 2000, pp. 213--237."}}