151
click to vote
FSTTCS
15 years 7 months ago
2003 Springer 
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
115
click to vote
FSTTCS
15 years 7 months ago
2003 Springer 
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
125
Voted
FSTTCS
15 years 7 months ago
2003 Springer 
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
116
Voted
FSTTCS
15 years 7 months ago
2003 Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
127
click to vote
FSTTCS
15 years 7 months ago
2003 Springer 
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
|
Software Engineering