298 search results - page 57 / 60 » Abstract Models of Transfinite Reductions |
201
click to vote
HASKELL
2009
ACM
16 years 3 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
175
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
190
Voted
ASIACRYPT
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
168
click to vote
IWDC
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. For time-constrained applications, repair-server-based active local recovery approaches can be valuable in providing low-latency reliable multicast service. However, an a...
146
click to vote
ISAAC
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...