The following pages link to Michaël Rusinowitch (Q437030):
Displaying 16 items.
- Decidability of equivalence of symbolic derivations (Q437031) (← links)
- Unification modulo homomorphic encryption (Q437037) (← links)
- (Q485833) (redirect page) (← links)
- Parametrized automata simulation and application to service composition (Q485834) (← links)
- Intruder deducibility constraints with negation. Decidability and application to secured service compositions (Q507348) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- On word problems in Horn theories (Q757095) (← links)
- Formal design and verification of operational transformation algorithms for copies convergence (Q820129) (← links)
- Compiling and securing cryptographic protocols (Q990127) (← links)
- Automated Mathematical Induction (Q4849648) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191511) (← links)
- Computer Science Logic (Q5292632) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431302) (← links)
