800 search results - page 17 / 160 » On the Complexity of Parity Games |
150
Voted
ICC
2007
IEEE
16 years 12 days ago
2007
IEEE
Abstract— In this paper, we present a simple statistical simulation technique for channels with long memory operating under coded data. The proposed technique employs a divideand...
188
click to vote
DAM
1999
15 years 5 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
192
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
162
click to vote
FOSSACS
2009
Springer
16 years 26 days ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
161
click to vote
DEXAW
2005
IEEE
15 years 11 months ago
2005
IEEE
A most critical and complex issue with regard to constrained devices in the ubiquitous and pervasive computing setting is secure key exchange. The restrictions motivate the invest...