848 search results - page 62 / 170 » Randomness and the linear degrees of computability |
STOC
2000
ACM
15 years 4 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
MOC
2010
14 years 6 months ago
2010
Abstract. We introduce a new mixed method for linear elasticity. The novelty is a simplicial element for the approximate stress. For every positive integer k, the row-wise divergen...
105
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
RANDOM
2001
Springer
15 years 4 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
CRYPTO
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...