Cycle detection: Revision history

21 May 2025

• curprev 06:1106:11, 21 May 2025 2600:1700:5f20:2e40:2001:16b7:d615:9564 talk 34,729 bytes −67 →Brent's algorithm: I think the comment I deleted was net unhelpful, or should at least instead read "repeat lam times" or something, given that the "list" is irrelevant. undo

29 December 2024

• curprev 05:4105:41, 29 December 2024 Citation bot talk contribs 34,796 bytes +41 Add: isbn, series. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Combinatorial algorithms | #UCB_Category 3/24 undo
• curprev 04:3404:34, 29 December 2024 Citation bot talk contribs 34,755 bytes +35 Add: isbn, date. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Combinatorial algorithms | #UCB_Category 7/24 undo

6 December 2024

• curprev 05:3105:31, 6 December 2024 97.102.205.224 talk 34,720 bytes +35 →Definitions: Since we're being formal here, call f an endofunction. Not used earlier because it's an uncommon technical term which would give pause to lay readers of the lead. undo
• curprev 05:0005:00, 6 December 2024 97.102.205.224 talk 34,685 bytes +902 →Computer representation: Added a whole paragraph explaining the recurrence function f and why it might not be usable in practice. This also adds a (fourth!) explanation of the nature of the recurrence, hopefully addressing prior concerns. undo
• curprev 00:2800:28, 6 December 2024 97.102.205.224 talk 33,783 bytes +59 →Computer representation: Tried to clarify recurrent nature of function use. undo
• curprev 00:2300:23, 6 December 2024 97.102.205.224 talk 33,724 bytes +70 →Computer representation: Added back mention of pointer algorithm that was deleted in recent edit. (With wiklink, this time!) undo
• curprev 00:1800:18, 6 December 2024 97.102.205.224 talk 33,654 bytes +210 Undid revision 1261289693 by David Eppstein (talk) See talk page; the objection is based on a misunderstanding of the problem to be solved. We can work on wording changes to prevent the misunderstanding, but that's best done from the edited baseline. undo Tag: Undo
• curprev 00:1700:17, 6 December 2024 97.102.205.224 talk 33,444 bytes +322 Undid revision 1261289773 by David Eppstein (talk) See talk page; the objection is based on a misunderstanding of the problem to be solved. undo Tag: Undo

5 December 2024

• curprev 08:1808:18, 5 December 2024 David Eppstein talk contribs 33,122 bytes −322 →Computer representation: For the same reason, the supposed "associative array" solution doesn't work and should not be justified as a reason for using cycle detection algorithms undo Tag: Reverted
• curprev 08:1708:17, 5 December 2024 David Eppstein talk contribs 33,444 bytes −210 Remove bogus claim that finding the first repeated value in an associative array is helpful in finding a cycle. Repetitions are not necessarily associated with cycles. undo Tag: Reverted
• curprev 07:4007:40, 5 December 2024 97.102.205.224 talk 33,654 bytes −393 →Computer representation: Complete rewrite of section. Keeping Pollard's rho algorithm example, but description rewritten de novo. undo

4 December 2024

• curprev 06:3906:39, 4 December 2024 97.102.205.224 talk 34,047 bytes +1,146 →Gosper's algorithm: Describe the algorithm, in addition to its properties. Give a more realistic 32-bit example. undo

3 December 2024

• curprev 17:3217:32, 3 December 2024 97.102.205.224 talk 32,901 bytes +756 →Definitions: Improve citation to Antoine Joux's book, particularly with an author-link. Add a paragraph describing limitations of practical algorithms: they find bounds on μ and may find a multiple of λ. This is to counteract the impression left by the definition in the paragraph that the algorithm finds exact solutions. undo

7 November 2024

• curprev 09:0309:03, 7 November 2024 192.122.132.252 talk 32,145 bytes +4 fix line breaking in code undo
• curprev 09:0209:02, 7 November 2024 192.122.132.252 talk 32,141 bytes +69 added comment to example code undo

20 August 2024

• curprev 21:1821:18, 20 August 2024 Onel5969 talk contribs m 32,072 bytes +19 Disambiguating links to Deadlock (link changed to Deadlock (computer science)) using DisamAssist. undo

20 June 2024

• curprev 06:3606:36, 20 June 2024 Zingarese talk contribs m 32,053 bytes +3 Reverted edits by 49.156.83.171 (talk): disruptive edits (HG) (3.4.12) undo Tags: Huggle Rollback
• curprev 06:3506:35, 20 June 2024 49.156.83.171 talk 32,050 bytes −3 →Brent's algorithm undo Tags: Reverted Visual edit

9 May 2024

• curprev 04:3304:33, 9 May 2024 WikiCleanerBot talk contribs m 32,053 bytes −15 v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation - Title linked in text) undo Tag: WPCleaner

2 May 2024

• curprev 21:0221:02, 2 May 2024 178.143.40.241 talk 32,068 bytes +146 →Gosper's algorithm: archive link undo
• curprev 20:3620:36, 2 May 2024 178.143.40.241 talk 31,922 bytes −11 →Advantages: fix error in logical reasoning undo

