Entry Santoro:1992:DSA 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{Santoro:1992:DSA,
  author =       "N. Santoro and J. B. Sidney and S. J. Sidney",
  title =        "A distributed selection algorithm and its expected
                 communication complexity",
  journal =      j-THEOR-COMP-SCI,
  volume =       "100",
  number =       "1",
  pages =        "185--204",
  day =          "22",
  month =        jun,
  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 = "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "communication activities; communication complexity;
                 computational complexity; distributed K-selection
                 problem; distributed selection; distributed selection
                 algorithm; point-to-point model; upper bound;
                 worst-case complexity",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries