16430 search results - page 112 / 3286 » On Computable Tree Functions |
127
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
175
click to vote
ALP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
128
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
143
click to vote
FCT
1991
Springer
15 years 7 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
112
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...