Jump to content

Fibonacci heap: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

19 December 2024

18 June 2024

9 June 2024

4 June 2024

31 May 2024

20 May 2024

4 May 2024

25 April 2024

23 April 2024

20 April 2024

18 April 2024

11 April 2024

7 April 2024

  • curprev 00:3100:31, 7 April 2024 David Eppstein talk contribs 19,713 bytes −500 Remove WP:DISINFOBOX as the permanent locus of totally misleading claims. The Fibonacci heap is not analyzed as an average case (in the usual sense of average over random input distributions). It is analyzed using amortized analysis, for worst-case inputs. If we can't express that properly in an infobox, and must instead provide totally useless individual-operation worst-case bounds only, or mislabeled "average" cases, we should not have an infobox at all. undo

6 April 2024

17 January 2024

20 November 2023

12 August 2023

23 July 2023

10 July 2023

2 March 2023

25 July 2022

9 June 2022

6 June 2022

31 May 2022

7 May 2022

11 March 2022

8 March 2022

22 December 2021

4 November 2021

2 June 2021

  • curprev 16:5816:58, 2 June 2021 Csimo005 talk contribs m 19,828 bytes −77 Removed reference 19 from practical considerations. When I checked the citations it was to an unrelated slide deck on cuckoo hashing. The specific slide referenced talked about practical considerations for that hashing algorithm, not fibonacci heaps. undo

1 June 2021

17 February 2021

21 January 2021

10 January 2021

17 November 2020

27 October 2020

17 September 2020

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)