The following pages link to Lianna Hambardzumyan (Q2081470):
Displayed 9 items.
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471) (← links)
- Lower bounds for graph bootstrap percolation via properties of polynomials (Q2174952) (← links)
- Chang's lemma via Pinsker's inequality (Q2279257) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- (Q5091215) (← links)
- Graphs, Disjoint Matchings and Some Inequalities (Q6268177) (← links)
- Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions (Q6314336) (← links)
- On depth-3 circuits and covering number: an explicit counter-example (Q6414040) (← links)
- An improved protocol for ExactlyN with more than 3 players (Q6450903) (← links)