[{"dc":{"date":["2000"],"identifier":["https://ris.uni-paderborn.de/record/2148"],"title":["Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma"],"creator":["Czumaj, Artur","Scheideler, Christian"],"source":["Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237."],"rights":["info:eu-repo/semantics/closedAccess"],"type":["info:eu-repo/semantics/article","doc-type:article","text","http://purl.org/coar/resource_type/c_6501"],"language":["eng"]},"user_id":"14955","volume":17,"dini_type":"doc-type:article","date_created":"2018-04-03T06:17:52Z","status":"public","department":[{"_id":"79","tree":[{"_id":"7"},{"_id":"34"},{"_id":"44"},{"_id":"43"}]},{"tree":[{"_id":"7"},{"_id":"34"},{"_id":"44"},{"_id":"43"}],"_id":"63"}],"publication":"Random Struct. Algorithms","author":[{"first_name":"Artur","last_name":"Czumaj"},{"first_name":"Christian","id":"20792","last_name":"Scheideler"}],"creator":{"login":"florida","id":"15504"},"issue":"3-4","_id":"2148","intvolume":" 17","date_updated":"2022-01-06T06:55:00Z","page":"213--237","uri_base":"https://ris.uni-paderborn.de","citation":{"mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 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} }","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 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.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237."},"type":"journal_article","language":[{}]}]