307 search results - page 15 / 62 » Finite locally-quasiprimitive graphs |
107
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
117
click to vote
FSTTCS
1994
Springer
15 years 6 months ago
1994
Springer
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
97
Voted
FSTTCS
2008
Springer
15 years 2 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
120
click to vote
TCOM
2010
15 years 7 days ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
115
click to vote
CSL
2008
Springer
15 years 3 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...