Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
21
click to vote
STACS
2007
Springer
favorite
Email
discuss
report
114
views
Theoretical Computer Science
»
more
STACS 2007
»
Admissibility in Infinite Games
14 years 2 months ago
Download
www-i7.informatik.rwth-aachen.de
Dietmar Berwanger
Real-time Traffic
STACS 2007
|
Theoretical Computer Science
|
claim paper
Related Content
»
FiniteState Strategies in Regular Infinite Games
»
Mechanical Reasoning on Infinite Extensive Games
»
Positional Determinacy of Games with Infinitely Many Priorities
»
Computing BestResponse Strategies in Infinite Games of Incomplete Information
»
A Survey of Stochastic Games with Limsup and Liminf Objectives
»
Analysis of LoadBalanced Switch with Finite Buffers
»
Emerging coordination in infinite team Markov games
»
Infinite trace equivalence
»
Stochastic Games with Lossy Channels
more »
Post Info
More Details (n/a)
Added
09 Jun 2010
Updated
09 Jun 2010
Type
Conference
Year
2007
Where
STACS
Authors
Dietmar Berwanger
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision