Entry Gambosi:1991:PFD from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Gambosi:1991:PFD,
author = "G. Gambosi and E. Nardelli and M. Talamo",
title = "A pointer-free data structure for merging heaps and
min-max heaps",
journal = j-THEOR-COMP-SCI,
volume = "84",
number = "1",
pages = "107--126",
day = "22",
month = jul,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Istituto di Analisi dei Sistemi ed Inf., CNR, Roma,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "amortized time complexity; data structures;
DeleteHeap; DeleteMax; DeleteMin; FindMax; FindMin;
Insert; Merge; merging heaps; min-max heaps; NewHeap;
pointer-free data structure",
pubcountry = "Netherlands",
treatment = "P Practical",
}
Related entries
- amortized,
117(1)187,
129(2)397
- C6120,
71(3)419,
72(2)97,
72(2)147,
75(3)223,
76(1)53,
77(1)161,
79(2)275,
83(2)275,
85(1)97,
87(1)115,
87(1)143,
91(2)239,
91(2)285,
92(1)191,
93(2)201,
94(1)1,
95(2)245,
96(1)249,
100(2)267,
101(2)177,
103(2)335,
104(1)89,
104(1)129,
106(1)21,
106(2)391,
107(1)121,
108(2)345,
109(1)257,
111(1)191,
112(1)99,
112(2)339,
113(1)35,
113(2)273,
116(1)59,
116(2)227,
116(2)359,
117(1)131,
117(1)303,
118(1)21,
118(1)81,
119(2)233,
119(2)331,
119(2)355,
120(1)101,
121(1)113,
122(1)263,
123(1)9,
124(1)93,
124(1)127,
124(1)149,
125(2)259,
127(2)387,
128(1)3,
129(2)397,
130(1)85,
130(1)139,
131(1)29,
131(2)295,
132(1)151,
132(1)377,
134(2)473,
136(1)79,
136(1)109
- file,
71(3)419,
72(2)97,
72(2)147,
75(3)223,
76(1)53,
77(1)161,
79(2)275,
83(2)275,
85(1)97,
87(1)115,
87(1)143,
91(2)239,
91(2)285,
92(1)191,
93(2)201,
94(1)1,
95(2)245,
96(1)249,
100(2)267,
101(2)177,
103(2)335,
104(1)89,
104(1)129,
106(1)21,
106(2)391,
107(1)121,
108(2)345,
109(1)257,
111(1)191,
112(1)99,
112(2)339,
113(1)35,
113(2)273,
116(1)59,
116(2)227,
116(2)359,
117(1)131,
117(1)303,
118(1)21,
118(1)81,
119(2)233,
119(2)331,
119(2)355,
120(1)101,
121(1)113,
122(1)263,
123(1)9,
124(1)93,
124(1)127,
124(1)149,
125(2)259,
127(2)387,
128(1)3,
129(2)397,
130(1)85,
130(1)139,
131(1)29,
131(2)295,
132(1)151,
132(1)377,
134(2)473,
136(1)79,
136(1)109
- Gambosi, G.,
70(2)251
- heap,
117(1)67,
118(1)81
- merge,
76(2)309
- merging,
82(1)157,
83(2)275,
86(2)205,
128(1)211
- organisation,
71(3)419,
72(2)97,
72(2)147,
75(3)223,
76(1)53,
77(1)161,
79(2)275,
83(2)275,
85(1)97,
87(1)115,
87(1)143,
91(2)239,
91(2)285,
92(1)191,
93(2)201,
94(1)1,
95(2)245,
96(1)249,
100(2)267,
101(2)177,
103(2)335,
104(1)89,
104(1)129,
106(1)21,
106(2)391,
107(1)121,
108(2)345,
109(1)257,
111(1)191,
112(1)99,
112(2)339,
113(1)35,
113(2)273,
116(1)59,
116(2)227,
116(2)359,
117(1)131,
117(1)303,
118(1)21,
118(1)81,
119(2)233,
119(2)331,
119(2)355,
120(1)101,
121(1)113,
122(1)263,
123(1)9,
124(1)93,
124(1)127,
124(1)149,
125(2)259,
127(2)387,
128(1)3,
129(2)397,
130(1)85,
130(1)139,
131(1)29,
131(2)295,
132(1)151,
132(1)377,
134(2)473,
136(1)79,
136(1)109
- Talamo, M.,
70(2)251