The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Average Bit-Complexity of Euclidean Algorithms
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Dynamical analysis of a class of Euclidean algorithms
Theoretical Computer Science - Latin American theoretical informatics
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
Combinatorics, Probability and Computing
Concentration of Size and Path Length of Tries
Combinatorics, Probability and Computing
Pseudorandomness of a random kronecker sequence
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Multiple GCDs. probabilistic analysis of the plain algorithm
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 5.23 |