Citation Context

... such as for cuckoo hashing or in error-correcting codes, offering the same potential benefits for these problems. We have explored this issue further in a subsequent (albeit already published) paper =-=[30]-=-, where there remain further open questions. In particular, we have not yet found how to use the fluid limit analysis used here for these other problems. Finally, it has been remarked to us that all o...

Citation Context

...ions by combinatorial structures called stopping sets on a bipartite graph, which is related to a simple algorithm called peeling algorithm. Since peeling algorithm naturally appears in many problems =-=[7]-=-, our results may have applications also in other areas. II. PSEUDORANDOM GENERATORS, GOLDREICH’S GENERATORS A. One-way function and pseudorandom generator Definition 1 (One-way function). Let X be a ...