 | The contents of the Gerth Stølting Brodal page were merged into Brodal queue on 7 November 2024. For the contribution history and old versions of the redirected page, please see its history; for the discussion at that location, see its talk page. |
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
Reference link #2 no longer points to anything (404)
edit104.32.238.180 (talk) 22:03, 6 October 2015 (UTC) DV
A google search comes up with the following result http://www.brics.dk/RS/96/37/BRICS-RS-96-37.pdf Is this the same document? 155.98.164.37 (talk) 22:47, 6 October 2015 (UTC)
It appears to be the same paper, only formatted differently, when compared to an archived version of the original link: https://web.archive.org/web/20101116140646/http://users.info.unicaen.fr/~karczma/TEACH/Doc/brodal_okasaki.pdf 2601:647:4801:CDD1:D1E3:F1B3:8DAD:9C55 (talk) 18:47, 27 October 2015 (UTC)
Is Brodal queue correct? There are some minor confusions in the descrition (reducing violations is done just on t_1 tree, but the descrition indicates anywhere in the heap, on sevaral places sons of particullar rank are meant, but the rank is not mentioned, seems the rank t_1 increase process is described wrongly ... being one rank off in the describtion and the required delinking neednot mean the vertex should be cut) all these could be easily corrected, but what I am totally not sure are guides. Their describtion is almost left as an excercise. It seems to me case with a lot of ones not being in a block would cause a problem after an increment in it.Hippo.69 (talk) 21:35, 13 May 2019 (UTC)
On the other side, there are Brodal, Lagogiannis, Tarjan Heaps https://dl.acm.org/citation.cfm?id=2214082 with the matching worst case complexities. They need no guides nor extendable arrays (pointer machine model suffices). The ranks could differ from degrees in both directions (loss/passive childern). Root degree, active roots, total loss are maintained bounded to O(lg n) as well as maximal rank, there are constraints to degrees of all vertices.Hippo.69 (talk) 17:57, 15 May 2019 (UTC)
Merge proposal
editI propose merging Gerth Stølting Brodal into Brodal queue. Few sources exist about Gerth Stølting Brodal specifically and may fail WP:BASIC. Information about him may fit best alongside the concept which makes him notable.Uffda608 (talk) 13:08, 2 March 2024 (UTC)
- It looks like there is room for expansion on this article, and I think he is notable enough; inventor of Brodal queue, and co-inventor of Skew binomial heaps and strict Fibonacci heaps. As for sources, apart from his CV there are not many independent sources, but it can probably be made to work. If not, then it should probably be deleted. IntGrah (talk) 20:34, 20 April 2024 (UTC)
- Support merge, not for notability (which I think is met), but rather short text and context. A 10-year-old stub unlikely to be expanded in the near term. Klbrain (talk) 07:00, 15 September 2024 (UTC)
Merger complete. Klbrain (talk) 10:16, 7 November 2024 (UTC)
- Support merge, not for notability (which I think is met), but rather short text and context. A 10-year-old stub unlikely to be expanded in the near term. Klbrain (talk) 07:00, 15 September 2024 (UTC)
