Article View: ut.theory
Article #59announcement
From: Arvind Gupta
Date: Thu, 22 Jan 1987 15:17
Date: Thu, 22 Jan 1987 15:17
32 lines
1684 bytes
1684 bytes
From: princeton!chazelle@seismo.css.gov
Subject: announcement
PRINCETON FORUM ON ALGORITHMS AND COMPLEXITY
The Department of Computer Science at Princeton University is
sponsoring an informal meeting to discuss current research issues
in the design and analysis of algorithms and data structures and
related problems in complexity theory.
The meeting will be held on March 30 and 31, 1987 in Princeton.
People desiring overnight accommodations should contact the
Nassau Inn, Princeton, NJ 08540.
Invited speakers include
Richard M. Karp
F. T. Leighton
Andrew Odlyzko
Endre Szemeredi
Leslie G. Valiant
In addition, there will be sessions scheduled to allow interchange of
fresh research results and discussion of open problems.
People interested in contributing to the problem session or desiring
any other information about the forum should contact
Bernard Chazelle, Department of Computer Science,
Princeton University, Princeton, NJ 08544.
Phone: (609) 452-5380
CSNET: chazelle@princeton
Technical Details
Message-ID:
<3981@utcsri.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!utcsri!arvindShow Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site utcsri.UUCP Path: arc1-ca.pugleaf.net!utzoo!utcsri!arvind From: arvind@utcsri.UUCP (Arvind Gupta) Newsgroups: ut.theory Subject: announcement Message-ID: <3981@utcsri.UUCP> Date: Thu, 22-Jan-87 10:17:25 EST Article-I.D.: utcsri.3981 Posted: Thu Jan 22 10:17:25 1987 Date-Received: Thu, 22-Jan-87 20:57:55 EST Distribution: ut Organization: CSRI, University of Toronto Lines: 32