FSTTCS 2008 - PDF Preprint Papers

FSTTCS 2008 Foundations of Software Technology and Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FSTTCS-2008 Paper

click to vote

FSTTCS
2008
Springer

192views Software Engineering» more FSTTCS 2008»

Banach-Mazur Games on Graphs

13 years 5 months ago

Download www.cs.umd.edu

We survey determinacy, deﬁnability, and complexity issues of Banach-Mazur games on ﬁnite and inﬁnite graphs. Inﬁnite games where two players take turns to move a token thro...

Erich Grädel

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	192	Banach-Mazur Games on Graphs	claim
2	172	Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations	claim
3	165	Analyzing Asynchronous Programs with Preemption	claim
4	161	Average-Time Games	claim
5	152	An Optimal Construction of Finite Automata from Regular Expressions	claim
6	139	Graph Games on Ordinals	claim
7	135	A Cubic-Vertex Kernel for Flip Consensus Tree	claim
8	133	Runtime Monitoring of Metric First-order Temporal Properties	claim
9	131	Some Sieving Algorithms for Lattice Problems	claim
10	124	About models of security protocols	claim
11	123	Sound Lemma Generation for Proving Inductive Validity of Equations	claim
12	123	Boolean algebras of unambiguous context-free languages	claim
13	115	3-connected Planar Graph Isomorphism is in Log-space	claim
14	115	Solvency Games	claim
15	112	Leaf languages and string compression	claim
16	109	The Complexity of Tree Transducer Output Languages	claim
17	109	Analyzing the Implicit Computational Complexity of object-oriented programs	claim
18	108	Pruning 2-Connected Graphs	claim
19	108	Algorithms for Game Metrics	claim
20	107	STCON in Directed Unique-Path Graphs	claim
21	106	A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems	claim
22	106	A new upper bound for 3-SAT	claim
23	102	Explicit Muller Games are PTIME	claim
24	97	Dynamic matrix rank with partial lookahead	claim
25	96	All-Norms and All-L_p-Norms Approximation Algorithms	claim
26	95	On the Power of Imperfect Information	claim
27	93	A new approach to the planted clique problem	claim
28	89	The unfolding of general Petri nets	claim
29	77	Single-Sink Network Design with Vertex Connectivity Requirements	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers