Sciweavers

108 search results - page 11 / 22
» iandc 2006
Sort
View
64
Voted
IANDC
2007
106views more  IANDC 2007»
14 years 9 months ago
Extended visual cryptography schemes
Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image ...
Andreas Klein, Markus Wessler
IANDC
1998
72views more  IANDC 1998»
14 years 9 months ago
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
Maria Paola Bonacina, Jieh Hsiang
IANDC
1998
106views more  IANDC 1998»
14 years 9 months ago
A Conservative Look at Operational Semantics with Variable Binding
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechan...
Wan Fokkink, Chris Verhoef
63
Voted
IANDC
2010
84views more  IANDC 2010»
14 years 8 months ago
Modules over monads and initial semantics
Inspired by the classical theory of modules over a monoid, we introduce the natural notion of module over a monad. The associated notion of morphism of left modules (”linear” n...
André Hirschowitz, Marco Maggesi
IANDC
2010
79views more  IANDC 2010»
14 years 8 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa