On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
The computational complexity of recognizing permutation functions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast construction of irreducible polynomials over finite fields
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Permutation Polynomials: A Matrix Analogue of Schur's Conjecture and a Survey of Recent Results
Finite Fields and Their Applications
Tests for Permutation Functions
Finite Fields and Their Applications
Permutation Polynomials Modulo 2w
Finite Fields and Their Applications
Full length article: Periodic representations and rational approximations of square roots
Journal of Approximation Theory
Hi-index | 0.00 |