Entry Dvorak:1988:MDR from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
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{Dvorak:1988:MDR,
author = "S. Dvo{\v{r}}{\'a}k and B. {\v{D}}urian",
title = "Merging by Decomposition Revisited",
journal = j-COMP-J,
volume = "31",
number = "6",
pages = "553--556",
month = dec,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.6.553",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68P10",
MRnumber = "89i:68014",
bibdate = "Tue Dec 4 14:48:25 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/31/6.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/",
URL = "http://comjnl.oxfordjournals.org/content/31/6/553.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/553.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/554.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/555.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/556.tif",
acknowledgement = ack-nhfb,
affiliation = "Centre of Tesla",
affiliationaddress = "Roznov pod Radhostem, Czechoslovakia",
classcodes = "C6130 (Data handling techniques); C4240 (Programming
and algorithm theory)",
classification = "723; C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Centre of Tesla Roznov, 1, Czechoslovakia",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Computational complexity; computational complexity;
Computer Programming--Algorithms; listing; Merging;
merging; Merging Algorithms; Merging by Decomposition;
Pascal; Pascal listing, Computer Systems Programming;
Pascal listings; Quicksort; Sorting; sorting; Stable
Merging; Stable merging by decomposition; stable
merging by decomposition; Time requirements; time
requirements",
thesaurus = "Computational complexity; Merging; Pascal listings;
Sorting",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- 68P10,
26(4)293,
27(3)218,
27(3)270,
28(1)54,
28(4)417,
28(4)426,
29(1)52,
29(5)436,
30(6)565,
31(6)490,
31(6)557,
31(6)561,
32(1)68
- Algorithms;, Programming-,
31(6)561,
31(6)570,
32(1)36,
32(1)45,
32(1)68,
32(1)91
- C4240,
31(6)517,
31(6)545,
31(6)557,
31(6)561,
31(6)567,
32(2)187,
32(5)437,
32(5)470,
32(5)474,
32(6)567,
32(6)571
- C6130,
31(6)503,
31(6)557,
31(6)561,
32(1)13,
32(1)16,
32(3)238,
32(3)241,
32(6)494,
32(6)505
- complexity,
25(1)63,
25(3)379,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)340,
28(1)5,
28(1)78,
28(5)487,
28(5)496,
29(2)103,
29(2)161,
29(2)176,
29(2)182,
29(4)300,
29(4)322,
29(4)330,
29(5)451,
30(1)43,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)258,
30(3)282,
30(4)308,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)561,
31(6)567,
32(4)362,
32(5)474
- computational,
23(2)123,
23(2)187,
26(2)164,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)375,
28(3)335,
28(4)433,
28(5)496,
29(1)76,
29(2)103,
29(2)176,
29(4)322,
29(4)330,
29(4)373,
29(5)467,
30(1)43,
30(1)87,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)282,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)561,
31(6)567,
32(1)93,
32(4)377,
32(5)453,
32(5)474
- decomposition,
23(1)89,
24(3)258,
25(1)68,
25(3)393,
25(4)495,
29(4)330,
30(3)268,
31(4)358
- handling,
23(2)147,
24(1)3,
24(1)17,
24(1)42,
24(2)97,
24(2)130,
25(3)347,
25(4)448,
25(4)486,
26(3)205,
28(2)117,
29(5)477-1,
30(3)277,
30(6)569,
31(1)61,
31(2)133,
31(6)503,
31(6)557,
31(6)561,
32(1)13,
32(1)16,
32(3)238,
32(3)241,
32(5)386,
32(6)494,
32(6)505
- listing,
27(4)368-1,
27(4)373,
28(2)117,
28(3)340,
28(3)343,
29(2)176,
30(3)277,
30(6)569,
31(6)557
- merging,
25(2)227,
27(4)334,
30(4)362,
30(4)372,
31(1)9,
31(3)279,
32(3)194
- Pascal,
24(2)112,
25(1)17,
25(2)176,
25(2)248,
25(3)289,
25(3)340,
25(4)496,
26(2)164,
26(2)187,
26(4)366,
27(4)348,
27(4)373,
28(2)134,
28(3)270,
28(4)391,
29(2)176,
29(3)246,
29(3)277,
29(5)423,
30(1)52,
30(3)277,
30(4)337,
30(4)355,
30(4)372,
31(1)1,
31(1)9,
31(6)557,
32(2)152
- Programming--Algorithms,
31(6)561,
31(6)570,
32(1)36,
32(1)45,
32(1)68,
32(1)91
- quicksort,
27(3)270,
27(3)276,
30(4)362,
31(6)561
- requirement,
25(2)235,
26(2)113,
27(2)143,
27(4)368-1,
28(1)73,
28(2)97,
28(2)128,
28(4)414,
29(5)423,
30(1)16,
31(5)426,
32(1)1,
32(3)212,
32(3)252
- revisited,
23(3)248,
27(2)159
- sorting,
23(1)61,
23(3)270,
24(1)83,
25(1)93,
25(1)102,
25(2)227,
25(3)327,
26(4)293,
27(2)176,
27(3)260,
27(3)270,
27(3)276,
27(4)334,
29(5)430,
30(4)362,
30(6)512,
31(6)557,
31(6)561
- stable,
30(4)372,
31(3)279
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
24(1)85,
24(2)156,
25(1)32,
25(1)45,
25(2)193,
25(4)429,
26(2)154,
26(3)224,
26(4)293,
26(4)320,
27(1)27,
27(3)201,
27(3)246,
27(3)254,
27(4)368-1,
28(1)9,
28(1)54,
28(1)78,
28(2)105,
28(3)309,
28(4)409,
28(4)412,
29(1)47,
29(1)52,
29(2)103,
29(2)118,
29(2)176,
29(3)229,
29(3)269,
29(5)390,
29(5)396,
29(5)436,
30(3)249,
30(4)362,
30(4)372,
30(4)376,
30(5)475,
30(6)519,
30(6)535,
31(3)243,
31(3)279,
31(3)283,
31(6)496,
31(6)545,
32(3)212,
32(3)228,
32(3)241,
32(4)374,
32(5)474