11345 search results - page 1694 / 2269 » Foundations of Computer Science |
135
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
145
Voted
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
160
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
161
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
179
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...