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
17
click to vote
CIAC
2006
Springer
favorite
Email
discuss
report
75
views
Algorithms
»
more
CIAC 2006
»
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
14 years 8 days ago
Download
www.lri.fr
Katalin Friedl, Gábor Ivanyos, Miklos Santh
Real-time Traffic
Algorithms
|
CIAC 2006
|
claim paper
Related Content
»
Settling the Complexity of Computing TwoPlayer Nash Equilibria
»
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
more »
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2006
Where
CIAC
Authors
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision