Entry Mansour:1993:CCU 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{Mansour:1993:CCU,
  author =       "Y. Mansour and N. Nisan and P. Tiwari",
  title =        "The computational complexity of universal hashing",
  journal =      j-THEOR-COMP-SCI,
  volume =       "107",
  number =       "1",
  pages =        "121--133",
  day =          "04",
  month =        jan,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:15:15 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "boolean branching program model; computational
                 complexity; constant-depth circuits; CREW PRAM;
                 exponential size; file organisation; n-bit strings;
                 parallel time bound; time-space tradeoff; universal
                 hashing; VLSI implementation",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries