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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Almost Optimal Strategies in One Clock Priced Timed Games
Sort
relevance
views
votes
recent
update
View
thumb
title
149
click to vote
EJC
2007
95
views
Information Technology
»
more
EJC 2007
»
Online balanced graph avoidance games
15 years 6 months ago
Download
www.inf.ethz.ch
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »