The following pages link to Ago-Erik Riet (Q324840):
Displaying 12 items.
- Graph saturation games (Q324842) (← links)
- Completing partial packings of bipartite graphs (Q640856) (← links)
- (Q2035131) (redirect page) (← links)
- Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes (Q2035132) (← links)
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space (Q2121804) (← links)
- \(\mathcal{F}\)-saturation games (Q2515577) (← links)
- On some batch code properties of the simplex code (Q2701478) (← links)
- Additive properties of a pair of sequences (Q3184345) (← links)
- Batch Codes for Asynchronous Recovery of Data (Q5080010) (← links)
- Permutation codes, source coding and a generalisation of Bollob\'as-Lubell-Yamamoto-Meshalkin and Kraft inequalities (Q6269766) (← links)
- Equal Requests are Asymptotically Hardest for Data Recovery (Q6533166) (← links)
- PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound (Q6737947) (← links)
