---
res:
  bibo_abstract:
  - We consider the recent formulation of the algorithmic Lov ́asz Local Lemma  [N.
    Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas
    and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F.
    Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms,
    arXiv preprint, 2018] for finding objects that avoid“bad  features,”  or  “flaws.”   It  extends  the  Moser–Tardos  resampling  algorithm  [R.  A.  Moser  andG.
    Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces.  At each step the
    method picks aflaw present in the current state and goes to a new state according
    to some prespecified probabilitydistribution (which depends on the current state
    and the selected flaw).  However, the recent formu-lation is less flexible than
    the Moser–Tardos method since it requires a specific flaw selection rule,whereas
    the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially
    beimplemented more efficiently).  We formulate a new “commutativity” condition
    and prove that it issufficient for an arbitrary rule to work.  It also enables
    an efficient parallelization under an additionalassumption.  We then show that
    existing resampling oracles for perfect matchings and permutationsdo satisfy this
    condition.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vladimir
      foaf_name: Kolmogorov, Vladimir
      foaf_surname: Kolmogorov
      foaf_workInfoHomepage: http://www.librecat.org/personId=3D50B0BA-F248-11E8-B48F-1D18A9856A87
  bibo_doi: 10.1137/16m1093306
  bibo_issue: '6'
  bibo_volume: 47
  dct_date: 2018^xs_gYear
  dct_identifier:
  - UT:000453785100001
  dct_isPartOf:
  - http://id.crossref.org/issn/0097-5397
  - http://id.crossref.org/issn/1095-7111
  dct_language: eng
  dct_publisher: Society for Industrial and Applied Mathematics@
  dct_title: Commutativity in the algorithmic Lovász local lemma@
...