Entry Peterson:1982:UAC from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | 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{Peterson:1982:UAC,
  author =       "Gary L. Peterson",
  title =        "An {$O(n\log{n})$} Unidirectional Algorithm for the
                 Circular Extrema Problem",
  journal =      j-TOPLAS,
  volume =       "4",
  number =       "4",
  pages =        "758--762",
  month =        oct,
  year =         "1982",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/toplas.bib;
                 Theory/ProbAlgs.bib",
  note =         "Peterson presents a deterministic distributed
                 algorithm for finding the largest of a set of $n$
                 uniquely numbered processes in a ring. The algorithm
                 requires $O(n \log n)$ messages in the worst case, and
                 is unidirectional. The number of processes is not
                 initially known.",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
}

Related entries