David Michael Ritchie Park Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Biographical Citations

DBLP keys1983
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Michael Ritchie Park: Reasoning with Fairness Constraints. FCT 1983: 516-517
1981
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Michael Ritchie Park: Concurrency and Automata on Infinite Sequences. Theoretical Computer Science 1981: 167-183
1979
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Michael Ritchie Park: On the Semantics of Fair Parallelism. Abstract Software Specifications 1979: 504-526
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkira Kanda, David Michael Ritchie Park: When are two Effectively given Domains Identical?. Theoretical Computer Science 1979: 170-181
1976
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Michael Ritchie Park: Finiteness is Mu-Ineffable. Theor. Comput. Sci. 3(2): 173-181 (1976)
1975
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. J. Kfoury, David Michael Ritchie Park: On the Termination of Program Schemas Information and Control 29(3): 243-251 (1975)
1972
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Hitchcock, David Michael Ritchie Park: Induction Rules and Termination Proofs. ICALP 1972: 225-251
1970
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid C. Luckham, David Michael Ritchie Park, Mike Paterson: On Formalised Computer Programs. J. Comput. Syst. Sci. 4(3): 220-249 (1970)

Coauthor Index

1Peter Hitchcock [2]
2Akira Kanda [5]
3Assaf J. Kfoury (A. J. Kfoury) [3]
4David C. Luckham [1]
5Mike Paterson [1]

Colors in the list of coauthors

Copyright © Fri Dec 11 16:01:56 2009 by Michael Ley (ley@uni-trier.de)