Entry Mahoney:2003:APC from dr-dobbs-2000.bib

Last update: Fri Jan 5 02:08:04 MST 2018                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{Mahoney:2003:APC,
  author =       "William R. Mahoney",
  title =        "The ``All-Pairs Closest Points'' Problem",
  journal =      j-DDJ,
  volume =       "28",
  number =       "1",
  pages =        "48--49, 51",
  month =        jan,
  year =         "2003",
  CODEN =        "DDJOEB",
  ISSN =         "1044-789X",
  bibdate =      "Thu Jun 12 05:46:20 MDT 2003",
  bibsource =    "http://www.ddj.com/articles/2003/0301/;
                 http://www.math.utah.edu/pub/tex/bib/dr-dobbs-2000.bib",
  URL =          "http://www.ddj.com/documents/s=7758/ddj0301f/",
  abstract =     "The divide-and-conquer algorithm William presents here
                 recursively partitions the set of points into two
                 halves, then solves for the halves plus a strip in the
                 middle.",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.ddj.com/",
}

Related entries