Sciweavers

85 search results - page 8 / 17
» Open Bisimulation, Revisited
Sort
View
CIE
2008
Springer
15 years 2 days ago
Deterministic Graphical Games Revisited
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
Daniel Andersson, Kristoffer Arnsfelt Hansen, Pete...
ASIACRYPT
2009
Springer
15 years 4 months ago
Cascade Encryption Revisited
Abstract. The security of cascade blockcipher encryption is an important and well-studied problem in theoretical cryptography with practical implications. It is well-known that dou...
Peter Gazi, Ueli M. Maurer
CPM
2003
Springer
68views Combinatorics» more  CPM 2003»
15 years 3 months ago
Multiple Genome Alignment: Chaining Algorithms Revisited
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
DLOG
2010
14 years 8 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide
ENTCS
2006
126views more  ENTCS 2006»
14 years 10 months ago
A Congruence Format for Name-passing Calculi
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
Axelle Ziegler, Dale Miller, Catuscia Palamidessi