Pages that link to "Item:Q3578191"
From MaRDI portal
The following pages link to A constructive proof of the general lovász local lemma (Q3578191):
Displaying 32 items.
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- Dynamic Sampling from Graphical Models (Q5858642) (← links)
- (Q5875457) (← links)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks (Q5919324) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Counting colorings of triangle-free graphs (Q6038582) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Extremal bipartite independence number and balanced coloring (Q6115783) (← links)
- Measurable graph combinatorics (Q6119672) (← links)
- Inapproximability of counting independent sets in linear hypergraphs (Q6121429) (← links)
- Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
- Edge colorings avoiding patterns (Q6181991) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- An extension of a construction of covering arrays (Q6188123) (← links)
- Optimization in graphical small cancellation theory (Q6197706) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
- Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters (Q6201902) (← links)
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions (Q6571302) (← links)
- Fundamentals of partial rejection sampling (Q6601395) (← links)
- A note on the \(k\)-restriction problem (Q6602326) (← links)
- A survey of cover-free families: constructions, applications, and generalizations (Q6613366) (← links)
- An algorithmic construction of union-intersection-bounded families (Q6615223) (← links)
- Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity (Q6633135) (← links)
- An efficient algorithm for group testing with runlength constraints (Q6648259) (← links)
- Combinatorial constructions of separating codes (Q6649717) (← links)
- Partitioning problems via random processes (Q6658754) (← links)
- Non-constructive upper bounds for repetition thresholds (Q6661757) (← links)
