159 search results - page 17 / 32 » Weak Equivalences in Psi-Calculi |
86
Voted
CSL
2002
Springer
15 years 15 days ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
96
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics...
EUROCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996, Dobbertin showed ...
117
Voted
CC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
109
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...