Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
SIAM Journal on Computing
A guided tour of Chernoff bounds
Information Processing Letters
Better expansion for Ramanujan graphs
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximating Aggregate Queries about Web Pages via Random Walks
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Randomness-Efficient Sampling within NC1
Computational Complexity
Random sampling from a search engine's index
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The Gaussian algorithm for lattice reduction in dimension 2 is analysed under its standard version. It is found that, when applied to random inputs in a continuous model, the complexity is constant on average, its probability distribution decays geometrically, ...