IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents’ utiliti...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., distrib...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Peer-to-peer systems, exchanging dynamic documents through Web services, are a simple and effective platform for data integration on the internet. Dynamic documents can contain b...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...