9 citations to 10.1007/s00039-010-0089-0 (Crossref Cited-By Service)

1. Paul Pollack, “Two remarks on iterates of Euler’s totient function”, Arch. Math., 97, no. 5, 2011, 443  
2. Louigi Addario-Berry, Kevin Ford, “Poisson–Dirichlet branching random walks”, Ann. Appl. Probab., 23, no. 1, 2013  
3. Kevin Ford, “Sieving Very Thin Sets of Primes, and Pratt Trees with Missing Primes”, International Mathematics Research Notices, 2014, no. 11, 2014, 2955  
4. M. A. Cherepniov, “Pairing Inversion for Finding Discrete Logarithms”, J Math Sci, 206, no. 6, 2015, 734  
5. Ilya Mironov, Noah Stephens-Davidowitz, 9057, Advances in Cryptology - EUROCRYPT 2015, 2015, 657  
6. Gérald Tenenbaum, 25, Erdős Centennial, 2013, 651  
7. Kevin Ford, Florian Luca, “The Number of Solutions of λ(x) = n”, Integers, 11, no. 4, 2011  
8. Mikhail Cherepniov, “Comparison of the complexity of Diffie–Hellman and discrete logarithm problems”, J Comput Virol Hack Tech, 16, no. 4, 2020, 265  
9. James Maynard, Analytic Number Theory, 2015, 253