8 November 2023

• curprev 10:1910:19, 8 November 2023 OAbot talk contribs m 31,933 bytes +16 Open access bot: doi updated in citation with #oabot. undo

1 November 2023

• curprev 17:4717:47, 1 November 2023 Trappist the monk talk contribs m 31,917 bytes −6 cite repair; undo Tag: AWB

16 October 2023

• curprev 05:4305:43, 16 October 2023 Bubba73 talk contribs 31,923 bytes +13 →Brent's algorithm undo

11 October 2023

• curprev 08:2308:23, 11 October 2023 Cedar101 talk contribs m 31,910 bytes +22 →Applications: fix math italics undo
• curprev 07:5807:58, 11 October 2023 2a02:3035:616:1257:d83c:4106:af24:ac58 talk 31,888 bytes 0 grammar undo

31 August 2023

• curprev 03:2703:27, 31 August 2023 Catttte talk contribs m 31,888 bytes −43 →Example: make image caption more descriptive undo Tag: Visual edit

24 August 2023

• curprev 07:5907:59, 24 August 2023 OAbot talk contribs m 31,931 bytes +16 Open access bot: doi updated in citation with #oabot. undo

17 June 2023

• curprev 21:1221:12, 17 June 2023 46.13.25.245 talk 31,915 bytes +1 →Gosper's algorithm: eg. -> i.e. undo
• curprev 21:0921:09, 17 June 2023 46.13.25.245 talk 31,914 bytes −5 →Brent's algorithm: simplify type hint undo
• curprev 21:0821:08, 17 June 2023 46.13.25.245 talk 31,919 bytes −5 →Floyd's tortoise and hare: simplify type hint undo

12 March 2023

• curprev 00:5800:58, 12 March 2023 Pmw2piVB talk contribs 31,924 bytes +42 Importing Wikidata short description: "Algorithmic problem" undo Tag: Shortdesc helper

9 March 2023

• curprev 17:1117:11, 9 March 2023 David Eppstein talk contribs 31,882 bytes −1 Undid revision 1143737611 by Arambasek10 (talk) incorrect. That would say that all elements after a certain value have the same value as the loop start. undo Tag: Undo
• curprev 15:4715:47, 9 March 2023 Arambasek10 talk contribs m 31,883 bytes +1 →Floyd's tortoise and hare: I made an edit to the mathematical formulation of the "key insight" as I believe there was a typo. undo Tag: Reverted

30 January 2023

• curprev 04:5204:52, 30 January 2023 OAbot talk contribs m 31,882 bytes +16 Open access bot: doi added to citation with #oabot. undo

25 January 2023

• curprev 11:5211:52, 25 January 2023 Frap talk contribs 31,866 bytes +128 →Algorithms: type hint undo

24 January 2023

• curprev 01:0001:00, 24 January 2023 Citation bot talk contribs 31,738 bytes +17 Add: s2cid. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 1525/3000 undo

23 January 2023

• curprev 12:1012:10, 23 January 2023 212.17.33.98 talk 31,721 bytes −12 →Floyd's tortoise and hare undo
• curprev 12:1012:10, 23 January 2023 212.17.33.98 talk 31,733 bytes +9 →Floyd's tortoise and hare undo

12 January 2023

• curprev 12:4112:41, 12 January 2023 Dimadick talk contribs 31,724 bytes +39 →External links undo

7 November 2022

• curprev 09:4209:42, 7 November 2022 85.51.16.178 talk 31,685 bytes −3 Wrong edit, since here it is referring to k and not lambda undo Tag: Manual revert
• curprev 09:4009:40, 7 November 2022 85.51.16.178 talk 31,688 bytes +3 By reading this I think there is an error, and lambda should represent the cycle's length. undo Tag: Reverted

21 October 2022

• curprev 15:3215:32, 21 October 2022 141.143.213.46 talk 31,685 bytes +8 →Gosper's algorithm: fix titles undo
• curprev 15:3115:31, 21 October 2022 141.143.213.46 talk 31,677 bytes +150 →Gosper's algorithm: some polishing undo
• curprev 15:1515:15, 21 October 2022 141.143.213.46 talk 31,527 bytes +2 →Gosper's algorithm: concurrent != parallel undo

7 October 2022

• curprev 11:1911:19, 7 October 2022 Citation bot talk contribs 31,525 bytes +17 Add: s2cid. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 778/3850 undo

15 February 2022

• curprev 04:4304:43, 15 February 2022 HaydenWong talk contribs m 31,508 bytes +1 →Example: fix math typographic issue undo Tag: 2017 wikitext editor

21 January 2022

• curprev 15:2315:23, 21 January 2022 PandatiX talk contribs 31,507 bytes +5 Fix dead link undo

31 December 2021

• curprev 18:0318:03, 31 December 2021 2605:a601:ab0d:d000:99b7:a194:1575:471b talk 31,502 bytes +4 Change 'such as' to 'such that' in the proof for Floyd's algorithm. This conveys more clearly that what follows is necessarily true and not simply an example that is sometimes true. undo Tag: Visual edit