The following pages link to Guy Wolfovitz (Q410734):
Displaying 12 items.
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- Lower bounds for the size of random maximal \(H\)-free graphs (Q1010905) (← links)
- Bounds on the number of maximal sum-free sets (Q1039444) (← links)
- \(K_4\)-free graphs without large induced triangle-free subgraphs (Q2250854) (← links)
- 4-cycles at the triangle-free process (Q2851522) (← links)
- Sub-Gaussian Tails for the Number of Triangles in<i>G</i>(<i>n, p</i>) (Q3068819) (← links)
- A concentration result with application to subgraph count (Q3119051) (← links)
- Bounds on the Number of Maximal Sum-Free Sets (Q3503488) (← links)
- A New Derandomization of Auctions (Q3648858) (← links)
- Hats, auctions and derandomization (Q5252259) (← links)
- Triangle‐free subgraphs in the triangle‐free process (Q5388974) (← links)