The following pages link to Shay Moran (Q251886):
Displaying 33 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Shattering, graph orientations, and connectivity (Q396883) (← links)
- A Sauer-Shelah-Perles lemma for sumsets (Q1627216) (← links)
- On the perceptron's compression (Q2106618) (← links)
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes (Q2121466) (← links)
- A Sauer-Shelah-Perles lemma for lattices (Q2209889) (← links)
- On weak \(\epsilon\)-nets and the Radon number (Q2223615) (← links)
- Twenty (short) questions (Q2322544) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Labeled Compression Schemes for Extremal Classes (Q2830265) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Direct sum fails for zero error average communication (Q2988905) (← links)
- Sample Compression Schemes for VC Classes (Q3177793) (← links)
- Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper (Q3379608) (← links)
- Node-Balancing by Edge-Increments (Q3452807) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Hitting Set for hypergraphs of low VC-dimension (Q4606292) (← links)
- Shattered Sets and the Hilbert Function (Q4608633) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Learners that Use Little Information (Q4617590) (← links)
- Twenty (simple) questions (Q4977956) (← links)
- (Q5002761) (← links)
- (Q5088983) (← links)
- (Q5091184) (← links)
- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (Q5167784) (← links)
- Private PAC learning implies finite Littlestone dimension (Q5212825) (← links)
- Near-optimal linear decision trees for k-SUM and related problems (Q5230319) (← links)
- Near-optimal Linear Decision Trees for k-SUM and Related Problems (Q5244388) (← links)
- Internal Compression of Protocols to Entropy (Q5351918) (← links)
- Private and Online Learnability Are Equivalent (Q5889789) (← links)
- A note on average-case sorting (Q5965138) (← links)
- (Q6126292) (← links)
