1623 search results - page 297 / 325 » No Sorting |
129
Voted
ASPLOS
1996
ACM
15 years 5 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
133
click to vote
ICALP
1993
Springer
15 years 4 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
111
Voted
SIGGRAPH
1993
ACM
15 years 4 months ago
1993
ACM
We believe that navigation in information spaces is best supported by tapping into our natural spatial and geographic ways of thinking. To this end, we are developing a new comput...
100
click to vote
ERSHOV
1989
Springer
15 years 4 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
115
click to vote
PPOPP
1990
ACM
15 years 4 months ago
1990
ACM
Toprogrammassivelyconcurrent MIMDmachines, programmersneed tools for managingcomplexity. One important tool that has been used in the sequential programmingworld is hierarchies of...