CLT@SU-AI.ARPA (04/06/84)
From: Carolyn Talcott <CLT@SU-AI.ARPA>
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
INSTRUCTOR: Professor G. Kreisel
TIME: Monday 4:15-6pm
PLACE: 252 Margaret Jacks Hall
(Stanford Computer Science Department)
TOPIC: Logic and parallel computation.
Below is a reading list that was compiled from discussion
at the organizational meeting. [...]
--------------------------------------------------
Reading List
--------------------------------------------------
[Carolyn Talcott - 362 Margaret Jacks - CLT@SU-AI - has copies
of all the references]
Parallel Computation
---------------------
Fortune,S. and Wyllie,J. [1978]
Parallelism in random access machines
Proc. 10th ACM Symposium on Theory of Computation (STOC)
pp.114-118.
Valiant,L. Skyum,S.[1981]
Fast parallel computation of polynomials using few processors
Proc. 10th Somposium on Mathematical Foundations of Computer Science
LNCS 118, pp. 132-139.
von zur Gathen,J.[1983]
Parallel algorithms for algebraic problems
Proc. 15th ACM Symposium on Theory of Computation (STOC)
pp. 17-23.
Mayr,E.[1984], Fast selection on para-computers (slides )
Karp,R.M. Wigderson,A.[1984?]
A Fast Parallel Algorithm for the Maximal Independent Set Problem
- Extended Abstract (manuscript)
Continuous operations on Infinitary Proof Trees, etc.
-----------------------------------------------------
Rabin,M.O.[1969]
Decidability of 2nd Order Theories and Automata on Infinite Trees,
TransAMS 141, pp.58-68.
Kreisel,G. Mints,G.E. Simpson,S.G.[1975]
The Use of Abstract Language in Elementary Metamathematics;
Some Pedagogic Examples,
in Logic Colloquium72, LNM 453, pp.38-131.
Mints,G.E.[1975] Finite Investigations of Transfinite Derivations,
J.Soviet Math. 10 (1978) pp. 548-596. (Eng.)
Sundholm,B.G.[1978] The Omega Rule: A Survey,
Bachelors Thesis, University of Oxford