34 citations · 35 across the 3 of their papers we have counts for
3 papers
cs.CC2026
Separations above TFNP from Sherali-Adams Lower Bounds
Noah Fleming, Anna Gal, Deniz Imrek +1
Unlike in TFNP, for which there is an abundance of problems capturing natural existence principles which are incomparable (in the black-box setting), Kleinberg et al. [KKMP21] obse…
cs.IT2014★ 1 cited
Batch Codes through Dense Graphs without Short Cycles
Alexandros G. Dimakis, Anna Gal, Ankit Singh Rawat +1
Consider a large database of data items that need to be stored using servers. We study how to encode information so that a large number of read requests can be performe…
cs.DM2013★ 34 cited
Optimal Combinatorial Batch Codes based on Block Designs
Natalia Silberstein, Anna Gál
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an -element data set on servers in such a way that any batch of …