Related changes
Appearance
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are shown in bold with a green bullet. See more at Help:Related changes.
List of abbreviations (help):
- D
- Edit made at Wikidata
- r
- Edit flagged by ORES
- N
- New page
- m
- Minor edit
- b
- Bot edit
- (±123)
- Page byte size change
- Temporarily watched page
24 May 2025
- diffhist Hash table 16:19 −301 MrOllie talk contribs (Reverted 1 edit by Wukuendo (talk): Clearly undue weight on little known, little used language) Tags: Twinkle Undo
- diffhist Hash table 16:05 +301 Wukuendo talk contribs ((1) "little-known" appears to be a bias statement without proof (2) V is ranked higher than Ruby on GitHub and is in the TIOBE's top 50 with Ruby, so arguably should be given equal weight (3) Undid revision 1291975537 by Remsense (talk)) Tags: Undo Reverted
- diffhist Hash table 14:07 −301 Remsense talk contribs (Reverted 1 edit by Wukuendo (talk): Like I already told you in edit summary, I see no reason for mention of this little-known language in every possible location where it possibly relevant. It's not WP:DUE, or at least you've made no attempt to demonstrate that it is (i.e. that its mention is of any real relevance to readers, and doesn't amount to advertising.)) Tags: Twinkle Undo Reverted
- diffhist Hash table 13:49 +301 Wukuendo talk contribs ((1) Remsense - Please see your talk, (2) Undid revision 1291961724 by Remsense (talk)) Tags: Undo Reverted
- diffhist m Hash table 12:15 −301 Remsense talk contribs (Reverted 1 edit by Wukuendo (talk) to last revision by Hddqsb) Tags: Twinkle Undo Reverted Mobile edit Mobile web edit Advanced mobile edit
23 May 2025
- diffhist Hash function 13:52 +98 Frap talk contribs (→Multiplicative hashing)
- diffhist Polynomial root-finding 13:51 +71 Renerpho talk contribs (→General solution using combinatorics: relation to Eisenstein series)
- diffhist Polynomial root-finding 13:46 +895 Renerpho talk contribs (→Closed-form formulas: Wildberger&Rubine, 2025)
22 May 2025
- diffhist Muller's method 14:15 +23 Frap talk contribs (→Computational example)
- diffhist Hash table 11:56 +301 Wukuendo talk contribs (Added V to the list of languages implemented hash map as type) Tag: Reverted
- diffhist Tree (abstract data type) 10:40 −60 Jochen Burghardt talk contribs (Undid revision 1291606130 by Sinomndeni Ian (talk): unrelated to mathematical trees) Tag: Undo
- diffhist Muller's method 09:05 +67 Dreamofthedolphin talk contribs (Added Python coding block)
- diffhist Tree (abstract data type) 08:35 +60 Sinomndeni Ian talk contribs (Added a picture to the article.) Tags: Reverted Visual edit
21 May 2025
- diffhist List of algorithms 14:43 −5 ItzSwirlz talk contribs (Fix possible troll/typo entry? (Smoothgamersort -> Smoothsort)) Tag: Visual edit
- diffhist Bit 14:42 −18 2406:3003:2006:1fca:9324:67e1:1082:8f5f talk (remove link to a dubious article (bad math and unclear structure), do see the link's talk page on disputes of its content since its creation. Talk:Negentropy)
- diffhist Bernoulli's method 04:19 +84 Basilelp talk contribs (→marked several sources as free doi-access)
- diffhist Durand–Kerner method 03:52 −2 Fgnievinski talk contribs (→top)
- diffhist Minimax 02:20 −1 2600:1700:3ec0:ec4f::1003 talk
20 May 2025
- diffhist Polynomial root-finding 19:20 +94 Lzxwuw talk contribs (added a few links) Tags: Visual edit Mobile edit Mobile web edit
- diffhist m Polynomial root-finding 19:18 +2 Lzxwuw talk contribs Tags: Visual edit Mobile edit Mobile web edit
- diffhist m Bit 17:59 −13 Dwo talk contribs (MOS:ANDOR, MOS:CONFORM)
- diffhist m Module:Lang/data/iana suppressed scripts 15:45 0 Trappist the monk talk contribs (update to 2025-05-15 data;) Tag: AWB
- diffhist m Module:Lang/data/iana variants 15:45 0 Trappist the monk talk contribs (update to 2025-05-15 data;) Tag: AWB
- diffhist m Module:Lang/data/iana regions 15:45 0 Trappist the monk talk contribs (update to 2025-05-15 data;) Tag: AWB
- diffhist m Module:Lang/data/iana scripts 15:45 +114 Trappist the monk talk contribs (update to 2025-05-15 data;) Tag: AWB
- diffhist m Module:Lang/data/iana languages 15:45 +58 Trappist the monk talk contribs (update to 2025-05-15 data;) Tag: AWB
- diffhist Bernoulli's method 06:02 +17 Basilelp talk contribs (→Added hdl free to a source)
19 May 2025
- diffhist Bisection method 15:47 0 Dgpop talk contribs (→Stopping Condition: Wikipedia titlecase)
- diffhist Bisection method 15:46 −24 Dgpop talk contribs (MOS:NOTED)
- diffhist Bisection method 15:21 −119 Jonesey95 talk contribs (rm obsolete tags)
- diffhist Bisection method 15:14 +34,053 Ejn38 talk contribs (The material between "Iteration tasks" and "Generalization to higher dimensions" has been replaced. The new version gives details as to the reason why the original was incorrect.) Tags: harv or sfn error references removed
- diffhist Bernoulli's method 05:59 +379 Basilelp talk contribs (→yet one more secondary source to supplement a primary)
- diffhist Bernoulli's method 05:35 +283 Basilelp talk contribs (→One more secondary source to backup a primary one)
- diffhist Bernoulli's method 04:39 +561 Basilelp talk contribs (→Included secondary sources to supplement primary ones)
- diffhist Algorithm 01:34 +112 David Eppstein talk contribs (→By design paradigm: improve sourcing for divide & conquer / prune & search)
- diffhist Algorithm 01:25 −35 David Eppstein talk contribs (→Ancient algorithms: the citation is right there in the next sentence)
- diffhist Algorithm 01:21 −177 David Eppstein talk contribs (more precisely locate the quotation from stone; page 8 (end of section), not page 4 (earlier version of similar def))
- diffhist Algorithm 01:12 +1,415 David Eppstein talk contribs (→Etymology: clean up attestations and sourcing)
- diffhist Algorithm 00:39 −28 David Eppstein talk contribs (I don't think this essay-like cleanup banner is valid)
- diffhist Hash table 00:37 +67 Hddqsb talk contribs (Add HTML comment about location in Farach-Colton for search complexity (most of the paper is about probe length, but search is different due to negative queries). And note that the paper also has an approach with O(log (1-α)^-1) worst-case expected probe length and insertion time (Theorem 1), but the search time for that approach doesn't appear to be specified.)