Entry Berman:1997:NOP from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Berman:1997:NOP,
  author =       "Piotr Berman and Andrzej Lingas",
  title =        "A nearly optimal parallel algorithm for the {Voronoi}
                 diagram of a convex polygon",
  journal =      j-THEOR-COMP-SCI,
  volume =       "174",
  number =       "1--2",
  pages =        "193--202",
  day =          "15",
  month =        mar,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:42 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=174&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=174&issue=1-2&aid=2227",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory); C4260 (Computational
                 geometry)",
  corpsource =   "Dept. of Comput. Sci., Pennsylvania State Univ.,
                 University Park, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computation time; computational complexity;
                 computational geometry; concurrent write; convex
                 polygon; CRCW PRAM algorithm; CRCW PRAM model;
                 duration-unknown task scheduling problem; integer
                 sorting subroutine; medial axis construction; nearly
                 optimal parallel algorithm; parallel algorithms;
                 processor scheduling; processors; randomized algorithm;
                 sorting; termination probability; vertices; Voronoi
                 diagram",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries