Towards a theory of parallel algorithms on concrete data structures (1990)

Cached

Download Links

by Stephen Brookes , Shai Geva
Venue:In Semantics for Concurrency, Leicester
Citations:11 - 6 self

Documents Related by Co-Citation

86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
395 LCF considered as a programming language – G Plotkin - 1977
21 About primitive recursive algorithms – L Colson - 1991
77 Automatic complexity analysis – M Rosendahl - 1989
53 Full Abstraction for sequential languages: the state of the art – G Berry, P-L Curien, J-J Lévy - 1985
4 Repr'esentation intentionelle d'algorithmes dans les syst`emes fonctionelles: une 'etude de cas, Th'ese de Doctorat, Universit'e Paris VII – L Colson - 1991
8 Automatic worst case complexity analysis of parallel programs – Wolf Zimmermann - 1990
10 Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness – Stephen Brookes, Denis Dancanet - 1995
7 Time analysis, cost equivalence and program refinement – D Sands - 1991
6 A Cartesian Closed Category of Parallel Algorithms between Scott Domains – Stephen Brookes, Shai Geva - 1991
32 Theory and practice of sequential algorithms: the kernel of the applicative language CDS0 – G Berry, P-L Curien - 1985
27 Stable models of typed -calculi – G Berry - 1978
14 Domaines concrets – G Kahn, G Plotkin - 1978
32 LCF considered as a programming language. Theoretical Computer Science, 5:223–255 – G D Plotkin - 1977
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
280 Introduction to Automata Theory – J E Hopcroft, R Motwani, J D Ullman - 2006
3 A provably efficient fully speculative parallel implementation – J Greiner, G E Blelloch - 1996
7 Calculating Lenient Programs' Performance – Paul Roe - 1990
4 On the expressive power of indeterminate network primitives – P Panangaden, V Shanbhogue - 1987