{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:46Z","timestamp":1750306966987,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1145\/2488608.2488696","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"685-694","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Constraint satisfaction, packet routing, and the lovasz local lemma"],"prefix":"10.1145","author":[{"given":"David G.","family":"Harris","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02783300"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"Alon N.","year":"2008","unstructured":"N. Alon and J. H. Spencer . The Probabilistic Method , Third Edition. John Wiley & Sons, Inc. , 2008 . N. Alon and J. H. Spencer. The Probabilistic Method, Third Edition. John Wiley & Sons, Inc., 2008."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00219-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90022-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90022-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240040403"},{"key":"e_1_3_2_1_7_1","first-page":"272","volume-title":"Proc. International Conference on Automata, Languages and Programming","author":"Bulatov A.","year":"2002","unstructured":"A. Bulatov , P. Jeavons , and A. A. Krokhin . Constraint satisfaction problems and finite algebras . In Proc. International Conference on Automata, Languages and Programming , pages 272 -- 282 , 2002 . A. Bulatov, P. Jeavons, and A. A. Krokhin. Constraint satisfaction problems and finite algebras. In Proc. International Conference on Automata, Languages and Programming, pages 272--282, 2002."},{"key":"e_1_3_2_1_8_1","first-page":"39","volume-title":"Algorithms and Combinatorics","volume":"8","author":"Cochand M.","year":"1989","unstructured":"M. Cochand and P. Duchet . A few remarks on orientations of graphs and Ramsey theory. In G. Hal\u00e1sz and V. T. S\u00f3s, editors, Irregularities of Partitions , Algorithms and Combinatorics , volume 8 , pages 39 -- 46 . 1989 . M. Cochand and P. Duchet. A few remarks on orientations of graphs and Ramsey theory. In G. Hal\u00e1sz and V. T. S\u00f3s, editors, Irregularities of Partitions, Algorithms and Combinatorics, volume 8, pages 39--46. 1989."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00323-9"},{"key":"e_1_3_2_1_10_1","series-title":"Colloq","first-page":"609","volume-title":"Infinite and Finite Sets","author":"Hos P.","year":"1975","unstructured":"P. Erd\\ Hos and L. Lov\u00e1sz . Problems and results on $3$-chromatic hypergraphs and some related questions . In Infinite and Finite Sets , volume 11 of Colloq . Math. Soc. J. Bolyai, pages 609 -- 627 . North-Holland , 1975 . P. Erd\\Hos and L. Lov\u00e1sz. Problems and results on $3$-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, volume 11 of Colloq. Math. Soc. J. Bolyai, pages 609--627. North-Holland, 1975."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133088"},{"key":"e_1_3_2_1_12_1","first-page":"13","article-title":"Forbidding prescribed distances for designated colors","volume":"2","author":"Greenwell D.","year":"1992","unstructured":"D. Greenwell and P. Johnson Jr . Forbidding prescribed distances for designated colors . Geombinatorics , 2 : 13 -- 16 , 1992 . D. Greenwell and P. Johnson Jr. Forbidding prescribed distances for designated colors. Geombinatorics, 2:13--16, 1992.","journal-title":"Geombinatorics"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049702"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301004758"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00031-5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840353"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993669"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700379760"},{"key":"e_1_3_2_1_19_1","unstructured":"F. T. Leighton B. M. Maggs and S. B. Rao. Packet routing and jobshop scheduling in $O($congestion  F. T. Leighton B. M. Maggs and S. B. Rao. Packet routing and jobshop scheduling in $O($congestion"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"dilation$)$ steps. Combinatorica 14:167--186 1994.  dilation$)$ steps. Combinatorica 14:167--186 1994.","DOI":"10.1007\/BF01215349"},{"key":"e_1_3_2_1_21_1","volume-title":"Graph Colouring and the Probabilistic Method","author":"Molloy M.","year":"2001","unstructured":"M. Molloy and B. Reed . Graph Colouring and the Probabilistic Method . Springer-Verlag , 2001 . M. Molloy and B. Reed. Graph Colouring and the Probabilistic Method. Springer-Verlag, 2001."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250767"},{"key":"e_1_3_2_1_24_1","volume-title":"An extension of the Moser-Tardos algorithmic Local Lemma. Arxiv 1102.2583","author":"Pegden W.","year":"2011","unstructured":"W. Pegden . An extension of the Moser-Tardos algorithmic Local Lemma. Arxiv 1102.2583 , 2011 . W. Pegden. An extension of the Moser-Tardos algorithmic Local Lemma. Arxiv 1102.2583, 2011."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2018158.2018187"},{"key":"e_1_3_2_1_26_1","first-page":"211","volume-title":"Graphs, Hypergraphs, and Block Systems","author":"R\u00f6dl V.","year":"1976","unstructured":"V. R\u00f6dl . A generalization of Ramsey theorem . In Graphs, Hypergraphs, and Block Systems , pages 211 -- 220 . Zielona Gora , 1976 . V. R\u00f6dl. A generalization of Ramsey theorem. In Graphs, Hypergraphs, and Block Systems, pages 211--220. Zielona Gora, 1976."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80023-8"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_29"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0052928","volume-title":"Universal routing strategies for interconnection networks","author":"Scheideler C.","year":"1998","unstructured":"C. Scheideler . Universal routing strategies for interconnection networks . In Lecture Notes in Computer Science , volume 1390 . Springer , 1998 . C. Scheideler. Universal routing strategies for interconnection networks. In Lecture Notes in Computer Science, volume 1390. Springer, 1998."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579368"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703434620"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Palo Alto California USA","acronym":"STOC'13"},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488696","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":31,"alternative-id":["10.1145\/2488608.2488696","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488696","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}