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
COCO
2008
Springer
favorite
Email
discuss
report
79
views
Algorithms
»
more
COCO 2008
»
Randomised Individual Communication Complexity
13 years 11 months ago
Download
www.math.cas.cz
Harry Buhrman, Michal Koucký, Nikolai K. Ve
Real-time Traffic
Algorithms
|
COCO 2008
|
claim paper
Related Content
»
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
»
Individual communication complexity
»
A Direct Sum Theorem in Communication Complexity via Message Compression
»
Pair programming and the reappropriation of individual tools for collaborative programming
»
Environmental Risk Cooperation and Communication Complexity
»
Lower bounds for predecessor searching in the cell probe model
»
Collaborative creativity a complex systems model with distributed affect
»
SimANet A Large Scalable Distributed Simulation Framework for Ambient Networks
»
Lower Bounds for MultiPlayer Pointer Jumping
more »
Post Info
More Details (n/a)
Added
18 Oct 2010
Updated
18 Oct 2010
Type
Conference
Year
2008
Where
COCO
Authors
Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision