---
res:
  bibo_abstract:
  - "The Lovász Local Lemma (LLL) is a powerful tool in probabilistic\r\ncombinatorics
    which can be used to establish the existence of objects with certain\r\nproperties.
    The breakthrough paper by Moser & Tardos (STOC’09 and JACM 2010)\r\nand follow-up
    work revealed that the LLL has intimate connections with a class of\r\nstochastic
    local search algorithms for finding such desirable objects.\r\nBesides conditions
    for convergence, many other natural questions can be asked\r\nabout algorithms;
    for instance, “are they parallelizable?”, “how many solutions can\r\nthey output?”,
    “what is the expected ‘weight’ of a solution?”. These questions and\r\nmore have
    been answered for a class of LLL-inspired algorithms called commutative. In\r\nthis
    paper we introduce a new, very natural and more general notion of commutativity\r\n(essentially
    matrix commutativity) which allows us to show a number of new refined\r\nproperties
    of LLL-inspired local search algorithms with significantly simpler proofs.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: David G.
      foaf_name: Harris, David G.
      foaf_surname: Harris
  - foaf_Person:
      foaf_givenName: Fotios
      foaf_name: Iliopoulos, Fotios
      foaf_surname: Iliopoulos
  - 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.4086/toc.2025.v021a005
  bibo_issue: '5'
  bibo_volume: 21
  dct_date: 2025^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1557-2862
  dct_language: eng
  dct_publisher: University of Chicago Press@
  dct_title: A new notion of commutativity for the algorithmic Lovász Local Lemma@
...