10575 search results - page 1714 / 2115 » Programming Languages |
184
Voted
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
171
click to vote
ICALP
2005
Springer
16 years 10 days 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...
195
click to vote
ICALP
2005
Springer
16 years 10 days 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...
169
click to vote
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
161
click to vote
IFIP
2005
Springer
16 years 9 days ago
2005
Springer
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...