Entry Levcopoulos:1989:HOB 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{Levcopoulos:1989:HOB,
author = "Christos Levcopoulos and Andrzej Lingas and Jorg-R. R.
Sack",
title = "Heuristics for optimum binary search trees and minimum
weight triangulation problems",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "181--203",
day = "20",
month = aug,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Link{\"o}ping Univ",
affiliationaddress = "Link{\"o}ping, Swed",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conflocation = "Karlsruhe, West Germany; 13-17 July 1987",
conftitle = "Fourteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. and Inf. Sci., Linkoping Univ.,
Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Amortization Argument; binary search trees; Computer
Programming--Algorithms; Data Processing; Data
Structures; duality; greedy heuristics; linear-time
heuristic; Mathematical Techniques--Trees; Minimum
Weight Triangulation; minimum weight triangulation;
Optimum Binary Search Trees; optimum binary search
trees; search problems; search trees; trees
(mathematics)",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput.Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
67(1)65
- binary,
35(2)129,
36(2)319,
37(1)51,
43(1)31,
44(2)209,
49(2)121,
52(1)1,
54(2)325,
58(1)143,
59(3)297,
63(3)253,
64(2)191,
65(2)149,
66(0)117
- 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)273,
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,
67(1)87,
68(1)37,
68(1)57,
69(2)117
- greedy,
57(1)131
- heuristic,
57(1)131
- linear-time,
47(1)15,
52(1)91,
59(1)115
- Lingas, Andrzej,
63(3)295
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- minimum,
47(3)237,
58(1)379,
60(3)231,
61(2)307,
63(1)91
- processing,
35(2)191,
36(2)173,
37(2)183,
37(3)245,
37(3)305,
39(1)47,
39(2)107,
43(1)31,
43(1)43,
43(2)213,
43(2)277,
48(2)145,
49(2)145,
49(2)171,
49(2)267,
50(3)241,
51(1)239,
52(1)155,
52(3)193,
53(2)281,
54(1)53,
55(2)291,
57(0)3,
57(1)131,
58(1)143,
58(1)183,
58(1)249,
58(1)347,
59(3)259,
59(3)277,
59(3)297,
61(2)121,
61(2)199,
62(1)67,
62(1)123,
62(3)251,
63(1)91,
64(1)83,
64(1)125,
64(2)135,
64(2)159,
64(2)175,
64(2)191,
64(3)271,
65(2)249,
66(0)117,
66(2)117,
68(3)343,
69(1)1
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
67(1)65
- search,
39(2)89,
41(2)325,
47(1)61,
47(2)205,
47(3)277,
58(1)57,
58(1)143,
58(1)209,
59(1)133,
59(3)297,
63(2)185,
66(0)117,
66(1)105,
68(3)343,
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,
48(2)273,
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,
67(1)87,
68(1)37,
68(1)57
- Techniques--Trees,
58(1)143,
58(1)379,
61(2)289,
62(3)251,
66(2)137
- time, linear-,
47(1)15,
52(1)91,
59(1)115
- Trees, Techniques-,
58(1)143,
58(1)379,
61(2)289,
62(3)251,
66(2)137
- triangulation,
59(3)297
- weight,
58(1)209