828 search results - page 64 / 166 » Bounded Hairpin Completion |
166
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
159
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
While Game Semantics has been remarkably successful at g, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at...
147
click to vote
RTA
1998
Springer
15 years 10 months ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
194
click to vote
ECOOP
1993
Springer
15 years 10 months ago
1993
Springer
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...
159
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...