1209 search results - page 43 / 242 » Universal Algebra and Computer Science |
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
WG
2005
Springer
14 years 2 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
TCS
2011
13 years 3 months ago
2011
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...
PR
2002
13 years 8 months ago
2002
The authors of this paper adopted the projected characteristics of the absolute conic in terms of the Pascal's theorem to propose an entirely new camera calibration method ba...
MFCS
1998
Springer
14 years 27 days ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...