Heap (struttura dati): differenze tra le versioni

Versione delle 15:45, 22 lug 2024

Versione delle 22:35, 15 mar 2025

Riga 72:

|contributo= Improved upper bounds for pairing heaps

| doi = 10.1007/3-540-44985-X_5

|pp= 63–7763-77

|editore= Springer-Verlag

|serie= Lecture Notes in Computer Science

Riga 102:

|style="background:#ffffdd"| ''Θ''(log ''n'')

|style="background:#ddffdd"| ''Θ''(1){{efn|name=amortized}}

|style="background:#ffffdd"| ''o''(log ''n''){{efn|name=amortized}}{{efn|name=pairingdecreasekey|Con lower-bound <math>\Omega(\log\log n)</math> e upper-bound <math>O(2^{2\sqrt{\log\log n}})</math><ref name="Fredman And Tarjan">{{Cita pubblicazione|nome1=Michael Lawrence|cognome1=Fredman|wkautore1=Michael Fredman|nome2=Robert E.|cognome2=Tarjan|wkautore2=Robert Tarjan |titolo=Fibonacci heaps and their uses in improved network optimization algorithms|url= https://www.cl.cam.ac.uk/~sos22/supervise/dsaa/fib_heaps.pdf |lingua= en |formato= PDF |rivista=[[Journal of the Association for Computing Machinery]]|volume=34|anno=1987|pp=596–615596-615|cid=harv|doi=10.1145/28869.28874|numero=3}}</ref><ref>{{Cita pubblicazione|cognome=Pettie|nome=Seth|titolo=Towards a Final Analysis of Pairing Heaps|rivista=Max Planck Institut f&uuml;r Informatik|anno=2005|lingua=en|url=https://web.eecs.umich.edu/~pettie/papers/focs05.pdf}}</ref>}}

|-

| unione

Riga 121:

|contributo= An Optimal Algorithm for Selection in a Min-Heap

|doi= 10.1006/inco.1993.1030

|pp= 197–214197-214

|lingua= en

|editore= Academic Press