Entry Katajainen:1989:AAS from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

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