67 search results - page 14 / 14 » Parallel sparse polynomial multiplication using heaps |
227
click to vote
SIAMCOMP
2000
15 years 7 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
189
Voted
CTCS
1989
Springer
15 years 11 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...