Entry Katajainen:1989:AAS 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{Katajainen:1989:AAS,
author = "J. Katajainen and T. Raita",
title = "An approximation algorithm for space-optimal encoding
of a text",
journal = j-COMP-J,
volume = "32",
number = "3",
pages = "228--237",
month = jun,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.3.228",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/32/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/32/3/228.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/228.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/229.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/230.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/231.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/232.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/233.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/234.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/235.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/236.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/237.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Turku Univ., Finland",
classcodes = "C6130D (Document processing techniques); C6120 (File
organisation); C7250 (Information storage and
retrieval); C1260 (Information theory)",
classification = "C1260 (Information theory); C6120 (File
organisation); C6130D (Document processing techniques);
C7250 (Information storage and retrieval)",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "acyclic bandwidth limited network; Acyclic bandwidth
limited network; approximation algorithm; Approximation
algorithm; code book; Code book; compression; data
compression; encoding; fixed dictionary; Fixed
dictionary; fixed internal memory; Fixed internal
memory; heuristic; information storage; linear working;
Linear working storage; longest match; Longest match
heuristic; often-occurring; Often-occurring substrings;
optimisation; performance; Performance; running time;
Running time; shortest path; Shortest path;
space-optimal encoding; Space-optimal encoding;
storage; storage management; storage space; Storage
space; string matching algorithm; String matching
algorithm; substrings; text; Text compression; vertex
pair; Vertex pair",
thesaurus = "Data compression; Encoding; Information storage;
Optimisation; Storage management",
treatment = "P Practical",
}
Related entries
- acyclic,
27(1)86,
28(1)5,
31(6)545
- approximation,
25(1)114,
28(4)398,
32(1)93
- bandwidth,
31(4)296,
32(4)362
- C1260,
32(3)212,
32(3)238,
32(3)246,
32(6)563
- C6120,
31(6)490,
31(6)517,
31(6)531,
31(6)540,
31(6)565,
32(1)63,
32(1)68,
32(4)323,
32(4)351,
32(6)494
- C7250,
32(3)212,
32(3)220
- code,
23(1)46,
23(1)53,
23(1)66,
23(2)147,
23(3)212,
23(3)223,
24(4)324,
25(3)316,
25(4)442,
26(4)303,
26(4)375,
27(3)246,
27(4)354,
27(4)368-1,
28(3)343,
28(4)379,
29(1)12,
29(1)60,
29(4)307,
29(5)472,
29(6)573,
30(1)87,
30(2)149,
30(6)541,
30(6)569,
31(6)517,
32(2)152,
32(3)241,
32(3)246,
32(3)276
- compression,
24(4)324,
25(1)116,
25(4)486,
26(4)336,
29(4)307,
30(1)80,
30(1)87,
30(2)149,
30(4)343,
30(6)541,
31(4)353,
32(1)16,
32(3)238,
32(6)563
- dictionary,
24(3)193,
26(2)106,
26(4)336,
28(3)270,
30(5)451,
31(2)182,
31(6)490
- document,
24(1)62,
24(4)312,
25(1)2,
26(3)239,
30(4)343,
32(3)212,
32(3)220,
32(3)252,
32(6)494,
32(6)505,
32(6)516,
32(6)524
- encoding,
24(4)324,
25(1)114,
25(1)116,
25(1)121,
26(1)83,
27(3)283,
27(3)283-1,
28(4)379,
29(1)60,
29(4)307,
29(5)472,
30(1)87,
30(2)149,
30(2)168,
30(5)451,
30(6)541,
30(6)569,
31(4)330,
31(4)353,
32(3)238
- fixed,
23(1)37,
24(4)339,
25(1)87,
25(2)231,
28(4)379,
30(6)558,
31(3)243,
32(1)13
- heuristic,
23(4)338,
24(1)85,
25(3)353,
27(4)301,
27(4)315,
29(1)47,
29(2)135,
30(5)458,
31(3)253,
32(2)98
- internal,
25(2)227,
28(5)508,
29(1)9,
30(3)214,
30(4)362
- limited,
25(2)239,
27(3)193,
32(6)516
- linear,
23(1)78,
24(2)156,
25(1)56,
25(3)347,
27(4)373,
28(1)73,
28(1)78,
28(2)142,
28(3)319,
28(4)412,
30(2)176,
30(4)372,
31(3)279,
31(6)567,
32(4)362,
32(6)571
- longest,
25(3)347
- match,
23(1)37,
25(1)2,
30(6)535,
31(2)147
- matching,
28(3)264,
29(3)222,
32(2)127,
32(4)351
- memory,
24(1)14,
25(1)37,
25(1)140,
25(1)159,
25(2)227,
26(1)43,
26(2)188,
27(3)254,
27(4)328,
27(4)362,
28(1)68,
28(3)291,
28(4)357,
28(4)398,
29(1)1,
29(2)127,
29(2)176,
29(6)522,
30(2)119,
30(3)201,
30(4)308,
30(4)362,
32(5)461
- optimisation,
23(1)89,
23(4)338,
28(5)518,
29(2)118,
30(4)308,
30(5)458,
30(5)475,
31(2)99,
32(3)273,
32(4)374
- organisation,
23(1)37,
23(3)207,
24(1)29,
24(4)290,
25(1)158,
25(2)169,
25(2)193,
25(2)239,
25(3)327,
25(3)368,
26(1)43,
26(3)196,
27(2)143,
27(3)218,
27(3)270,
27(3)284,
27(4)321,
27(4)334,
28(1)54,
28(2)179,
28(3)203,
28(3)243,
28(3)291,
28(3)313,
28(3)319,
28(3)330,
28(4)391,
28(4)412,
28(4)414,
28(4)417,
28(4)426,
28(5)524,
29(1)52,
29(2)167,
29(3)277,
29(4)368,
29(5)436,
29(6)522,
30(1)80,
30(6)529,
30(6)535,
30(6)565,
31(1)41,
31(5)426,
31(6)490,
31(6)517,
31(6)531,
31(6)540,
31(6)565,
32(1)63,
32(1)68,
32(3)212,
32(4)323,
32(4)351,
32(6)494
- pair,
28(4)353
- path,
23(2)161,
23(2)188,
23(3)207,
27(2)178,
29(5)423,
29(6)553,
30(1)43,
30(1)77,
31(1)41,
32(1)24,
32(1)68,
32(3)194
- performance,
24(2)132,
24(4)343,
24(4)347,
24(4)384-2,
25(1)74,
25(2)169,
25(2)188,
25(2)193,
25(2)227,
25(3)347,
25(4)486,
26(1)93,
26(2)113,
27(1)27,
27(2)143,
27(2)165,
27(3)201,
27(3)238,
27(3)270,
28(2)142,
28(2)179,
28(3)231,
28(3)309,
28(3)319,
28(3)330,
28(4)409,
28(4)426,
28(5)501,
29(1)47,
29(2)118,
29(4)289,
29(5)390,
29(5)396,
29(5)451,
30(4)289,
30(4)362,
30(6)519,
30(6)535,
31(1)12,
31(3)276,
31(4)304,
31(5)409,
31(5)437,
31(5)445,
31(6)490,
31(6)565,
32(1)16,
32(2)142,
32(2)152,
32(3)252,
32(4)333,
32(5)437,
32(5)453
- Raita, T.,
30(1)80
- retrieval,
23(1)37,
23(2)131,
23(2)131-1,
24(4)312,
25(1)2,
25(1)158,
25(4)478,
26(2)106,
26(3)239,
26(4)336,
27(2)121,
28(1)54,
28(3)264,
28(3)319,
29(1)52,
29(3)277,
29(5)460,
29(5)467,
29(6)481,
30(4)343,
30(5)420,
30(6)485,
31(1)41,
31(2)147,
31(6)550,
32(3)212,
32(3)220,
32(4)333
- running,
25(1)45,
27(4)321,
28(4)412,
29(2)176
- space,
24(4)316,
25(1)45,
25(4)486,
26(1)15,
26(3)224,
27(4)368-1,
28(1)73,
28(3)330,
28(4)439,
29(3)269,
30(1)87,
30(2)119,
30(2)163,
30(3)223,
30(4)362,
30(4)372,
31(1)17,
31(1)56,
31(2)110,
31(3)279,
31(4)296,
31(4)358,
32(4)362
- string,
23(1)37,
25(1)93,
25(1)114,
26(3)205,
27(2)178,
29(6)486,
30(2)149
- substring,
25(1)2
- text,
24(1)62,
24(3)249,
24(4)324,
25(1)2,
25(1)17,
27(2)97,
27(4)348,
28(4)414,
29(5)460,
30(1)80,
30(4)343,
31(6)525,
32(1)16,
32(5)445
- 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,
31(6)553,
32(3)212,
32(3)241,
32(4)374,
32(5)474
- vertex,
31(1)76
- working,
27(1)37,
29(1)90