Reply to thread

Message

[QUOTE="Ben Bacarisse, post: 3981827"]
I can't track this down.  Have I got the right Journal of Algorithms?

[URL]http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html[/URL]

does not list that paper.  Of course, this table of contents might be
wrong.  The horrendous link:

[URL]http://www.sciencedirect.com/science?_ob=PublicationURL&_tockey=%23TOC%236839%231982%23999969995%23518142%23FLA%23&_cdi=6839&_pubType=J&_auth=y&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=2c8bc9013d6025d08b7d24d3207dfe18[/URL]

appears to be for the journal itself.  The paper does not appear
there, either.

I can find a 1982 technical report from Yale:

FINDING A MAJORITY AMONG N VOTES Solution to Problem 81-5 (Journal
  of Algorithms, June 1981)

by the same two authors.  It describes what seems to me to be a
different algorithm and for which the 3k - 2 bound is proved.  I
suspect the algorithm has been modified since the technical report but
I can't find a good reference that matches the algorithm you describe.

<snip>
[/QUOTE]

Verification