Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
The Lovász local lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection ℬ$$ \mathcal{B} $$ of “bad” events which are mostly independent and have low probability. A seminal algorithm of Moser and Tardos (J. ACM, 2010, 57, 11) (...
Saved in:
| Published in: | Random structures & algorithms Vol. 63; no. 3; pp. 716 - 752 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
John Wiley & Sons, Inc
01.10.2023
Wiley Subscription Services, Inc |
| Subjects: | |
| ISSN: | 1042-9832, 1098-2418 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The Lovász local lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection ℬ$$ \mathcal{B} $$ of “bad” events which are mostly independent and have low probability. A seminal algorithm of Moser and Tardos (J. ACM, 2010, 57, 11) (which we call the MT algorithm) gives nearly‐automatic randomized algorithms for most constructions based on the LLL. However, deterministic algorithms have lagged behind. We address three specific shortcomings of the prior deterministic algorithms. First, our algorithm applies to the LLL criterion of Shearer (Combinatorica, 1985, 5, 241–245); this is more powerful than alternate LLL criteria and also leads to cleaner and more legible bounds. Second, we provide parallel algorithms with much greater flexibility. Third, we provide a derandomized version of the MT‐distribution, that is, the distribution of the variables at the termination of the MT algorithm. We show applications to non‐repetitive vertex coloring, independent transversals, strong coloring, and other problems. |
|---|---|
| AbstractList | The Lovász local lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection of “bad” events which are mostly independent and have low probability. A seminal algorithm of Moser and Tardos (J. ACM, 2010, 57, 11) (which we call the MT algorithm) gives nearly‐automatic randomized algorithms for most constructions based on the LLL. However, deterministic algorithms have lagged behind. We address three specific shortcomings of the prior deterministic algorithms. First, our algorithm applies to the LLL criterion of Shearer (Combinatorica, 1985, 5, 241–245); this is more powerful than alternate LLL criteria and also leads to cleaner and more legible bounds. Second, we provide parallel algorithms with much greater flexibility. Third, we provide a derandomized version of the MT‐distribution, that is, the distribution of the variables at the termination of the MT algorithm. We show applications to non‐repetitive vertex coloring, independent transversals, strong coloring, and other problems. The Lovász local lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection ℬ$$ \mathcal{B} $$ of “bad” events which are mostly independent and have low probability. A seminal algorithm of Moser and Tardos (J. ACM, 2010, 57, 11) (which we call the MT algorithm) gives nearly‐automatic randomized algorithms for most constructions based on the LLL. However, deterministic algorithms have lagged behind. We address three specific shortcomings of the prior deterministic algorithms. First, our algorithm applies to the LLL criterion of Shearer (Combinatorica, 1985, 5, 241–245); this is more powerful than alternate LLL criteria and also leads to cleaner and more legible bounds. Second, we provide parallel algorithms with much greater flexibility. Third, we provide a derandomized version of the MT‐distribution, that is, the distribution of the variables at the termination of the MT algorithm. We show applications to non‐repetitive vertex coloring, independent transversals, strong coloring, and other problems. |
| Author | Harris, David G. |
| Author_xml | – sequence: 1 givenname: David G. surname: Harris fullname: Harris, David G. email: davidgharris29@gmail.com organization: University of Maryland |
| BookMark | eNp1kMtKxDAUhoOM4HhZ-AYBV8JUk7RNE3fDeIUBwcvWEtMTzZA2Neko-jY-iy9mx85KdHUufP9_Dv82GjW-AYT2KTmihLDjENURozRnG2hMiRQJy6gYrfqMJVKkbAttx7gghBQpS8fo4RQ6CLVtbOysxso9-WC75zpi4wPungHP_evXZ_zAzmvlsIO6Vif41tatgzDBtQ-An6CBoNwEq6YaNq3qZwduF20a5SLsresOuj8_u5tdJvPri6vZdJ5oJov-MSIg07xKeWVk9qgg54JTKTQVIHjxyLgodE4zWhlWUEWkyRlLjcpMoWVVmXQHHQy-bfAvS4hdufDL0PQnSyZyWXDOU9lTxwOlg48xgCm17VRnfdMFZV1JSbkKsexDLH9C7BWHvxRtsLUK73-ya_c36-D9f7C8uZ0Oim8GRYOi |
| CitedBy_id | crossref_primary_10_1109_TIT_2024_3355416 |
| Cites_doi | 10.1017/S0963548320000127 10.1145/3230651 10.1145/1667053.1667060 10.1137/0215074 10.1109/FOCS.2015.85 10.1145/3392035 10.1007/s00493-007-2086-y 10.1007/s00493-006-0019-9 10.1007/BF01793010 10.1145/3039869 10.1002/rsa.10057 10.1137/100799642 10.1007/BF01205052 10.1145/2049697.2049702 10.1002/jgt.20300 10.1145/509907.509996 10.1007/BF02579368 10.1145/1993636.1993669 10.1007/BF01305237 10.1007/s004530010046 10.1145/2975386 10.1016/0097-3165(80)90035-7 10.1007/s00453-018-0471-0 10.1002/rsa.20914 10.1145/3474057 10.1017/S0963548311000253 10.1145/3147211 |
| ContentType | Journal Article |
| Copyright | Published 2023. This article is a U.S. Government work and is in the public domain in the USA. 2023 Wiley Periodicals LLC. |
| Copyright_xml | – notice: Published 2023. This article is a U.S. Government work and is in the public domain in the USA. – notice: 2023 Wiley Periodicals LLC. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1002/rsa.21152 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1098-2418 |
| EndPage | 752 |
| ExternalDocumentID | 10_1002_rsa_21152 RSA21152 |
| Genre | researchArticle |
| GroupedDBID | -~X .3N .4S .DC .GA .Y3 05W 0R~ 10A 123 1L6 1OB 1OC 1ZS 31~ 33P 3SF 3WU 4.4 4ZD 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHHS AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ABJNI ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACGFO ACGFS ACIWK ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN AEEZP AEIGN AEIMD AENEX AEQDE AEUQT AEUYR AFBPY AFFPM AFGKR AFPWT AFWVQ AFZJQ AHBTC AIAGR AITYG AIURR AIWBW AJBDE AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EBS EJD F00 F01 F04 FEDTE FSPIC G-S G.N GNP GODZA H.T H.X HBH HF~ HGLYW HHY HVGLF HZ~ H~9 IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M6L MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ NNB O66 O9- OIG P2P P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QRW R.K RIWAO RJQFR ROL RWI RX1 SAMSI SUPJJ TN5 TUS UB1 V2E V8K W8V W99 WBKPD WH7 WIB WIH WIK WOHZO WQJ WRC WWM WXSBR WYISQ XBAML XG1 XPP XSW XV2 ZZTAW ~IA ~WT AAMMB AAYXX AEFGJ AEYWJ AGHNM AGQPQ AGXDD AGYGG AIDQK AIDYY AIQQE AMVHM CITATION O8X 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c2972-908e4c6d36df94bae5686198c18e867b2687c5141df271a09f5223fa4f7c9ddf3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000971880500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1042-9832 |
| IngestDate | Sun Jul 13 04:26:37 EDT 2025 Sat Nov 29 02:48:14 EST 2025 Tue Nov 18 21:33:45 EST 2025 Wed Jan 22 16:14:30 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2972-908e4c6d36df94bae5686198c18e867b2687c5141df271a09f5223fa4f7c9ddf3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2859766639 |
| PQPubID | 1016429 |
| PageCount | 37 |
| ParticipantIDs | proquest_journals_2859766639 crossref_citationtrail_10_1002_rsa_21152 crossref_primary_10_1002_rsa_21152 wiley_primary_10_1002_rsa_21152_RSA21152 |
| PublicationCentury | 2000 |
| PublicationDate | October 2023 2023-10-00 20231001 |
| PublicationDateYYYYMMDD | 2023-10-01 |
| PublicationDate_xml | – month: 10 year: 2023 text: October 2023 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Hoboken |
| PublicationTitle | Random structures & algorithms |
| PublicationYear | 2023 |
| Publisher | John Wiley & Sons, Inc Wiley Subscription Services, Inc |
| Publisher_xml | – name: John Wiley & Sons, Inc – name: Wiley Subscription Services, Inc |
| References | 1990; 30 1980; 29 2010; 57 1985; 5 2013; 42 1995; 11 1986; 15 2008; 58 2020; 57 2011; 58 2001; 29 2021; DS24 1992; 12 2016; 13 2019; 81 2019; 66 2021; 18 2021; 17 2002; 21 2017; 13 2006; 26 2011; 20 2016; 63 1994; 4 2018; 14 2007; 27 2020; 29 e_1_2_10_23_1 e_1_2_10_24_1 e_1_2_10_21_1 e_1_2_10_22_1 Erdős P. (e_1_2_10_7_1) 1990; 30 e_1_2_10_2_1 e_1_2_10_4_1 e_1_2_10_18_1 e_1_2_10_3_1 e_1_2_10_19_1 e_1_2_10_6_1 e_1_2_10_16_1 e_1_2_10_5_1 e_1_2_10_8_1 e_1_2_10_14_1 e_1_2_10_15_1 e_1_2_10_12_1 e_1_2_10_9_1 e_1_2_10_13_1 e_1_2_10_10_1 Harris D. (e_1_2_10_17_1) 2016; 13 e_1_2_10_33_1 e_1_2_10_11_1 e_1_2_10_32_1 Wood D. (e_1_2_10_34_1) 2021; 24 Harris D. (e_1_2_10_20_1) 2019; 66 e_1_2_10_31_1 e_1_2_10_30_1 e_1_2_10_29_1 e_1_2_10_27_1 e_1_2_10_28_1 e_1_2_10_25_1 e_1_2_10_26_1 |
| References_xml | – volume: DS24 start-page: 1 year: 2021 end-page: 78 article-title: Nonrepetitive graph colouring publication-title: Electron. J. Comb. – volume: 4 start-page: 1 issue: 1 year: 1994 end-page: 11 article-title: RL SC publication-title: Comput. Complex. – volume: 81 start-page: 1288 issue: 3 year: 2019 end-page: 1318 article-title: Deterministic parallel algorithms for bilinear objective functions publication-title: Algorithmica – volume: 5 start-page: 241 issue: 3 year: 1985 end-page: 245 article-title: On a problem of Spencer publication-title: Combinatorica – volume: 12 start-page: 449 issue: 4 year: 1992 end-page: 461 article-title: Pseudorandom generator for space‐bounded computation publication-title: Combinatorica – volume: 26 start-page: 333 issue: 3 year: 2006 end-page: 351 article-title: Extremal problems for transversals in graphs with bounded degree publication-title: Combinatorica – volume: 66 issue: 4 year: 2019 article-title: The Moser‐Tardos framework with partial resampling publication-title: J. ACM – volume: 29 start-page: 376 issue: 3 year: 1980 end-page: 379 article-title: A remark concerning arithmetic progressions publication-title: J. Comb. Theory A – volume: 30 start-page: 151 issue: 2,3 year: 1990 end-page: 154 article-title: Lopsided Lovász local lemma and Latin transversals publication-title: Discrete Appl. Math. – volume: 14 issue: 4 year: 2018 article-title: Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász local lemma publication-title: ACM Trans. Algorithm – volume: 18 issue: 1 year: 2021 article-title: Algorithms for weighted independent transversals and strong colouring publication-title: ACM Trans. Algorithm – volume: 11 start-page: 245 issue: 3 year: 1995 end-page: 248 article-title: A condition for matchability in hypergraphs publication-title: Graph Comb. – volume: 27 start-page: 253 issue: 3 year: 2007 end-page: 267 article-title: Independent systems of representatives in weighted graphs publication-title: Combinatorica – volume: 58 issue: 6 year: 2011 article-title: New constructive aspects of the Lovász local lemma publication-title: J. ACM – volume: 13 issue: 4 year: 2017 article-title: Parallel algorithms and concentration bounds for the Lovász local lemma via witness‐DAGs publication-title: ACM Trans. Algorithm – volume: 13 issue: 3 year: 2017 article-title: Algorithmic and enumerative aspects of the Moser‐Tardos distribution publication-title: ACM Trans. Algorithm – volume: 57 issue: 2 year: 2010 article-title: A constructive proof of the general Lovász local lemma publication-title: J. ACM – volume: 17 issue: 1 year: 2021 article-title: Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász local lemma publication-title: ACM Trans. Algorithm – volume: 58 start-page: 148 issue: 2 year: 2008 end-page: 158 article-title: An improved bound for the strong chromatic number publication-title: J. Graph Theory – volume: 15 start-page: 1036 issue: 4 year: 1986 end-page: 1053 article-title: A simple parallel algorithm for the maximal independent set problem publication-title: SIAM J. Comput. – volume: 21 start-page: 336 issue: 3‐4 year: 2002 end-page: 346 article-title: Nonrepetitive colorings of graphs publication-title: Random Struct. Algorithm – volume: 57 start-page: 97 issue: 1 year: 2020 end-page: 131 article-title: New bounds for the Moser‐Tardos distribution publication-title: Random Struct. Algorithm – volume: 20 start-page: 709 issue: 5 year: 2011 end-page: 719 article-title: An improvement of the Lovász local lemma via cluster expansion publication-title: Comb. Probab. Comput. – volume: 29 start-page: 780 issue: 5 year: 2020 end-page: 806 article-title: Finding independent transversals efficiently publication-title: Comb. Probab. Comput. – volume: 63 issue: 5 year: 2016 article-title: The local lemma is asymptotically tight for SAT publication-title: J. ACM – volume: 29 start-page: 371 issue: 3 year: 2001 end-page: 395 article-title: Solving some discrepancy problems in NC publication-title: Algorithmica – volume: 42 start-page: 2132 issue: 6 year: 2013 end-page: 2155 article-title: Deterministic algorithms for the Lovász local lemma publication-title: SIAM J. Comput. – volume: 13 issue: 1 year: 2016 article-title: Lopsidependency in the Moser‐Tardos framework: beyond the Lopsided Lovász local lemma publication-title: ACM Trans. Algorithm – volume: 66 issue: 4 year: 2019 ident: e_1_2_10_20_1 article-title: The Moser‐Tardos framework with partial resampling publication-title: J. ACM – volume: 24 start-page: 1 year: 2021 ident: e_1_2_10_34_1 article-title: Nonrepetitive graph colouring publication-title: Electron. J. Comb. – ident: e_1_2_10_21_1 – ident: e_1_2_10_10_1 doi: 10.1017/S0963548320000127 – ident: e_1_2_10_14_1 doi: 10.1145/3230651 – ident: e_1_2_10_28_1 doi: 10.1145/1667053.1667060 – volume: 13 issue: 1 year: 2016 ident: e_1_2_10_17_1 article-title: Lopsidependency in the Moser‐Tardos framework: beyond the Lopsided Lovász local lemma publication-title: ACM Trans. Algorithm – ident: e_1_2_10_26_1 doi: 10.1137/0215074 – ident: e_1_2_10_22_1 doi: 10.1109/FOCS.2015.85 – ident: e_1_2_10_18_1 doi: 10.1145/3392035 – ident: e_1_2_10_2_1 doi: 10.1007/s00493-007-2086-y – ident: e_1_2_10_33_1 doi: 10.1007/s00493-006-0019-9 – ident: e_1_2_10_23_1 doi: 10.1007/BF01793010 – ident: e_1_2_10_19_1 doi: 10.1145/3039869 – ident: e_1_2_10_3_1 doi: 10.1002/rsa.10057 – ident: e_1_2_10_6_1 doi: 10.1137/100799642 – ident: e_1_2_10_9_1 – ident: e_1_2_10_30_1 doi: 10.1007/BF01205052 – ident: e_1_2_10_13_1 doi: 10.1145/2049697.2049702 – ident: e_1_2_10_24_1 doi: 10.1002/jgt.20300 – ident: e_1_2_10_32_1 doi: 10.1145/509907.509996 – ident: e_1_2_10_31_1 doi: 10.1007/BF02579368 – ident: e_1_2_10_25_1 doi: 10.1145/1993636.1993669 – ident: e_1_2_10_29_1 doi: 10.1007/BF01305237 – ident: e_1_2_10_27_1 doi: 10.1007/s004530010046 – ident: e_1_2_10_8_1 doi: 10.1145/2975386 – ident: e_1_2_10_4_1 doi: 10.1016/0097-3165(80)90035-7 – ident: e_1_2_10_15_1 doi: 10.1007/s00453-018-0471-0 – ident: e_1_2_10_16_1 doi: 10.1002/rsa.20914 – ident: e_1_2_10_11_1 doi: 10.1145/3474057 – ident: e_1_2_10_5_1 doi: 10.1017/S0963548311000253 – volume: 30 start-page: 151 issue: 2 year: 1990 ident: e_1_2_10_7_1 article-title: Lopsided Lovász local lemma and Latin transversals publication-title: Discrete Appl. Math. – ident: e_1_2_10_12_1 doi: 10.1145/3147211 |
| SSID | ssj0007323 |
| Score | 2.3737695 |
| Snippet | The Lovász local lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection ℬ$$... The Lovász local lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection of “bad”... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 716 |
| SubjectTerms | Algorithms Coloring derandomization independent transversal LLL Lovász Local Lemma Probability theory strong coloring |
| Title | Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1002%2Frsa.21152 https://www.proquest.com/docview/2859766639 |
| Volume | 63 |
| WOSCitedRecordID | wos000971880500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1098-2418 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007323 issn: 1042-9832 databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NSsQwEA6LetCD_-I_QTx42Oo2aZNUT6IuHlTEVfBkSZpEF7q70q4efBufxRdz0na7CgqCt1KmTZnJzHxTJt8gtKtCn0FiUZ6v3JEcw6WnuCJeRC1lzBUURBXDJvjVlbi_j64b6Gh0Fqbkh6h_uDnPKOK1c3Cp8oMxaWiWy32oXkKIv5PuUBVUXpOnN-27izoQc0rK_voA1oadOyIWapGD-uHv6WiMMb8i1SLVtOf-9ZHzaLZCmPi43BILqGH6i2jmsqZnzZfQw2nVBFOwNGOZPg6y7vCpl2OAsBgE8cXg9eM9f8NFqsOp6fXkIe50HZVw1sSuORc_loTVTSz7urzjaMTT1KTL6K59dnty7lWDFryERByU0xImSJimTNsoUNKETEBhJRJfGMHAdEzwBJCVry3hvmxFFlAbtTKwPIm0tnQFTfQHfbOKMAHAQGhgBQ1EYIgvQx1qZaHwZGB2Ha6hvZG-46RiIXfDMNK45E8mMagsLlS2hnZq0eeSeuMnoc2R0eLK-_LYkfJxqMtoBMsV5vn9BfFN57i4WP-76AaadlPny56-TTQxzF7MFppKXofdPNuutuEnTiffYg |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB6hBQl6gJaHyqu1EAcOBDZ2YjuICyqsQF1WiIfEiciJbbpSdrdKthz6b_gt_DHGSTYUCaRK3KJoHEczY8831vgbgO0k9DkGlsTzE3clxwjlJSKhXsQs49wlFDQpm02IXk_e3kYXU3A4uQtT8UM0B25uZZT7tVvg7kB6_4U1NC_UHqYvIW7A0wFnQrZg-viyc9NtdmLBaFVgH-Dk6LoTZqE23W8Gv45HLyDzX6haxprOwsf-8jPM1xiTHFVO8QWmzHARPp03BK3FEtwd12UwJU8zUdn9KO-Pfw0KgiCWoCDpjh6eHou_pAx2JDODgTogV31HJpzvEleeS-4ryupdooa6euOIxLPMZMtw0zm5_nHq1a0WvJRGArXTliZIuWZc2yhIlAm5xNRKpr40kqPxuBQpYitfWyp81Y4s4jZmVWBFGmlt2Qq0hqOh-QqEImSgLLCSBTIw1FehDnViMfXkaHgdrsLOROFxWvOQu3YYWVwxKNMYVRaXKluFrUb0d0W-8ZbQxsRqcb3-itjR8gnMzFiE05X2ef8D8eXVUfmw9v-i32H29Pq8G3fPej_XYc71oK8q_DagNc7_mE2YSR_G_SL_VvvkM7YL41I |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1fa9swED9COkb3sH9dWbduFWMPe6jXWJIleeylNAsby0JpF8jTjGxJbcBJip31Yd9mn6VfrCfbcTrooNA3Y86WuT-635nT7wDep1EoMLGkQZj6IzlW6iCVKQ1i5pgQvqCgaTVsQo5GajKJjzvweXUWpuaHaH-4-cio9msf4PbCuIM1a2hR6o9YvkS4AW_wKI54Fzb6J4PxsN2JJaN1gz3HxdF1V8xCPXrQPvxvPlqDzJtQtco1gyf3-8qn8LjBmOSwdopn0LHz5_DoR0vQWm7Br37TBlPxNBOdny2K6fJ8VhIEsQQFyXBxefW3_EOqZEdyO5vpT-R06smEi33i23PJWU1ZvU_03NR3PJF4ntv8BYwHX34efQ2aUQtBRmOJ2ukpyzNhmDAu5qm2kVBYWqksVFYJNJ5QMkNsFRpHZah7sUPcxpzmTmaxMY5tQ3e-mNuXQChCBsq4U4wrbmmoIxOZ1GHpKdDwJtqBDyuFJ1nDQ-7HYeRJzaBME1RZUqlsB961ohc1-cZtQrsrqyVN_JWJp-WTWJmxGJer7PP_FyQnp4fVxau7i-7Bw-P-IBl-G31_DZt-BH3d4LcL3WXx276BB9nlcloWbxuXvAZqy-LN |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Deterministic+algorithms+for+the+Lov%C3%A1sz+local+lemma%3A+Simpler%2C+more+general%2C+and+more+parallel&rft.jtitle=Random+structures+%26+algorithms&rft.au=Harris%2C+David+G.&rft.date=2023-10-01&rft.issn=1042-9832&rft.eissn=1098-2418&rft.volume=63&rft.issue=3&rft.spage=716&rft.epage=752&rft_id=info:doi/10.1002%2Frsa.21152&rft.externalDBID=n%2Fa&rft.externalDocID=10_1002_rsa_21152 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1042-9832&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1042-9832&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1042-9832&client=summon |