Entry Breslauer:1996:OPC from parallelprocesslett.bib

Last update: Fri Jul 8 02:02:43 MDT 2005                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{Breslauer:1996:OPC,
  author =       "Dany Breslauer and Ramesh Hariharan",
  title =        "Optimal parallel construction of minimal suffix and
                 factor automata",
  journal =      j-PARALLEL-PROCESS-LETT,
  volume =       "6",
  number =       "1",
  pages =        "35--44",
  month =        mar,
  year =         "1996",
  CODEN =        "PPLTEE",
  ISSN =         "0129-6264",
  bibdate =      "Mon Apr 14 10:50:40 MDT 1997",
  bibsource =    "Compendex database",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Aarhus",
  classification = "721.1; 722.1; 722.4; 723.2; 921.5; C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C4220 (Automata theory); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Basic Res. in Comput. Sci., Aarhus Univ., Denmark",
  countrypub =   "Singapore",
  journalabr =   "Parallel Process Lett",
  keywords =     "algorithms; data structure; Data structures; Factor
                 automata; factor automata; Finite automata; finite
                 automata; minimal suffix; minimisation; Online systems;
                 optimal; optimal parallel algorithm; optimal parallel
                 construction; optimisation; Optimization; parallel;
                 parallel algorithm theory; Parallel algorithms;
                 parallel suffix tree construction algorithm; Random
                 access storage; smallest deterministic finite automata;
                 string; string matching; Suffix tree; suffix tree;
                 trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries