Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics
Pattern matching in lempel-Ziv compressed strings: fast, simple, and deterministic
ESA'11 Proceedings of the 19th European conference on Algorithms
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...