|
259
|
Parallel Prefix Computation
– Richard E. Ladner, Michael, J. Fischer
- 1980
|
|
1224
|
Introduction to functional programming
– Philip Wadler
- 1995
|
|
191
|
The Cube Connected Cycles: A Versatile Network for Parallel Computers
– F P Preparata, J V Vuillemin
- 1981
|
|
2173
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
|
430
|
Sorting networks and their applications
– K. E. Batcher
- 1968
|
|
18
|
Ground reducibility is EXPTIME-complete
– Hubert Comon, Florent Jacquemard
- 1997
|
|
12
|
Divacon: A parallel language for scientific computing based on divide-and-conquer
– Z G Mou
- 1990
|
|
65
|
Foundations of Parallel Programming
– D Skillicorn
- 1994
|
|
22
|
Parallel Computing
– M J Quinn
- 1994
|
|
8
|
Constructors Can Be Partial, Too
– Deepak Kapur
- 1997
|
|
140
|
Parallel Programming Using Skeleton Functions
– J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D. W. N. Sharp, Q. Wu, R.L. While
- 1993
|
|
143
|
Scans as Primitive Parallel Operations
– Guy Blelloch
- 1987
|
|
15
|
Systematic Extraction and Implementation of Divide-and-Conquer Parallelism
– Sergei Gorlatch
- 1996
|
|
9
|
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
– Klaus Achatz, Wolfram Schulte
- 1995
|
|
14
|
Verification of control flow based security policies
– T Jensen, D L Métayer, T Thorn
- 1999
|
|
65
|
Tree Automata With One Memory, Set Constraints and Cryptographic Protocols
– Hubert Comon
|
|
39
|
Equality and disequality constraints on direct subterms in tree automata
– B Bogaert, S Tison
- 1992
|
|
9
|
Tree pushdown automata
– K M Schimpf, J Gallier
|
|
2
|
Visibly pushdown tree languages. Available on: http://www.cis.upenn.edu/ ∼ swarat/pubs/vptl.ps
– R Alur, S Chaudhuri, P Madhusudan
- 2006
|
