Jump to content

Talk:Fibonacci heap: Revision history

View logs for this page (view filter log)

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

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

curprev 16:3316:33, 27 January 2024 Qwerfjkl (bot) talk contribs 10,970 bytes +31 Implementing WP:PIQA (Task 26) undo Tag: Talk banner shell conversion

curprev 19:4819:48, 12 November 2023 David Eppstein talk contribs 10,939 bytes +433 →Why "Fibonacci": Reply undo Tag: Reply
curprev 17:1817:18, 12 November 2023 2601:647:c001:97c0:cc7:1833:5e7b:4d00 talk 10,506 bytes +525 →Why "Fibonacci": Reply undo Tag: Reply

curprev 07:4207:42, 11 February 2021 SineBot talk contribs m 9,981 bytes +340 Signing comment by TheBlackBeans - "→Complexity in entry section: " undo
curprev 07:4107:41, 11 February 2021 TheBlackBeans talk contribs 9,641 bytes +1,003 →Complexity in entry section undo

curprev 00:1500:15, 29 August 2017 David Eppstein talk contribs 8,638 bytes +124 →Time complexity of extract minimum: + undo
curprev 00:1400:14, 29 August 2017 David Eppstein talk contribs 8,514 bytes +283 →Time complexity of extract minimum: r undo

curprev 22:5022:50, 28 August 2017 McGucket talk contribs 8,231 bytes +641 →Time complexity of extract minimum undo

curprev 22:4122:41, 27 August 2017 David Eppstein talk contribs 7,590 bytes +234 →Time complexity of extract minimum: =O vs subset-O undo
curprev 16:1016:10, 27 August 2017 McGucket talk contribs 7,356 bytes +350 →Time complexity of extract minimum: new section undo

curprev 05:0005:00, 8 July 2016 David Eppstein talk contribs 7,006 bytes 0 too badly sourced for B-class, drop to C, but this shouldn't be too difficult to bring back up to B, as otherwise it doesn't look bad undo

curprev 11:1011:10, 7 February 2016 Jochen Burghardt talk contribs 7,006 bytes +300 →Complexity in entry section: oops undo

curprev 16:4616:46, 5 February 2016 David Eppstein talk contribs 6,706 bytes +541 →Complexity in entry section: r undo
curprev 09:5809:58, 5 February 2016 Jochen Burghardt talk contribs 6,165 bytes +452 →Complexity in entry section undo

curprev 23:2523:25, 25 November 2014 2.207.170.18 talk 5,713 bytes +477 →Complexity in entry section: new section undo
curprev 23:1523:15, 25 November 2014 2.207.170.18 talk 5,236 bytes +386 Reference example for mergeable queues undo

curprev 19:5819:58, 17 January 2014 Yecril talk contribs 4,850 bytes +172 →Summary of running times: RfD undo
curprev 19:4619:46, 17 January 2014 Yecril talk contribs 4,678 bytes +281 →decrease key should update the minimum pointer, shouldn’t it?: new section undo

curprev 04:2304:23, 24 February 2013 Kvng talk contribs 4,397 bytes −21 assess importance undo

curprev 17:0317:03, 19 May 2011 130.56.92.62 talk 4,418 bytes +376 →Introduction less overviews how the Fibonacci heap works: new section undo

curprev 17:3817:38, 7 March 2011 Hiiiiiiiiiiiiiiiiiiiii talk contribs 4,042 bytes +25 No edit summary undo
curprev 17:3717:37, 7 March 2011 Hiiiiiiiiiiiiiiiiiiiii talk contribs 4,017 bytes +183 No edit summary undo

curprev 15:5615:56, 23 October 2010 SineBot talk contribs m 3,834 bytes +294 Signing comment by 95.80.12.63 - "→Summary of running times: " undo
curprev 15:5515:55, 23 October 2010 95.80.12.63 talk 3,540 bytes +114 →Summary of running times undo

curprev 17:1417:14, 14 October 2009 WuTheFWasThat talk contribs m 3,426 bytes +61 →Why "Fibonacci" undo
curprev 17:1317:13, 14 October 2009 WuTheFWasThat talk contribs m 3,365 bytes 0 →Why "Fibonacci" undo

curprev 15:1515:15, 7 October 2009 SineBot talk contribs m 3,365 bytes +300 Signing comment by Trachten - "→Summary of running times: " undo
curprev 15:1415:14, 7 October 2009 Trachten talk contribs 3,065 bytes +347 →Summary of running times undo

curprev 17:3317:33, 13 September 2009 WuTheFWasThat talk contribs 2,718 bytes −17 →Why "Fibonacci" undo
curprev 17:2817:28, 13 September 2009 WuTheFWasThat talk contribs 2,735 bytes +98 →Why "Fibonacci" undo
curprev 17:2717:27, 13 September 2009 WuTheFWasThat talk contribs 2,637 bytes +555 →Why "Fibonacci" undo

curprev 18:2618:26, 30 July 2009 128.187.80.2 talk 2,082 bytes +552 →Summary of running times undo

curprev 16:2516:25, 22 September 2008 TinucherianBot talk contribs 1,530 bytes +1 Autoassessment for WP:COMP ! ( FAQ ) : undo

curprev 20:0120:01, 31 August 2008 85.178.10.62 talk 1,529 bytes +410 No edit summary undo

curprev 08:4208:42, 15 August 2008 Cyhawk talk contribs 1,119 bytes +413 →Why "Fibonacci": new section undo

curprev 13:3713:37, 25 June 2008 TinucherianBot talk contribs 706 bytes +45 WP:COMPUTING Tagging ! (False Positive ) ?? :(Plugin++) Added {{WikiProject Computing}}. undo

curprev 14:0714:07, 19 March 2008 Niaz talk contribs 661 bytes +24 assessment added undo

curprev 07:3307:33, 21 February 2008 Mahanga talk contribs 637 bytes +34 No edit summary undo

curprev 07:4807:48, 14 February 2007 DaveWF talk contribs 603 bytes +603 ←Created page with '== Mergeable priority queue ADT == Has anyone else ever heard it mentioned that Fibonacci heaps can be used to efficiently implement mergeable priority queues? If ...'

Retrieved from "https://en.wikipedia.org/wiki/Talk:Fibonacci_heap"