Asymptotics of subtracted singularities for generating functions with small singularities
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Polynomials over finite fields free from large and small degree irreducible factors
Journal of Algorithms - Analysis of algorithms
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem
Designs, Codes and Cryptography
Polynomial factorization: a success story
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The average lengths of the factors of the standard factorization of lyndon words
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Generating series for irreducible polynomials over finite fields
Finite Fields and Their Applications
| Hi-index | 0.00 |