ICALP
2005
Springer
14 years 6 months ago
2005
Springer
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...
ICALP
2005
Springer
14 years 6 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...
ICALP
2005
Springer
14 years 6 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...
ICALP
2005
Springer
14 years 6 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
ICALP
2005
Springer
14 years 6 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...
ICALP
2005
Springer
14 years 6 months ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
ICALP
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
ICALP
2005
Springer
14 years 6 months ago
2005
Springer
ICALP
2005
Springer
14 years 6 months ago
2005
Springer
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
ICALP
2005
Springer
14 years 6 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...