Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness (1995)

Cached

Download Links

by Stephen Brookes , Denis Dancanet
Venue:Proc. ACM Symposium on Principles of Programming Languages
Citations:10 - 4 self

Documents Related by Co-Citation

21 About primitive recursive algorithms – L Colson - 1991
4 Programming Language Expressiveness and Circuit Complexity – Denis Dancanet, Stephen Brookes - 1996
8 Automatic worst case complexity analysis of parallel programs – Wolf Zimmermann - 1990
11 Towards a theory of parallel algorithms on concrete data structures – Stephen Brookes, Shai Geva - 1990
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
7 Time analysis, cost equivalence and program refinement – D Sands - 1991
4 On the asymptotic behaviour of primitive recursive algorithms. Theoretical Computer Science – R David
11 System T, call-by-value and the minimum problem – L Colson, D Fredholm - 1998
77 Automatic complexity analysis – M Rosendahl - 1989
4 Une preuve directe du Th'eor`eme d'Ultime Obstination, Comptes Rendus de l'Academie des Sciences – T Coquand - 1992
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
5 A Parallel Complexity Model for Functional Languages – Guy Blelloch , John Greiner - 1994
16 Pomset interpretations of parallel functional programs – P Hudak, S Anderson - 1987
58 The gap between monotone and non-monotone circuit complexity is exponential – E Tardos - 1988
109 The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) – Michael J. Fischer - 2000
77 Monotone Circuits for Matching Require Linear Depth – Ran Raz , Avi Wigderson
176 The complexity of finite functions – R B Boppana, M Sipser - 1990