Finding small simple cycle separators for 2-connected planar graphs.
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography. As an application for this technique, we present a provably secure protocol for One-Bit Disclosures i.e. for giving a one-bit ...