161
Voted
FCT
2003
Springer
16 years 29 days ago
2003
Springer
188
click to vote
FCT
2003
Springer
16 years 29 days ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
195
Voted
FCT
2003
Springer
16 years 29 days ago
2003
Springer
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
195
Voted
FCT
2003
Springer
16 years 29 days ago
2003
Springer
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
170
click to vote
FCT
2003
Springer
16 years 29 days ago
2003
Springer
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...