Entry Kedem:1992:OPA from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

Index sections

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{Kedem:1992:OPA,
  author =       "Z. M. Kedem and K. V. Palem",
  title =        "Optimal parallel algorithms for forest and term
                 matching",
  journal =      j-THEOR-COMP-SCI,
  volume =       "93",
  number =       "2",
  pages =        "245--264",
  day =          "17",
  month =        feb,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240P (Parallel
                 programming and algorithm theory); C6110L (Logic
                 programming)",
  corpsource =   "Dept. of Comput. Sci., Courant Inst. of Math. Sci.,
                 New York Univ., NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; concurrent writes; CRCW
                 PRAM; CREW PRAM; forest matching; hashing; logic
                 programming; nodes; parallel algorithm; parallel
                 algorithms; rewriting systems; term matching; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries