Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!floyd!harpo!ihnp4!zehntel!hplabs!sri-unix!STORY@MIT-MC
From: STORY%MIT-MC@sri-unix.UUCP
Newsgroups: net.ai
Subject: Sorting Networks
Message-ID: <149@sri-arpa.UUCP>
Date: Thu, 15-Mar-84 16:58:00 EST
Article-I.D.: sri-arpa.149
Posted: Thu Mar 15 16:58:00 1984
Date-Received: Fri, 23-Mar-84 08:48:49 EST
Lines: 18

From:  Kenneth Byrd Story 

            [Forward from the MIT bboard by Laws@SRI-AI.]

DATE:   Tuesday, March 20, 1984
TIME:   3:45pm   Refreshments
        4:00pm   Lecture
PLACE:  NE43-512a
TITLE:  "Sorting Networks"
SPEAKER:        Professor Michael Paterson, University of Warwick

Last year, Ajtai, Komlos and Szemeredi published details of a depth O(log n)
comparator network for sorting, thus answering a longstanding open problem.
Their construction is difficult to analyse and the bounds they proved result in
networks of astronomical size.  A considerable simplification is presented
which readily yields constructions of more moderate size.

HOST:   Professor Tom Leighton