Entry Dietzfelbinger:1989:LBS 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{Dietzfelbinger:1989:LBS,
author = "Martin Dietzfelbinger",
title = "Lower bounds for sorting of sums",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "137--155",
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 = "Univ Dortmund",
affiliationaddress = "Dortmund, West Ger",
classification = "723; 921; C4240 (Programming and algorithm theory);
C6130 (Data handling techniques)",
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 = "Lehrstuhl Informatik II, Dortmund Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "comparison tree; complexity of sorting; Computational
Complexity; computational complexity; Computer Systems
Programming; lower bound; Lower Bounds; Mathematical
Techniques--Trees; optimal; Sorting; sorting; Sorting
of Sums; sums",
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
- bound,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
41(2)331,
43(2)201,
44(3)247,
45(1)63,
46(2)107,
46(2)329,
47(2)111,
47(2)149,
47(3)323,
49(2)171,
49(2)217,
52(3)239,
52(3)251,
54(2)325,
56(2)211,
57(1)97,
57(1)113,
58(1)175,
58(1)263,
60(3)285,
61(2)149,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(1)1,
66(1)105,
67(1)55,
67(1)115,
69(3)319
- C6130,
39(2)319,
40(2)101,
46(2)261,
50(2)137,
50(3)323,
52(3)193,
54(2)315,
66(1)45
- comparison,
43(2)345,
54(2)249,
58(1)3,
61(1)67,
63(2)185,
66(1)105
- 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)181,
67(1)87,
68(1)37,
68(1)57,
69(2)117
- handling,
39(2)319,
40(2)101,
46(1)13,
46(2)261,
50(2)137,
50(3)323,
52(3)193,
54(2)315,
66(1)45
- lower,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
43(2)201,
44(3)247,
46(2)329,
47(2)149,
47(3)323,
49(2)171,
52(3)239,
52(3)251,
54(2)325,
57(1)97,
57(1)113,
58(1)263,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
67(1)115
- 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)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- optimal,
39(1)15,
39(1)z,
45(1)63,
53(2)281,
53(2)295,
59(3)259,
59(3)297,
61(1)33,
63(2)203,
64(1)83,
64(1)125,
64(2)159,
66(1)105,
66(2)157,
67(1)5
- sorting,
37(2)183,
38(1)83,
43(2)345,
46(2)261,
49(2)171,
52(3)193,
54(2)315,
58(1)325,
66(0)117,
67(1)115
- sum,
38(1)55,
51(1)239,
63(2)113,
63(3)275,
65(2)189,
65(2)z,
66(0)117
- technique,
39(2)319,
40(1)67,
40(2)101,
45(1)87,
46(2)261,
48(1)75,
49(1)81,
49(2)171,
50(2)137,
50(3)323,
51(1)53,
52(3)193,
53(2)169,
53(2)281,
54(1)53,
54(1)87,
54(1)129,
54(2)315,
57(0)3,
57(1)97,
57(1)131,
57(1)147,
57(1)153,
58(1)103,
58(1)209,
59(1)157,
59(3)297,
61(2)299,
63(3)275,
63(3)295,
64(1)107,
64(2)135,
64(2)175,
65(1)1,
65(2)123,
65(2)131,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
66(0)117,
66(1)45,
67(1)5,
67(1)37,
67(1)87,
68(3)267,
69(1)1
- Techniques--Trees,
58(1)143,
58(1)379,
61(2)289,
62(3)251,
66(2)181
- Trees, Techniques-,
58(1)143,
58(1)379,
61(2)289,
62(3)251,
66(2)181