379 search results - page 2 / 76 » Strong reducibility of partial numberings |
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Speed improvements in today's processors have largely been delivered in the form of multiple cores, increasing the importance of ions that ease parallel programming. Software...
ORDER
2002
13 years 7 months ago
2002
It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
We consider a cluster architecture in which dynamic content is generated by a database back-end and a collection of Web and application server front-ends. We study the effect of t...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...