Cycle detection (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cycle detection" in English language version.

Last modified: 19:51:39, 31 March 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2414doi.org

2^nd place

127semanticscholar.org

15^th place

8^th place

43books.google.com

3^rd place

42web.archive.org

1^st place

41anu.edu.au

514^th place

281^st place

22jstor.org

23^rd place

15^th place

21hackersdelight.org

low place

21inwap.com

low place

21adsabs.harvard.edu

14^th place

9^th place

11hdl.handle.net

66^th place

34^th place

11carleton.ca

8,980^th place

5,526^th place

11liu.se

low place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Teske, Edlyn (1998), "A space-efficient algorithm for group structure computation", Mathematics of Computation, 67 (224): 1637–1663, Bibcode:1998MaCom..67.1637T, doi:10.1090/S0025-5718-98-00968-5.

anu.edu.au (Global: 514^th place; English: 281^st place)

maths-people.anu.edu.au

Brent, R. P. (1980), "An improved Monte Carlo factorization algorithm" (PDF), BIT Numerical Mathematics , 20 (2): 176–184, doi:10.1007/BF01933190, S2CID 17181286.

books.google.com (Global: 3^rd place; English: 3^rd place)

Joux, Antoine (2009), "7. Birthday-based algorithms for functions", Algorithmic Cryptanalysis, CRC Press, p. 223, ISBN 978-1-420-07003-3.
Handbook of Applied Cryptography, by Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, p. 125, describes this algorithm and others
The Hash Function BLAKE, by Jean-Philippe Aumasson, Willi Meier, Raphael C.-W. Phan, Luca Henzen (2015), p. 21, footnote 8

carleton.ca (Global: 8,980^th place; English: 5,526^th place)

ir.library.carleton.ca

van Oorschot, Paul C.; Wiener, Michael J. (1999), "Parallel collision search with cryptanalytic applications", Journal of Cryptology, 12 (1): 1–28, doi:10.1007/PL00003816, S2CID 5091635.

doi.org (Global: 2^nd place; English: 2^nd place)

Floyd, R.W. (1967), "Nondeterministic Algorithms", J. ACM, 14 (4): 636–644, doi:10.1145/321420.321422, S2CID 1990464
Brent, R. P. (1980), "An improved Monte Carlo factorization algorithm" (PDF), BIT Numerical Mathematics , 20 (2): 176–184, doi:10.1007/BF01933190, S2CID 17181286.
Nivasch, Gabriel (2004), "Cycle detection using a stack", Information Processing Letters, 90 (3): 135–140, doi:10.1016/j.ipl.2004.01.016.
Schnorr, Claus P.; Lenstra, Hendrik W. (1984), "A Monte Carlo factoring algorithm with linear storage", Mathematics of Computation, 43 (167): 289–311, doi:10.2307/2007414, hdl:1887/3815, JSTOR 2007414.
Teske, Edlyn (1998), "A space-efficient algorithm for group structure computation", Mathematics of Computation, 67 (224): 1637–1663, Bibcode:1998MaCom..67.1637T, doi:10.1090/S0025-5718-98-00968-5.
Sedgewick, Robert; Szymanski, Thomas G.; Yao, Andrew C.-C. (1982), "The complexity of finding cycles in periodic functions", SIAM Journal on Computing, 11 (2): 376–390, doi:10.1137/0211030.
van Oorschot, Paul C.; Wiener, Michael J. (1999), "Parallel collision search with cryptanalytic applications", Journal of Cryptology, 12 (1): 1–28, doi:10.1007/PL00003816, S2CID 5091635.
Quisquater, J.-J.; Delescaille, J.-P. (1990), "How easy is collision search? Application to DES", Advances in Cryptology – EUROCRYPT '89, Workshop on the Theory and Application of Cryptographic Techniques, Lecture Notes in Computer Science, vol. 434, Springer-Verlag, pp. 429–434, doi:10.1007/3-540-46885-4_43, ISBN 978-3-540-53433-4.
Fich, Faith Ellen (1981), "Lower bounds for the cycle detection problem", Proc. 13th ACM Symposium on Theory of Computing, Stoc '81, pp. 96–105, doi:10.1145/800076.802462, ISBN 978-1-4503-7392-0, S2CID 119742106.
Allender, Eric W.; Klawe, Maria M. (1985), "Improved lower bounds for the cycle detection problem", Theoretical Computer Science, 36 (2–3): 231–237, doi:10.1016/0304-3975(85)90044-1.
Pollard, J. M. (1975), "A Monte Carlo method for factorization", BIT, 15 (3): 331–334, doi:10.1007/BF01933667, S2CID 122775546.
Pollard, J. M. (1978), "Monte Carlo methods for index computation $(mod p$ )", Mathematics of Computation, 32 (143), American Mathematical Society: 918–924, doi:10.2307/2006496, JSTOR 2006496, S2CID 235457090.
Kaliski, Burton S. Jr.; Rivest, Ronald L.; Sherman, Alan T. (1988), "Is the Data Encryption Standard a group? (Results of cycling experiments on DES)", Journal of Cryptology, 1 (1): 3–36, doi:10.1007/BF00206323, S2CID 17224075.
Van Gelder, Allen (1987), "Efficient loop detection in Prolog using the tortoise-and-hare technique", Journal of Logic Programming, 4 (1): 23–31, doi:10.1016/0743-1066(87)90020-3.

hackersdelight.org (Global: low place; English: low place)

Warren, Henry S. Jr. "Loop detectors of Floyd and Gosper". Hacker's Delight. Archived from the original on 2016-04-14. Retrieved 2017-02-08.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Schnorr, Claus P.; Lenstra, Hendrik W. (1984), "A Monte Carlo factoring algorithm with linear storage", Mathematics of Computation, 43 (167): 289–311, doi:10.2307/2007414, hdl:1887/3815, JSTOR 2007414.

inwap.com (Global: low place; English: low place)

"Hakmem -- Flows and Iterated Functions -- Draft, Not Yet Proofed". Archived from the original on 2020-03-18. Retrieved 2024-05-02.

jstor.org (Global: 23^rd place; English: 15^th place)

Schnorr, Claus P.; Lenstra, Hendrik W. (1984), "A Monte Carlo factoring algorithm with linear storage", Mathematics of Computation, 43 (167): 289–311, doi:10.2307/2007414, hdl:1887/3815, JSTOR 2007414.
Pollard, J. M. (1978), "Monte Carlo methods for index computation $(mod p$ )", Mathematics of Computation, 32 (143), American Mathematical Society: 918–924, doi:10.2307/2006496, JSTOR 2006496, S2CID 235457090.

liu.se (Global: low place; English: low place)

ep.liu.se

Auguston, Mikhail; Hon, Miu Har (1997), "Assertions for Dynamic Shape Analysis of List Data Structures", AADEBUG '97, Proceedings of the Third International Workshop on Automatic Debugging, Linköping Electronic Articles in Computer and Information Science, Linköping University, pp. 37–42.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Floyd, R.W. (1967), "Nondeterministic Algorithms", J. ACM, 14 (4): 636–644, doi:10.1145/321420.321422, S2CID 1990464
Brent, R. P. (1980), "An improved Monte Carlo factorization algorithm" (PDF), BIT Numerical Mathematics , 20 (2): 176–184, doi:10.1007/BF01933190, S2CID 17181286.
van Oorschot, Paul C.; Wiener, Michael J. (1999), "Parallel collision search with cryptanalytic applications", Journal of Cryptology, 12 (1): 1–28, doi:10.1007/PL00003816, S2CID 5091635.
Fich, Faith Ellen (1981), "Lower bounds for the cycle detection problem", Proc. 13th ACM Symposium on Theory of Computing, Stoc '81, pp. 96–105, doi:10.1145/800076.802462, ISBN 978-1-4503-7392-0, S2CID 119742106.
Pollard, J. M. (1975), "A Monte Carlo method for factorization", BIT, 15 (3): 331–334, doi:10.1007/BF01933667, S2CID 122775546.
Pollard, J. M. (1978), "Monte Carlo methods for index computation $(mod p$ )", Mathematics of Computation, 32 (143), American Mathematical Society: 918–924, doi:10.2307/2006496, JSTOR 2006496, S2CID 235457090.
Kaliski, Burton S. Jr.; Rivest, Ronald L.; Sherman, Alan T. (1988), "Is the Data Encryption Standard a group? (Results of cycling experiments on DES)", Journal of Cryptology, 1 (1): 3–36, doi:10.1007/BF00206323, S2CID 17224075.

web.archive.org (Global: 1^st place; English: 1^st place)

Warren, Henry S. Jr. "Loop detectors of Floyd and Gosper". Hacker's Delight. Archived from the original on 2016-04-14. Retrieved 2017-02-08.
"Hakmem -- Flows and Iterated Functions -- Draft, Not Yet Proofed". Archived from the original on 2020-03-18. Retrieved 2024-05-02.

Cycle detection (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

anu.edu.au (Global: 514th place; English: 281st place)

maths-people.anu.edu.au

books.google.com (Global: 3rd place; English: 3rd place)

carleton.ca (Global: 8,980th place; English: 5,526th place)

ir.library.carleton.ca

doi.org (Global: 2nd place; English: 2nd place)

hackersdelight.org (Global: low place; English: low place)

hdl.handle.net (Global: 66th place; English: 34th place)

inwap.com (Global: low place; English: low place)

jstor.org (Global: 23rd place; English: 15th place)

liu.se (Global: low place; English: low place)

ep.liu.se

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

web.archive.org (Global: 1st place; English: 1st place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

anu.edu.au (Global: 514^th place; English: 281^st place)

books.google.com (Global: 3^rd place; English: 3^rd place)

carleton.ca (Global: 8,980^th place; English: 5,526^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

hdl.handle.net (Global: 66^th place; English: 34^th place)

jstor.org (Global: 23^rd place; English: 15^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

web.archive.org (Global: 1^st place; English: 1^st place)