Entry Italiano:1986:AEP from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Italiano:1986:AEP,
author = "G. F. Italiano",
title = "Amortized efficiency of a path retrieval data
structure",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "273--281",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dipartimento di Inf. e Sistemistica, Roma Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ADD operation; amortised efficiency; computational
complexity; data structures; digraph; directed graphs;
path retrieval data structure; SEARCHPATH operation;
space complexity; time complexity",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
Related entries
- data,
35(2)329,
36(2)251,
37(3)269,
38(1)83,
39(2)107,
39(2)319,
40(2)101,
42(2)123,
45(1)1,
45(3)293,
46(1)13,
46(2)261,
48(1)75,
48(2)297,
49(2)171,
49(2)239,
50(2)103,
50(2)137,
50(3)323,
51(1)129,
51(1)205,
52(3)193,
53(2)169,
53(2)281,
54(1)53,
54(2)315,
55(2)265,
56(1)59,
56(3)345,
57(1)3,
57(1)131,
57(2)225,
58(0)3,
58(1)57,
58(1)143,
59(1)85,
59(3)211,
59(3)259,
60(3)297,
62(0)3,
62(1)3,
62(3)251,
63(1)63,
63(2)113,
63(3)303,
64(1)55,
66(0)117,
66(1)45,
66(2)137,
66(2)181,
67(1)87,
68(1)37,
68(1)57,
69(2)117
- digraph,
58(1)325,
61(2)175
- directed,
39(2)155,
40(2)149,
41(2)141,
41(2)185,
43(1)99,
44(3)275,
44(3)307,
45(3)261,
47(2)205,
47(3)315,
52(1)37,
52(1)155,
55(1)87,
56(2)223,
58(1)325,
60(1)1,
61(2)175,
61(2)307,
63(2)223,
64(2)191
- Italiano, G. F.,
68(1)57
- operation,
35(2)271,
36(2)291,
36(2)333,
39(2)327,
40(2)257,
42(2)123,
47(3)237,
48(2)145,
49(2)185,
51(3)281,
52(1)1,
52(3)251,
55(2)183,
55(2)265,
58(1)175,
60(3)297,
61(2)199,
62(1)3,
62(3)235,
64(1)119,
64(3)221,
66(2)157,
68(1)71
- path,
36(1)27,
37(1)77,
40(2)257,
40(2)323,
43(2)213,
57(1)131,
57(1)153,
58(1)103,
68(1)1,
68(2)155
- retrieval,
49(2)239,
58(1)69,
62(3)251,
63(1)91
- space,
39(2)267,
41(2)141,
41(2)331,
43(1)59,
47(1)39,
48(1)9,
48(2)145,
49(2)217,
51(1)221,
52(3)251,
52(3)269,
57(2)327,
58(1)175,
58(1)325,
59(3)259,
62(3)251,
64(1)83,
68(1)57,
68(3)253,
69(1)1
- structure,
35(2)329,
36(2)145,
37(3)269,
38(1)83,
38(2)143,
40(2)175,
40(2)195,
40(2)257,
40(2)275,
40(2)301,
41(1)81,
41(1)95,
42(1)1,
42(2)123,
43(2)169,
44(2)175,
45(3)293,
46(2)197,
48(1)75,
49(2)239,
50(2)103,
50(2)137,
51(1)129,
51(1)205,
52(3)307,
53(1)99,
53(1)z,
56(2)211,
56(3)345,
57(1)3,
57(2)205,
58(0)3,
58(1)57,
58(1)143,
58(1)183,
59(1)115,
59(3)211,
59(3)259,
60(2)109,
60(3)297,
61(2)103,
61(2)175,
61(2)279,
62(0)3,
62(1)3,
62(3)251,
63(2)113,
63(3)303,
66(0)117,
66(2)181,
67(1)87,
68(1)37,
68(1)57
- time,
35(2)215,
36(2)203,
36(2)265,
37(1)1,
37(2)123,
38(2)157,
38(2)249,
38(2)269,
38(2)323,
40(1)31,
40(1)57,
40(1)67,
40(2)175,
40(2)195,
41(1)81,
41(2)141,
43(2)337,
46(2)219,
46(2)261,
47(1)39,
47(1)85,
47(3)315,
47(3)329,
48(1)9,
48(1)35,
49(1)81,
50(2)183,
51(1)177,
51(1)221,
51(1)239,
52(3)177,
52(3)269,
53(2)201,
54(1)53,
54(1)65,
54(1)129,
54(2)181,
54(2)199,
54(2)249,
54(2)315,
56(1)3,
56(2)211,
57(2)317,
57(2)327,
58(1)57,
58(1)69,
58(1)155,
58(1)175,
58(1)249,
58(1)325,
59(1)115,
60(3)255,
60(3)341,
61(2)175,
62(1)105,
63(1)43,
63(3)295,
68(1)57,
68(3)319,
69(2)117