Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!utcsri!clarke
From: clarke@utcsri.UUCP
Newsgroups: ont.events
Subject: U of Toronto Computer Science activities, Sept. 28 - Oct. 2
Message-ID: <5427@utcsri.UUCP>
Date: Mon, 21-Sep-87 16:43:04 EDT
Article-I.D.: utcsri.5427
Posted: Mon Sep 21 16:43:04 1987
Date-Received: Tue, 22-Sep-87 00:40:42 EDT
Distribution: ont
Organization: CSRI, University of Toronto
Lines: 56


         (SF = Sandford Fleming Building, 10 King's College Road)
              (GB = Galbraith Building, 35 St. George Street)
             (MC = Mechanical Building, 5 King's College Road)

SUMMARY:

COMBINATORICS SEMINAR, Monday, September 28, 3 pm  MC254 -- Alan Hartman:
     "Halving the Complete Design"

SYSTEMS/THEORY SEMINAR, Tuesday, September 29, 11 am, SF1105 -- Shai Ben-David:
     "A Modal Logic For Distributed Systems With Concurrence"

THEORY SEMINAR, Thursday, October 1, 3 pm,  GB 244 -- Oded Goldreich:
     "On the Message Complexity of Broadcast: A Basic Lower Bound"

----------------------------------------


         COMBINATORICS SEMINAR, Monday, September 28, 3 pm  MC254

                          Professor Alan Hartman
                        IBM Research & Development
                               Haifa, Israel
                            Visiting Professor
                         Department of Mathematics

                       "Halving the Complete Design"

       SYSTEMS/THEORY SEMINAR, Tuesday, September 29, 11 am,  SF1105

                            Dr. Shai Ben-David
                          Technion, Haifa, Israel
                            Visiting Professor
                      Department of Computer Science
                           University of Toronto

         "A Modal Logic For Distributed Systems With Concurrence"

     This is a sequel to my Colloquium talk. (It will be self contained
though, so missing the Colloquium is not a good enough excuse for missing
this one).  I wish to elaborate on the main ideas of the first talk, to
present some proofs (painless, I promise), and to discuss possible applica-
tions and open questions.

            THEORY SEMINAR, Thursday, October 1, 3 pm,  GB 244

                         Professor Oded Goldreich
                         Technion, Haifa, Israel

       "On the Message Complexity of Broadcast: A Basic Lower Bound"
-- 

Jim Clarke -- Dept. of Computer Science, Univ. of Toronto, Canada M5S 1A4
              (416) 978-4058
{allegra,cornell,decvax,linus,utzoo}!utcsri!clarke