1000 search results - page 20 / 200 » order 2011 |
178
click to vote
APAL
2011
14 years 6 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
108
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
JOI
2011
14 years 6 months ago
2011
This paper proposes an axiomatic analysis of Impact Factors when used as tools for ranking journals. This analysis draws on the similarities between the problem of comparing distr...
102
click to vote
MCM
2011
14 years 6 months ago
2011
When filtering through a wall with constant averaging radius, in addition to the subfilter scale stresses, a non-closed commutator term arises. We consider a proposal of Das and ...