22 search results - page 4 / 5 » Common subproofs in proof pairs |
IFIP
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
SIAMDM
1998
13 years 5 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
ESOP
2001
Springer
13 years 9 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
VIS
2005
IEEE
14 years 6 months ago
2005
IEEE
Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that d...