The following pages link to Omri Ben-Eliezer (Q777479):
Displayed 22 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)
- (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)
- Adversarial laws of large numbers and optimal regret in online classification (Q6087016) (← links)
- Testing hereditary properties of ordered graphs and matrices (Q6285278) (← links)
- Ordered Graph Limits and Their Applications (Q6309246) (← links)
- Testing local properties of arrays (Q6309907) (← links)
- Optimal Adaptive Detection of Monotone Patterns (Q6328468) (← links)
- Information Spread with Error Correction (Q6372721) (← links)
- Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions (Q6407940) (← links)
- Is this correct? Let's check! (Q6418113) (← links)