The following pages link to Omri Ben-Eliezer (Q777479):
Displaying 18 items.
- The hat guessing number of graphs (Q777481) (← links)
- Local and global colorability of graphs (Q898084) (← links)
- Efficient removal lemmas for matrices (Q2183099) (← links)
- Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520) (← links)
- Improved Bounds for Testing Forbidden Order Patterns (Q4608030) (← links)
- Efficient Removal Lemmas for Matrices (Q5002628) (← links)
- What Is Learned in Knowledge Graph Embeddings? (Q5050385) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- (Q5090383) (← links)
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays (Q5111338) (← links)
- Semi‐random graph process (Q5113951) (← links)
- Earthmover Resilience and Testing in Ordered Structures (Q5121906) (← links)
- Very fast construction of bounded-degree spanning graphs via the semi-random graph process (Q5146812) (← links)
- (Q5875702) (← links)
- Testing local properties of arrays (Q6309907) (← links)
- Adversarially robust streaming via dense-sparse trade-offs (Q6538779) (← links)
- Finding monotone patterns in sublinear time, adaptively (Q6560801) (← links)
- Is this correct? Let's check! (Q6610277) (← links)
